Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BG Lemma C.3, Step 3: a subgroup between UUU and PUPUPU is UUU or PUPUPU

Proved
OddOrder.BG.AppC.FieldNormalizerData.subgroup_eq_P_sup_U_of_U_le_of_le_P_sup_U_of_ne_U

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let data : FieldNormalizerData p q G be the field-normalizer data of Bender--Glauberman Appendix C, with subgroups P=σ(P)P=\sigma(P)P=σ(P) and U=σ(U)U=\sigma(U)U=σ(U) of GGG. Let X≤GX\le GX≤G be a subgroup with U≤X≤P⊔UU\le X\le P\sqcup UU≤X≤P⊔U (the join PUPUPU) and X≠UX\ne UX=U. Then

X=P⊔U.X=P\sqcup U.X=P⊔U.

Equivalently, any subgroup of PUPUPU containing UUU is either UUU or all of PUPUPU. This transports the irreducibility of the concrete Frobenius group P⋊UP\rtimes UP⋊U through σ\sigmaσ, and is the irreducibility bridge used in Step 3 of Lemma C.3.

Preamble
import Definitions.Def_OddOrder_BG_AppC_FrobeniusBasics
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_Setup
Formal statement
namespace OddOrder.BG.AppC

open scoped Pointwise

variable {p q : ℕ} [Fact p.Prime] {G : Type*} [Group G]

namespace FieldNormalizerData

theorem subgroup_eq_P_sup_U_of_U_le_of_le_P_sup_U_of_ne_U
    (data : FieldNormalizerData p q G) {X : Subgroup G}
    (hUle : data.U ≤ X) (hXle : X ≤ data.P ⊔ data.U)
    (hne : X ≠ data.U) :
    X = data.P ⊔ data.U := by sorry

end FieldNormalizerData

end OddOrder.BG.AppC
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/BG/AppC_LemmaC3_Setup.lean#L405-L448

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me