Peterfalvi (12.17) and the (8.8) case (b) dichotomy: type I covering
DefinitionOddOrder_Peterfalvi_S14_MaximalI_TypeICoveringfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Formalizes the all-type-I non-existence argument: the type I maximals assemble into a (7.10) Frobenius family, which (7.11) rules out, as used in Peterfalvi (12.17) and the (8.8) case (b) dichotomy.
Main declarations: TypeICovering (§8/§10 covering inputs to Peterfalvi (12.17)).
Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
-- OddOrder/Peterfalvi/S14_MaximalI/TypeICovering.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Definitions.Def_OddOrder_Peterfalvi_S14_MaximalI_NormPackage
namespace OddOrder.Peterfalvi.S14
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
section Theorem1217
variable [Finite G]
/-- **§8/§10 covering inputs to Peterfalvi (12.17)** — the all-type-I case of Theorem (8.8).
When every maximal subgroup of `G` is of type I, the §8 covering theory (BG Theorem E, (8.17), and
the escaping-centralizer control (8.13.c1)) supplies a finite family of conjugacy-class
representatives `reps i` whose maximal nilpotent normal Hall subgroups `(reps i)_F`:
* number at least two (`two_le`);
* have TI sharp-sets `((reps i)_F)#` (`isTI`, via (8.13.c1)+(2.3));
* are pairwise of coprime order (`coprime`, via the (8.17) prime partition);
* cover `G#` up to conjugacy (`covers`, the (8.17.a) type-I covering).
These are exactly the inputs the (12.17) argument feeds to (7.11), beyond the genuinely
group-theoretic family facts (Frobenius structure, `reps i = N_G((reps i)_F)`) discharged in
`not_all_maximal_typeI`. -/
structure TypeICovering (hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hall : ∀ M : Subgroup G, M ∈ maximalSubgroups G → IsTypeI M) where
/-- Number of conjugacy classes of maximal subgroups. -/
k : ℕ
/-- Conjugacy-class representatives of the maximal subgroups. -/
reps : Fin k → Subgroup G
/-- Each representative is maximal. -/
reps_maximal : ∀ i, reps i ∈ maximalSubgroups G
/-- (7.10): at least two members. -/
two_le : 2 ≤ k
/-- (8.13.c1)+(2.3): each kernel sharp-set is a TI-subset. -/
isTI : ∀ i, IsTISubset ((maxNilpotentNormalHall (reps i) : Set G) \ {1}) (reps i)
/-- (8.17): the kernels have pairwise-coprime order. -/
coprime : ∀ ⦃i j⦄, i ≠ j →
Nat.Coprime (Nat.card ↥(maxNilpotentNormalHall (reps i)))
(Nat.card ↥(maxNilpotentNormalHall (reps j)))
/-- (8.17.a): the conjugates of the kernels cover every nonidentity element. -/
covers : ∀ x : G, x ≠ 1 →
∃ i, ∃ g : G, g * x * g⁻¹ ∈ (maxNilpotentNormalHall (reps i) : Set G) \ {1}
end Theorem1217
end OddOrder.Peterfalvi.S14
Source
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/S14_MaximalI/TypeICovering.lean