BG Lemma C.3, Step 3: a subgroup of properly containing is everything
ProvedOddOrder.BG.AppC.NormSet.normOneFrobeniusSubgroup_eq_top_of_inr_range_le_of_ne_inr_rangefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a prime and a prime number, and assume . Let be the group normOneFrobeniusGroup p q (the additive group of extended by the norm-one units ), and let be a subgroup containing the complement (the image of SemidirectProduct.inr) with . Then
This is the subgroup dichotomy of Step 3 of Lemma C.3 in Bender--Glauberman Appendix C: any subgroup containing is either or all of .
Preamble
import Definitions.Def_OddOrder_BG_AppC_NormSetBasic import Mathlib.FieldTheory.Finite.GaloisField import Mathlib.FieldTheory.Finite.Trace import Mathlib.GroupTheory.SemidirectProduct import Mathlib.GroupTheory.SpecificGroups.Cyclic import Mathlib.Algebra.Ring.AddAut import Mathlib.Algebra.Polynomial.Roots import Mathlib.Algebra.Polynomial.SpecificDegree import Mathlib.Algebra.Ring.GeomSum import Mathlib.Data.ZMod.Basic import Mathlib.Algebra.Module.ZMod
Formal statement
namespace OddOrder.BG.AppC.NormSet
open scoped Pointwise
open Polynomial Finset
variable (p q : ℕ)
theorem normOneFrobeniusSubgroup_eq_top_of_inr_range_le_of_ne_inr_range
[Fact p.Prime] (hq : q.Prime)
(hA : Nat.Coprime ((p ^ q - 1) / (p - 1)) (p - 1))
(X : Subgroup (normOneFrobeniusGroup p q))
(hUle : (SemidirectProduct.inr : normOneUnits p q →* normOneFrobeniusGroup p q).range ≤ X)
(hne : X ≠
(SemidirectProduct.inr : normOneUnits p q →* normOneFrobeniusGroup p q).range) :
X = ⊤ := by sorry
end OddOrder.BG.AppC.NormSetSource
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_NormSetBasic.lean#L944-L989