Peterfalvi (14.11.4): the norm cascade yields a contradiction from the case-(b) outputs and size bounds
ProvedOddOrder.Peterfalvi.S16.norm_cascade_contradiction_of_caseB_outputs_main_size_boundsfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let hyp be a Peterfalvi §14 configuration with parameters , and Mdata : MHypothesis hyp with kernel order Mdata.k and complement index Mdata.e. Assume
- (
hT) there isdata : CaseBForTData hypwithdata.caseB_formulaand ; - (
hS) there isdata : CaseBForSData hypwithdata.caseB_formula; - (
hsize) the three size bounds: ; ; (the last two in , with the subtractions done in ); - (
hbound)normCascadeBound hyp k.
Then
This consumes exactly the output shapes of caseB_for_T, caseB_for_S and main_size_bounds in the norm-cascade contradiction of (14.11.4).
Formalization Note. normCascadeBound is a project definition encoding the norm-cascade inequality; the type has only a Group instance here.
Preamble
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_CoherentEtaOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupMCore
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
open scoped BigOperators
variable {G : Type*} [Group G]
theorem norm_cascade_contradiction_of_caseB_outputs_main_size_bounds
{hyp : Hypothesis (G := G)}
(hT : ∃ data : CaseBForTData hyp,
data.caseB_formula ∧ hyp.base.v = (hyp.base.q ^ hyp.base.p - 1) / (hyp.base.q - 1))
(hS : ∃ data : CaseBForSData hyp, data.caseB_formula) (Mdata : MHypothesis hyp)
(hsize : Mdata.k > 2 * hyp.base.p * hyp.base.v ∧
(((Mdata.k - 1 : ℕ) : ℚ) / (Mdata.e : ℚ) >
((hyp.base.v - 1 : ℕ) : ℚ) / (hyp.base.p : ℚ)) ∧
(((hyp.base.v - 1 : ℕ) : ℚ) / (hyp.base.p : ℚ) >
((hyp.base.u - 1 : ℕ) : ℚ) / (hyp.base.q : ℚ)))
(hbound : normCascadeBound hyp Mdata.k) :
False := 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/SubgroupMCore.lean#L480-L497