Peterfalvi (13.19.c): equality-case rigidity of the coherent -projection
ProvedOddOrder.Peterfalvi.S16.TypeICoherent78Data.etaGrid_projection_rigidityfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple odd-order group, a subgroup, data : TypeICoherent78Data L, and hyp a Peterfalvi §13 configuration with primes and grid . Put , where is the residual of the (7.8.a) decomposition data.betaDecomp hG. Let (, ) satisfy:
- for all ;
- principal value ;
- the (3.7) four-corner relation for all ;
- is odd for , and is odd for ;
- the complement index of the (7.8) data satisfies .
Then
where the last sum is etaGridProjection hyp m.
This packages the tight chain "lower bound Bessel bound " and is the rigidity step of (13.19.c). The orthogonality needed for the coefficient hypothesis is kept outside the theorem.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Peterfalvi.S09
open OddOrder.Peterfalvi.S09.Cert
open scoped BigOperators
variable {G : Type*} [Group G]
namespace TypeICoherent78Data
open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
theorem etaGrid_projection_rigidity [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) {L : Subgroup G}
(data : TypeICoherent78Data L)
(hyp : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
(m : Fin hyp.q → Fin hyp.p → ℤ)
(hcoeff : ∀ i j,
ClassFunction.inner
(OddOrder.Peterfalvi.S09.Hypothesis71.constOne G + (data.betaDecomp hG).Gamma)
(hyp.eta i j) = (m i j : ℂ))
(hprincipal : m ⟨0, hyp.q_prime.pos⟩ ⟨0, hyp.p_prime.pos⟩ = 1)
(hrelation : ∀ i j,
m i j + m ⟨0, hyp.q_prime.pos⟩ ⟨0, hyp.p_prime.pos⟩ =
m i ⟨0, hyp.p_prime.pos⟩ + m ⟨0, hyp.q_prime.pos⟩ j)
(hrow : ∀ j, j ≠ ⟨0, hyp.p_prime.pos⟩ ->
Odd (m ⟨0, hyp.q_prime.pos⟩ j))
(hcol : ∀ i, i ≠ ⟨0, hyp.q_prime.pos⟩ ->
Odd (m i ⟨0, hyp.p_prime.pos⟩))
(he : (data.h78 hG).complementIndex ≤ hyp.p * hyp.q) :
(data.h78 hG).complementIndex = hyp.p * hyp.q ∧
(∀ i j, m i j = 1 ∨ m i j = -1) ∧
OddOrder.Peterfalvi.S09.Hypothesis71.constOne G + (data.betaDecomp hG).Gamma =
etaGridProjection hyp m := by sorry
end TypeICoherent78Data
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/CoherentProjectionRigidity.lean#L169-L287