Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Definitions for Local structure of algebraic monoids

Definition
QAlgorithms_Papers_Independent_Intakethird100_P79

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

prove2quantum

The objects the formalized statements of Local structure of algebraic monoids (arXiv:0709.1255) are stated in. Each was checked against the paper by a blind read-back and a moderator.

  • KScheme: Schemes over the ground field; all arrows in this category are k-morphisms.
  • IsVariety: The paper's convention for a variety, PDF p. 3; irreducibility is separate.
  • constantMap: The constant morphism with value the k-rational point e.
  • rightMultiplication: Right multiplication r_e(x)=xe, (1.1.2), PDF p. 4.
  • leftMultiplication: Left multiplication ell_e(x)=ex, (1.1.1), PDF p. 4.
  • reducedOver: Reduction of a k-scheme using its actual nilradical ideal sheaf.
  • reductionInclusion: The canonical reduction inclusion.
  • stabilizerEquations: Scheme-theoretic equations xe=e, ex=e, or (xe,ex)=(e,e). The three cases encode the left, right, and two-sided stabilizers, respectively.
  • stabilizerEquationsInclusion: Canonical inclusion of the scheme-theoretic stabilizer into M.
  • stabilizer: The reduced stabilizer varieties of (1.1.4), (1.1.6), (1.1.8), PDF pp. 4-5. Side 0 means M_e^ell, side 1 means M_e^r, and side 2 means M_e.
  • stabilizerInclusion: The canonical closed inclusion of the reduced stabilizer in M.
  • unitPairs: The scheme of inverse pairs (x,y), defined by xy=yx=1 on all test schemes. Projection to x represents the unit functor, rather than an arbitrary abstract group.
  • unitsInclusion: The canonical map from inverse pairs to their invertible first coordinate.
  • groupStabilizer: The group stabilizer G intersected with M_e^ell, M_e^r or M_e, computed inside the inverse-pair scheme by the same stabilizer equations.
  • groupStabilizerInclusion: Canonical map from a group stabilizer to M.
  • IsIdempotentPoint: On test schemes, a point of M is idempotent for the actual regular product.
  • affineSpace: A^n over k, including A^0=Spec k up to the standard polynomial isomorphism.
  • IsSmoothPoint: Smoothness at a k-rational point, expressed on a Zariski open neighbourhood.
  • projectiveSpace: Projective n-space as Proj of the ordinary total-degree graded polynomial ring.
  • degreeZeroConstants: Constants land in the actual degree-zero ring of homogeneous polynomials.
  • projectiveSpaceBase: The structure morphism P^n_k to Spec k.
  • IsQuasiProjective: Quasi-projectivity means a locally closed scheme immersion into some P^n_k, compatible with the fixed k-structure; it is not assumed in IsVariety.
  • MonoidSchemePoint: Closed points of a variety over the algebraically closed ground field are its k-rational sections; their multiplication is induced by the regular product.
  • stabilizerPoints: The closed-point view of the reduced stabilizers already defined above.
  • groupStabilizerPoints: Closed-point group stabilizers are computed by invertibility in M.
  • groupCentralizerPoints: The left (side 0), right (side 1), or full (side 2) centralizer in the actual unit group, in the equations (1.3.1), (1.3.7), (1.2.1).
  • rightIdealPoints: The right ideal Me, not the subscript stabilizer M_e.
  • leftIdealPoints: The left ideal eM.
  • localOpenPoints: The point locus of M_0^r or M_0^ell, from (2.1.1) and (2.1.4), or their intersection M_0. Every orbit/product is computed from M and e.
  • IsMinimalIdempotent: Minimality in PDF p. 14: e is the only idempotent in eMe. Idempotence of e is supplied separately, as in the source.
  • kernelPoints: The kernel of a monoid is its least nonempty two-sided ideal. Here it is computed as membership in every nonempty two-sided ideal, not as a free parameter. For an irreducible algebraic monoid this is the closed two-sided unit-group orbit.
Definition code
import Mathlib

/-!
Local definitions and statement drafts for Michel Brion, *Local structure of algebraic
monoids*, arXiv:0709.1255v2. Varieties have precisely the convention on PDF p. 3:
separated reduced schemes of finite type over an algebraically closed field of
characteristic zero. No quasi-projectivity, normality or affineness is built into
that convention. Deferred nodes are listed in the accompanying HARD.md.
-/

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]

/-- Schemes over the ground field; all arrows in this category are k-morphisms. -/
abbrev KScheme := Over (Spec (CommRingCat.of k))

/-- The paper's convention for a variety, PDF p. 3; irreducibility is separate. -/
class IsVariety (X : KScheme k) : Prop where
  locally_finite_type : LocallyOfFiniteType X.hom
  quasi_compact : QuasiCompact X.hom
  separated : IsSeparated X.hom
  reduced : IsReduced X.left

attribute [instance] IsVariety.locally_finite_type IsVariety.quasi_compact
  IsVariety.separated IsVariety.reduced

variable {k}

/-- The constant morphism with value the k-rational point e. -/
def constantMap {X Y : KScheme k} (e : 𝟙_ (KScheme k) ⟶ Y) : X ⟶ Y :=
  toUnit X ≫ e

/-- Right multiplication r_e(x)=xe, (1.1.2), PDF p. 4. -/
def rightMultiplication (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) : M ⟶ M :=
  lift (𝟙 M) (constantMap e) ≫ μ[M]

/-- Left multiplication ell_e(x)=ex, (1.1.1), PDF p. 4. -/
def leftMultiplication (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) : M ⟶ M :=
  lift (constantMap e) (𝟙 M) ≫ μ[M]

/-- Reduction of a k-scheme using its actual nilradical ideal sheaf. -/
def reducedOver (X : KScheme k) : KScheme k :=
  Over.mk (X.left.nilradical.subschemeι ≫ X.hom)

/-- The canonical reduction inclusion. -/
def reductionInclusion (X : KScheme k) : reducedOver X ⟶ X :=
  Over.homMk X.left.nilradical.subschemeι

/-- Scheme-theoretic equations xe=e, ex=e, or (xe,ex)=(e,e).
The three cases encode the left, right, and two-sided stabilizers, respectively. -/
def stabilizerEquations (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : KScheme k :=
  if side = 0 then equalizer (rightMultiplication M e) (constantMap e)
  else if side = 1 then equalizer (leftMultiplication M e) (constantMap e)
  else equalizer
    (lift (rightMultiplication M e) (leftMultiplication M e))
    (constantMap (lift e e))

/-- Canonical inclusion of the scheme-theoretic stabilizer into M. -/
def stabilizerEquationsInclusion (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : stabilizerEquations M e side ⟶ M := by
  classical
  unfold stabilizerEquations
  split
  · exact equalizer.ι _ _
  · split
    · exact equalizer.ι _ _
    · exact equalizer.ι _ _

/-- The reduced stabilizer varieties of (1.1.4), (1.1.6), (1.1.8), PDF pp. 4-5.
Side 0 means M_e^ell, side 1 means M_e^r, and side 2 means M_e. -/
def stabilizer (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : KScheme k :=
  reducedOver (stabilizerEquations M e side)

/-- The canonical closed inclusion of the reduced stabilizer in M. -/
def stabilizerInclusion (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : stabilizer M e side ⟶ M :=
  reductionInclusion _ ≫ stabilizerEquationsInclusion M e side

/-- The scheme of inverse pairs (x,y), defined by xy=yx=1 on all test schemes.
Projection to x represents the unit functor, rather than an arbitrary abstract group. -/
def unitPairs (M : KScheme k) [MonObj M] : KScheme k :=
  equalizer
    (lift μ[M] (lift (snd M M) (fst M M) ≫ μ[M]))
    (constantMap (lift η[M] η[M]))

/-- The canonical map from inverse pairs to their invertible first coordinate. -/
def unitsInclusion (M : KScheme k) [MonObj M] : unitPairs M ⟶ M :=
  equalizer.ι _ _ ≫ fst M M

/-- The group stabilizer G intersected with M_e^ell, M_e^r or M_e,
computed inside the inverse-pair scheme by the same stabilizer equations. -/
def groupStabilizer (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : KScheme k :=
  if side = 0 then equalizer
    (unitsInclusion M ≫ rightMultiplication M e) (constantMap e)
  else if side = 1 then equalizer
    (unitsInclusion M ≫ leftMultiplication M e) (constantMap e)
  else equalizer
    (unitsInclusion M ≫ lift (rightMultiplication M e) (leftMultiplication M e))
    (constantMap (lift e e))

/-- Canonical map from a group stabilizer to M. -/
def groupStabilizerInclusion (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) (side : Fin 3) : groupStabilizer M e side ⟶ M := by
  classical
  unfold groupStabilizer
  split
  · exact equalizer.ι _ _ ≫ unitsInclusion M
  · split
    · exact equalizer.ι _ _ ≫ unitsInclusion M
    · exact equalizer.ι _ _ ≫ unitsInclusion M

/-- On test schemes, a point of M is idempotent for the actual regular product. -/
def IsIdempotentPoint (M : KScheme k) [MonObj M]
    (e : 𝟙_ (KScheme k) ⟶ M) : Prop :=
  lift e e ≫ μ[M] = e

/-- Sanity check: the identity section is idempotent. -/
example (M : KScheme k) [MonObj M] : IsIdempotentPoint M η[M] := by
  change η[M] * η[M] = η[M]
  have h : (η[M] : 𝟙_ (KScheme k) ⟶ M) = 1 := by
    change η[M] = toUnit (𝟙_ (KScheme k)) ≫ η[M]
    rw [show toUnit (𝟙_ (KScheme k)) = 𝟙 _ from toUnit_unique _ _,
      Category.id_comp]
  rw [h, _root_.one_mul]

/-- Sanity check: left stabilizers impose xe=e, with no reversed convention. -/
example (M : KScheme k) [MonObj M] (e : 𝟙_ (KScheme k) ⟶ M) :
    stabilizerEquations M e 0 =
      equalizer (rightMultiplication M e) (constantMap e) := by
  simp [stabilizerEquations]

/-- Sanity check: right stabilizers impose ex=e. -/
example (M : KScheme k) [MonObj M] (e : 𝟙_ (KScheme k) ⟶ M) :
    stabilizerEquations M e 1 =
      equalizer (leftMultiplication M e) (constantMap e) := by
  simp [stabilizerEquations]

/-- A^n over k, including A^0=Spec k up to the standard polynomial isomorphism. -/
def affineSpace (n : ℕ) : KScheme k :=
  Over.mk (Spec.map (CommRingCat.ofHom
    (MvPolynomial.C : k →+* MvPolynomial (Fin n) k)))

/-- Smoothness at a k-rational point, expressed on a Zariski open neighbourhood. -/
def IsSmoothPoint (X : KScheme k) (e : 𝟙_ (KScheme k) ⟶ X) : Prop :=
  ∃ U : X.left.Opens,
    e.left (IsLocalRing.closedPoint k) ∈ U ∧ Smooth (U.ι ≫ X.hom)

attribute [local instance] MvPolynomial.gradedAlgebra

/-- Projective n-space as Proj of the ordinary total-degree graded polynomial ring. -/
def projectiveSpace (n : ℕ) : Scheme :=
  Proj (MvPolynomial.homogeneousSubmodule (Fin (n + 1)) k)

/-- Constants land in the actual degree-zero ring of homogeneous polynomials. -/
def degreeZeroConstants (n : ℕ) :
    k →+* (MvPolynomial.homogeneousSubmodule (Fin (n + 1)) k 0) where
  toFun a := ⟨MvPolynomial.C a, MvPolynomial.isHomogeneous_C _ a⟩
  map_one' := Subtype.ext (map_one MvPolynomial.C)
  map_mul' a b := Subtype.ext (map_mul MvPolynomial.C a b)
  map_zero' := Subtype.ext (map_zero MvPolynomial.C)
  map_add' a b := Subtype.ext (map_add MvPolynomial.C a b)

/-- The structure morphism P^n_k to Spec k. -/
def projectiveSpaceBase (n : ℕ) : projectiveSpace (k := k) n ⟶ Spec (CommRingCat.of k) :=
  Proj.toSpecZero (MvPolynomial.homogeneousSubmodule (Fin (n + 1)) k) ≫
    Spec.map (CommRingCat.ofHom (degreeZeroConstants (k := k) n))

/-- Quasi-projectivity means a locally closed scheme immersion into some P^n_k,
compatible with the fixed k-structure; it is not assumed in IsVariety. -/
def IsQuasiProjective (X : KScheme k) : Prop :=
  ∃ n : ℕ, ∃ i : X.left ⟶ projectiveSpace (k := k) n,
    IsImmersion i ∧ i ≫ projectiveSpaceBase n = X.hom

/-- Sanity check: quasi-projectivity retains the prescribed ground-field morphism. -/
example (X : KScheme k) (h : IsQuasiProjective X) :
    ∃ n : ℕ, ∃ i : X.left ⟶ projectiveSpace (k := k) n,
      IsImmersion i ∧ i ≫ projectiveSpaceBase n = X.hom := h

/-- Closed points of a variety over the algebraically closed ground field are
its k-rational sections; their multiplication is induced by the regular product. -/
abbrev MonoidSchemePoint (M : KScheme k) := 𝟙_ (KScheme k) ⟶ M

/-- The closed-point view of the reduced stabilizers already defined above. -/
def stabilizerPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M)
    (side : Fin 3) : Set (MonoidSchemePoint M) :=
  if side = 0 then {x | x * e = e}
  else if side = 1 then {x | e * x = e}
  else {x | x * e = e ∧ e * x = e}

/-- Closed-point group stabilizers are computed by invertibility in M. -/
def groupStabilizerPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M)
    (side : Fin 3) : Set (MonoidSchemePoint M) :=
  {x | IsUnit x} ∩ stabilizerPoints M e side

/-- The left (side 0), right (side 1), or full (side 2) centralizer in the
actual unit group, in the equations (1.3.1), (1.3.7), (1.2.1). -/
def groupCentralizerPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M)
    (side : Fin 3) : Set (MonoidSchemePoint M) :=
  {x | IsUnit x} ∩
    (if side = 0 then {x | x * e = e * x * e}
     else if side = 1 then {x | e * x = e * x * e}
     else {x | x * e = e * x})

/-- The right ideal Me, not the subscript stabilizer M_e. -/
def rightIdealPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M) : Set (MonoidSchemePoint M) :=
  Set.range (fun x : MonoidSchemePoint M => x * e)

/-- The left ideal eM. -/
def leftIdealPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M) : Set (MonoidSchemePoint M) :=
  Set.range (fun x : MonoidSchemePoint M => e * x)

/-- The point locus of M_0^r or M_0^ell, from (2.1.1) and (2.1.4),
or their intersection M_0. Every orbit/product is computed from M and e. -/
def localOpenPoints (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M)
    (side : Fin 3) : Set (MonoidSchemePoint M) :=
  if side = 0 then {x | x * e ∈ groupCentralizerPoints M e 1 * {e}}
  else if side = 1 then {x | e * x ∈ {e} * groupCentralizerPoints M e 0}
  else {x | x * e ∈ groupCentralizerPoints M e 1 * {e} ∧
            e * x ∈ {e} * groupCentralizerPoints M e 0}

/-- Minimality in PDF p. 14: e is the only idempotent in eMe.
Idempotence of e is supplied separately, as in the source. -/
def IsMinimalIdempotent (M : KScheme k) [MonObj M] (e : MonoidSchemePoint M) : Prop :=
  ∀ x : MonoidSchemePoint M, e * x * e = x → x * x = x → x = e

/-- The kernel of a monoid is its least nonempty two-sided ideal. Here it is
computed as membership in every nonempty two-sided ideal, not as a free parameter.
For an irreducible algebraic monoid this is the closed two-sided unit-group orbit. -/
def kernelPoints (M : KScheme k) [MonObj M] : Set (MonoidSchemePoint M) :=
  {x | ∀ I : Set (MonoidSchemePoint M), I.Nonempty →
    (∀ a ∈ I, ∀ b c : MonoidSchemePoint M, b * a * c ∈ I) → x ∈ I}

/-- Sanity check at e=1: the right ideal M1 is the whole point set. -/
example (M : KScheme k) [MonObj M] :
    rightIdealPoints M (1 : MonoidSchemePoint M) = Set.univ := by
  ext x
  simp [rightIdealPoints]

/-- Sanity check at e=1: the two-sided stabilizer has just its identity point. -/
example (M : KScheme k) [MonObj M] :
    stabilizerPoints M (1 : MonoidSchemePoint M) 2 = {1} := by
  ext x
  simp [stabilizerPoints]

end QAlgorithms.Papers.Independent.Intakethird100.P79
Source
Local structure of algebraic monoids, arXiv:0709.1255v2, https://arxiv.org/abs/0709.1255v2
Read-back

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

QAlgorithms.Papers.Independent.Intakethird100.P79.IsIdempotentPoint

For a scheme MMM over Spec⁡k\operatorname{Spec}kSpeck with a monoid-object structure and a kkk-point e:Spec⁡k→Me:\operatorname{Spec}k\to Me:Speck→M, this predicate means that the composite of (e,e):Spec⁡k→M×kM(e,e):\operatorname{Spec}k\to M\times_k M(e,e):Speck→M×k​M with the multiplication μ:M×kM→M\mu:M\times_k M\to Mμ:M×k​M→M equals eee. Equivalently, it is the equality e⋅e=ee\cdot e=ee⋅e=e of kkk-points.

QAlgorithms.Papers.Independent.Intakethird100.P79.IsMinimalIdempotent

For a monoid scheme MMM over kkk, write P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. For any e∈Pe\in Pe∈P, this defines the proposition that every x∈Px\in Px∈P satisfying both (ex)e=x(ex)e=x(ex)e=x and x2=xx^2=xx2=x must equal eee. The definition does not separately require e2=ee^2=ee2=e; its universally quantified implication also includes points xxx for which either premise fails.

QAlgorithms.Papers.Independent.Intakethird100.P79.IsQuasiProjective

For a scheme XXX over Spec⁡k\operatorname{Spec}kSpeck, with structure morphism f:X→Spec⁡kf:X\to\operatorname{Spec}kf:X→Speck, this predicate means that there exist a natural number nnn, possibly zero, and a scheme morphism i:X→Proj⁡(k[t0,…,tn])i:X\to\operatorname{Proj}(k[t_0,\ldots,t_n])i:X→Proj(k[t0​,…,tn​]) such that iii is an immersion and its composite with the specified morphism to Spec⁡k\operatorname{Spec}kSpeck equals fff. Here the polynomial ring is graded by total degree, and the specified morphism is the canonical map to the spectrum of its degree-zero component followed by the map induced by the inclusion of constant polynomials from kkk. No nonemptiness condition on XXX is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.IsSmoothPoint

For a scheme XXX over Spec⁡k\operatorname{Spec}kSpeck and a kkk-point e:Spec⁡k→Xe:\operatorname{Spec}k\to Xe:Speck→X, this predicate means that there exists an open subset UUU of the underlying scheme of XXX which contains the image under eee of the distinguished closed point of Spec⁡k\operatorname{Spec}kSpeck, and for which the composite U↪X→Spec⁡kU\hookrightarrow X\to\operatorname{Spec}kU↪X→Speck is smooth. The condition concerns smoothness of the structure morphism on such an open neighborhood.

QAlgorithms.Papers.Independent.Intakethird100.P79.IsVariety

For a scheme XXX over the base ring kkk, with structure morphism pX:X→Spec⁡kp_X:X\to\operatorname{Spec} kpX​:X→Speck, this property consists of four requirements: pXp_XpX​ is locally of finite type, quasi-compact, and separated, and the underlying scheme XXX is reduced. No nonemptiness or irreducibility requirement is included.

QAlgorithms.Papers.Independent.Intakethird100.P79.KScheme

For the base ring kkk, this denotes the category of schemes over Spec⁡k\operatorname{Spec} kSpeck. An object is a scheme XXX equipped with a structure morphism pX:X→Spec⁡kp_X:X\to\operatorname{Spec} kpX​:X→Speck, and a morphism from (X,pX)(X,p_X)(X,pX​) to (Y,pY)(Y,p_Y)(Y,pY​) is a scheme morphism f:X→Yf:X\to Yf:X→Y satisfying pY∘f=pXp_Y\circ f=p_XpY​∘f=pX​.

QAlgorithms.Papers.Independent.Intakethird100.P79.MonoidSchemePoint

For any scheme MMM over Spec⁡k\operatorname{Spec}kSpeck, this abbreviates the type of morphisms from the monoidal unit of the category of kkk-schemes to MMM; equivalently, it is the type of kkk-points Spec⁡k→M\operatorname{Spec}k\to MSpeck→M, with morphisms required to commute with the structure maps to Spec⁡k\operatorname{Spec}kSpeck. This abbreviation itself requires no monoid-object structure on MMM.

QAlgorithms.Papers.Independent.Intakethird100.P79.affineSpace

For the base commutative ring kkk and every natural number nnn, including n=0n=0n=0, this defines the kkk-scheme Spec⁡(k[ti∣i∈{0,…,n−1}])\operatorname{Spec}(k[t_i\mid i\in\{0,\ldots,n-1\}])Spec(k[ti​∣i∈{0,…,n−1}]), whose structure morphism to Spec⁡k\operatorname{Spec}kSpeck is induced contravariantly by the ring homomorphism sending each element of kkk to its constant polynomial. When n=0n=0n=0, the polynomial ring has no variables and is canonically kkk, so the resulting kkk-scheme is canonically Spec⁡k\operatorname{Spec}kSpeck.

QAlgorithms.Papers.Independent.Intakethird100.P79.constantMap

For schemes XXX and YYY over the base ring kkk and a kkk-point e:Spec⁡k→Ye:\operatorname{Spec} k\to Ye:Speck→Y, this defines the morphism X→YX\to YX→Y obtained by composing the unique morphism from XXX to the terminal object Spec⁡k\operatorname{Spec} kSpeck with eee:

X→pXSpec⁡k→eY.X\xrightarrow{p_X}\operatorname{Spec} k\xrightarrow{e}Y.XpX​​Specke​Y.

QAlgorithms.Papers.Independent.Intakethird100.P79.degreeZeroConstants

For the base commutative ring kkk and every natural number nnn, including n=0n=0n=0, this defines the ring homomorphism from kkk to the degree-zero homogeneous component of k[t0,…,tn]k[t_0,\ldots,t_n]k[t0​,…,tn​] which sends each a∈ka\in ka∈k to the constant polynomial aaa, regarded as a homogeneous polynomial of degree zero. This map preserves 000, 111, addition, and multiplication; the zero polynomial is included in the degree-zero component.

QAlgorithms.Papers.Independent.Intakethird100.P79.groupCentralizerPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. Given any e∈Pe\in Pe∈P and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines the set of points x∈Px\in Px∈P that have a two-sided multiplicative inverse and satisfy xe=(ex)exe=(ex)exe=(ex)e if s=0s=0s=0, ex=(ex)eex=(ex)eex=(ex)e if s=1s=1s=1, and xe=exxe=exxe=ex if s=2s=2s=2. No idempotence assumption on eee is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizer

For a scheme MMM over Spec⁡k\operatorname{Spec}kSpeck with a monoid-object structure, a kkk-point e:Spec⁡k→Me:\operatorname{Spec}k\to Me:Speck→M, and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, let UUU be the equalizer defining pairs (x,y)(x,y)(x,y) with xy=yx=1Mxy=yx=1_Mxy=yx=1M​, and let p:U→Mp:U\to Mp:U→M send (x,y)(x,y)(x,y) to xxx. This definition produces a kkk-scheme as follows: for s=0s=0s=0, it is the equalizer of u↦p(u)eu\mapsto p(u)eu↦p(u)e and the constant map with value eee; for s=1s=1s=1, it is the equalizer of u↦ep(u)u\mapsto ep(u)u↦ep(u) and that constant map; for s=2s=2s=2, it is the equalizer of u↦(p(u)e,ep(u))u\mapsto(p(u)e,ep(u))u↦(p(u)e,ep(u)) and the constant map with value (e,e)(e,e)(e,e). These are scheme equalizers, imposing respectively xe=exe=exe=e, ex=eex=eex=e, or both equations on inverse pairs. No idempotence condition on eee is assumed.

QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizerInclusion

For a scheme MMM over Spec⁡k\operatorname{Spec}kSpeck with a monoid-object structure, a kkk-point eee, and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, form the scheme UUU of inverse pairs (x,y)(x,y)(x,y) satisfying xy=yx=1Mxy=yx=1_Mxy=yx=1M​. Inside UUU, take the scheme equalizer imposing xe=exe=exe=e when s=0s=0s=0, ex=eex=eex=e when s=1s=1s=1, and both equations when s=2s=2s=2. The morphism defined here from this equalizer to MMM is the composite of its equalizer inclusion into UUU, the equalizer inclusion U→M×kMU\to M\times_k MU→M×k​M, and the first projection M×kM→MM\times_k M\to MM×k​M→M. Thus it sends an inverse pair satisfying the selected equations to its first component xxx; eee is an arbitrary kkk-point.

QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizerPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M) be its monoid of kkk-rational points, with multiplication induced by the multiplication of MMM. Given any e∈Pe\in Pe∈P and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines the set of points x∈Px\in Px∈P that have a two-sided multiplicative inverse and satisfy xe=exe=exe=e if s=0s=0s=0, ex=eex=eex=e if s=1s=1s=1, and both xe=exe=exe=e and ex=eex=eex=e if s=2s=2s=2. No idempotence assumption on eee is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.kernelPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. This defines the set of all x∈Px\in Px∈P such that, for every subset I⊆PI\subseteq PI⊆P, if III is nonempty and (ba)c∈I(ba)c\in I(ba)c∈I for every a∈Ia\in Ia∈I and every b,c∈Pb,c\in Pb,c∈P, then x∈Ix\in Ix∈I. Thus the quantification is over all nonempty subsets stable under multiplication on both sides, with no topological or scheme-theoretic condition on those subsets; the empty subset imposes no requirement.

QAlgorithms.Papers.Independent.Intakethird100.P79.leftIdealPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. For any e∈Pe\in Pe∈P, this defines the subset {ex∣x∈P}\{ex\mid x\in P\}{ex∣x∈P} of PPP: a point yyy belongs to it exactly when there exists x∈Px\in Px∈P such that y=exy=exy=ex. No idempotence assumption on eee is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.leftMultiplication

For a monoid scheme MMM over the base ring kkk, with associative multiplication μ:M×kM→M\mu:M\times_k M\to Mμ:M×k​M→M and an identity section satisfying the unit laws, and any kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, this defines the endomorphism

Le=μ∘⟨e∘pM,id⁡M⟩:M→M,L_e=\mu\circ\langle e\circ p_M,\operatorname{id}_M\rangle:M\to M,Le​=μ∘⟨e∘pM​,idM​⟩:M→M,

where pMp_MpM​ is the structure morphism. Thus it sends a generalized point xxx to exexex, with eee pulled back to the same base as xxx.

QAlgorithms.Papers.Independent.Intakethird100.P79.localOpenPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. Given any e∈Pe\in Pe∈P and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines a subset of PPP as follows: when s=0s=0s=0, its members are exactly the xxx for which there exists a two-sided invertible u∈Pu\in Pu∈P satisfying eu=(eu)eeu=(eu)eeu=(eu)e and xe=uexe=uexe=ue; when s=1s=1s=1, its members are exactly the xxx for which there exists a two-sided invertible v∈Pv\in Pv∈P satisfying ve=(ev)eve=(ev)eve=(ev)e and ex=evex=evex=ev; when s=2s=2s=2, both of these existence conditions must hold, with independently chosen witnesses uuu and vvv. No idempotence assumption on eee is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.projectiveSpace

For the base commutative ring kkk and every natural number nnn, including n=0n=0n=0, this defines the scheme Proj⁡(k[t0,…,tn])\operatorname{Proj}(k[t_0,\ldots,t_n])Proj(k[t0​,…,tn​]), using the grading by total degree: its degree-ddd component consists of the homogeneous polynomials of total degree ddd. For n=0n=0n=0, this construction uses the polynomial ring in one variable. The value of this definition is a scheme.

QAlgorithms.Papers.Independent.Intakethird100.P79.projectiveSpaceBase

For the base commutative ring kkk and every natural number nnn, including n=0n=0n=0, put S=k[t0,…,tn]S=k[t_0,\ldots,t_n]S=k[t0​,…,tn​] with its total-degree grading and let S0S_0S0​ be its degree-zero component. This defines the morphism Proj⁡S→Spec⁡k\operatorname{Proj}S\to\operatorname{Spec}kProjS→Speck as the composite of the canonical morphism Proj⁡S→Spec⁡S0\operatorname{Proj}S\to\operatorname{Spec}S_0ProjS→SpecS0​ with the morphism Spec⁡S0→Spec⁡k\operatorname{Spec}S_0\to\operatorname{Spec}kSpecS0​→Speck induced by the ring homomorphism k→S0k\to S_0k→S0​ sending each scalar to its constant polynomial.

QAlgorithms.Papers.Independent.Intakethird100.P79.reducedOver

For a scheme XXX over the base ring kkk, with structure morphism pXp_XpX​, this defines the scheme over kkk whose underlying scheme is the closed subscheme XredX_{\mathrm{red}}Xred​ cut out by the nilradical ideal sheaf of XXX, and whose structure morphism is

Xred→ιXX→pXSpec⁡k,X_{\mathrm{red}}\xrightarrow{\iota_X}X\xrightarrow{p_X}\operatorname{Spec} k,Xred​ιX​​XpX​​Speck,

where ιX\iota_XιX​ is the canonical closed immersion.

QAlgorithms.Papers.Independent.Intakethird100.P79.reductionInclusion

For a scheme XXX over the base ring kkk, this defines the morphism over kkk from its reduction to XXX whose underlying scheme morphism is the canonical inclusion ιX:Xred→X\iota_X:X_{\mathrm{red}}\to XιX​:Xred​→X. Here XredX_{\mathrm{red}}Xred​ is the closed subscheme cut out by the nilradical ideal sheaf, equipped with the structure morphism pX∘ιXp_X\circ\iota_XpX​∘ιX​.

QAlgorithms.Papers.Independent.Intakethird100.P79.rightIdealPoints

For a monoid scheme MMM over kkk, let P=Hom⁡k(Spec⁡k,M)P=\operatorname{Hom}_k(\operatorname{Spec}k,M)P=Homk​(Speck,M), with its induced monoid multiplication. For any e∈Pe\in Pe∈P, this defines the subset {xe∣x∈P}\{xe\mid x\in P\}{xe∣x∈P} of PPP: a point yyy belongs to it exactly when there exists x∈Px\in Px∈P such that y=xey=xey=xe. No idempotence assumption on eee is imposed.

QAlgorithms.Papers.Independent.Intakethird100.P79.rightMultiplication

For a monoid scheme MMM over the base ring kkk, with associative multiplication μ:M×kM→M\mu:M\times_k M\to Mμ:M×k​M→M and an identity section satisfying the unit laws, and any kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, this defines the endomorphism

Re=μ∘⟨id⁡M,e∘pM⟩:M→M,R_e=\mu\circ\langle\operatorname{id}_M,e\circ p_M\rangle:M\to M,Re​=μ∘⟨idM​,e∘pM​⟩:M→M,

where pMp_MpM​ is the structure morphism. Thus it sends a generalized point xxx to xexexe, with eee pulled back to the same base as xxx.

QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizer

For a monoid scheme MMM over the base ring kkk, an arbitrary kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, and an index s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines the reduction of the equalizer imposing xe=exe=exe=e when s=0s=0s=0, ex=eex=eex=e when s=1s=1s=1, or both equations when s=2s=2s=2. Multiplication is the given associative multiplication with identity on MMM, and these are equations of morphisms on generalized points after pulling back eee to their base. Explicitly, if EsE_sEs​ is that equalizer, the resulting scheme is the closed subscheme (Es)red(E_s)_{\mathrm{red}}(Es​)red​ cut out by its nilradical ideal sheaf, with structure morphism obtained by composing (Es)red→Es(E_s)_{\mathrm{red}}\to E_s(Es​)red​→Es​ with the structure morphism of EsE_sEs​. No idempotency condition on eee is assumed.

QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerEquations

For a monoid scheme MMM over the base ring kkk, with associative multiplication and an identity section satisfying the unit laws, an arbitrary kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, and an index s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines a scheme over kkk by taking the equalizer of the maps x↦xex\mapsto xex↦xe and x↦ex\mapsto ex↦e when s=0s=0s=0, the equalizer of x↦exx\mapsto exx↦ex and x↦ex\mapsto ex↦e when s=1s=1s=1, and the equalizer of x↦(xe,ex)x\mapsto(xe,ex)x↦(xe,ex) and x↦(e,e)x\mapsto(e,e)x↦(e,e) when s=2s=2s=2. All products are over kkk, and constant maps factor through Spec⁡k\operatorname{Spec} kSpeck. Equivalently, for every scheme TTT over kkk, its TTT-points are precisely those x:T→Mx:T\to Mx:T→M satisfying xeT=eTxe_T=e_TxeT​=eT​ for s=0s=0s=0, eTx=eTe_Tx=e_TeT​x=eT​ for s=1s=1s=1, or both equations for s=2s=2s=2, where eT=e∘pTe_T=e\circ p_TeT​=e∘pT​. No idempotency condition on eee is assumed.

QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerEquationsInclusion

For a monoid scheme MMM over the base ring kkk, an arbitrary kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, and an index s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines the canonical equalizer morphism into MMM: its source is the equalizer imposing xe=exe=exe=e when s=0s=0s=0, ex=eex=eex=e when s=1s=1s=1, or both equations when s=2s=2s=2. Here multiplication comes from the given associative monoid structure with identity on MMM, and the equations mean equalities of morphisms on generalized points, with eee pulled back to their base. In each case the defined map is the equalizer inclusion itself.

QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerInclusion

For a monoid scheme MMM over the base ring kkk, an arbitrary kkk-point e:Spec⁡k→Me:\operatorname{Spec} k\to Me:Speck→M, and an index s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, let EsE_sEs​ be the equalizer imposing xe=exe=exe=e for s=0s=0s=0, ex=eex=eex=e for s=1s=1s=1, or both equations for s=2s=2s=2, using the given associative multiplication with identity on MMM and pulling back eee to the base of each generalized point. This defines the morphism over kkk

(Es)red⟶Es⟶M,(E_s)_{\mathrm{red}}\longrightarrow E_s\longrightarrow M,(Es​)red​⟶Es​⟶M,

where the first arrow is the inclusion of the closed subscheme cut out by the nilradical ideal sheaf of EsE_sEs​, and the second is the canonical equalizer inclusion.

QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerPoints

For a scheme MMM over Spec⁡k\operatorname{Spec}kSpeck equipped with a monoid-object structure, a kkk-point eee, and s∈{0,1,2}s\in\{0,1,2\}s∈{0,1,2}, this defines a set of kkk-points of MMM, using the multiplication on points induced by the scheme multiplication. For s=0s=0s=0, the set is {x∣xe=e}\{x\mid xe=e\}{x∣xe=e}; for s=1s=1s=1, it is {x∣ex=e}\{x\mid ex=e\}{x∣ex=e}; and for s=2s=2s=2, it is {x∣xe=e and ex=e}\{x\mid xe=e\text{ and }ex=e\}{x∣xe=e and ex=e}. The point eee is arbitrary, with no idempotence assumption, and membership imposes no invertibility condition on xxx.

QAlgorithms.Papers.Independent.Intakethird100.P79.unitPairs

For a monoid scheme MMM over the base ring kkk, with associative multiplication μ:M×kM→M\mu:M\times_k M\to Mμ:M×k​M→M and identity section η:Spec⁡k→M\eta:\operatorname{Spec} k\to Mη:Speck→M satisfying the unit laws, this defines the equalizer of the two morphisms

M×kM⇉M×kM,(x,y)⟼(xy,yx),(x,y)⟼(1,1),M\times_k M\rightrightarrows M\times_k M, \qquad (x,y)\longmapsto(xy,yx), \qquad (x,y)\longmapsto(1,1),M×k​M⇉M×k​M,(x,y)⟼(xy,yx),(x,y)⟼(1,1),

where 111 denotes the identity section pulled back along the structure morphism. Thus, for every scheme TTT over kkk, its TTT-points are pairs (x,y)(x,y)(x,y) of TTT-points of MMM satisfying both xy=1Txy=1_Txy=1T​ and yx=1Tyx=1_Tyx=1T​, where 1T=η∘pT1_T=\eta\circ p_T1T​=η∘pT​.

QAlgorithms.Papers.Independent.Intakethird100.P79.unitsInclusion

For a scheme MMM over Spec⁡k\operatorname{Spec}kSpeck, equipped with an associative multiplication and a unit making it a monoid object, let UUU be the equalizer of the two morphisms M×kM→M×kMM\times_k M\to M\times_k MM×k​M→M×k​M given by (x,y)↦(xy,yx)(x,y)\mapsto(xy,yx)(x,y)↦(xy,yx) and the constant map with value (1M,1M)(1_M,1_M)(1M​,1M​). Thus UUU is the scheme of pairs satisfying xy=yx=1Mxy=yx=1_Mxy=yx=1M​. The morphism defined here is U↪M×kM→MU\hookrightarrow M\times_k M\to MU↪M×k​M→M, where the second arrow is the first projection; it sends an inverse pair (x,y)(x,y)(x,y) to xxx.

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