Peterfalvi (14.16): an odd with exceeds
ProvedOddOrder.Peterfalvi.S16.Hypothesis.quotient_gt_two_mul_pq_of_modEq_one_mod_p_and_qfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let hyp be a Peterfalvi §14 configuration (OddOrder.Peterfalvi.S16.Hypothesis), with primes = hyp.base.p and = hyp.base.q. Let be a natural number with , , odd and . Then
By the Chinese remainder theorem ; since is odd and the smallest candidate is beyond . This is the parity estimate for the quotient in (14.16).
Preamble
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_Setup import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs import Definitions.Def_OddOrder_Peterfalvi_S15_SSideGaloisFieldModel 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_GridExpansion import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTGrid import Definitions.Def_OddOrder_Peterfalvi_S16_CoreLemmas
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 quotient_gt_two_mul_pq_of_modEq_one_mod_p_and_q
(hyp : Hypothesis (G := G)) {x : ℕ}
(hx_mod_p : x ≡ 1 [MOD hyp.base.p])
(hx_mod_q : x ≡ 1 [MOD hyp.base.q])
(hx_odd : Odd x) (hx_ne_one : x ≠ 1) :
2 * (hyp.base.p * hyp.base.q) < x := 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_CoreLemmas.lean#L191-L233