Subfield embedding from Borel and projective-point interchange data
ProvedGlauberman.Dickson.h826_subfield_embedding_of_borel_and_swapLet H be a subgroup of PSL₂(F), where F is a finite field, and P a Sylow subgroup. Suppose a faithful conjugated action places P in the standard upper-unipotent subgroup, its normalizer is generated by P and a specified cyclic complement, and H is generated by that normalizer and a specified element interchanging the two standard projective points. The statement explicitly supplies the standard unipotent and diagonal matrix formulas and projective action. Let W be the additive parameters of the conjugated P, and K a subfield preserving W by scalar multiplication, with |K|=|W| and containing the squared diagonal parameter. Assume W contains a specified nonzero vector and covers the affine part of the H-orbit of infinity. Then H admits an injective homomorphism into PGL₂(K). This is the subfield-embedding step of the original Huppert II.8.26 proof; no classification conclusion is assumed.
import Mathlib.GroupTheory.Complement import Mathlib.LinearAlgebra.Matrix.ProjectiveSpecialLinearGroup import Mathlib.LinearAlgebra.Projectivization.Action import Mathlib.LinearAlgebra.Matrix.GeneralLinearGroup.Projective import Mathlib.GroupTheory.Sylow import Mathlib.Tactic.FinCases import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.Group set_option autoImplicit false set_option backward.isDefEq.respectTransparency false universe u v open scoped LinearAlgebra.Projectivization MatrixGroups
theorem Glauberman.Dickson.h826_subfield_embedding_of_borel_and_swap {F : Type u} [Field F] [Finite F] {p : ℕ}
(H : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)) (P : Sylow p H)
(U : Subgroup (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F))
(conjH' : H →* Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)
(hconjH'_injective : Function.Injective conjH')
(unipotent : AddChar F (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F))
(splitTorus : Fˣ →* Matrix.ProjectiveSpecialLinearGroup (Fin 2) F)
(hP_map_conjH'_le_U : (P : Subgroup H).map conjH' ≤ U)
(hU_range : U = unipotent.toMonoidHom.range)
(hunipotent_matrix : ∀ x : F, unipotent x =
QuotientGroup.mk' (Subgroup.center (Matrix.SpecialLinearGroup (Fin 2) F))
⟨!![1,x;0,1], by simp [Matrix.det_fin_two]⟩)
(hsplitTorus_matrix : ∀ a : Fˣ, splitTorus a =
QuotientGroup.mk' (Subgroup.center (Matrix.SpecialLinearGroup (Fin 2) F))
⟨!![(a:F),0;0,(a⁻¹:F)], by simp [Matrix.det_fin_two]⟩) :
let NP := Subgroup.normalizer (P : Set H)
let PN := (P : Subgroup H).subgroupOf NP
∀ (C : Subgroup NP) (hcomp : PN.IsComplement' C)
(cgen : C) (hcgen : ∀ x : C, x ∈ Subgroup.zpowers cgen),
let cN : NP := cgen
∀ (r : Fˣ) (hcgen_split : conjH' (cN : H) = splitTorus r),
let P0 := (P : Subgroup H).map conjH'
let W : AddSubgroup F :=
{ carrier := {x | unipotent x ∈ P0}
zero_mem' := by change unipotent 0 ∈ P0; simp
add_mem' := by
intro x y hx hy
change unipotent (x+y) ∈ P0
rw [unipotent.map_add_eq_mul]
exact P0.mul_mem hx hy
neg_mem' := by
intro x hx
change unipotent (-x) ∈ P0
rw [unipotent.map_neg_eq_inv]
exact P0.inv_mem hx }
∀ (x0 : W) (hx0_ne_zero : x0 ≠ 0) (hx0_val_ne_zero : (x0:F) ≠ 0)
(K : Subfield F) (hK : ∀ a : K, ∀ x : F, x ∈ W → (a:F)*x ∈ W)
(hKcard : Nat.card K = Nat.card W) (hlambda_mem_K : (r:F)*(r:F) ∈ K),
let lambdaU := r*r
let lambdaK0 : K := ⟨(lambdaU:F), hlambda_mem_K⟩
∀ (hlambdaK0_ne_zero : lambdaK0 ≠ 0),
let Point := ℙ F (Fin 2 → F)
let inf : Point := Projectivization.mk F ![(1:F),0] (by simp)
let zero : Point := Projectivization.mk F ![(0:F),1] (by simp)
let affine (x : F) : Point := Projectivization.mk F ![x,1] (by simp)
∀ (rho : Matrix.ProjectiveSpecialLinearGroup (Fin 2) F →* Equiv.Perm Point)
(hrho_apply : ∀ (A : Matrix.SpecialLinearGroup (Fin 2) F) (z : Point),
rho (QuotientGroup.mk' (Subgroup.center (Matrix.SpecialLinearGroup (Fin 2) F)) A) z =
(Matrix.GeneralLinearGroup.toLin (Matrix.SpecialLinearGroup.toGL A)).toLinearEquiv • z),
letI : MulAction (Matrix.ProjectiveSpecialLinearGroup (Fin 2) F) Point := MulAction.compHom Point rho
∀ (hunipotent_affine : ∀ w x : F, unipotent w • affine x = affine (x+w)),
letI : MulAction H Point := MulAction.compHom Point (rho.comp conjH')
let S := MulAction.orbit H inf
∀ (haffine_injective : Function.Injective affine) (hswap : H)
(hswap_inf : hswap • inf = zero) (hswap_zero : hswap • zero = inf)
(hcover : ∀ z : S, (z:Point) ≠ inf → ∃ w : W, (z:Point) = affine (w:F))
(hgen : NP ⊔ Subgroup.zpowers hswap = ⊤),
∃ phi : H →* Matrix.ProjGenLinGroup (Fin 2) K, Function.Injective phi := by sorry