Existence of a finite complete family of irreducible representations
ProvedFrobMednykh.exists_irrepFamily is a finite group; representations are finite-dimensional over (FDRep ℂ G), is the character and . An IrrepFamily G ι is a family of irreducible representations, pairwise non-isomorphic, such that every irreducible representation is isomorphic to some ; , . For every finite group there is a finite type and an IrrepFamily G ι.
import Definitions.Def_FrobMednykh_defs open CategoryTheory
namespace FrobMednykh
theorem exists_irrepFamily (G : Type) [Group G] [Fintype G] :
∃ (ι : Type) (_ : Fintype ι), Nonempty (IrrepFamily G ι) := by sorry
end FrobMednykhRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. Let be a group with finitely many elements. There exist a type , a proof that has finitely many elements, and an IrrepFamily structure on indexed by . That is, there is a finite index set and a family of simple finite-dimensional complex representations of , pairwise non-isomorphic, such that every simple finite-dimensional complex representation of is isomorphic to one of them.
Assessment:
- (a) True. For a finite group the isomorphism classes of irreducible complex representations form a finite set (Maschke / Wedderburn), and one can choose representatives. Not trivial or vacuous.
- (b) The trivial group has exactly one simple representation, . Finiteness of is genuinely asserted, as part of the conclusion.
Nonemptyasserts existence of the data only. - (c) Nothing objectionable. The universe restriction is harmless.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.