BG Lemma C.2 (): the norm set contains an element
ProvedOddOrder.BG.AppC.NormSet.exists_mem_normSetE_threefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be an odd prime. Then there is an element with and
where is the norm to .
This is the lifting step of Lemma C.2 of Bender--Glauberman Appendix C in the case : a root-free polynomial yields an element of different from (its Frobenius conjugates give ).
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 exists_mem_normSetE_three [Fact p.Prime] (hpodd : Odd p) :
∃ a : GaloisField p 3, a ∈ normSetE p 3 ∧ a ≠ 1 := 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#L795-L901