Peterfalvi (4.1): family-wide cross-orthogonality
ProvedOddOrder.Peterfalvi.S16.pair_cross_orthogonalfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group which is minimal simple odd-order (hG), and let be non-conjugate maximal subgroups of (¬ IsConjugateSubgroup L M) with (7.8) coherence data dataL : TypeICoherent78Data L and dataM : TypeICoherent78Data M. Let with dataL.ind1H and with dataM.ind1H (nontrivial family indices). Then
where (dataL.h78 hG).nu, (dataL.h78 hG).hyp76.zeta i, and likewise for .
This is the family-wide form of " is orthogonal to ": each member pairs with its conjugate (equal degree, distinct by odd order), the two -differences are Dade images with disjoint supports, and orthonormality of virtual characters concludes.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_Hypothesis import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_RhoConstancy import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_PairCoherence import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_FrobeniusStructure import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_MinimalCounterexample import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_DadeContradiction import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_RhoMEvaluation import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_NormPackage import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_TypeICovering import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_BrauerPermutationUnconditional import Definitions.Def_OddOrder_Peterfalvi_S08_CoherenceCorePart1 import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusConjIndex import Definitions.Def_OddOrder_Peterfalvi_S09_CrossOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusHypothesis79 import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_CharacterProduct import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Peterfalvi.S09
open OddOrder.Peterfalvi.S09.Cert
open scoped OddOrder.Peterfalvi.S12.FiniteInduce
variable {G : Type*} [Group G]
section Pairing
variable [Finite G] {L M : Subgroup G}
variable (dataL : TypeICoherent78Data L) (dataM : TypeICoherent78Data M)
variable (hG : OddOrder.BG.IsMinimalSimpleOdd G)
theorem pair_cross_orthogonal
(hL : L ∈ maximalSubgroups G) (hM : M ∈ maximalSubgroups G)
(hnc : ¬ OddOrder.BG.Ch4.S14.IsConjugateSubgroup L M)
{i : Fin (dataL.n + 1)} (hi : i ≠ dataL.ind1H)
{j : Fin (dataM.n + 1)} (hj : j ≠ dataM.ind1H) :
ClassFunction.inner ((dataL.h78 hG).nu ((dataL.h78 hG).hyp76.zeta i))
((dataM.h78 hG).nu ((dataM.h78 hG).hyp76.zeta j)) = 0 := by sorry
end Pairing
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_PairingCoherence.lean#L997-L1050