Minimal idempotents: global product descriptions
OpenQAlgorithms.Papers.Independent.Intakethird100.P79.lemma_2_3_1Let be algebraically closed of characteristic zero, let be an irreducible affine algebraic monoid, let be its unit group, and let be an idempotent which is the unique idempotent of . Write , , , and for their intersections with . The left and right group centralizers are and . Products below are products of subsets of , and are the principal ideals, and is the least nonempty two-sided ideal. Then
Here , and . 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 . No quotient or geometric isomorphism is replaced by a point-set bijection.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P79
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an algebraically closed field of characteristic zero, and let be a monoid scheme over whose structure morphism is locally of finite type, quasi-compact, and separated, and whose underlying scheme is reduced, irreducible, and affine. Write for its monoid of rational points and for the points having two-sided multiplicative inverses. Let satisfy , and suppose that every with and equals . Define , , , for , , and . Let consist of those belonging to every nonempty subset such that for all and . Define , , and , where products of subsets mean . Then all of the following equalities hold simultaneously:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.