Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3 — atlas independence and composition

Proved
PhilipponMultiplicity.proposition_4_3

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

draft-statementphilippon-multiplicity

Proved with no Open theorem dependencies, verified 29 September 2026. Checked locally with Lean 4.33.1 and the proposal’s pinned Mathlib. An independent blind readback is attached.

Polynomial translation/differentiation ideals after retention are independent of the representing atlas and compose by adding both translation points and derivative cutoffs.

Preamble
import Definitions.Def_PhilipponMultiplicity_SectionFour
set_option autoImplicit false
Formal statement
namespace PhilipponMultiplicity

theorem proposition_4_3
    (K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
    (g g' : G.Point) (k k' : ℕ) (I : Ideal G.CoordinateRing)
    (hI : IsMultihomogeneousIdeal G.ambient I)
    (atlas atlas' : TranslationAtlas A g) :
    (retainedPolynomialOperatorIdeal atlas k I =
      retainedPolynomialOperatorIdeal atlas' k I) ∧
    (∀ other : TranslationAtlas A g', ∀ combined : TranslationAtlas A (g + g'),
      retainedPolynomialOperatorIdeal atlas k
        (retainedPolynomialOperatorIdeal other k' I) =
      retainedPolynomialOperatorIdeal combined (k + k') I) := by sorry

end PhilipponMultiplicity
Source
1986, pp.373–374. https://numdam.org/articles/10.24033/bsmf.2060/
Read-back

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

Let KKK be a nontrivially normed field for which there is an isometric field isomorphism either K≅CK\cong\mathbb CK≅C or K≅Cp=PadicComplex⁡(p)K\cong\mathbb C_p=\operatorname{PadicComplex}(p)K≅Cp​=PadicComplex(p) for some prime natural number ppp. Let G=∏i=0q−1GiG=\prod_{i=0}^{q-1}G_iG=∏i=0q−1​Gi​ be a product of a positive finite number qqq of embedded commutative groups over KKK: each GiG_iGi​ is a locally closed subset of PNi(K)\mathbb P^{N_i}(K)PNi​(K), with a specified abelian additive group structure, and addition and negation are locally represented in projective coordinates by tuples of multihomogeneous polynomials of a common multidegree that do not all vanish on the relevant neighborhood. The integers NiN_iNi​ may be zero. Write R=K[Xij:0≤i<q, 0≤j≤Ni]R=K[X_{ij}:0\le i<q,\ 0\le j\le N_i]R=K[Xij​:0≤i<q, 0≤j≤Ni​] for the ambient polynomial ring, and regard elements of GGG as their embedded projective points. The topology on GGG is induced by the ambient topology generated by nonvanishing sets of multihomogeneous polynomials. Evaluating a polynomial at an embedded point uses a chosen nonzero representative in each factor. For S⊆GS\subseteq GS⊆G, write I(S)I(S)I(S) for the ideal generated by all multihomogeneous polynomials whose evaluations vanish at every embedded point of SSS; in particular I(G)I(G)I(G) uses all group points. A polynomial is multihomogeneous when all its supported monomials have the same degree in each coordinate block, and zero is multihomogeneous in every multidegree. No connectedness or positive dimension of the groups is part of this data. The analytic data AAA consist of a positive natural parameter dimension sss, a positive real radius rrr, the open ball B={z∈Ks:∥z∥<r}B=\{z\in K^s:\|z\|<r\}B={z∈Ks:∥z∥<r} about zero, 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. They also include, for every t∈Gt\in Gt∈G, a total coordinate tuple Lt(z)=(Lt,ij(z))L_t(z)=(L_{t,ij}(z))Lt​(z)=(Lt,ij​(z)) on KsK^sKs whose coordinate functions are analytic at zero and which, on some neighborhood of zero, is nonzero in every block and represents t+ϕ(z)t+\phi(z)t+ϕ(z). For t=0t=0t=0, each coordinate admits a formal multilinear power series on the whole ball of radius rrr, and the tuple represents ϕ(z)\phi(z)ϕ(z) and is blockwise nonzero throughout BBB. Injectivity of ϕ\phiϕ is not assumed. Choose g,g′∈Gg,g'\in Gg,g′∈G, natural numbers k,k′k,k'k,k′, and an ideal I⊆RI\subseteq RI⊆R closed under taking every block-multihomogeneous component of each of its polynomials. For t∈Gt\in Gt∈G, a translation chart consists of a Zariski-open set U⊆GU\subseteq GU⊆G, a natural block-degree vector bbb, and polynomials Fij(z;X)F_{ij}(z;X)Fij​(z;X) in the ambient variables whose finitely many nonzero coefficient functions of z∈Ksz\in K^sz∈Ks are analytic at zero. Every supported monomial of FijF_{ij}Fij​ has degree bib_ibi​ in block iii and degree zero in every other block. For every x∈Gx\in Gx∈G and every pair of coordinates j,ℓj,\ellj,ℓ in block iii, the identity Fij(z;x)Lt+x,iℓ(z)=Fiℓ(z;x)Lt+x,ij(z)F_{ij}(z;x)L_{t+x,i\ell}(z)=F_{i\ell}(z;x)L_{t+x,ij}(z)Fij​(z;x)Lt+x,iℓ​(z)=Fiℓ​(z;x)Lt+x,ij​(z) holds near zero, where F(z;x)F(z;x)F(z;x) evaluates the ambient variables at the chosen representative of xxx. For every x∈Ux\in Ux∈U, near zero the tuple F(z;x)F(z;x)F(z;x) is blockwise nonzero and represents x+t+ϕ(z)x+t+\phi(z)x+t+ϕ(z), with those parameter values lying in BBB. These neighborhoods may depend on xxx and, for the compatibility identities, on the coordinate pair. No positivity is imposed on bbb, and a chart domain may be empty. A translation atlas at ttt is an arbitrarily indexed family of such charts whose domains cover every point of GGG; the indexing type is not required to be finite. For a chart CCC, a natural number mmm, an ordered map ν:{0,…,m−1}→{0,…,s−1}\nu:\{0,\ldots,m-1\}\to\{0,\ldots,s-1\}ν:{0,…,m−1}→{0,…,s−1}, and P∈RP\in RP∈R, substitute all Fij(z;X)F_{ij}(z;X)Fij​(z;X) into PPP, write the resulting polynomial as ∑ece(z)Xe\sum_e c_e(z)X^e∑e​ce​(z)Xe, and define DC,m,νP=∑eXe Dmce(0)[eν(0),…,eν(m−1)]\mathcal D_{C,m,\nu}P=\sum_e X^e\,D^mc_e(0)[e_{\nu(0)},\ldots,e_{\nu(m-1)}]DC,m,ν​P=∑e​XeDmce​(0)[eν(0)​,…,eν(m−1)​], using the iterated Fréchet derivative and the standard coordinate vectors of KsK^sKs. Directions may repeat, and for m=0m=0m=0 this just evaluates every substituted coefficient at zero. For an ideal J⊆RJ\subseteq RJ⊆R, define RG(J)=⋂ρ{P∈R:P/1∈JRmρ}\mathcal R_G(J)=\bigcap_\rho\{P\in R:P/1\in J R_{\mathfrak m_\rho}\}RG​(J)=⋂ρ​{P∈R:P/1∈JRmρ​​}, where ρ\rhoρ ranges over every group point together with every tuple of nonzero homogeneous representatives of that point, and mρ=ker⁡(R→K, P↦P(ρ))\mathfrak m_\rho=\ker(R\to K,\ P\mapsto P(\rho))mρ​=ker(R→K, P↦P(ρ)). The family is nonempty because GGG is a group. Thus this is extension to each such maximal-ideal localization followed by contraction and intersection. For an atlas A\mathcal AA, set TA,k(I)=RG(I(G)+⟨DC,m,νP:P∈I is multihomogeneous, C∈A, m≤k, ν:{0,…,m−1}→{0,…,s−1}⟩)\mathcal T_{\mathcal A,k}(I)=\mathcal R_G\bigl(I(G)+\langle\mathcal D_{C,m,\nu}P:P\in I\text{ is multihomogeneous},\ C\in\mathcal A,\ m\le k,\ \nu:\{0,\ldots,m-1\}\to\{0,\ldots,s-1\}\rangle\bigr)TA,k​(I)=RG​(I(G)+⟨DC,m,ν​P:P∈I is multihomogeneous, C∈A, m≤k, ν:{0,…,m−1}→{0,…,s−1}⟩). For any two given translation atlases A,A′\mathcal A,\mathcal A'A,A′ at ggg, the theorem asserts the conjunction TA,k(I)=TA′,k(I)\mathcal T_{\mathcal A,k}(I)=\mathcal T_{\mathcal A',k}(I)TA,k​(I)=TA′,k​(I) and the following composition assertion: for every translation atlas B\mathcal BB at g′g'g′ and every translation atlas C\mathcal CC at g+g′g+g'g+g′, TA,k(TB,k′(I))=TC,k+k′(I)\mathcal T_{\mathcal A,k}(\mathcal T_{\mathcal B,k'}(I))=\mathcal T_{\mathcal C,k+k'}(I)TA,k​(TB,k′​(I))=TC,k+k′​(I). These are equalities of ideals of the ambient polynomial ring, including the localization-and-contraction operation in each occurrence of T\mathcal TT. The hypotheses supply A\mathcal AA and A′\mathcal A'A′ but do not assert that atlases at g′g'g′ or g+g′g+g'g+g′ exist; the second assertion is quantified over any such atlases and is vacuous if the relevant atlas types are empty. Both k=0k=0k=0 and k′=0k'=0k′=0 are included, the ideal III may be zero or the full ring, and no bounds on chart degrees are assumed.

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