Character Degree Divisibility
Abstract
Finite representation theory relates simple modules, characters, conjugation and induction.
Theorem 1.1 (Trace eq finrank iff).
Proof. Machine-checked in Lean as D5/S3/FiniteGroups/CharacterDegreeDivisibility.trace_eq_finrank_iff (✓ std3). ∎
Citation. The Tau Ceti contributors; Claude (2026). TauCeti finite representation and character theory. URL: https://github.com/TauCetiProject/TauCeti/tree/a780c7ad6beb23f60a17351a492d177878020ad5.
Commentary.
The displayed conclusion holds under the stated hypotheses.
Theorem 1.2 (Finrank dvd card).
Proof. Machine-checked in Lean as D5/S3/FiniteGroups/CharacterDegreeDivisibility.finrank_dvd_card (✓ std3). ∎
Citation. The Tau Ceti contributors; Claude (2026). TauCeti finite representation and character theory. URL: https://github.com/TauCetiProject/TauCeti/tree/a780c7ad6beb23f60a17351a492d177878020ad5.
Commentary.
The displayed conclusion holds under the stated hypotheses.