Peterfalvi (2.7), -side: preserves the multiplicity of the trivial character on -supported functions
ProvedOddOrder.Peterfalvi.S16.tSideDadeMap_inner_trivialfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple odd-order group, hyp a Peterfalvi §14 configuration, hyp.base.T (with Fintype G, Fintype ↥T and invertible in ). Let be a complex class function on whose support lies in supportInSubgroup (sigmaSharp T) T. Then, with tSideDadeMap hyp hG,
That is, a class function supported on has the same trivial-character multiplicity before and after applying .
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TSideTypeP import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisBasics import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisSwap import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_DegreesFirstSplit import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_PairStructure import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_CountingLayer import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization import Definitions.Def_OddOrder_Peterfalvi_S13_ElementaryAbelianKernel import Definitions.Def_OddOrder_BG_Ch2_Uniqueness_S07_Theorem74 import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_TSideDegrees import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_Hypothesis import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_CharacterParameters import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_DadeCalculations import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_PrimeTIResidue import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
open scoped Classical in
theorem tSideDadeMap_inner_trivial [Finite G]
(hyp : Hypothesis (G := G)) [Fintype G] [Fintype ↥hyp.base.T]
[Invertible (Nat.card G : ℂ)]
[Invertible (Nat.card ↥hyp.base.T : ℂ)]
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
{φ : ClassFunction ↥hyp.base.T ℂ}
(hφ : φ.support ⊆
OddOrder.Peterfalvi.S04.supportInSubgroup
(OddOrder.BG.Ch4.S14.sigmaSharp hyp.base.T) hyp.base.T) :
ClassFunction.inner (tSideDadeMap hyp hG φ) (trivialClassFunction G) =
ClassFunction.inner φ (trivialClassFunction ↥hyp.base.T) := by sorry
end OddOrder.Peterfalvi.S16Source
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/S16_NonExistenceG/TGapPrimeTI.lean#L346-L391