Peterfalvi (1.5.a) at : irreducible lies in
ProvedOddOrder.Peterfalvi.S15.Hypothesis.induce_K_mem_zSpan_sSet_irr_Tfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group which is a minimal simple odd-order group, let hyp be a Peterfalvi §13 configuration for with subgroups (with viewed inside via Subgroup.subgroupOf), let pins : NuGridSupplyData hyp, and assume . Let be an irreducible character of such that , and assume additionally that the induced class function is itself an irreducible character of . Then
where is sSet (hyp.toTypesIIIIIIVSetupT hG hvd) and the span is S07.zSpan.
This refines the previous membership statement (membership in ) for irreducible induced characters: any reducible constituent would be a -row, which is orthogonal to because the latter is irreducible.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_NuRowPin import Definitions.Def_OddOrder_Peterfalvi_S15_CaseACoherence import Definitions.Def_OddOrder_Peterfalvi_S15_Tau1T
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
open OddOrder.Peterfalvi.S11 in
open scoped FiniteInduce in
theorem Hypothesis.induce_K_mem_zSpan_sSet_irr_T [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
(pins : NuGridSupplyData hyp)
(hvd : hyp.v * hyp.d ≠ 1)
(θ : ClassFunction ↥(hyp.K.subgroupOf hyp.T) ℂ)
(hθ : OddOrder.RepresentationTheory.IsIrreducibleCharacter θ)
(hθQ : ¬ (((hyp.Q.subgroupOf hyp.T).subgroupOf (hyp.K.subgroupOf hyp.T) :
Set ↥(hyp.K.subgroupOf hyp.T)) ⊆
OddOrder.Peterfalvi.S03.characterKernel θ))
(hind : OddOrder.RepresentationTheory.IsIrreducibleCharacter
(ClassFunction.induce (hyp.K.subgroupOf hyp.T) θ)) :
ClassFunction.induce (hyp.K.subgroupOf hyp.T) θ ∈
OddOrder.Peterfalvi.S07.zSpan
{ψ : ClassFunction ↥hyp.T ℂ | ψ ∈ sSet (hyp.toTypesIIIIIIVSetupT hG hvd) ∧
OddOrder.RepresentationTheory.IsIrreducibleCharacter ψ} := by sorry
end OddOrder.Peterfalvi.S15Source
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/S15_Tau1T.lean#L376-L583