Peterfalvi (7.9): parity of for real virtual characters of odd-order groups
ProvedOddOrder.RepresentationTheory.cfdot_real_vchar_evenfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group of odd order, and let (ZIrr G) be real virtual characters (ClassFunction.IsReal). Then there exist integers with
So .
This is the parity primitive used in Peterfalvi (7.9): by the Fourier expansion in , the terms are paired by , whose only fixed point is when is odd.
Formalization Note. The statement is bundled: the integers are returned together with equations to the complex inner products. carries Fintype and Invertible (Nat.card G : ℂ) instances.
Preamble
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_BrauerPermutationUnconditional import Definitions.Def_OddOrder_Peterfalvi_S08_CoherenceCorePart1
Formal statement
namespace OddOrder.RepresentationTheory
variable {G : Type*} [Group G] [Finite G]
section Main
variable [Fintype G] [Invertible (Nat.card G : ℂ)]
open scoped Classical in
theorem cfdot_real_vchar_even (hodd : Odd (Nat.card G))
{φ ψ : ClassFunction G ℂ} (hφZ : φ ∈ ZIrr G) (hφR : ClassFunction.IsReal φ)
(hψZ : ψ ∈ ZIrr G) (hψR : ClassFunction.IsReal ψ) :
∃ m a b : ℤ, (m : ℂ) = ClassFunction.inner φ ψ ∧
(a : ℂ) = ClassFunction.inner φ (trivialIrreducibleCharacter G : ClassFunction G ℂ) ∧
(b : ℂ) = ClassFunction.inner ψ (trivialIrreducibleCharacter G : ClassFunction G ℂ) ∧
Even (m - a * b) := by sorry
end Main
end OddOrder.RepresentationTheorySource
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/Peterfalvi/S09_ParityPrimitive.lean#L137-L189