BG Appendix C, Lemma C.1: if the norm set is inversion-closed with elements, then
ProvedOddOrder.BG.AppC.NormSet.lemmaC1feit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a prime and a prime number, and let be the norm set, where . Suppose (as subsets of , with the set of inverses) and has at least two elements. Then
For the map sends to , and the telescoping product gives for all . The degree- polynomial then has all elements of as roots, so . This is Lemma C.1 of Bender--Glauberman Appendix C.
Formalization Note The norm set is NormSet.normSetE p q, its cardinality is taken with Set.ncard, and is the pointwise inverse (⁻¹ on sets).
Preamble
import Definitions.Def_OddOrder_BG_AppC_NormSetBasic import Definitions.Def_OddOrder_BG_AppC_NormSet 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 lemmaC1 [Fact p.Prime] (hq : q.Prime)
(hEinv : normSetE p q = (normSetE p q)⁻¹)
(hcard : 2 ≤ (normSetE p q).ncard) :
p ≤ q := 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_NormSet.lean#L531-L608