Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicity obstruction on named geometric certificates

Open
WeierstrassEllipticZeta.structured_multiplicity_obstruction

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

elliptic-curvestranscendence-theory

Fix an elliptic period pair and its graph quotient extension, together with the entire projective lift, compatible fiber action, chart differential equations, jet identities, truncation function BBB, and contact-ideal identities recorded by the geometry interface. There is a real constant C>0C>0C>0 with the following property.

Let m,n,U≥1m,n,U\ge1m,n,U≥1, let X⊂CX\subset\mathbb CX⊂C be finite with 0∈X0\in X0∈X, and let QQQ be bihomogeneous of bidegree (m,n)(m,n)(m,n). Assume the normalized derivatives have degree at most m+2n+km+2n+km+2n+k, and both charts on X+X+XX+X+XX+X+X have the fixed finite contact certificates of weight 3U+13U+13U+1. At every valid chart point, the normalized polynomial does not belong to the contact ideal of order B(m+2n)B(m+2n)B(m+2n).

Then there are a subgroup HHH of the graph extension group and integers a,b≥0a,b\ge0a,b≥0, with b≤2b\le2b≤2, such that either a=1a=1a=1 and HHH lies in the kernel of the additive projection, or a=0a=0a=0 and HHH lies in the kernel of the elliptic projection, and

(U+1)#(ϕ(X) mod H)≤Cmanb.(U+1)\#(\phi(X)\bmod H)\le C m^a n^b.(U+1)#(ϕ(X)modH)≤Cmanb.

This is the geometric multiplicity obstruction on the named interfaces. All accumulated finite-algebra certificates remain available, while the quantitative subgroup estimate is the conclusion to be proved.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry
open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.structured_multiplicity_obstruction (G : Frontier.Geometry) :
    ∃ C : ℝ, 0 < C ∧ ∀ m n U : ℕ,
          1 ≤ m → 1 ≤ n → 1 ≤ U → ∀ X : Finset ℂ,
          0 ∈ X → ∀ Q : MvPolynomial (Fin 7) ℂ,
            (∀ d ∈ Q.support, d 0 + d 1 = m ∧
              d 2 + d 3 + d 4 + d 5 + d 6 = n) →
            (∀ (c : Fin 2) (z : ℂ), G.S (extensionChartDenominator c) z ≠ 0 →
              extensionChartNormalize c Q ∉ extensionChartContactIdeal G.L.g₂ G.L.g₃ c
                (extensionChartCoordinates G.S c z) (G.B (m + 2 * n))) →
            (∀ (c : Fin 2) (k : ℕ),
              ((extensionChartDerivation G.L.g₂ G.L.g₃ c)^[k] (extensionChartNormalize c Q)).totalDegree ≤
                m + 2 * n + k) →
            Frontier.HasChartCertificates G m n U X Q →
            Frontier.SubgroupBound G C m n U X := by sorry
Source
Structural reorganization of the exact open frontier WeierstrassEllipticZeta.spectral_factor_nilradical_multiplicity_obstruction, https://prove2.me/theorems/39b4eb14-daee-45cf-8bec-ecd2560be211. The mathematical setting is Senthil Kumar K (2026), Appendix A.2 and Theorem A.2, https://doi.org/10.1017/S001309152610145X. The interfaces and equivalence proofs are derived here, rather than quoted from the article.

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