Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonsplit tori and their normalizers in PSL₂ over a finite field

Proved
Glauberman.Dickson.h84_nonsplit_torus_data

by arexychen · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

dickson-classificationfinite-fieldsgroup-theorypsl2

Let F be a finite field of cardinality p^f, where p is prime, and put d=gcd(|F|-1,2). There is a cyclic nonsplit torus S in PSL₂(F) of order (|F|+1)/d with normalizer of order 2|S|. Its normalizer is generated by S and an involution w outside S which acts on S by inversion. Every nontrivial subgroup of S has this same normalizer. Moreover, if a nonidentity element of S is conjugated back into S, the conjugating element belongs to the normalizer. Finally, the projective image of any determinant-one 2-by-2 matrix whose squared trace is not 4 and which has no eigenvector over F belongs to a conjugate of S.

This is the explicit nonsplit-torus package in the original CFSG formalization of Huppert II.8.4. The statement retains the normalizer, inversion, conjugacy, and nonsplit-element coverage properties used in Dickson's classification. Original mathematics and formalization remain attributed to the cited sources; arexychen provides declaration extraction and exact-environment validation.

Preamble
import Mathlib.Algebra.BigOperators.Ring.Nat
import Mathlib.Algebra.CharP.CharAndCard
import Mathlib.Algebra.Polynomial.SpecificDegree
import Mathlib.FieldTheory.Finite.Extension
import Mathlib.FieldTheory.Finite.GaloisField
import Mathlib.FieldTheory.Finite.Trace
import Mathlib.GroupTheory.GroupAction.ConjAct
import Mathlib.GroupTheory.SchurZassenhaus
import Mathlib.GroupTheory.SpecificGroups.Dihedral
import Mathlib.LinearAlgebra.Eigenspace.Basic
import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Card
import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.FinTwo
import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Projective
import Mathlib.LinearAlgebra.Matrix.ProjectiveSpecialLinearGroup
set_option autoImplicit false
universe u
Formal statement
theorem Glauberman.Dickson.h84_nonsplit_torus_data
    {F : Type u} [Field F] [Finite F] {p f : ℕ} [Fact p.Prime]
    (hFcard : Nat.card F = p ^ f) :
    ∃ S : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F),
      IsCyclic S ∧
      Nat.card S =
        (Nat.card F + 1) / Nat.gcd (Nat.card F - 1) 2 ∧
      Nat.card (Subgroup.normalizer (S : Set (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F))) =
        2 * Nat.card S ∧
      (∃ w : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F,
        w ∈ Subgroup.normalizer (S : Set (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)) ∧
        w ∉ S ∧
        w * w = 1 ∧
        (∀ t : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F, t ∈ S → w * t * w⁻¹ = t⁻¹) ∧
        Nat.card (S ⊔ Subgroup.zpowers w :
          Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)) = 2 * Nat.card S ∧
        ∀ R : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F), R ≤ S → R ≠ ⊥ →
          Subgroup.normalizer (R : Set (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)) =
            S ⊔ Subgroup.zpowers w) ∧
      (∀ y : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F, y ∈ S → y ≠ 1 →
        ∀ g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F,
          g * y * g⁻¹ ∈ S →
            g ∈ Subgroup.normalizer
              (S : Set (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F))) ∧
      ∀ A : Matrix.SpecialLinearGroup (Fin 2) F,
        Matrix.trace (A : Matrix (Fin 2) (Fin 2) F) ^ 2 ≠ (4 : F) →
        (¬ ∃ (μ : F) (v : Fin 2 → F), v ≠ 0 ∧
          (A : Matrix (Fin 2) (Fin 2) F).mulVec v = μ • v) →
        ∃ g : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F,
          (QuotientGroup.mk' (Subgroup.center
            (Matrix.SpecialLinearGroup (Fin 2) F))) A ∈
            S.map (MulAut.conj g).toMonoidHom := by sorry
Source
Qiuzhen-CFSG/CFSG, original source authors, Apache-2.0; immutable commit 96b2a02085dc678f3e0a97b334c31ada599c55fd; Glauberman/DicksonNonsplitTorus.lean, h84_nonsplit_torus_data (Huppert II.8.4): https://github.com/Qiuzhen-CFSG/CFSG/blob/96b2a02085dc678f3e0a97b334c31ada599c55fd/Glauberman/DicksonNonsplitTorus.lean . arexychen: extraction, target-environment replay and verification; no claim of original classification authorship.

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