Definitions for Local structure of algebraic monoids
DefinitionQAlgorithms_Papers_Independent_Intakethird100_P79The 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.
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakethird100.P79.IsIdempotentPoint
For a scheme over with a monoid-object structure and a -point , this predicate means that the composite of with the multiplication equals . Equivalently, it is the equality of -points.
QAlgorithms.Papers.Independent.Intakethird100.P79.IsMinimalIdempotent
For a monoid scheme over , write , with its induced monoid multiplication. For any , this defines the proposition that every satisfying both and must equal . The definition does not separately require ; its universally quantified implication also includes points for which either premise fails.
QAlgorithms.Papers.Independent.Intakethird100.P79.IsQuasiProjective
For a scheme over , with structure morphism , this predicate means that there exist a natural number , possibly zero, and a scheme morphism such that is an immersion and its composite with the specified morphism to equals . 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 . No nonemptiness condition on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.IsSmoothPoint
For a scheme over and a -point , this predicate means that there exists an open subset of the underlying scheme of which contains the image under of the distinguished closed point of , and for which the composite is smooth. The condition concerns smoothness of the structure morphism on such an open neighborhood.
QAlgorithms.Papers.Independent.Intakethird100.P79.IsVariety
For a scheme over the base ring , with structure morphism , this property consists of four requirements: is locally of finite type, quasi-compact, and separated, and the underlying scheme is reduced. No nonemptiness or irreducibility requirement is included.
QAlgorithms.Papers.Independent.Intakethird100.P79.KScheme
For the base ring , this denotes the category of schemes over . An object is a scheme equipped with a structure morphism , and a morphism from to is a scheme morphism satisfying .
QAlgorithms.Papers.Independent.Intakethird100.P79.MonoidSchemePoint
For any scheme over , this abbreviates the type of morphisms from the monoidal unit of the category of -schemes to ; equivalently, it is the type of -points , with morphisms required to commute with the structure maps to . This abbreviation itself requires no monoid-object structure on .
QAlgorithms.Papers.Independent.Intakethird100.P79.affineSpace
For the base commutative ring and every natural number , including , this defines the -scheme , whose structure morphism to is induced contravariantly by the ring homomorphism sending each element of to its constant polynomial. When , the polynomial ring has no variables and is canonically , so the resulting -scheme is canonically .
QAlgorithms.Papers.Independent.Intakethird100.P79.constantMap
For schemes and over the base ring and a -point , this defines the morphism obtained by composing the unique morphism from to the terminal object with :
QAlgorithms.Papers.Independent.Intakethird100.P79.degreeZeroConstants
For the base commutative ring and every natural number , including , this defines the ring homomorphism from to the degree-zero homogeneous component of which sends each to the constant polynomial , regarded as a homogeneous polynomial of degree zero. This map preserves , , addition, and multiplication; the zero polynomial is included in the degree-zero component.
QAlgorithms.Papers.Independent.Intakethird100.P79.groupCentralizerPoints
For a monoid scheme over , let , with its induced monoid multiplication. Given any and , this defines the set of points that have a two-sided multiplicative inverse and satisfy if , if , and if . No idempotence assumption on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizer
For a scheme over with a monoid-object structure, a -point , and , let be the equalizer defining pairs with , and let send to . This definition produces a -scheme as follows: for , it is the equalizer of and the constant map with value ; for , it is the equalizer of and that constant map; for , it is the equalizer of and the constant map with value . These are scheme equalizers, imposing respectively , , or both equations on inverse pairs. No idempotence condition on is assumed.
QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizerInclusion
For a scheme over with a monoid-object structure, a -point , and , form the scheme of inverse pairs satisfying . Inside , take the scheme equalizer imposing when , when , and both equations when . The morphism defined here from this equalizer to is the composite of its equalizer inclusion into , the equalizer inclusion , and the first projection . Thus it sends an inverse pair satisfying the selected equations to its first component ; is an arbitrary -point.
QAlgorithms.Papers.Independent.Intakethird100.P79.groupStabilizerPoints
For a monoid scheme over , let be its monoid of -rational points, with multiplication induced by the multiplication of . Given any and , this defines the set of points that have a two-sided multiplicative inverse and satisfy if , if , and both and if . No idempotence assumption on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.kernelPoints
For a monoid scheme over , let , with its induced monoid multiplication. This defines the set of all such that, for every subset , if is nonempty and for every and every , then . 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 over , let , with its induced monoid multiplication. For any , this defines the subset of : a point belongs to it exactly when there exists such that . No idempotence assumption on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.leftMultiplication
For a monoid scheme over the base ring , with associative multiplication and an identity section satisfying the unit laws, and any -point , this defines the endomorphism
where is the structure morphism. Thus it sends a generalized point to , with pulled back to the same base as .
QAlgorithms.Papers.Independent.Intakethird100.P79.localOpenPoints
For a monoid scheme over , let , with its induced monoid multiplication. Given any and , this defines a subset of as follows: when , its members are exactly the for which there exists a two-sided invertible satisfying and ; when , its members are exactly the for which there exists a two-sided invertible satisfying and ; when , both of these existence conditions must hold, with independently chosen witnesses and . No idempotence assumption on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.projectiveSpace
For the base commutative ring and every natural number , including , this defines the scheme , using the grading by total degree: its degree- component consists of the homogeneous polynomials of total degree . For , 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 and every natural number , including , put with its total-degree grading and let be its degree-zero component. This defines the morphism as the composite of the canonical morphism with the morphism induced by the ring homomorphism sending each scalar to its constant polynomial.
QAlgorithms.Papers.Independent.Intakethird100.P79.reducedOver
For a scheme over the base ring , with structure morphism , this defines the scheme over whose underlying scheme is the closed subscheme cut out by the nilradical ideal sheaf of , and whose structure morphism is
where is the canonical closed immersion.
QAlgorithms.Papers.Independent.Intakethird100.P79.reductionInclusion
For a scheme over the base ring , this defines the morphism over from its reduction to whose underlying scheme morphism is the canonical inclusion . Here is the closed subscheme cut out by the nilradical ideal sheaf, equipped with the structure morphism .
QAlgorithms.Papers.Independent.Intakethird100.P79.rightIdealPoints
For a monoid scheme over , let , with its induced monoid multiplication. For any , this defines the subset of : a point belongs to it exactly when there exists such that . No idempotence assumption on is imposed.
QAlgorithms.Papers.Independent.Intakethird100.P79.rightMultiplication
For a monoid scheme over the base ring , with associative multiplication and an identity section satisfying the unit laws, and any -point , this defines the endomorphism
where is the structure morphism. Thus it sends a generalized point to , with pulled back to the same base as .
QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizer
For a monoid scheme over the base ring , an arbitrary -point , and an index , this defines the reduction of the equalizer imposing when , when , or both equations when . Multiplication is the given associative multiplication with identity on , and these are equations of morphisms on generalized points after pulling back to their base. Explicitly, if is that equalizer, the resulting scheme is the closed subscheme cut out by its nilradical ideal sheaf, with structure morphism obtained by composing with the structure morphism of . No idempotency condition on is assumed.
QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerEquations
For a monoid scheme over the base ring , with associative multiplication and an identity section satisfying the unit laws, an arbitrary -point , and an index , this defines a scheme over by taking the equalizer of the maps and when , the equalizer of and when , and the equalizer of and when . All products are over , and constant maps factor through . Equivalently, for every scheme over , its -points are precisely those satisfying for , for , or both equations for , where . No idempotency condition on is assumed.
QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerEquationsInclusion
For a monoid scheme over the base ring , an arbitrary -point , and an index , this defines the canonical equalizer morphism into : its source is the equalizer imposing when , when , or both equations when . Here multiplication comes from the given associative monoid structure with identity on , and the equations mean equalities of morphisms on generalized points, with 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 over the base ring , an arbitrary -point , and an index , let be the equalizer imposing for , for , or both equations for , using the given associative multiplication with identity on and pulling back to the base of each generalized point. This defines the morphism over
where the first arrow is the inclusion of the closed subscheme cut out by the nilradical ideal sheaf of , and the second is the canonical equalizer inclusion.
QAlgorithms.Papers.Independent.Intakethird100.P79.stabilizerPoints
For a scheme over equipped with a monoid-object structure, a -point , and , this defines a set of -points of , using the multiplication on points induced by the scheme multiplication. For , the set is ; for , it is ; and for , it is . The point is arbitrary, with no idempotence assumption, and membership imposes no invertibility condition on .
QAlgorithms.Papers.Independent.Intakethird100.P79.unitPairs
For a monoid scheme over the base ring , with associative multiplication and identity section satisfying the unit laws, this defines the equalizer of the two morphisms
where denotes the identity section pulled back along the structure morphism. Thus, for every scheme over , its -points are pairs of -points of satisfying both and , where .
QAlgorithms.Papers.Independent.Intakethird100.P79.unitsInclusion
For a scheme over , equipped with an associative multiplication and a unit making it a monoid object, let be the equalizer of the two morphisms given by and the constant map with value . Thus is the scheme of pairs satisfying . The morphism defined here is , where the second arrow is the first projection; it sends an inverse pair to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.