Degree-uniform exact ideal truncation in both Weierstrass charts
ProvedWeierstrassEllipticZeta.elliptic_chart_uniform_jet_capFor every fixed period pair L, there exists a positive monotone function B from natural degrees to natural derivative orders. It works simultaneously for both Weierstrass charts and every auxiliary polynomial Q of any given bidegree (m,n).
Write d=m+2n and J_T=(F_c,Q_c,D_c Q_c,...,D_c^T Q_c), the chart ideal with the explicit cubic F_c and normalized polynomial Q_c. At every order T there is exact ideal equality
J_T = J_min(T,B(d)).
The displayed generators of the capped ideal have total degree at most max(3,d+B(d)). Their number is min(T,B(d))+2, hence at most B(d)+2. Both upper bounds are independent of T and of the coefficients of Q for fixed d and L. The theorem includes all natural m,n,T, including zero.
Earlier work supplied a degree-uniform cutoff for detecting common zeros of jets. The new conclusion is equality of ideals under every coefficient specialization, which also preserves nonreduced multiplicities and localized lengths. The existing individual jet-degree estimates are reused. The proof is non-effective: it supplies no numerical B(d) or growth bound in d. In particular it does not establish A.1's required Cmn^2 or C*n^2 estimate.
import Definitions.Def_WeierstrassEllipticZeta_CappedChartJets open TranscendenceTheory WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.elliptic_chart_uniform_jet_cap (L : PeriodPair) :
∃ B : ℕ → ℕ, Monotone B ∧ (∀ d, 0 < B d) ∧
∀ (m n : ℕ) (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) (T : ℕ),
extensionChartJetIdeal L Q c T =
extensionChartJetIdeal L Q c (min T (B (m + 2 * n))) ∧
∀ j : Fin (min T (B (m + 2 * n)) + 2),
(extensionChartJetGenerator L Q c (min T (B (m + 2 * n))) j).totalDegree ≤
max 3 (m + 2 * n + B (m + 2 * n)) := by sorry