Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Affine connected stabilizers with dense unit groups

Open
QAlgorithms.Papers.Independent.Intakethird100.P79.lemma_3_1_4

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let kkk be algebraically closed of characteristic zero, let MMM be an irreducible algebraic monoid with unit group GGG, and let e∈Me\in Me∈M be idempotent. Give Meℓ={x∈M:xe=e}M_e^\ell=\{x\in M:xe=e\}Meℓ​={x∈M:xe=e}, Mer={x∈M:ex=e}M_e^r=\{x\in M:ex=e\}Mer​={x∈M:ex=e} and Me=Meℓ∩MerM_e=M_e^\ell\cap M_e^rMe​=Meℓ​∩Mer​ their reduced closed-subscheme structures. For s∈{ℓ,r,two}s\in\{\ell,r,\mathrm{two}\}s∈{ℓ,r,two}, write SsS_sSs​ for the respective stabilizer and Gs=G∩SsG_s=G\cap S_sGs​=G∩Ss​ for its unit group. Then

∀s∈{ℓ,r,two},Ss is affine and connected,Gs‾ M=Ss.\forall s\in\{\ell,r,\mathrm{two}\},\qquad S_s\text{ is affine and connected},\qquad\overline{G_s}^{\,M}=S_s.∀s∈{ℓ,r,two},Ss​ is affine and connected,Gs​​M=Ss​.

The closure formula states density of each actual unit group in its own stabilizer. It does not assert irreducibility, and requires neither affineness nor normality of MMM.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P79
Formal statement
noncomputable section

open CategoryTheory CategoryTheory.Limits AlgebraicGeometry

open CategoryTheory.MonoidalCategory CategoryTheory.CartesianMonoidalCategory

open CategoryTheory.MonObj

open scoped CategoryTheory.MonObj Pointwise

universe u

namespace QAlgorithms.Papers.Independent.Intakethird100.P79

variable (k : Type u) [Field k]

variable {k}

attribute [local instance] MvPolynomial.gradedAlgebra

/-- Lemma 3.1.4, PDF p. 17: the three reduced stabilizers are affine and
connected, and their actual unit groups are dense. Closure is taken inside M,
and is compared with the canonical stabilizer inclusion, so density is not input. -/
theorem lemma_3_1_4 [IsAlgClosed k] [CharZero k]
    (M : KScheme k) [MonObj M] [IsVariety k M] [IrreducibleSpace M.left]
    (e : 𝟙_ (KScheme k) ⟶ M) (he : IsIdempotentPoint M e) :
    ∀ side : Fin 3,
      IsAffine (stabilizer M e side).left ∧
      ConnectedSpace (stabilizer M e side).left ∧
      closure (Set.range (groupStabilizerInclusion M e side).left) =
        Set.range (stabilizerInclusion M e side).left := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P79

end
Source
Local structure of algebraic monoids, arXiv:0709.1255v2, PDF p. 17, Lemma 3.1.4
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let kkk be an algebraically closed field of characteristic zero, and let MMM be a monoid scheme over kkk whose structure morphism is locally of finite type, quasi-compact, and separated, and whose underlying scheme is reduced and irreducible. Let e:Spec⁡k→Me:\operatorname{Spec}k\to Me:Speck→M satisfy e2=ee^2=ee2=e. For s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, define EsE_sEs​ scheme-theoretically by the equalizer equation xe=exe=exe=e when s=0s=0s=0, ex=eex=eex=e when s=1s=1s=1, and (xe,ex)=(e,e)(xe,ex)=(e,e)(xe,ex)=(e,e) when s=2s=2s=2; let ZsZ_sZs​ be its reduction, namely the closed subscheme defined by its nilradical, with its induced morphism js:Zs→Mj_s:Z_s\to Mjs​:Zs​→M. Let V⊆M×kMV\subseteq M\times_k MV⊆M×k​M be the equalizer imposing ab=ba=1Mab=ba=1_Mab=ba=1M​, and let HsH_sHs​ be the equalizer inside VVV imposing the same respective equations on the first coordinate aaa: ae=eae=eae=e, ea=eea=eea=e, or both. Let hs:Hs→Mh_s:H_s\to Mhs​:Hs​→M be its morphism given by the first coordinate. For every s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, the underlying scheme of ZsZ_sZs​ is affine, its underlying topological space is nonempty and connected, and

im⁡(∣hs∣)‾=im⁡(∣js∣),\overline{\operatorname{im}(|h_s|)} =\operatorname{im}(|j_s|),im(∣hs​∣)​=im(∣js​∣),

where both images and the closure are taken in the underlying topological space ∣M∣|M|∣M∣, over all scheme points rather than only rational points.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me