fact stringlengths 8 1.54k | type stringclasses 19 values | library stringclasses 8 values | imports listlengths 1 10 | filename stringclasses 98 values | symbolic_name stringlengths 1 42 | docstring stringclasses 1 value |
|---|---|---|---|---|---|---|
max_submod_eqmxU1 U2 V1 V2 :
(U1 :=: U2)%MS -> (V1 :=: V2)%MS -> max_submod U1 V1 -> max_submod U2 V2.
Proof.
move=> eqU12 eqV12 [ltUV1 maxU1].
by split=> [|W]; rewrite -(lt_eqmx eqU12) -(lt_eqmx eqV12).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | max_submod_eqmx | |
mx_subseries:= all modG. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_subseries | |
mx_composition_seriesV :=
mx_subseries V /\ (forall i, i < size V -> max_submod (0 :: V)`_i V`_i).
Local Notation mx_series := mx_composition_series.
Fact mx_subseries_module V i : mx_subseries V -> mxmodule rG V`_i.
Proof.
move=> modV; have [|leVi] := ltnP i (size V); first exact: all_nthP.
by rewrite nth_default ?mxmodule0.
Qed.
Fact mx_subseries_module' V i : mx_subseries V -> mxmodule rG (0 :: V)`_i.
Proof. by move=> modV; rewrite mx_subseries_module //= mxmodule0. Qed. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_composition_series | |
subseries_reprV i (modV : all modG V) :=
section_repr (mx_subseries_module' i modV) (mx_subseries_module i modV). | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | subseries_repr | |
series_reprV i (compV : mx_composition_series V) :=
subseries_repr i (proj1 compV). | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | series_repr | |
mx_series_ltV : mx_composition_series V -> path ltmx 0 V.
Proof. by case=> _ compV; apply/(pathP 0)=> i /compV[]. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_series_lt | |
max_size_mx_series(V : seq 'M[F]_n) :
path ltmx 0 V -> size V <= \rank (last 0 V).
Proof.
rewrite -[size V]addn0 -(mxrank0 F n n); elim: V 0 => //= V1 V IHV V0.
rewrite ltmxErank -andbA => /and3P[_ ltV01 ltV].
by apply: leq_trans (IHV _ ltV); rewrite addSnnS leq_add2l.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | max_size_mx_series | |
mx_series_repr_irrV i (compV : mx_composition_series V) :
i < size V -> mx_irreducible (series_repr i compV).
Proof.
case: compV => modV compV /compV maxVi; apply/max_submodP => //.
by apply: ltmxW; case: maxVi.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_series_repr_irr | |
mx_series_rconsU V :
mx_series (rcons U V) <-> [/\ mx_series U, modG V & max_submod (last 0 U) V].
Proof.
rewrite /mx_series /mx_subseries all_rcons size_rcons -rcons_cons.
split=> [ [/andP[modU modV] maxU] | [[modU maxU] modV maxV]].
split=> //; last first.
by have:= maxU _ (leqnn _); rewrite !nth_rcons leqnn ltnn eqxx -last_nth.
by split=> // i ltiU; have:= maxU i (ltnW ltiU); rewrite !nth_rcons leqW ltiU.
rewrite modV; split=> // i; rewrite !nth_rcons ltnS leq_eqVlt.
case: eqP => [-> _ | /= _ ltiU]; first by rewrite ltnn ?eqxx -last_nth.
by rewrite ltiU; apply: maxU.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_series_rcons | |
mx_SchreierU :
mx_subseries U -> path ltmx 0 U ->
classically (exists V, [/\ mx_series V, last 0 V :=: 1%:M & subseq U V])%MS.
Proof.
move: U => U0; set U := {1 2}U0; have: subseq U0 U := subseq_refl U.
pose n' := n.+1; have: n < size U + n' by rewrite leq_addl.
elim: n' U => [|n' IH_U] U ltUn' sU0U modU incU [] // noV.
rewrite addn0 ltnNge in ltUn'; case/negP: ltUn'.
by rewrite (leq_trans (max_size_mx_series incU)) ?rank_leq_row.
apply: (noV); exists U; split => //; first split=> // i lt_iU; last first.
apply/eqmxP; apply: contraT => neU1.
apply: {IH_U}(IH_U (rcons U 1%:M)) noV.
- by rewrite size_rcons addSnnS.
- by rewrite (subseq_trans sU0U) ?subseq_rcons.
- by rewrite /mx_subseries all_rcons mxmodule1.
by rewrite rcons_path ltmxEneq neU1 submx1 !andbT.
set U'i := _`_i; set Ui := _`_i; have defU := cat_take_drop i U.
have defU'i: U'i = last 0 (take i U).
rewrite (last_nth 0) /U'i -{1}defU -cat_cons nth_cat /=.
by rewrite size_take lt_iU leqnn.
move: incU; rewrite -defU cat_path (drop_nth 0) //= -/Ui -defU'i.
set U' := take i U; set U'' := drop _ U; case/and3P=> incU' ltUi incU''.
split=> // W [modW ltUW ltWV]; case: notF.
apply: {IH_U}(IH_U (U' ++ W :: Ui :: U'')) noV; last 2 first.
- by rewrite /mx_subseries -drop_nth // all_cat /= modW -all_cat defU.
- by rewrite cat_path /= -defU'i; apply/and4P.
- by rewrite -drop_nth // size_cat /= addnS -size_cat defU addSnnS.
by rewrite (subseq_trans sU0U) // -defU cat_subseq // -drop_nth ?subseq_cons.
Qed. | Theorem | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_Schreier | |
mx_second_rsimU V (modU : modG U) (modV : modG V) :
let modI := capmx_module modU modV in let modA := addsmx_module modU modV in
mx_rsim (section_repr modI modU) (section_repr modV modA).
Proof.
move=> modI modA; set nI := {1}(\rank _).
have sIU := capmxSl U V; have sVA := addsmxSr U V.
pose valI := val_factmod (val_submod (1%:M : 'M_nI)).
have UvalI: (valI <= U)%MS.
rewrite -(addsmx_idPr sIU) (submx_trans _ (proj_factmodS _ _)) //.
by rewrite submxMr // val_submod1 genmxE.
exists (valI *m in_factmod _ 1%:M *m in_submod _ 1%:M) => [||x Gx].
- apply: (@addIn (\rank (U :&: V) + \rank V)%N); rewrite genmxE addnA addnCA.
rewrite /nI genmxE !{1}mxrank_in_factmod 2?(addsmx_idPr _) //.
by rewrite -mxrank_sum_cap addnC.
- rewrite -kermx_eq0; apply/rowV0P=> u; rewrite (sameP sub_kermxP eqP).
rewrite mulmxA -in_submodE mulmxA -in_factmodE -(inj_eq val_submod_inj).
rewrite linear0 in_submodK ?in_factmod_eq0 => [Vvu|]; last first.
by rewrite genmxE addsmxC in_factmod_addsK submxMr // mulmx_sub.
apply: val_submod_inj; apply/eqP; rewrite linear0 -[val_submod u]val_factmodK.
rewrite val_submodE val_factmodE -mulmxA -val_factmodE -/valI.
by rewrite in_factmod_eq0 sub_capmx mulmx_sub.
symmetry; rewrite -{1}in_submodE -{1}in_submodJ; last first.
by rewrite genmxE addsmxC in_factmod_addsK -in_factmodE submxMr.
rewrite -{1}in_factmodE -{1}in_factmodJ // mulmxA in_submodE; congr (_ *m _).
apply/eqP; rewrite mulmxA -in_factmodE -subr_eq0 -linearB in_factmod_eq0.
apply: submx_trans (
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_second_rsim | |
section_eqmx_addU1 U2 V1 V2 modU1 modU2 modV1 modV2 :
(U1 :=: U2)%MS -> (U1 + V1 :=: U2 + V2)%MS ->
mx_rsim (@section_repr U1 V1 modU1 modV1) (@section_repr U2 V2 modU2 modV2).
Proof.
move=> eqU12 eqV12; set n1 := {1}(\rank _).
pose v1 := val_factmod (val_submod (1%:M : 'M_n1)).
have sv12: (v1 <= U2 + V2)%MS.
rewrite -eqV12 (submx_trans _ (proj_factmodS _ _)) //.
by rewrite submxMr // val_submod1 genmxE.
exists (v1 *m in_factmod _ 1%:M *m in_submod _ 1%:M) => [||x Gx].
- apply: (@addIn (\rank U1)); rewrite {2}eqU12 /n1 !{1}genmxE.
by rewrite !{1}mxrank_in_factmod eqV12.
- rewrite -kermx_eq0; apply/rowV0P=> u; rewrite (sameP sub_kermxP eqP) mulmxA.
rewrite -in_submodE mulmxA -in_factmodE -(inj_eq val_submod_inj) linear0.
rewrite in_submodK ?in_factmod_eq0 -?eqU12 => [U1uv1|]; last first.
by rewrite genmxE -(in_factmod_addsK U2 V2) submxMr // mulmx_sub.
apply: val_submod_inj; apply/eqP; rewrite linear0 -[val_submod _]val_factmodK.
by rewrite in_factmod_eq0 val_factmodE val_submodE -mulmxA -val_factmodE.
symmetry; rewrite -{1}in_submodE -{1}in_factmodE -{1}in_submodJ; last first.
by rewrite genmxE -(in_factmod_addsK U2 V2) submxMr.
rewrite -{1}in_factmodJ // mulmxA in_submodE; congr (_ *m _); apply/eqP.
rewrite mulmxA -in_factmodE -subr_eq0 -linearB in_factmod_eq0 -eqU12.
rewrite -in_factmod_eq0 linearB /= subr_eq0 {1}(in_factmodJ modU1) //.
rewrite val_factmodK /v1 val_factmodE eq_sym mulmxA -val_factmodE val_factmodK.
by rewrite -[_ *m _]mul1mx mulmxA -val_submodE va
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | section_eqmx_add | |
section_eqmxU1 U2 V1 V2 modU1 modU2 modV1 modV2
(eqU : (U1 :=: U2)%MS) (eqV : (V1 :=: V2)%MS) :
mx_rsim (@section_repr U1 V1 modU1 modV1) (@section_repr U2 V2 modU2 modV2).
Proof. by apply: section_eqmx_add => //; apply: adds_eqmx. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | section_eqmx | |
mx_butterflyU V W modU modV modW :
~~ (U == V)%MS -> max_submod U W -> max_submod V W ->
let modUV := capmx_module modU modV in
max_submod (U :&: V)%MS U
/\ mx_rsim (@section_repr V W modV modW) (@section_repr _ U modUV modU).
Proof.
move=> neUV maxU maxV modUV; have{neUV maxU} defW: (U + V :=: W)%MS.
wlog{neUV modUV} ltUV: U V modU modV maxU maxV / ~~ (V <= U)%MS.
by case/nandP: neUV => ?; first rewrite addsmxC; apply.
apply/eqmxP/idPn=> neUVW; case: maxU => ltUW; case/(_ (U + V)%MS).
rewrite addsmx_module // ltmxE ltmxEneq neUVW addsmxSl !addsmx_sub.
by have [ltVW _] := maxV; rewrite submx_refl andbT ltUV !ltmxW.
have sUV_U := capmxSl U V; have sVW: (V <= W)%MS by rewrite -defW addsmxSr.
set goal := mx_rsim _ _; suffices{maxV} simUV: goal.
split=> //; apply/(max_submodP modUV modU sUV_U).
by apply: mx_rsim_irr simUV _; apply/max_submodP.
apply: {goal}mx_rsim_sym.
by apply: mx_rsim_trans (mx_second_rsim modU modV) _; apply: section_eqmx.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_butterfly | |
mx_JordanHolder_existsU V :
mx_composition_series U -> modG V -> max_submod V (last 0 U) ->
{W : seq 'M_n | mx_composition_series W & last 0 W = V}.
Proof.
elim/last_ind: U V => [|U Um IHU] V compU modV; first by case; rewrite ltmx0.
rewrite last_rcons => maxV; case/mx_series_rcons: compU => compU modUm maxUm.
case eqUV: (last 0 U == V)%MS.
case/lastP: U eqUV compU {maxUm IHU} => [|U' Um'].
by rewrite andbC; move/eqmx0P->; exists [::].
rewrite last_rcons; move/eqmxP=> eqU'V; case/mx_series_rcons=> compU _ maxUm'.
exists (rcons U' V); last by rewrite last_rcons.
by apply/mx_series_rcons; split => //; apply: max_submod_eqmx maxUm'.
set Um' := last 0 U in maxUm eqUV; have [modU _] := compU.
have modUm': modG Um' by rewrite /Um' (last_nth 0) mx_subseries_module'.
have [|||W compW lastW] := IHU (V :&: Um')%MS; rewrite ?capmx_module //.
by case: (mx_butterfly modUm' modV modUm); rewrite ?eqUV // {1}capmxC.
exists (rcons W V); last by rewrite last_rcons.
apply/mx_series_rcons; split; rewrite // lastW.
by case: (mx_butterfly modV modUm' modUm); rewrite // andbC eqUV.
Qed.
Let rsim_rcons U V compU compUV i : i < size U ->
mx_rsim (@series_repr U i compU) (@series_repr (rcons U V) i compUV).
Proof.
by move=> ltiU; apply: section_eqmx; rewrite -?rcons_cons nth_rcons ?leqW ?ltiU.
Qed.
Let last_mod U (compU : mx_series U) : modG (last 0 U).
Proof.
by case: compU => modU _; rewrite (last_nth 0) (mx_subseries_module' _ modU).
Qed.
Let rsim_last U V modUm modV compUV :
mx_rsim (@section_re
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_JordanHolder_exists | |
mx_JordanHolderU V compU compV :
let m := size U in (last 0 U :=: last 0 V)%MS ->
m = size V /\ (exists p : 'S_m, forall i : 'I_m,
mx_rsim (@series_repr U i compU) (@series_repr V (p i) compV)).
Proof.
move Dr: {-}(size U) => r; move/eqP in Dr.
elim: r U V Dr compU compV => /= [|r IHr] U V.
move/nilP->; case/lastP: V => [|V Vm] /= ? compVm; rewrite ?last_rcons => Vm0.
by split=> //; exists 1%g; case.
by case/mx_series_rcons: (compVm) => _ _ []; rewrite -(lt_eqmx Vm0) ltmx0.
case/lastP: U => // [U Um]; rewrite size_rcons eqSS => szUr compUm.
case/mx_series_rcons: (compUm); set Um' := last 0 U => compU modUm maxUm.
case/lastP: V => [|V Vm] compVm; rewrite ?last_rcons ?size_rcons /= => eqUVm.
by case/mx_series_rcons: (compUm) => _ _ []; rewrite (lt_eqmx eqUVm) ltmx0.
case/mx_series_rcons: (compVm); set Vm' := last 0 V => compV modVm maxVm.
have [modUm' modVm']: modG Um' * modG Vm' := (last_mod compU, last_mod compV).
pose i_m := @ord_max (size U).
have [eqUVm' | neqUVm'] := altP (@eqmxP _ _ _ _ Um' Vm').
have [szV [p sim_p]] := IHr U V szUr compU compV eqUVm'.
split; first by rewrite szV.
exists (lift_perm i_m i_m p) => i; case: (unliftP i_m i) => [j|] ->{i}.
apply: rsimT (rsimC _) (rsimT (sim_p j) _).
by rewrite lift_max; apply: rsim_rcons.
by rewrite lift_perm_lift lift_max; apply: rsim_rcons; rewrite -szV.
have simUVm := section_eqmx modUm' modVm' modUm modVm eqUVm' eqUVm.
apply: rsimT (rsimC _) (rsimT simUVm _); first exact: rsim_last.
by rewri
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_JordanHolder | |
mx_JordanHolder_maxU (m := size U) V compU modV :
(last 0 U :=: 1%:M)%MS -> mx_irreducible (@factmod_repr _ G n rG V modV) ->
exists i : 'I_m, mx_rsim (factmod_repr modV) (@series_repr U i compU).
Proof.
rewrite {}/m; set Um := last 0 U => Um1 irrV.
have modUm: modG Um := last_mod compU; have simV := rsimC (mx_factmod_sub modV).
have maxV: max_submod V Um.
move/max_submodP: (mx_rsim_irr simV irrV) => /(_ (submx1 _)).
by apply: max_submod_eqmx; last apply: eqmx_sym.
have [W compW lastW] := mx_JordanHolder_exists compU modV maxV.
have compWU: mx_series (rcons W Um) by apply/mx_series_rcons; rewrite lastW.
have:= mx_JordanHolder compU compWU; rewrite last_rcons size_rcons.
case=> // szW [p pUW]; have ltWU: size W < size U by rewrite szW.
pose i := Ordinal ltWU; exists ((p^-1)%g i).
apply: rsimT simV (rsimT _ (rsimC (pUW _))); rewrite permKV.
apply: rsimT (rsimC _) (rsim_last (last_mod compW) modUm _).
by apply: section_eqmx; rewrite ?lastW.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_JordanHolder_max | |
gring_free: row_free R_G.
Proof.
apply/row_freeP; exists (lin1_mx (row (gring_index G 1) \o vec_mx)).
apply/row_matrixP=> i; rewrite row_mul rowK mul_rV_lin1 /= mxvecK rowK row1.
by rewrite gring_indexK // mul1g gring_valK.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gring_free | |
gring_op_idA : (A \in R_G)%MS -> gring_op aG A = A.
Proof.
case/envelop_mxP=> a ->{A}; rewrite linear_sum.
by apply: eq_bigr => x Gx; rewrite linearZ /= gring_opG.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gring_op_id | |
gring_rowKA : (A \in R_G)%MS -> gring_mx aG (gring_row A) = A.
Proof. exact: gring_op_id. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gring_rowK | |
mem_gring_mxm a (M : 'M_(m, nG)) :
(gring_mx aG a \in M *m R_G)%MS = (a <= M)%MS.
Proof. by rewrite vec_mxK submxMfree ?gring_free. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mem_gring_mx | |
mem_sub_gringm A (M : 'M_(m, nG)) :
(A \in M *m R_G)%MS = (A \in R_G)%MS && (gring_row A <= M)%MS.
Proof.
rewrite -(andb_idl (memmx_subP (submxMl _ _) A)); apply: andb_id2l => R_A.
by rewrite -mem_gring_mx gring_rowK.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mem_sub_gring | |
gring_mxPa : (gring_mx rG a \in enveloping_algebra_mx rG)%MS.
Proof. by rewrite vec_mxK submxMl. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gring_mxP | |
gring_opMA B :
(B \in R_G)%MS -> gring_op rG (A *m B) = gring_op rG A *m gring_op rG B.
Proof. by move=> R_B; rewrite -gring_opJ gring_rowK. Qed.
Hypothesis irrG : mx_irreducible rG. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gring_opM | |
rsim_regular_factmod:
{U : 'M_nG & {modU : mxmodule aG U & mx_rsim rG (factmod_repr modU)}}.
Proof.
pose v : 'rV[F]_n := nz_row 1%:M.
pose fU := lin1_mx (mulmx v \o gring_mx rG); pose U := kermx fU.
have modU: mxmodule aG U.
apply/mxmoduleP => x Gx; apply/sub_kermxP/row_matrixP=> i.
rewrite 2!row_mul row0; move: (row i U) (sub_kermxP (row_sub i U)) => u.
by rewrite !mul_rV_lin1 /= gring_mxJ // mulmxA => ->; rewrite mul0mx.
have def_n: \rank (cokermx U) = n.
apply/eqP; rewrite mxrank_coker mxrank_ker subKn ?rank_leq_row // -genmxE.
rewrite -[_ == _]sub1mx; have [_ _ ->] := irrG; rewrite ?submx1 //.
rewrite (eqmx_module _ (genmxE _)); apply/mxmoduleP=> x Gx.
apply/row_subP=> i; apply: eq_row_sub (gring_index G (enum_val i * x)) _.
rewrite !rowE mulmxA !mul_rV_lin1 /= -mulmxA -gring_mxJ //.
by rewrite -rowE rowK.
rewrite (eqmx_eq0 (genmxE _)); apply/rowV0Pn.
exists v; last exact: (nz_row_mxsimple irrG).
apply/submxP; exists (gring_row (aG 1%g)); rewrite mul_rV_lin1 /=.
by rewrite -gring_opE gring_opG // repr_mx1 mulmx1.
exists U; exists modU; apply: mx_rsim_sym.
exists (val_factmod 1%:M *m fU) => // [|x Gx].
rewrite /row_free eqn_leq rank_leq_row /= -subn_eq0 -mxrank_ker mxrank_eq0.
apply/rowV0P=> u /sub_kermxP; rewrite mulmxA => /sub_kermxP.
by rewrite -/U -in_factmod_eq0 mulmxA mulmx1 val_factmodK => /eqP.
rewrite mulmxA -val_factmodE (canRL (addKr _) (add_sub_fact_mod U _)).
rewrite mulmxDl mulNmx (sub_kermxP (val_submodP _)) oppr0 add0r.
apply/row_matri
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rsim_regular_factmod | |
rsim_regular_seriesU (compU : mx_composition_series aG U) :
(last 0 U :=: 1%:M)%MS ->
exists i : 'I_(size U), mx_rsim rG (series_repr i compU).
Proof.
move=> lastU; have [V [modV simGV]] := rsim_regular_factmod.
have irrV := mx_rsim_irr simGV irrG.
have [i simVU] := mx_JordanHolder_max compU lastU irrV.
by exists i; apply: mx_rsim_trans simGV simVU.
Qed.
Hypothesis F'G : [pchar F]^'.-group G. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rsim_regular_series | |
rsim_regular_submod_pchar:
{U : 'M_nG & {modU : mxmodule aG U & mx_rsim rG (submod_repr modU)}}.
Proof.
have [V [modV eqG'V]] := rsim_regular_factmod.
have [U modU defVU dxVU] := mx_Maschke_pchar F'G modV (submx1 V).
exists U; exists modU; apply: mx_rsim_trans eqG'V _.
by apply: mx_rsim_factmod; rewrite ?mxdirectE /= addsmxC // addnC.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rsim_regular_submod_pchar | |
gset_mx(A : {set gT}) := \sum_(x in A) aG x.
Local Notation tG := #|pred_of_set (classes (gval G))|. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | gset_mx | |
classg_base:= \matrix_(k < tG) mxvec (gset_mx (enum_val k)).
Let groupCl : {in G, forall x, {subset x ^: G <= G}}.
Proof. by move=> x Gx; apply: subsetP; apply: class_subG. Qed. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | classg_base | |
classg_base_free: row_free classg_base.
Proof.
rewrite -kermx_eq0; apply/rowV0P=> v /sub_kermxP; rewrite mulmx_sum_row => v0.
apply/rowP=> k /[1!mxE].
have [x Gx def_k] := imsetP (enum_valP k).
transitivity (@gring_proj F _ G x (vec_mx 0) 0 0); last first.
by rewrite !linear0 !mxE.
rewrite -{}v0 !linear_sum (bigD1 k) //= 2!linearZ /= rowK mxvecK def_k.
rewrite linear_sum (bigD1 x) ?class_refl //= gring_projE // eqxx.
rewrite !big1 ?addr0 ?mxE ?mulr1 // => [k' | y /andP[xGy ne_yx]]; first 1 last.
by rewrite gring_projE ?(groupCl Gx xGy) // eq_sym (negPf ne_yx).
rewrite rowK 2!linearZ /= mxvecK -(inj_eq enum_val_inj) def_k eq_sym.
have [z Gz ->] := imsetP (enum_valP k').
move/eqP=> not_Gxz; rewrite linear_sum big1 ?scaler0 //= => y zGy.
rewrite gring_projE ?(groupCl Gz zGy) //.
by case: eqP zGy => // <- /class_eqP.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | classg_base_free | |
classg_base_center: (classg_base :=: 'Z(R_G))%MS.
Proof.
apply/eqmxP/andP; split.
apply/row_subP=> k; rewrite rowK /gset_mx sub_capmx {1}linear_sum.
have [x Gx ->{k}] := imsetP (enum_valP k); have sxGG := groupCl Gx.
rewrite summx_sub => [|y xGy]; last by rewrite envelop_mx_id ?sxGG.
rewrite memmx_cent_envelop; apply/centgmxP=> y Gy.
rewrite {2}(reindex_acts 'J _ Gy) ?astabsJ ?class_norm //=.
rewrite mulmx_suml mulmx_sumr; apply: eq_bigr => z; move/sxGG=> Gz.
by rewrite -!repr_mxM ?groupJ -?conjgC.
apply/memmx_subP=> A; rewrite sub_capmx memmx_cent_envelop.
case/andP=> /envelop_mxP[a ->{A}] cGa.
rewrite (partition_big_imset (class^~ G)) -/(classes G) /=.
rewrite linear_sum summx_sub //= => xG GxG; have [x Gx def_xG] := imsetP GxG.
apply: submx_trans (scalemx_sub (a x) (submx_refl _)).
rewrite (eq_row_sub (enum_rank_in GxG xG)) // linearZ /= rowK enum_rankK_in //.
rewrite !linear_sum {xG GxG}def_xG; apply: eq_big => [y | xy] /=.
apply/idP/andP=> [| [_ xGy]]; last by rewrite -(eqP xGy) class_refl.
by case/imsetP=> z Gz ->; rewrite groupJ // classGidl.
case/imsetP=> y Gy ->{xy}; rewrite linearZ; congr (_ *: _).
move/(canRL (repr_mxK aG Gy)): (centgmxP cGa y Gy); have Gy' := groupVr Gy.
move/(congr1 (gring_proj x)); rewrite -mulmxA mulmx_suml !linear_sum.
rewrite (bigD1 x Gx) big1 => [|z /andP[Gz]]; rewrite linearZ /=; last first.
by rewrite eq_sym gring_projE // => /negPf->; rewrite scaler0.
rewrite gring_projE // eqxx scalemx1 (bigD1 (x ^ y)%g) ?groupJ //=.
rewrite big1 => [
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | classg_base_center | |
regular_module_idealm (M : 'M_(m, nG)) :
mxmodule aG M = right_mx_ideal R_G (M *m R_G).
Proof.
apply/idP/idP=> modM.
apply/mulsmx_subP=> A B; rewrite !mem_sub_gring => /andP[R_A M_A] R_B.
by rewrite envelop_mxM // gring_row_mul (mxmodule_envelop modM).
apply/mxmoduleP=> x Gx; apply/row_subP=> i; rewrite row_mul -mem_gring_mx.
rewrite gring_mxJ // (mulsmx_subP modM) ?envelop_mx_id //.
by rewrite mem_gring_mx row_sub.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | regular_module_ideal | |
irrType:= socleType aG.
Identity Coercion type_of_irrType : irrType >-> socleType.
Variable sG : irrType. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irrType | |
irr_degree(i : sG) := \rank (socle_base i).
Local Notation "'n_ i" := (irr_degree i) : group_ring_scope.
Local Open Scope group_ring_scope. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_degree | |
irr_degreeEi : 'n_i = \rank (socle_base i). Proof. by []. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_degreeE | |
irr_degree_gt0i : 'n_i > 0.
Proof. by rewrite lt0n mxrank_eq0; case: (socle_simple i). Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_degree_gt0 | |
irr_repri : mx_representation F G 'n_i := socle_repr i. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_repr | |
irr_reprEi x : irr_repr i x = submod_mx (socle_module i) x.
Proof. by []. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_reprE | |
rfix_regular: (rfix_mx aG G :=: gring_row (gset_mx G))%MS.
Proof.
apply/eqmxP/andP; split; last first.
apply/rfix_mxP => x Gx; rewrite -gring_row_mul; congr gring_row.
rewrite {2}/gset_mx (reindex_astabs 'R x) ?astabsR //= mulmx_suml.
by apply: eq_bigr => y Gy; rewrite repr_mxM.
apply/rV_subP=> v /rfix_mxP cGv.
have /envelop_mxP[a def_v]: (gring_mx aG v \in R_G)%MS.
by rewrite vec_mxK submxMl.
suffices ->: v = a 1%g *: gring_row (gset_mx G) by rewrite scalemx_sub.
rewrite -linearZ scaler_sumr -[v]gring_mxK def_v; congr (gring_row _).
apply: eq_bigr => x Gx; congr (_ *: _).
move/rowP/(_ 0): (congr1 (gring_proj x \o gring_mx aG) (cGv x Gx)).
rewrite /= gring_mxJ // def_v mulmx_suml !linear_sum (bigD1 1%g) //=.
rewrite repr_mx1 -scalemxAl mul1mx linearZ /= gring_projE // eqxx scalemx1.
rewrite big1 ?addr0 ?mxE /= => [ | y /andP[Gy nt_y]]; last first.
rewrite -scalemxAl linearZ -repr_mxM //= gring_projE ?groupM //.
by rewrite eq_sym eq_mulgV1 mulgK (negPf nt_y) scaler0.
rewrite (bigD1 x) //= linearZ /= gring_projE // eqxx scalemx1.
rewrite big1 ?addr0 ?mxE // => y /andP[Gy ne_yx].
by rewrite linearZ /= gring_projE // eq_sym (negPf ne_yx) scaler0.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rfix_regular | |
principal_comp_subproof: mxsimple aG (rfix_mx aG G).
Proof.
apply: linear_mxsimple; first exact: rfix_mx_module.
apply/eqP; rewrite rfix_regular eqn_leq rank_leq_row lt0n mxrank_eq0.
apply/eqP => /(congr1 (gring_proj 1 \o gring_mx aG)); apply/eqP.
rewrite /= -[gring_mx _ _]/(gring_op _ _) !linear0 !linear_sum (bigD1 1%g) //=.
rewrite gring_opG ?gring_projE // eqxx big1 ?addr0 ?oner_eq0 // => x.
by case/andP=> Gx nt_x; rewrite gring_opG // gring_projE // eq_sym (negPf nt_x).
Qed.
Fact principal_comp_key : unit. Proof. by []. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | principal_comp_subproof | |
principal_comp_def:=
PackSocle (component_socle sG principal_comp_subproof). | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | principal_comp_def | |
principal_comp:= locked_with principal_comp_key principal_comp_def.
Local Notation "1" := principal_comp : irrType_scope. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | principal_comp | |
irr1_rfix: (1%irr :=: rfix_mx aG G)%MS.
Proof.
rewrite [1%irr]unlock PackSocleK; apply/eqmxP.
rewrite (component_mx_id principal_comp_subproof) andbT.
have [I [W isoW ->]] := component_mx_def principal_comp_subproof.
apply/sumsmx_subP=> i _; have [f _ hom_f <-]:= isoW i. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr1_rfix | |
rank_irr1: \rank 1%irr = 1.
Proof.
apply/eqP; rewrite eqn_leq lt0n mxrank_eq0 nz_socle andbT.
by rewrite irr1_rfix rfix_regular rank_leq_row.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rank_irr1 | |
degree_irr1: 'n_1 = 1.
Proof.
apply/eqP; rewrite eqn_leq irr_degree_gt0 -rank_irr1.
by rewrite mxrankS ?component_mx_id //; apply: socle_simple.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | degree_irr1 | |
Wedderburn_subring(i : sG) := <<i *m R_G>>%MS.
Local Notation "''R_' i" := (Wedderburn_subring i) : group_ring_scope.
Let sums_R : (\sum_i 'R_i :=: Socle sG *m R_G)%MS.
Proof.
apply/eqmxP; set R_S := (_ <= _)%MS.
have sRS: R_S by apply/sumsmx_subP=> i; rewrite genmxE submxMr ?(sumsmx_sup i).
rewrite sRS -(mulmxKpV sRS) mulmxA submxMr //; apply/sumsmx_subP=> i _.
rewrite -(submxMfree _ _ gring_free) -(mulmxA _ _ R_G) mulmxKpV //.
by rewrite (sumsmx_sup i) ?genmxE.
Qed. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_subring | |
Wedderburn_ideali : mx_ideal R_G 'R_i.
Proof.
apply/andP; split; last first.
rewrite /right_mx_ideal genmxE (muls_eqmx (genmxE _) (eqmx_refl _)).
by rewrite -[(_ <= _)%MS]regular_module_ideal component_mx_module.
apply/mulsmx_subP=> A B R_A; rewrite !genmxE !mem_sub_gring => /andP[R_B SiB].
rewrite envelop_mxM {R_A}// gring_row_mul -{R_B}(gring_rowK R_B).
pose f := mulmx (gring_row A) \o gring_mx aG.
rewrite -[_ *m _](mul_rV_lin1 f).
suffices: (i *m lin1_mx f <= i)%MS by apply: submx_trans; rewrite submxMr.
apply: hom_component_mx; first exact: socle_simple.
apply/rV_subP=> v _; apply/hom_mxP=> x Gx.
by rewrite !mul_rV_lin1 /f /= gring_mxJ ?mulmxA.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_ideal | |
Wedderburn_direct: mxdirect (\sum_i 'R_i)%MS.
Proof.
apply/mxdirectP; rewrite /= sums_R mxrankMfree ?gring_free //.
rewrite (mxdirectP (Socle_direct sG)); apply: eq_bigr=> i _ /=.
by rewrite genmxE mxrankMfree ?gring_free.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_direct | |
Wedderburn_disjointi j : i != j -> ('R_i :&: 'R_j)%MS = 0.
Proof.
move=> ne_ij; apply/eqP; rewrite -submx0 capmxC.
by rewrite -(mxdirect_sumsP Wedderburn_direct j) // capmxS // (sumsmx_sup i).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_disjoint | |
Wedderburn_annihilatei j : i != j -> ('R_i * 'R_j)%MS = 0.
Proof.
move=> ne_ij; apply/eqP; rewrite -submx0 -(Wedderburn_disjoint ne_ij).
rewrite sub_capmx; apply/andP; split.
case/andP: (Wedderburn_ideal i) => _; apply: submx_trans.
by rewrite mulsmxS // genmxE submxMl.
case/andP: (Wedderburn_ideal j) => idlRj _; apply: submx_trans idlRj.
by rewrite mulsmxS // genmxE submxMl.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_annihilate | |
Wedderburn_mulmx0i j A B :
i != j -> (A \in 'R_i)%MS -> (B \in 'R_j)%MS -> A *m B = 0.
Proof.
move=> ne_ij RiA RjB; apply: memmx0.
by rewrite -(Wedderburn_annihilate ne_ij) mem_mulsmx.
Qed.
Hypothesis F'G : [pchar F]^'.-group G. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_mulmx0 | |
irr_mx_sum_pchar: (\sum_(i : sG) i = 1%:M)%MS.
Proof. by apply: reducible_Socle1; apply: mx_Maschke_pchar. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mx_sum_pchar | |
Wedderburn_sum_pchar: (\sum_i 'R_i :=: R_G)%MS.
Proof.
by apply: eqmx_trans sums_R _; rewrite /Socle irr_mx_sum_pchar mul1mx.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_sum_pchar | |
Wedderburn_idi :=
vec_mx (mxvec 1%:M *m proj_mx 'R_i (\sum_(j | j != i) 'R_j)%MS).
Local Notation "''e_' i" := (Wedderburn_id i) : group_ring_scope. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_id | |
Wedderburn_sum_id_pchar: \sum_i 'e_i = 1%:M.
Proof.
rewrite -linear_sum; apply: canLR mxvecK _.
have: (1%:M \in R_G)%MS := envelop_mx1 aG.
rewrite -Wedderburn_sum_pchar.
case/(sub_dsumsmx Wedderburn_direct) => e Re -> _.
apply: eq_bigr => i _; have dxR := mxdirect_sumsP Wedderburn_direct i (erefl _).
rewrite (bigD1 i) // mulmxDl proj_mx_id ?Re // proj_mx_0 ?addr0 //=.
by rewrite summx_sub // => j ne_ji; rewrite (sumsmx_sup j) ?Re.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_sum_id_pchar | |
Wedderburn_id_memi : ('e_i \in 'R_i)%MS.
Proof. by rewrite vec_mxK proj_mx_sub. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_id_mem | |
Wedderburn_is_id_pchari : mxring_id 'R_i 'e_i.
Proof.
have ideRi A: (A \in 'R_i)%MS -> 'e_i *m A = A.
move=> RiA; rewrite -{2}[A]mul1mx -Wedderburn_sum_id_pchar mulmx_suml.
rewrite (bigD1 i) //= big1 ?addr0 // => j ne_ji.
by rewrite (Wedderburn_mulmx0 ne_ji) ?Wedderburn_id_mem.
split=> // [||A RiA]; first 2 [exact: Wedderburn_id_mem].
apply: contraNneq (nz_socle i) => e0.
apply/rowV0P=> v; rewrite -mem_gring_mx -(genmxE (i *m _)) => /ideRi.
by rewrite e0 mul0mx => /(canLR gring_mxK); rewrite linear0.
rewrite -{2}[A]mulmx1 -Wedderburn_sum_id_pchar mulmx_sumr (bigD1 i) //=.
rewrite big1 ?addr0 // => j; rewrite eq_sym => ne_ij.
by rewrite (Wedderburn_mulmx0 ne_ij) ?Wedderburn_id_mem.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_is_id_pchar | |
Wedderburn_closed_pchari : ('R_i * 'R_i = 'R_i)%MS.
Proof.
rewrite -{3}['R_i]genmx_id -/'R_i -genmx_muls; apply/genmxP.
have [idlRi idrRi] := andP (Wedderburn_ideal i).
apply/andP; split.
by apply: submx_trans idrRi; rewrite mulsmxS // genmxE submxMl.
have [_ Ri_e ideRi _] := Wedderburn_is_id_pchar i.
by apply/memmx_subP=> A RiA; rewrite -[A]ideRi ?mem_mulsmx.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_closed_pchar | |
Wedderburn_is_ring_pchari : mxring 'R_i.
Proof.
rewrite /mxring /left_mx_ideal Wedderburn_closed_pchar submx_refl.
by apply/mxring_idP; exists 'e_i; apply: Wedderburn_is_id_pchar.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_is_ring_pchar | |
Wedderburn_min_ideal_pcharm i (E : 'A_(m, nG)) :
E != 0 -> (E <= 'R_i)%MS -> mx_ideal R_G E -> (E :=: 'R_i)%MS.
Proof.
move=> nzE sE_Ri /andP[idlE idrE]; apply/eqmxP; rewrite sE_Ri.
pose M := E *m pinvmx R_G; have defE: E = M *m R_G.
by rewrite mulmxKpV // (submx_trans sE_Ri) // genmxE submxMl.
have modM: mxmodule aG M by rewrite regular_module_ideal -defE.
have simSi := socle_simple i; set Si := socle_base i in simSi.
have [I [W isoW defW]]:= component_mx_def simSi.
rewrite /'R_i /socle_val /= defW genmxE defE submxMr //.
apply/sumsmx_subP=> j _.
have simW := mx_iso_simple (isoW j) simSi; have [modW _ minW] := simW.
have [{minW}dxWE | nzWE] := eqVneq (W j :&: M)%MS 0; last first.
by rewrite (sameP capmx_idPl eqmxP) minW ?capmxSl ?capmx_module.
have [_ Rei ideRi _] := Wedderburn_is_id_pchar i.
have:= nzE; rewrite -submx0 => /memmx_subP[A E_A].
rewrite -(ideRi _ (memmx_subP sE_Ri _ E_A)).
have:= E_A; rewrite defE mem_sub_gring => /andP[R_A M_A].
have:= Rei; rewrite genmxE mem_sub_gring => /andP[Re].
rewrite -{2}(gring_rowK Re) /socle_val defW => /sub_sumsmxP[e ->].
rewrite !(linear_sum, mulmx_suml) summx_sub //= => k _.
rewrite -(gring_rowK R_A) -gring_mxA -mulmxA gring_rowK //.
rewrite ((W k *m _ =P 0) _) ?linear0 ?sub0mx //.
have [f _ homWf defWk] := mx_iso_trans (mx_iso_sym (isoW j)) (isoW k).
rewrite -submx0 -{k defWk}(eqmxMr _ defWk) -(hom_envelop_mxC homWf) //.
rewrite -(mul0mx _ f) submxMr {f homWf}// -dxWE sub_capmx.
rewrite (mxmodule_envelop modW) //=; apply/row_subP=> k.
rewrite row_mul
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_min_ideal_pchar | |
irr_comp:= odflt 1%irr [pick i | gring_op rG 'e_i != 0].
Local Notation iG := irr_comp.
Hypothesis irrG : mx_irreducible rG. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_comp | |
rsim_irr_comp_pchar: mx_rsim rG (irr_repr iG).
Proof.
have [M [modM rsimM]] := rsim_regular_submod_pchar irrG F'G.
have simM: mxsimple aG M.
case/mx_irrP: irrG => n_gt0 minG.
have [f def_n injf homf] := mx_rsim_sym rsimM.
apply/(submod_mx_irr modM)/mx_irrP.
split=> [|U modU nzU]; first by rewrite def_n.
rewrite /row_full -(mxrankMfree _ injf) -genmxE {4}def_n.
apply: minG; last by rewrite -mxrank_eq0 genmxE mxrankMfree // mxrank_eq0.
rewrite (eqmx_module _ (genmxE _)); apply/mxmoduleP=> x Gx.
by rewrite -mulmxA -homf // mulmxA submxMr // (mxmoduleP modU).
pose i := PackSocle (component_socle sG simM).
have{modM} rsimM: mx_rsim rG (socle_repr i).
apply: mx_rsim_trans rsimM (mx_rsim_sym _); apply/mx_rsim_iso.
apply: (component_mx_iso (socle_simple _)) => //.
by rewrite [component_mx _ _]PackSocleK component_mx_id.
have [<- // | ne_i_iG] := eqVneq i iG.
suffices {i M simM ne_i_iG rsimM}: gring_op rG 'e_iG != 0.
by rewrite (not_rsim_op0_pchar rsimM ne_i_iG) ?Wedderburn_id_mem ?eqxx.
rewrite /iG; case: pickP => //= G0.
suffices: rG 1%g == 0.
by case/idPn; rewrite -mxrank_eq0 repr_mx1 mxrank1 -lt0n; case/mx_irrP: irrG.
rewrite -gring_opG // repr_mx1 -Wedderburn_sum_id_pchar linear_sum big1 //.
by move=> j _; move/eqP: (G0 j).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rsim_irr_comp_pchar | |
irr_comp'_op0_pcharj A : j != iG -> (A \in 'R_j)%MS -> gring_op rG A = 0.
Proof. by rewrite eq_sym; apply: not_rsim_op0_pchar rsim_irr_comp_pchar. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_comp'_op0_pchar | |
irr_comp_envelop_pchar: ('R_iG *m lin_mx (gring_op rG) :=: E_G)%MS.
Proof.
apply/eqmxP/andP; split; apply/row_subP=> i.
by rewrite row_mul mul_rV_lin gring_mxP.
rewrite rowK /= -gring_opG ?enum_valP // -mul_vec_lin -gring_opG ?enum_valP //.
rewrite vec_mxK /= -mulmxA mulmx_sub {i}//= -(eqmxMr _ Wedderburn_sum_pchar).
rewrite (bigD1 iG) //= addsmxMr addsmxC [_ *m _](sub_kermxP _) ?adds0mx //=.
apply/sumsmx_subP => j ne_j_iG; apply/memmx_subP=> A RjA; apply/sub_kermxP.
by rewrite mul_vec_lin /= (irr_comp'_op0_pchar ne_j_iG RjA) linear0.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_comp_envelop_pchar | |
ker_irr_comp_op_pchar: ('R_iG :&: kermx (lin_mx (gring_op rG)))%MS = 0.
Proof.
apply/eqP; rewrite -submx0; apply/memmx_subP=> A.
rewrite sub_capmx /= submx0 mxvec_eq0 => /andP[R_A].
rewrite (sameP sub_kermxP eqP) mul_vec_lin mxvec_eq0 /= => opA0.
have [_ Re ideR _] := Wedderburn_is_id_pchar iG; rewrite -[A]ideR {ideR}//.
move: Re; rewrite genmxE mem_sub_gring /socle_val => /andP[Re].
rewrite -{2}(gring_rowK Re) -submx0.
pose simMi := socle_simple iG; have [J [M isoM ->]] := component_mx_def simMi.
case/sub_sumsmxP=> e ->; rewrite linear_sum mulmx_suml summx_sub // => j _.
rewrite -(in_submodK (submxMl _ (M j))); move: (in_submod _ _) => v.
have modMj: mxmodule aG (M j) by apply: mx_iso_module (isoM j) _; case: simMi.
have rsimMj: mx_rsim rG (submod_repr modMj).
by apply: mx_rsim_trans rsim_irr_comp_pchar _; apply/mx_rsim_iso.
have [f [f' _ hom_f]] := mx_rsim_def (mx_rsim_sym rsimMj); rewrite submx0.
have <-: (gring_mx aG (val_submod (v *m (f *m gring_op rG A *m f')))) = 0.
by rewrite (eqP opA0) !(mul0mx, linear0).
have: (A \in R_G)%MS by rewrite -Wedderburn_sum_pchar (sumsmx_sup iG).
case/envelop_mxP=> a ->; rewrite !(linear_sum, mulmx_suml) /=; apply/eqP.
apply: eq_bigr=> x Gx; rewrite 3!linearZ -scalemxAl 3!linearZ /=.
by rewrite gring_opG // -hom_f // val_submodJ // gring_mxJ.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | ker_irr_comp_op_pchar | |
regular_op_inj_pchar:
{in [pred A | (A \in 'R_iG)%MS] &, injective (gring_op rG)}.
Proof.
move=> A B RnA RnB /= eqAB; apply/eqP; rewrite -subr_eq0 -mxvec_eq0 -submx0.
rewrite -ker_irr_comp_op_pchar sub_capmx (sameP sub_kermxP eqP) mul_vec_lin.
by rewrite 2!raddfB /= eqAB subrr linear0 addmx_sub ?eqmx_opp /=.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | regular_op_inj_pchar | |
rank_irr_comp_pchar: \rank 'R_iG = \rank E_G.
Proof.
rewrite -irr_comp_envelop_pchar; apply/esym/mxrank_injP.
by rewrite ker_irr_comp_op_pchar.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rank_irr_comp_pchar | |
irr_comp_rsim_pcharn1 n2 rG1 rG2 :
@mx_rsim _ G n1 rG1 n2 rG2 -> irr_comp rG1 = irr_comp rG2.
Proof.
case=> f eq_n12; rewrite -eq_n12 in rG2 f * => inj_f hom_f.
rewrite /irr_comp; apply/f_equal/eq_pick => i; rewrite -!mxrank_eq0. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_comp_rsim_pchar | |
irr_reprK_pchari : irr_comp (irr_repr i) = i.
Proof.
apply/eqP; apply/component_mx_isoP; try exact: socle_simple.
by move/mx_rsim_iso: (rsim_irr_comp_pchar (socle_irr i)); apply: mx_iso_sym.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_reprK_pchar | |
irr_repr'_op0_pchari j A :
j != i -> (A \in 'R_j)%MS -> gring_op (irr_repr i) A = 0.
Proof.
move=> neq_ij /(irr_comp'_op0_pchar _).
by move=> ->; [|apply: socle_irr|rewrite irr_reprK_pchar].
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_repr'_op0_pchar | |
op_Wedderburn_id_pchari : gring_op (irr_repr i) 'e_i = 1%:M.
Proof.
rewrite -(gring_op1 (irr_repr i)) -Wedderburn_sum_id_pchar.
rewrite linear_sum (bigD1 i) //= addrC big1 ?add0r // => j neq_ji.
exact: irr_repr'_op0_pchar (Wedderburn_id_mem j).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | op_Wedderburn_id_pchar | |
irr_comp_id_pchar(M : 'M_nG) (modM : mxmodule aG M) (iM : sG) :
mxsimple aG M -> (M <= iM)%MS -> irr_comp (submod_repr modM) = iM.
Proof.
move=> simM sMiM; rewrite -[iM]irr_reprK_pchar.
apply/esym/irr_comp_rsim_pchar/mx_rsim_iso/component_mx_iso => //.
exact: socle_simple.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_comp_id_pchar | |
irr1_reprx : x \in G -> irr_repr 1 x = 1%:M.
Proof.
move=> Gx; suffices: x \in rker (irr_repr 1) by case/rkerP.
apply: subsetP x Gx; rewrite rker_submod rfix_mx_rstabC // -irr1_rfix.
by apply: component_mx_id; apply: socle_simple.
Qed.
Hypothesis splitG : group_splitting_field G. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr1_repr | |
rank_Wedderburn_subring_pchari : \rank 'R_i = ('n_i ^ 2)%N.
Proof.
apply/eqP; rewrite -{1}[i]irr_reprK_pchar; have irrSi := socle_irr i.
by case/andP: (splitG irrSi) => _; rewrite rank_irr_comp_pchar.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rank_Wedderburn_subring_pchar | |
sum_irr_degree_pchar: (\sum_i 'n_i ^ 2 = nG)%N.
Proof.
apply: etrans (eqnP gring_free).
rewrite -Wedderburn_sum_pchar (mxdirectP Wedderburn_direct) /=.
by apply: eq_bigr => i _; rewrite rank_Wedderburn_subring_pchar.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | sum_irr_degree_pchar | |
irr_mx_mult_pchari : socle_mult i = 'n_i.
Proof.
rewrite /socle_mult -(mxrankMfree _ gring_free) -genmxE.
by rewrite rank_Wedderburn_subring_pchar mulKn ?irr_degree_gt0.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mx_mult_pchar | |
mxtrace_regular_pchar:
{in G, forall x, \tr (aG x) = \sum_i \tr (socle_repr i x) *+ 'n_i}.
Proof.
move=> x Gx; have soc1: (Socle sG :=: 1%:M)%MS by rewrite -irr_mx_sum_pchar.
rewrite -(mxtrace_submod1 (Socle_module sG) soc1) // mxtrace_Socle //.
by apply: eq_bigr => i _; rewrite irr_mx_mult_pchar.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mxtrace_regular_pchar | |
linear_irr:= [set i | 'n_i == 1]. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | linear_irr | |
irr_degree_abelian: abelian G -> forall i, 'n_i = 1.
Proof. by move=> cGG i; apply: mxsimple_abelian_linear (socle_simple i). Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_degree_abelian | |
linear_irr_comp_pchari : 'n_i = 1 -> (i :=: socle_base i)%MS.
Proof.
move=> ni1; apply/eqmxP; rewrite andbC -mxrank_leqif_eq -/'n_i.
rewrite -(mxrankMfree _ gring_free) -genmxE.
by rewrite rank_Wedderburn_subring_pchar ni1.
exact: component_mx_id (socle_simple i).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | linear_irr_comp_pchar | |
Wedderburn_subring_center_pchari : ('Z('R_i) :=: mxvec 'e_i)%MS.
Proof.
have [nz_e Re ideR idRe] := Wedderburn_is_id_pchar i.
have Ze: (mxvec 'e_i <= 'Z('R_i))%MS.
rewrite sub_capmx [(_ <= _)%MS]Re.
by apply/cent_mxP=> A R_A; rewrite ideR // idRe.
pose irrG := socle_irr i; set rG := socle_repr i in irrG.
pose E_G := enveloping_algebra_mx rG; have absG := splitG irrG.
apply/eqmxP; rewrite andbC -(geq_leqif (mxrank_leqif_eq Ze)).
have ->: \rank (mxvec 'e_i) = (0 + 1)%N.
by apply/eqP; rewrite eqn_leq rank_leq_row lt0n mxrank_eq0 mxvec_eq0.
rewrite -(mxrank_mul_ker _ (lin_mx (gring_op rG))) addnC leq_add //.
rewrite leqn0 mxrank_eq0 -submx0 -(ker_irr_comp_op_pchar irrG) capmxS //.
by rewrite irr_reprK_pchar capmxSl.
apply: leq_trans (mxrankS _) (rank_leq_row (mxvec 1%:M)).
apply/memmx_subP=> Ar; case/submxP=> a ->{Ar}.
rewrite mulmxA mul_rV_lin /=; set A := vec_mx _.
rewrite memmx1 (mx_abs_irr_cent_scalar absG) // -memmx_cent_envelop.
apply/cent_mxP=> Br; rewrite -(irr_comp_envelop_pchar irrG) irr_reprK_pchar.
case/submxP=> b /(canRL mxvecK) ->{Br}; rewrite mulmxA mx_rV_lin /=.
set B := vec_mx _; have RiB: (B \in 'R_i)%MS by rewrite vec_mxK submxMl.
have sRiR: ('R_i <= R_G)%MS by rewrite -Wedderburn_sum_pchar (sumsmx_sup i).
have: (A \in 'Z('R_i))%MS by rewrite vec_mxK submxMl.
rewrite sub_capmx => /andP[RiA /cent_mxP cRiA].
by rewrite -!gring_opM ?(memmx_subP sRiR) 1?cRiA.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_subring_center_pchar | |
Wedderburn_center_pchar:
('Z(R_G) :=: \matrix_(i < #|sG|) mxvec 'e_(enum_val i))%MS.
Proof.
have:= mxdirect_sums_center
Wedderburn_sum_pchar Wedderburn_direct Wedderburn_ideal.
move/eqmx_trans; apply; apply/eqmxP/andP; split.
apply/sumsmx_subP=> i _; rewrite Wedderburn_subring_center_pchar.
by apply: (eq_row_sub (enum_rank i)); rewrite rowK enum_rankK.
apply/row_subP=> i; rewrite rowK -Wedderburn_subring_center_pchar.
by rewrite (sumsmx_sup (enum_val i)).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_center_pchar | |
card_irr_pchar: #|sG| = tG.
Proof.
rewrite -(eqnP classg_base_free) classg_base_center.
have:= mxdirect_sums_center
Wedderburn_sum_pchar Wedderburn_direct Wedderburn_ideal.
move->; rewrite (mxdirectP _) /=; last first.
apply/mxdirect_sumsP=> i _; apply/eqP; rewrite -submx0.
rewrite -{2}(mxdirect_sumsP Wedderburn_direct i) // capmxS ?capmxSl //=.
by apply/sumsmx_subP=> j neji; rewrite (sumsmx_sup j) ?capmxSl.
rewrite -sum1_card; apply: eq_bigr => i _; apply/eqP.
rewrite Wedderburn_subring_center_pchar eqn_leq rank_leq_row lt0n mxrank_eq0.
by rewrite andbT mxvec_eq0; case: (Wedderburn_is_id_pchar i).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | card_irr_pchar | |
irr_modex := irr_repr i x i0 i0. | Definition | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mode | |
irr_mode1: irr_mode 1 = 1.
Proof. by rewrite /irr_mode repr_mx1 mxE eqxx. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mode1 | |
irr_center_scalar: {in 'Z(G), forall x, irr_repr i x = (irr_mode x)%:M}.
Proof.
rewrite /irr_mode => x /setIP[Gx cGx].
suffices [a ->]: exists a, irr_repr i x = a%:M by rewrite mxE eqxx.
apply/is_scalar_mxP; apply: (mx_abs_irr_cent_scalar (splitG (socle_irr i))).
by apply/centgmxP=> y Gy; rewrite -!{1}repr_mxM 1?(centP cGx).
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_center_scalar | |
irr_modeM: {in 'Z(G) &, {morph irr_mode : x y / (x * y)%g >-> x * y}}.
Proof.
move=> x y Zx Zy; rewrite {1}/irr_mode repr_mxM ?(subsetP (center_sub G)) //.
by rewrite !irr_center_scalar // -scalar_mxM mxE eqxx.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_modeM | |
irr_modeXn : {in 'Z(G), {morph irr_mode : x / (x ^+ n)%g >-> x ^+ n}}.
Proof.
elim: n => [|n IHn] x Zx; first exact: irr_mode1.
by rewrite expgS irr_modeM ?groupX // exprS IHn.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_modeX | |
irr_mode_unit: {in 'Z(G), forall x, irr_mode x \is a GRing.unit}.
Proof.
move=> x Zx /=; have:= unitr1 F.
by rewrite -irr_mode1 -(mulVg x) irr_modeM ?groupV // unitrM; case/andP=> _.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mode_unit | |
irr_mode_neq0: {in 'Z(G), forall x, irr_mode x != 0}.
Proof. by move=> x /irr_mode_unit; rewrite unitfE. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mode_neq0 | |
irr_modeV: {in 'Z(G), {morph irr_mode : x / (x^-1)%g >-> x^-1}}.
Proof.
move=> x Zx /=; rewrite -[_^-1]mul1r; apply: canRL (mulrK (irr_mode_unit Zx)) _.
by rewrite -irr_modeM ?groupV // mulVg irr_mode1.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_modeV | |
irr1_modex : x \in G -> irr_mode 1 x = 1.
Proof. by move=> Gx; rewrite /irr_mode irr1_repr ?mxE. Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr1_mode | |
card_linear_irr(sG : irrType G) :
[pchar F]^'.-group G -> group_splitting_field G ->
#|linear_irr sG| = #|G : G^`(1)|%g.
Proof.
move=> F'G splitG; apply/eqP.
wlog sGq: / irrType (G / G^`(1))%G by apply: socle_exists.
have [_ nG'G] := andP (der_normal 1 G); apply/eqP; rewrite -card_quotient //.
have cGqGq: abelian (G / G^`(1))%g by apply: sub_der1_abelian.
have F'Gq: [pchar F]^'.-group (G / G^`(1))%g by apply: morphim_pgroup.
have splitGq: group_splitting_field (G / G^`(1))%G.
exact: quotient_splitting_field.
rewrite -(sum_irr_degree_pchar sGq) // -sum1_card.
pose rG (j : sGq) := morphim_repr (socle_repr j) nG'G.
have irrG j: mx_irreducible (rG j) by apply/morphim_mx_irr; apply: socle_irr.
rewrite (reindex (fun j => irr_comp sG (rG j))) /=.
apply: eq_big => [j | j _]; last by rewrite irr_degree_abelian.
have [_ lin_j _ _] := rsim_irr_comp_pchar sG F'G (irrG j).
by rewrite inE -lin_j -irr_degreeE irr_degree_abelian.
pose sGlin := {i | i \in linear_irr sG}.
have sG'k (i : sGlin) : G^`(1)%g \subset rker (irr_repr (val i)).
by case: i => i /= /[!inE] lin; rewrite rker_linear //=; apply/eqP.
pose h' u := irr_comp sGq (quo_repr (sG'k u) nG'G).
have irrGq u: mx_irreducible (quo_repr (sG'k u) nG'G).
by apply/quo_mx_irr; apply: socle_irr.
exists (fun i => oapp h' [1 sGq]%irr (insub i)) => [j | i] lin_i.
rewrite (insubT [in _] lin_i) /=; apply/esym/eqP/socle_rsimP.
apply: mx_rsim_trans (rsim_irr_comp_pchar sGq F'Gq (irrGq _)).
have [g lin_g inj_g hom_g] := rsim_irr_comp_pchar s
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | card_linear_irr | |
primitive_root_splitting_abelian(z : F) :
#|G|.-primitive_root z -> abelian G -> group_splitting_field G.
Proof.
move=> ozG cGG [|n] rG irrG; first by case/mx_irrP: irrG.
case: (pickP [pred x in G | ~~ is_scalar_mx (rG x)]) => [x | scalG].
case/andP=> Gx nscal_rGx; have: horner_mx (rG x) ('X^#|G| - 1) == 0.
rewrite rmorphB rmorphXn /= horner_mx_C horner_mx_X.
rewrite -repr_mxX ?inE // ((_ ^+ _ =P 1)%g _) ?repr_mx1 ?subrr //.
by rewrite -order_dvdn order_dvdG.
case/idPn; rewrite -mxrank_eq0 -(factor_Xn_sub_1 ozG).
elim: #|G| => [|i IHi]; first by rewrite big_nil horner_mx_C mxrank1.
rewrite big_nat_recr => [|//]; rewrite rmorphM mxrankMfree {IHi}//=.
rewrite row_free_unit rmorphB /= horner_mx_X horner_mx_C.
rewrite (mx_Schur irrG) ?subr_eq0 //; last first.
by apply: contraNneq nscal_rGx => ->; apply: scalar_mx_is_scalar.
rewrite -memmx_cent_envelop raddfB.
rewrite addmx_sub ?eqmx_opp ?scalar_mx_cent //= memmx_cent_envelop.
by apply/centgmxP=> j Zh_j; rewrite -!repr_mxM // (centsP cGG).
pose M := <<delta_mx 0 0 : 'rV[F]_n.+1>>%MS.
have linM: \rank M = 1 by rewrite genmxE mxrank_delta.
have modM: mxmodule rG M.
apply/mxmoduleP=> x Gx; move/idPn: (scalG x); rewrite /= Gx negbK.
by case/is_scalar_mxP=> ? ->; rewrite scalar_mxC submxMl.
apply: linear_mx_abs_irr; apply/eqP; rewrite eq_sym -linM.
by case/mx_irrP: irrG => _; apply; rewrite // -mxrank_eq0 linM.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | primitive_root_splitting_abelian | |
cycle_repr_structure_pcharx (sG : irrType G) :
G :=: <[x]> -> [pchar F]^'.-group G -> group_splitting_field G ->
exists2 w : F, #|G|.-primitive_root w &
exists iphi : 'I_#|G| -> sG,
[/\ bijective iphi,
#|sG| = #|G|,
forall i, irr_mode (iphi i) x = w ^+ i
& forall i, irr_repr (iphi i) x = (w ^+ i)%:M].
Proof.
move=> defG; rewrite {defG}(group_inj defG) -/#[x] in sG * => F'X splitF.
have Xx := cycle_id x; have cXX := cycle_abelian x.
have card_sG: #|sG| = #[x].
by rewrite card_irr_pchar //; apply/eqP; rewrite -card_classes_abelian.
have linX := irr_degree_abelian splitF cXX (_ : sG).
pose r (W : sG) := irr_mode W x.
have scalX W: irr_repr W x = (r W)%:M.
by apply: irr_center_scalar; rewrite ?(center_idP _).
have inj_r: injective r.
move=> V W eqVW; rewrite -(irr_reprK_pchar F'X V) -(irr_reprK_pchar F'X W).
move: (irr_repr V) (irr_repr W) (scalX V) (scalX W).
rewrite !linX {}eqVW => rV rW <- rWx; apply: irr_comp_rsim_pchar => //.
exists 1%:M; rewrite ?row_free_unit ?unitmx1 // => xk; case/cycleP=> k ->{xk}.
by rewrite mulmx1 mul1mx !repr_mxX // rWx.
have rx1 W: r W ^+ #[x] = 1.
by rewrite -irr_modeX ?(center_idP _) // expg_order irr_mode1.
have /hasP[w _ prim_w]: has #[x].-primitive_root (map r (enum sG)).
rewrite has_prim_root 1?map_inj_uniq ?enum_uniq //; first 1 last.
by rewrite size_map -cardE card_sG.
by apply/allP=> _ /mapP[W _ ->]; rewrite unity_rootE rx1.
have iphi'P := prim_rootP prim_w (rx1 _); pose iphi' := sval (iphi'P _).
have def_r W: r W =
... | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | cycle_repr_structure_pchar | |
splitting_cyclic_primitive_root_pchar:
cyclic G -> [pchar F]^'.-group G -> group_splitting_field G ->
classically {z : F | #|G|.-primitive_root z}.
Proof.
case/cyclicP=> x defG F'G splitF; case=> // IH.
wlog sG: / irrType G by apply: socle_exists.
have [w prim_w _] := cycle_repr_structure_pchar sG defG F'G splitF.
by apply: IH; exists w.
Qed. | Lemma | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | splitting_cyclic_primitive_root_pchar | |
mx_Maschke:= (mx_Maschke_pchar) (only parsing).
#[deprecated(since="mathcomp 2.4.0",
note="Use rsim_regular_submod_pchar instead.")] | Notation | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | mx_Maschke | |
rsim_regular_submod:= (rsim_regular_submod_pchar) (only parsing).
#[deprecated(since="mathcomp 2.4.0", note="Use irr_mx_sum_pchar instead.")] | Notation | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | rsim_regular_submod | |
irr_mx_sum:= (irr_mx_sum_pchar) (only parsing).
#[deprecated(since="mathcomp 2.4.0", note="Use Wedderburn_sum_pchar instead.")] | Notation | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | irr_mx_sum | |
Wedderburn_sum:= (Wedderburn_sum_pchar) (only parsing).
#[deprecated(since="mathcomp 2.4.0",
note="Use Wedderburn_sum_id_pchar instead.")] | Notation | character | [
"From HB Require Import structures",
"From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq path",
"From mathcomp Require Import div choice fintype tuple finfun bigop prime",
"From mathcomp Require Import ssralg poly polydiv finset fingroup morphism",
"From mathcomp Require Import perm aut... | character/mxrepresentation.v | Wedderburn_sum |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.