proposition: Lemma conj_ge0 : forall x, (0 <= x ^*) = (0 <= x).
proof: Proof. by move=> [a b] /=; simpc; rewrite oppr_eq0. Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg ssrint div ssrnum rat poly closed_field) mathcomp(polyrcf matrix mxalgebra tuple mxpoly zmodp binomial realalg) mathcomp(mxpoly)