Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tighter elliptic section dimension: coefficient 30 reduced to 7

Proved
WeierstrassEllipticZeta.elliptic_first_chart_tight_section_dimension

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

algebraic-geometrynumber-theory

Let LLL be a period pair, m≥0m\ge0m≥0 and n≥1n\ge1n≥1. Let Vm,nV_{m,n}Vm,n​ be the complex vector space spanned by restrictions of bihomogeneous sections of bidegree (m,n)(m,n)(m,n) to the first cubic Weierstrass chart. This space is finite dimensional and satisfies

(m+1)(n+1)2≤dim⁡CVm,n,2dim⁡CVm,n≤7(m+1)n(n+1).(m+1)(n+1)^2\le\dim_{\mathbb C}V_{m,n},\qquad 2\dim_{\mathbb C}V_{m,n}\le7(m+1)n(n+1).(m+1)(n+1)2≤dimC​Vm,n​,2dimC​Vm,n​≤7(m+1)n(n+1).

In particular,

dim⁡CVm,n≤7(m+1)n2.\dim_{\mathbb C}V_{m,n}\le7(m+1)n^2.dimC​Vm,n​≤7(m+1)n2.

This improves the previously proved uniform upper coefficient from 303030 to 777, with no change of space or additional geometric assumptions. The lower bound is reused from the already-Proved section-growth theorem. The new upper bound is a count of a spanning family; it is not claimed to be the exact dimension. The separate geometric comparison between chart costs and section dimension remains unproved.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_TightCubicSections
import Mathlib.Tactic

noncomputable section
open scoped Classical
open WeierstrassEllipticZeta MvPolynomial
Formal statement
theorem WeierstrassEllipticZeta.elliptic_first_chart_tight_section_dimension (L : PeriodPair) (m n : ℕ)
    (hn : 1 ≤ n) :
    Module.Finite ℂ (firstChartSectionSpace L m n) ∧
    (m + 1) * (n + 1) ^ 2 ≤ Module.finrank ℂ (firstChartSectionSpace L m n) ∧
    2 * Module.finrank ℂ (firstChartSectionSpace L m n) ≤
      7 * (m + 1) * n * (n + 1) ∧
    Module.finrank ℂ (firstChartSectionSpace L m n) ≤ 7 * (m + 1) * n ^ 2 := by sorry
Source
Derived quantitative refinement of WeierstrassEllipticZeta.elliptic_first_chart_section_dimension, https://prove2.me/theorems/13b6bf3d-1364-403b-8b54-d9e68f950754. Existing normalization uses the cubic relation y^2=4*x^3-g2*x-g3 and substitutes (1,t;1,x,y,u,y*u+2*x^2). Retaining the fibre exponent c<=n and the coupled weight 2*a+3*b+c<=4*n, b<2, gives exactly (m+1)*sum(c=0..n)(4*n-c)=(7/2)*(m+1)*n*(n+1) spanning monomials for n>=1. Thus the previously Proved uniform coefficient 30 is replaced by 7. The lower bound (m+1)*(n+1)^2 is reused from the Proved section-growth theorem https://prove2.me/theorems/af52a388-2af4-4817-ace8-f041f281a3c2. Pinned arithmetic source: Finset.sum_range_id_mul_two, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Algebra/BigOperators/Intervals.lean. Source context for the projective coordinates: Senthil Kumar K (2026), Appendix A.2, exponential mapping and the chart display preceding Lemma A.1, https://www.cambridge.org/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/algebraic-independence-of-values-of-weierstrass-elliptic-and-zeta-functions/E91A8EEEB1F63536D95D1DE7D7DD47E2#app1. This sharper dimension estimate is derived here, not quoted as a theorem of that paper. Frontier https://prove2.me/theorems/2cdf9a4f-11a1-457e-a98e-81ce6ee0b5e8 is reduced to the actual section-dimension budget W_min*E_min<=C*dim V_(m,n). That budget implies the parent with constant 7*C; the checked converse retains the parent constant using the existing lower dimension bound. The global geometric comparison remains unproved, and the integer-search bound is unchanged.

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