Peterfalvi (14.14.b)/(14.15): arithmetic core forces and in case (b)
ProvedOddOrder.Peterfalvi.S16.Hypothesis.caseB_forces_q_three_and_p_fivefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let hyp be a Peterfalvi §14 configuration with parameters hyp.base.p, hyp.base.q, hyp.base.v (and no hypothesis on beyond the group). Assume
- (natural-number division);
- in (with and computed in , then cast).
Then
The hypothesis on is the -pairing bound of (14.14.b); combined with the cyclotomic value of it pins down the exceptional primes in the proof via the exponential comparison (14.8.a), which uses the primality and ordering of carried by the configuration hyp.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_BetaVanishing import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines 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_CharacterDegreeSupply
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]
namespace Hypothesis
theorem caseB_forces_q_three_and_p_five (hyp : Hypothesis (G := G))
(hv : hyp.base.v = (hyp.base.q ^ hyp.base.p - 1) / (hyp.base.q - 1))
(hbound : ((hyp.base.v - 1 : ℕ) : ℚ) / ((hyp.base.p * hyp.base.q : ℕ) : ℚ) ≤
((hyp.base.p * hyp.base.q - 1 : ℕ) : ℚ)) :
hyp.base.q = 3 ∧ hyp.base.p = 5 := by sorry
end Hypothesis
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/ComparingLM.lean#L262-L349