Peterfalvi (11.8): the Section 12 residual of a degree- member is not orthogonal to the -grid
ProvedOddOrder.Peterfalvi.S16.member_residual_not_orthogonal_eta_of_refuterfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple odd-order group, base : S15.Hypothesis a Peterfalvi §13 configuration with base.T, subgroups and -grid (, ), and let s12 : S12.Hypothesis base.T be the Section 12 hypothesis for with type- datum s12.typeP. Assume:
- the -data agree:
s12.typeP.W = base.W,s12.typeP.W2 = base.W1,s12.typeP.W1 = base.W2; typePV T s12.typePequals the set ;- is of type III or type IV;
- the second derived subgroup of equals (
s12.typeP.H ⊔ (s12.typeP.U ⊓ centralizer H)); - ;
- (
hrefute) for every §13 hypothesiss13hypon , there is no coherence datumS07.IsCoherent s13hyp.base.tau (s13hyp.SOf s13hyp.H0C) s13hyp.base.A0; - is an irreducible character of in the induced family
S12.inducedFamily Twith ; sourceis a class function on with , wheres12.tau.
Then it is not the case that all grid pairings of the residual vanish:
This transports the canonical refuter of S13.zeta_residual_not_orthogonal_H0C_of_refuter through the global / grid identification. The Dade-image identification of the source is the input himage.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapNonorthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapGridAlignment
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
variable {G : Type*} [Group G]
open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
theorem member_residual_not_orthogonal_eta_of_refuter [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
(base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
(s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
(hW : s12.typeP.W = base.W)
(hW1 : s12.typeP.W2 = base.W1)
(hW2 : s12.typeP.W1 = base.W2)
(hV : typePV base.T s12.typeP =
(base.W : Set G) \ ((base.W1 : Set G) ∪ (base.W2 : Set G)))
(htype : IsTypeIII base.T ∨ IsTypeIV base.T)
(hM2 : secondDerivedInAmbient base.T =
s12.typeP.H ⊔
(s12.typeP.U ⊓ Subgroup.centralizer (s12.typeP.H : Set G)))
(hHcard : Nat.card ↥s12.typeP.H = s12.w2 ^ s12.w1)
(hrefute : ∀ s13hyp : OddOrder.Peterfalvi.S13.Hypothesis base.T,
¬ Nonempty (OddOrder.Peterfalvi.S07.IsCoherent
s13hyp.base.tau (s13hyp.SOf s13hyp.H0C) s13hyp.base.A0))
(zeta : ClassFunction ↥base.T ℂ)
(hzetaS : zeta ∈ OddOrder.Peterfalvi.S12.inducedFamily base.T)
(hzetairr : IsIrreducibleCharacter zeta)
(hzeta1 : zeta 1 = (s12.w1 : ℂ))
(source : ClassFunction G ℂ)
(himage : s12.tau
((∑ i' : Fin s12.w1, s12.muGrid hG hG.odd i' 0) - zeta) = source) :
¬ ∀ (i : Fin base.q) (j : Fin base.p),
ClassFunction.inner
(source - ∑ j' : Fin base.p, base.eta ⟨0, base.q_prime.pos⟩ j')
(base.eta i j) = 0 := 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/TGapGridAlignment.lean#L1280-L1341