Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Minimal idempotents: global product descriptions

Open
QAlgorithms.Papers.Independent.Intakethird100.P79.lemma_2_3_1

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 affine algebraic monoid, let GGG be its unit group, and let eee be an idempotent which is the unique idempotent of eMeeMeeMe. Write Meℓ={x:xe=e}M_e^\ell=\{x:xe=e\}Meℓ​={x:xe=e}, Mer={x:ex=e}M_e^r=\{x:ex=e\}Mer​={x:ex=e}, Me=Meℓ∩MerM_e=M_e^\ell\cap M_e^rMe​=Meℓ​∩Mer​, and Geℓ,Ger,GeG_e^\ell,G_e^r,G_eGeℓ​,Ger​,Ge​ for their intersections with GGG. The left and right group centralizers are CGℓ(e)={g:ge=ege}C_G^\ell(e)=\{g:ge=ege\}CGℓ​(e)={g:ge=ege} and CGr(e)={g:eg=ege}C_G^r(e)=\{g:eg=ege\}CGr​(e)={g:eg=ege}. Products below are products of subsets of MMM, MeMeMe and eMeMeM are the principal ideals, and ker⁡(M)\ker(M)ker(M) is the least nonempty two-sided ideal. Then

Me=CGr(e)e,M=CGr(e)Meℓ,eM=eCGℓ(e),M=MerCGℓ(e),Mere=Gere,Mer=GerMe,eMeℓ=eGeℓ,Meℓ=MeGeℓ,M=CGr(e)MeGeℓ=CGℓ(e)MeGer,ker⁡(M)=CGr(e)eGeℓ=CGℓ(e)eGer,M0r=M0ℓ=M0=M.\begin{gathered} Me=C_G^r(e)e,\quad M=C_G^r(e)M_e^\ell,\quad eM=eC_G^\ell(e),\quad M=M_e^rC_G^\ell(e),\\ M_e^re=G_e^re,\quad M_e^r=G_e^rM_e,\quad eM_e^\ell=eG_e^\ell,\quad M_e^\ell=M_eG_e^\ell,\\ M=C_G^r(e)M_eG_e^\ell=C_G^\ell(e)M_eG_e^r,\\ \ker(M)=C_G^r(e)eG_e^\ell=C_G^\ell(e)eG_e^r,\\ M_0^r=M_0^\ell=M_0=M. \end{gathered}Me=CGr​(e)e,M=CGr​(e)Meℓ​,eM=eCGℓ​(e),M=Mer​CGℓ​(e),Mer​e=Ger​e,Mer​=Ger​Me​,eMeℓ​=eGeℓ​,Meℓ​=Me​Geℓ​,M=CGr​(e)Me​Geℓ​=CGℓ​(e)Me​Ger​,ker(M)=CGr​(e)eGeℓ​=CGℓ​(e)eGer​,M0r​=M0ℓ​=M0​=M.​

Here M0r={x:xe∈CGr(e)e}M_0^r=\{x:xe\in C_G^r(e)e\}M0r​={x:xe∈CGr​(e)e}, M0ℓ={x:ex∈eCGℓ(e)}M_0^\ell=\{x:ex\in eC_G^\ell(e)\}M0ℓ​={x:ex∈eCGℓ​(e)} and M0=M0r∩M0ℓM_0=M_0^r\cap M_0^\ellM0​=M0r​∩M0ℓ​. The local product loci therefore cover the whole monoid at a minimal idempotent.

Formalization Note Equalities are stated on closed-point loci, which determine reduced subvarieties over kkk. No quotient or geometric isomorphism is replaced by a point-set bijection.

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 2.3.1, PDF p. 14, all four parts and both left/right counterparts.
These are equalities of the closed-point loci of the indicated reduced
subvarieties; no quotient is replaced by a point bijection. The affine standing
hypothesis of Sections 1-2 is retained. -/
theorem lemma_2_3_1 [IsAlgClosed k] [CharZero k]
    (M : KScheme k) [MonObj M] [IsVariety k M] [IrreducibleSpace M.left]
    [IsAffine M.left] (e : MonoidSchemePoint M) (he : IsIdempotentPoint M e)
    (hmin : IsMinimalIdempotent M e) :
    (rightIdealPoints M e = groupCentralizerPoints M e 1 * {e} ∧
      Set.univ = groupCentralizerPoints M e 1 * stabilizerPoints M e 0 ∧
      leftIdealPoints M e = {e} * groupCentralizerPoints M e 0 ∧
      Set.univ = stabilizerPoints M e 1 * groupCentralizerPoints M e 0) ∧
    (stabilizerPoints M e 1 * {e} = groupStabilizerPoints M e 1 * {e} ∧
      stabilizerPoints M e 1 = groupStabilizerPoints M e 1 * stabilizerPoints M e 2 ∧
      {e} * stabilizerPoints M e 0 = {e} * groupStabilizerPoints M e 0 ∧
      stabilizerPoints M e 0 = stabilizerPoints M e 2 * groupStabilizerPoints M e 0) ∧
    (Set.univ = groupCentralizerPoints M e 1 * stabilizerPoints M e 2 *
        groupStabilizerPoints M e 0 ∧
      Set.univ = groupCentralizerPoints M e 0 * stabilizerPoints M e 2 *
        groupStabilizerPoints M e 1 ∧
      kernelPoints M = groupCentralizerPoints M e 1 * {e} * groupStabilizerPoints M e 0 ∧
      kernelPoints M = groupCentralizerPoints M e 0 * {e} * groupStabilizerPoints M e 1) ∧
    (localOpenPoints M e 0 = Set.univ ∧
      localOpenPoints M e 1 = Set.univ ∧
      localOpenPoints M e 2 = Set.univ) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P79

end
Source
Local structure of algebraic monoids, arXiv:0709.1255v2, PDF p. 14, Lemma 2.3.1
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, irreducible, and affine. Write P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M) for its monoid of rational points and U⊆PU\subseteq PU⊆P for the points having two-sided multiplicative inverses. Let e∈Pe\in Pe∈P satisfy e2=ee^2=ee2=e, and suppose that every x∈Px\in Px∈P with (ex)e=x(ex)e=x(ex)e=x and x2=xx^2=xx2=x equals eee. Define S0={x∈P:xe=e}S_0=\{x\in P:xe=e\}S0​={x∈P:xe=e}, S1={x∈P:ex=e}S_1=\{x\in P:ex=e\}S1​={x∈P:ex=e}, S2=S0∩S1S_2=S_0\cap S_1S2​=S0​∩S1​, Gi=U∩SiG_i=U\cap S_iGi​=U∩Si​ for i=0,1,2i=0,1,2i=0,1,2, C0={u∈U:ue=(eu)e}C_0=\{u\in U:ue=(eu)e\}C0​={u∈U:ue=(eu)e}, and C1={u∈U:eu=(eu)e}C_1=\{u\in U:eu=(eu)e\}C1​={u∈U:eu=(eu)e}. Let KKK consist of those x∈Px\in Px∈P belonging to every nonempty subset I⊆PI\subseteq PI⊆P such that (ba)c∈I(ba)c\in I(ba)c∈I for all a∈Ia\in Ia∈I and b,c∈Pb,c\in Pb,c∈P. Define O0={x∈P:xe∈C1{e}}O_0=\{x\in P:xe\in C_1\{e\}\}O0​={x∈P:xe∈C1​{e}}, O1={x∈P:ex∈{e}C0}O_1=\{x\in P:ex\in\{e\}C_0\}O1​={x∈P:ex∈{e}C0​}, and O2=O0∩O1O_2=O_0\cap O_1O2​=O0​∩O1​, where products of subsets mean AB={ab:a∈A, b∈B}AB=\{ab:a\in A,\ b\in B\}AB={ab:a∈A, b∈B}. Then all of the following equalities hold simultaneously:

{xe:x∈P}=C1{e},P=C1S0,{ex:x∈P}={e}C0,P=S1C0,S1{e}=G1{e},S1=G1S2,{e}S0={e}G0,S0=S2G0,P=(C1S2)G0,P=(C0S2)G1,K=(C1{e})G0,K=(C0{e})G1,O0=P,O1=P,O2=P.\begin{aligned} \{xe:x\in P\}&=C_1\{e\},& P&=C_1S_0,& \{ex:x\in P\}&=\{e\}C_0,& P&=S_1C_0,\\ S_1\{e\}&=G_1\{e\},& S_1&=G_1S_2,& \{e\}S_0&=\{e\}G_0,& S_0&=S_2G_0,\\ P&=(C_1S_2)G_0,& P&=(C_0S_2)G_1,& K&=(C_1\{e\})G_0,& K&=(C_0\{e\})G_1,\\ O_0&=P,& O_1&=P,& O_2&=P. \end{aligned}{xe:x∈P}S1​{e}PO0​​=C1​{e},=G1​{e},=(C1​S2​)G0​,=P,​PS1​PO1​​=C1​S0​,=G1​S2​,=(C0​S2​)G1​,=P,​{ex:x∈P}{e}S0​KO2​​={e}C0​,={e}G0​,=(C1​{e})G0​,=P.​PS0​K​=S1​C0​,=S2​G0​,=(C0​{e})G1​,​
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