Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The concrete section-five ideal chain and selected component

Definition
PhilipponMultiplicity_SectionFive

by tomasz · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

draft-definitionphilippon-multiplicity

Source input polynomial and contact data, genuine bounded translation atlases, the explicit chain I₀ = I(G), I₁ = (I(G),P) and later operator-generated ideals; selection of a common minimal prime of maximal dimension at a stable index; its actual zero locus and set stabilizer. The stabilizer closedness is setup data. Construction existence and all three Lemma 5.1 conclusions remain theorem obligations.

Compiled, admission-free definition bundle. Theorems asserting its substantive properties remain open targets in the full-paper goal.

Definition code
import Definitions.Def_PhilipponMultiplicity_Operators
import Definitions.Def_PhilipponMultiplicity_Degree
import Definitions.Def_PhilipponMultiplicity_Differential

/-!
Concrete data selected in section five: a polynomial, bounded polynomial
translation atlases, the resulting ideal chain, and a common component of
maximal dimension. Existence of these selections and closedness of the
stabilizer are separate geometric obligations. None of the three conclusions
of Lemma 5.1 is a field of these structures.
-/

set_option autoImplicit false
open scoped BigOperators Pointwise
noncomputable section

namespace PhilipponMultiplicity

universe u
variable {K : Type u} [NontriviallyNormedField K]

def idealZeroLocusOnGroup (G : EmbeddedGroupProduct K)
    (I : Ideal G.CoordinateRing) : Set G.Point :=
  {x | ∀ P ∈ I, G.ambient.eval P (G.embedding x) = 0}

/-- Stabilizer of an actual subset under translation. -/
def setStabilizer (G : EmbeddedGroupProduct K) (V : Set G.Point) : AddSubgroup G.Point :=
  AddAction.stabilizer G.Point V

/-- The input from Theorem 2.1 together with the actual bounded coordinate
presentations used to construct its ideals. -/
structure SectionFiveInput (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G) where
  samplingSet : Finset G.Point
  zero_mem : 0 ∈ samplingSet
  contactParameter : ℕ
  degrees : G.FactorIndex → ℕ
  polynomial : G.CoordinateRing
  polynomial_ne_zero : polynomial ≠ 0
  polynomial_homogeneous : IsMultihomogeneousOfDegree G polynomial degrees
  contact : ∀ g ∈ sumset samplingSet G.dimension,
    ((G.dimension * contactParameter + 1 : ℕ) : WithTop ℕ) ≤
      vanishingOrder A polynomial g
  coordinateBounds : G.FactorIndex → ℕ
  coordinateBounds_pos : ∀ i, 1 ≤ coordinateBounds i
  atlas : ∀ g : G.Point, TranslationAtlas A g
  atlas_bound : ∀ g : G.Point, (atlas g).IsBoundedBy coordinateBounds

def SectionFiveInput.scaledDegrees {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveInput G A) : G.FactorIndex → ℕ :=
  fun i => C.coordinateBounds i * C.degrees i

/-- The source sets I₀ = I(G) and I₁ = (I(G), P) explicitly. For r ≥ 2
use its displayed polynomial-operator generators, without assuming that
raw chart substitutions at order zero equal P as an unretained ideal. -/
def SectionFiveInput.idealChain {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveInput G A) : ℕ → Ideal G.CoordinateRing
  | 0 => G.vanishingIdeal Set.univ
  | 1 => G.vanishingIdeal Set.univ ⊔ Ideal.span {C.polynomial}
  | r + 2 => G.vanishingIdeal Set.univ ⊔ Ideal.span
      {Q | ∃ g ∈ sumset C.samplingSet (r + 1),
        ∃ a : (C.atlas g).Index, ∃ order : ℕ,
          order ≤ (r + 1) * C.contactParameter ∧
            ∃ directions : Fin order → Fin A.parameterDimension,
              Q = polynomialOperator ((C.atlas g).chart a) order directions C.polynomial}

/-- The common component selected on p. 380. The dimension equality and
maximal-component selection describe the source's setup, not the counting,
differential-containment, or incomplete-definition conclusions. -/
structure SectionFiveConstruction (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
    extends SectionFiveInput G A where
  index : ℕ
  index_le : index ≤ G.dimension
  dimension_stable :
    varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain index)) =
      varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain (index + 1)))
  selectedPrime : PrimeSpectrum G.CoordinateRing
  minimal_at_index : selectedPrime.asIdeal ∈ (toSectionFiveInput.idealChain index).minimalPrimes
  minimal_at_next : selectedPrime.asIdeal ∈ (toSectionFiveInput.idealChain (index + 1)).minimalPrimes
  meets_group : ComponentMeetsGroup G selectedPrime.asIdeal
  maximal_dimension :
    varietyDimension G (idealZeroLocusOnGroup G selectedPrime.asIdeal) =
      varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain index))
  stabilizer_closed : @IsClosed _ G.zariskiTopology
    (setStabilizer G (idealZeroLocusOnGroup G selectedPrime.asIdeal) : Set G.Point)

def SectionFiveConstruction.chosenIdeal {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveConstruction G A) : Ideal G.CoordinateRing :=
  C.toSectionFiveInput.idealChain C.index

def SectionFiveConstruction.componentPrime {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveConstruction G A) : Ideal G.CoordinateRing :=
  C.selectedPrime.asIdeal

def SectionFiveConstruction.component {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveConstruction G A) : Set G.Point :=
  idealZeroLocusOnGroup G C.componentPrime

def SectionFiveConstruction.stabilizer {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
    (C : SectionFiveConstruction G A) : AlgebraicSubgroup G where
  toAddSubgroup := setStabilizer G C.component
  isClosed := C.stabilizer_closed

end PhilipponMultiplicity
Source
Philippon 1986, §§2–5; 1987 corrections/addenda. https://numdam.org/articles/10.24033/bsmf.2060/
Read-back

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

For all declarations in this bundle, The common data are a field KKK with a nontrivial norm and a product G=∏i=1mGiG=\prod_{i=1}^{m}G_iG=∏i=1m​Gi​ with m>0m>0m>0. Each GiG_iGi​ is a subset of P(KNi+1)\mathbf P(K^{N_i+1})P(KNi​+1), where Ni∈NN_i\in\mathbb NNi​∈N may be zero, equipped with an additive commutative group law; this subset is locally closed in the projective Zariski topology, and addition and negation have local polynomial presentations. More explicitly, at every input and for each output projective factor there is a Zariski open neighborhood in the input projective space and a tuple of input multihomogeneous polynomials of one common multidegree whose evaluated vector is nonzero and represents that output at every input in the neighborhood. Put R=K[Xi,j:1≤i≤m, 0≤j≤Ni]R=K[X_{i,j}:1\le i\le m,\ 0\le j\le N_i]R=K[Xi,j​:1≤i≤m, 0≤j≤Ni​], and let r(x)i,jr(x)_{i,j}r(x)i,j​ be the coordinate of the fixed nonzero representative chosen for the projective point xix_ixi​; evaluation at a group point means P(r(x))P(r(x))P(r(x)). A polynomial is multihomogeneous of multidegree D∈NmD\in\mathbb N^mD∈Nm when every monomial in its support has sum of exponents DiD_iDi​ in block iii; the zero polynomial satisfies this condition for every DDD. The Zariski topology on the ambient product is generated by the sets where one such polynomial evaluates nonzero, and GGG has the topology induced by its inclusion. For V⊆GV\subseteq GV⊆G, write I(V)\mathcal I(V)I(V) for the ideal of RRR generated by all multihomogeneous polynomials, of any multidegree, whose evaluations P(r(x))P(r(x))P(r(x)) vanish for every x∈Vx\in Vx∈V, and write IG=I(G)I_G=\mathcal I(G)IG​=I(G). In particular, this is an ideal span of homogeneous vanishing polynomials. The analytic datum AAA consists of an integer d>0d>0d>0, a real radius ρ>0\rho>0ρ>0, the open ball B={z∈Kd:∥z∥<ρ}B=\{z\in K^d:\|z\|<\rho\}B={z∈Kd:∥z∥<ρ} about zero (with its specified openness and membership 0∈B0\in B0∈B), and a map ϕ:B→G\phi:B\to Gϕ:B→G with ϕ(0)=0\phi(0)=0ϕ(0)=0 and ϕ(x+y)=ϕ(x)+ϕ(y)\phi(x+y)=\phi(x)+\phi(y)ϕ(x+y)=ϕ(x)+ϕ(y) whenever x,y,x+y∈Bx,y,x+y\in Bx,y,x+y∈B. It also contains total coordinate functions Lg(z)i,j∈KL_g(z)_{i,j}\in KLg​(z)i,j​∈K for every g∈Gg\in Gg∈G and z∈Kdz\in K^dz∈Kd. Every such coordinate function is analytic at z=0z=0z=0. For each coordinate, L0L_0L0​ has a formal multilinear power series representing it on the ball of radius ρ\rhoρ; for every z∈Bz\in Bz∈B, each vector L0(z)iL_0(z)_iL0​(z)i​ is nonzero and represents ϕ(z)i\phi(z)_iϕ(z)i​. For every g∈Gg\in Gg∈G, on some neighborhood of 000 all parameters belong to BBB, each vector Lg(z)iL_g(z)_iLg​(z)i​ is nonzero, and its projective point is (g+ϕ(z))i(g+\phi(z))_i(g+ϕ(z))i​. These latter neighborhoods may depend on ggg. Injectivity of ϕ\phiϕ and positivity of its derivative rank are not hypotheses. The parameter space is the full normed vector space KdK^dKd, including points outside BBB. Here Dkf(0)D^k f(0)Dkf(0) denotes the kkkth iterated Fréchet derivative over KKK as a continuous kkk-linear map. Its value for k=0k=0k=0 is f(0)f(0)f(0), with an empty tuple of arguments. At each positive recursive step the Fréchet derivative is defined to be zero if the differentiated function is not differentiable there; these expressions are total. Write eae_aea​ for the vector with coordinate aaa equal to 111 and every other coordinate equal to 000. For any ideal JJJ in one of these block polynomial rings, let hJ(a)h_J(a)hJ​(a) be the dimension over KKK of the image, in R/JR/JR/J, of the vector space of polynomials homogeneous of exact block degree a∈Nma\in\mathbb N^ma∈Nm. Define HJ∈Q[t1,…,tm]\mathscr H_J\in\mathbb Q[t_1,\ldots,t_m]HJ​∈Q[t1​,…,tm​] by choosing a polynomial for which there exists a0∈Nma_0\in\mathbb N^ma0​∈Nm such that HJ(a)=hJ(a)\mathscr H_J(a)=h_J(a)HJ​(a)=hJ​(a) for every aaa with ai≥(a0)ia_i\ge(a_0)_iai​≥(a0​)i​ for all iii, if any such polynomial exists; if none exists, define HJ=0\mathscr H_J=0HJ​=0. Its total degree is the largest sum of monomial exponents in its support, with total degree of zero defined to be zero. Put dim⁡G(V)=deg⁡totHI(V)\dim_G(V)=\deg_{\mathrm{tot}}\mathscr H_{\mathcal I(V)}dimG​(V)=degtot​HI(V)​. The number n=dim⁡(G)n=\dim(G)n=dim(G) used below is, specifically, the sum over iii of the total degrees of the analogous one-block Hilbert polynomials for the homogeneous vanishing ideals of the individual subsets Gi⊆P(KNi+1)G_i\subseteq\mathbf P(K^{N_i+1})Gi​⊆P(KNi​+1); it is a natural number and may be zero. For P∈RP\in RP∈R and g∈Gg\in Gg∈G, the order ord⁡A,g(P)\operatorname{ord}_{A,g}(P)ordA,g​(P) is the infimum in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞} of the natural numbers kkk for which the entire multilinear map Dk(z↦P(Lg(z)))(0)D^k(z\mapsto P(L_g(z)))(0)Dk(z↦P(Lg​(z)))(0) is nonzero. Thus it is the least such kkk if one exists, and is ∞\infty∞ if all these derivatives are zero; order zero tests P(Lg(0))P(L_g(0))P(Lg​(0)). For g∈Gg\in Gg∈G, a translation chart consists of a Zariski open set U⊆GU\subseteq GU⊆G, a degree vector δ∈Nm\delta\in\mathbb N^mδ∈Nm, and polynomials Fi,j∈(KKd)[X]F_{i,j}\in (K^{K^d})[X]Fi,j​∈(KKd)[X]. Every coefficient function of each Fi,jF_{i,j}Fi,j​ that is nonzero as a function is analytic at 000. Every supported monomial of Fi,jF_{i,j}Fi,j​ has degree δi\delta_iδi​ in block iii and degree zero in each other block. Set Ei,j(x,z)=Fi,j(r(x),z)E_{i,j}(x,z)=F_{i,j}(r(x),z)Ei,j​(x,z)=Fi,j​(r(x),z), evaluating coefficient functions at zzz and polynomial variables at r(x)r(x)r(x). For all x∈Gx\in Gx∈G, all iii, and all j,kj,kj,k in block iii, the equality Ei,j(x,z)Lg+x(z)i,k=Ei,k(x,z)Lg+x(z)i,jE_{i,j}(x,z)L_{g+x}(z)_{i,k}=E_{i,k}(x,z)L_{g+x}(z)_{i,j}Ei,j​(x,z)Lg+x​(z)i,k​=Ei,k​(x,z)Lg+x​(z)i,j​ holds on some neighborhood of 000; the neighborhood may depend on x,i,j,kx,i,j,kx,i,j,k. For every x∈Ux\in Ux∈U, on some neighborhood of 000 one has z∈Bz\in Bz∈B and each vector (Ei,j(x,z))j(E_{i,j}(x,z))_j(Ei,j​(x,z))j​ is nonzero and represents (x+g+ϕ(z))i(x+g+\phi(z))_i(x+g+ϕ(z))i​. An atlas for ggg is a family of such charts indexed by an arbitrary type, together with the requirement that every x∈Gx\in Gx∈G belongs to at least one chart domain. Individual chart domains may be empty, and chart degrees may be zero; the coefficient and monomial conditions on a zero coordinate polynomial are vacuous. The atlas index type cannot be empty, because GGG contains zero. A bound c∈Nmc\in\mathbb N^mc∈Nm means δa,i≤ci\delta_{a,i}\le c_iδa,i​≤ci​ for every chart aaa and factor iii. For a chart aaa and P∈RP\in RP∈R, substitute its polynomials Fa,i,jF_{a,i,j}Fa,i,j​ into PPP, embedding each scalar coefficient of PPP as a constant function on KdK^dKd, and write the resulting finite polynomial as ∑αbα(z)Xα\sum_{\alpha}b_\alpha(z)X^\alpha∑α​bα​(z)Xα. For k∈Nk\in\mathbb Nk∈N and an ordered tuple v:{0,…,k−1}→{0,…,d−1}v:\{0,\ldots,k-1\}\to\{0,\ldots,d-1\}v:{0,…,k−1}→{0,…,d−1}, define Da,k,vP=∑αDkbα(0)(ev(0),…,ev(k−1))Xα\mathcal D_{a,k,v}P=\sum_{\alpha}D^k b_\alpha(0)(e_{v(0)},\ldots,e_{v(k-1)})X^\alphaDa,k,v​P=∑α​Dkbα​(0)(ev(0)​,…,ev(k−1)​)Xα. This sum runs over the finite support of the coefficient function polynomial, differentiates the coefficients only, and has no factorial divisor. Directions may repeat. At k=0k=0k=0 the result is the substituted polynomial with coefficient functions evaluated at 000.

idealZeroLocusOnGroup. For GGG and an arbitrary ideal J⊆RJ\subseteq RJ⊆R, this is the subset ZG(J)={x∈G:∀Q∈J, Q(r(x))=0}Z_G(J)=\{x\in G:\forall Q\in J,\ Q(r(x))=0\}ZG​(J)={x∈G:∀Q∈J, Q(r(x))=0}. The universal condition ranges over every polynomial in the ideal, not merely a displayed generating family. No homogeneity or properness condition is imposed on JJJ; the zero ideal gives all of GGG, and the unit ideal gives the empty set.

setStabilizer. For GGG and any subset V⊆GV\subseteq GV⊆G, this is the additive subgroup SV={g∈G:{g+x:x∈V}=V}S_V=\{g\in G:\{g+x:x\in V\}=V\}SV​={g∈G:{g+x:x∈V}=V}. Membership requires equality of the entire translated set. The subset VVV need not be closed, connected, nonempty, or contain zero. If VVV is empty or all of GGG, its stabilizer is all of GGG. Closedness of this subgroup is not part of this definition.

SectionFiveInput. For GGG and AAA as specified, The input consists of a finite subset Σ⊆G\Sigma\subseteq GΣ⊆G with 0∈Σ0\in\Sigma0∈Σ, a natural number TTT, a multidegree vector D∈NmD\in\mathbb N^mD∈Nm, a polynomial P∈RP\in RP∈R which is nonzero as an element of RRR and is multihomogeneous of degree DDD, a vector c∈Nmc\in\mathbb N^mc∈Nm with 1≤ci1\le c_i1≤ci​ for every iii, and, for every g∈Gg\in Gg∈G, a translation atlas bounded coordinatewise by ccc as described above. If Σ(q)\Sigma(q)Σ(q) denotes the finite set of sums of exactly qqq elements of Σ\SigmaΣ, with repetitions permitted, then Σ(0)={0}\Sigma(0)=\{0\}Σ(0)={0} and the input requires nT+1≤ord⁡A,g(P)nT+1\le\operatorname{ord}_{A,g}(P)nT+1≤ordA,g​(P) for every g∈Σ(n)g\in\Sigma(n)g∈Σ(n), with the natural number on the left included in N∪{∞}\mathbb N\cup\{\infty\}N∪{∞}. Thus the threshold is 111 when either n=0n=0n=0 or T=0T=0T=0, and infinite order satisfies the inequality. Individual DiD_iDi​ may be zero, and nonzeroness of PPP does not require that PPP be nonzero as a function on GGG. If every Di=0D_i=0Di​=0, multihomogeneity and P≠0P\ne0P=0 make PPP a nonzero constant, whose order is zero; since 0∈Σ(n)0\in\Sigma(n)0∈Σ(n), that choice cannot satisfy the contact requirement. The fields provide an atlas for every g∈Gg\in Gg∈G, including points outside all of the specified finite sumsets. The existence and coordinatewise bounds of those atlases are hypotheses carried by the input; the required coordinate bound is the non-strict inequality δa,i≤ci\delta_{a,i}\le c_iδa,i​≤ci​, whereas its positivity is the separate condition 1≤ci1\le c_i1≤ci​. There is no requirement that KKK be isometrically isomorphic to a complex or a ppp-adic complex field in this structure.

SectionFiveInput.scaledDegrees. For any input CCC carrying the preceding fields and conditions, the returned degree vector is Di′=ciDiD'_i=c_iD_iDi′​=ci​Di​ for every projective factor iii, using multiplication of natural numbers. Since ci≥1c_i\ge1ci​≥1, the result is zero in every coordinate for which Di=0D_i=0Di​=0; zero coordinates are retained.

SectionFiveInput.idealChain. For any input CCC with polynomial PPP, sampling set Σ\SigmaΣ, contact parameter TTT, and its specified atlases, The sequence of ideals is I0=IGI_0=I_GI0​=IG​, I1=IG+(P)I_1=I_G+(P)I1​=IG​+(P), and, for every q∈Nq\in\mathbb Nq∈N, Iq+2=IG+⟨Da,k,vP: g∈Σ(q+1), a is a chart of the atlas for g, 0≤k≤(q+1)T, v∈{0,…,d−1}k⟩I_{q+2}=I_G+\langle\mathcal D_{a,k,v}P:\ g\in\Sigma(q+1),\ a\text{ is a chart of the atlas for }g,\ 0\le k\le(q+1)T,\ v\in\{0,\ldots,d-1\}^{k}\rangleIq+2​=IG​+⟨Da,k,v​P: g∈Σ(q+1), a is a chart of the atlas for g, 0≤k≤(q+1)T, v∈{0,…,d−1}k⟩. These generators use every chart, including any chart with empty domain; there is no condition that a group point belong to that chart domain when the generator is included. The displayed ideals use ordinary ideal generation in RRR. At T=0T=0T=0 only order-zero operators occur in the terms with index at least 222. In particular the term with index 222 uses g∈Σ(1)g\in\Sigma(1)g∈Σ(1) and orders at most TTT, the term with index 000 is defined as IGI_GIG​ alone, and the term with index 111 is defined directly as IG+(P)I_G+(P)IG​+(P). The clauses form ordinary polynomial-generator ideals; they apply neither localization and contraction nor the locally generated differential-ideal operation.

SectionFiveConstruction. For GGG and AAA, this structure contains all the input data and conditions: 0∈Σ0\in\Sigma0∈Σ, T∈NT\in\mathbb NT∈N, a nonzero multihomogeneous PPP of degree DDD, contact order at least nT+1nT+1nT+1 at every g∈Σ(n)g\in\Sigma(n)g∈Σ(n), natural bounds ci≥1c_i\ge1ci​≥1, and an atlas bounded by ccc for every group point. With the sequence IqI_qIq​ defined by the displayed generator formulas, A construction additionally selects an index r∈Nr\in\mathbb Nr∈N with r≤nr\le nr≤n and requires dim⁡G(ZG(Ir))=dim⁡G(ZG(Ir+1))\dim_G(Z_G(I_r))=\dim_G(Z_G(I_{r+1}))dimG​(ZG​(Ir​))=dimG​(ZG​(Ir+1​)), where ZG(J)={x∈G:∀Q∈J, Q(r(x))=0}Z_G(J)=\{x\in G:\forall Q\in J,\ Q(r(x))=0\}ZG​(J)={x∈G:∀Q∈J, Q(r(x))=0}. It selects a proper prime ideal p\mathfrak pp of RRR that is minimal among prime ideals containing IrI_rIr​ and is also minimal among prime ideals containing Ir+1I_{r+1}Ir+1​. There must exist x∈Gx\in Gx∈G at which every polynomial in p\mathfrak pp evaluates zero. Put V=ZG(p)V=Z_G(\mathfrak p)V=ZG​(p); the construction requires dim⁡G(V)=dim⁡G(ZG(Ir))\dim_G(V)=\dim_G(Z_G(I_r))dimG​(V)=dimG​(ZG​(Ir​)) and requires the additive subgroup S={h∈G:h+V=V}S=\{h\in G:h+V=V\}S={h∈G:h+V=V} to be closed in the specified Zariski topology on GGG. Here h+V={h+x:x∈V}h+V=\{h+x:x\in V\}h+V={h+x:x∈V}, and r=0r=0r=0 is allowed, including when n=0n=0n=0. The prime is not separately required to be multihomogeneous, and its meeting condition forces VVV to be nonempty. This structure includes every field and condition of the input just described. Minimality means that each of IrI_rIr​ and Ir+1I_{r+1}Ir+1​ is contained in p\mathfrak pp and that no strictly smaller prime ideal containing the respective ideal is contained in p\mathfrak pp. The two equalities involving dimension refer to total degrees of the chosen Hilbert polynomials of homogeneous vanishing ideals of the indicated group zero loci, including their explicit zero fallback; they are equalities of natural numbers, not inequalities. The closedness of the full stabilizer is a supplied condition. No existence or uniqueness of a choice of index or prime is asserted by defining this structure.

SectionFiveConstruction.chosenIdeal. For any construction CCC with its inherited input, selected index rrr, common minimal prime, dimension equalities, meeting condition, and closed stabilizer, this ideal is exactly IrI_rIr​: it is IGI_GIG​ when r=0r=0r=0, IG+(P)I_G+(P)IG​+(P) when r=1r=1r=1, and, when r=q+2r=q+2r=q+2, it is IGI_GIG​ plus the ideal generated by the chart coefficient-derivative operators of PPP based at g∈Σ(q+1)g\in\Sigma(q+1)g∈Σ(q+1) and of orders 0≤k≤(q+1)T0\le k\le(q+1)T0≤k≤(q+1)T, for all atlas charts and ordered coordinate directions. This projection performs no further operation on that ideal.

SectionFiveConstruction.componentPrime. For any construction CCC carrying all its input and selection conditions, this returns the underlying proper prime ideal p⊆R\mathfrak p\subseteq Rp⊆R selected in the construction. That prime is minimal over both IrI_rIr​ and Ir+1I_{r+1}Ir+1​, has a common zero in GGG, has group zero-locus dimension equal to that of IrI_rIr​, and has a group zero locus with closed translation stabilizer, as required by the construction. The returned object is the ideal itself.

SectionFiveConstruction.component. For any construction CCC, this is V={x∈G:∀Q∈p, Q(r(x))=0}V=\{x\in G:\forall Q\in\mathfrak p,\ Q(r(x))=0\}V={x∈G:∀Q∈p, Q(r(x))=0}, using the selected prime p\mathfrak pp and the fixed projective representatives. It is a set of group points. Its nonemptiness follows from the construction's explicit meeting condition, and the construction supplies dim⁡G(V)=dim⁡G(ZG(Ir))\dim_G(V)=\dim_G(Z_G(I_r))dimG​(V)=dimG​(ZG​(Ir​)).

SectionFiveConstruction.stabilizer. For any construction CCC, this is an algebraic subgroup in the defined sense: the additive subgroup S={g∈G:g+V=V}S=\{g\in G:g+V=V\}S={g∈G:g+V=V}, with V={x∈G:∀Q∈p, Q(r(x))=0}V=\{x\in G:\forall Q\in\mathfrak p,\ Q(r(x))=0\}V={x∈G:∀Q∈p, Q(r(x))=0}, equipped with the proof that its carrier is closed in the induced Zariski topology which was supplied as a field of CCC. This definition returns the full stabilizer subgroup; it does not take a connected component.

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