BG Lemma C.3, Step 3: a subgroup between and is or
ProvedOddOrder.BG.AppC.FieldNormalizerData.subgroup_eq_P_sup_U_of_U_le_of_le_P_sup_U_of_ne_Ufeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let data : FieldNormalizerData p q G be the field-normalizer data of Bender--Glauberman Appendix C, with subgroups and of . Let be a subgroup with (the join ) and . Then
Equivalently, any subgroup of containing is either or all of . This transports the irreducibility of the concrete Frobenius group through , 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.AppCSource
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