Bounded polynomial coefficient selection and small-value transfer
ProvedTranscendenceTheory.small_values_of_bounded_bivariate_systemslinear-algebrapolynomialstranscendence
Let . Suppose there are such that every sufficiently large integer admits a bounded bivariate system at : polynomial equations and test forms with the degree, height, dimension, and small-value properties in BoundedBivariateSystem.
Then there exist and, for every sufficiently large , a polynomial such that
No algebraic independence or integrality assumption on is needed for this transfer. This isolates the finite coefficient-selection and polynomial-recombination step of the auxiliary-function argument. Constructing the systems, including their analytic estimates, is a separate hypothesis.
Preamble
import Definitions.Def_TranscendenceTheory_BoundedBivariateSystem open scoped Polynomial open Filter TranscendenceTheory
Formal statement
theorem TranscendenceTheory.small_values_of_bounded_bivariate_systems (θ ν : ℂ)
(h_systems : ∃ a c : ℝ, 0 < a ∧ 0 < c ∧
∀ᶠ N : ℕ in atTop, Nonempty (BoundedBivariateSystem θ ν a c N)) :
∃ A c : ℝ, 0 < A ∧ 0 < c ∧
∀ᶠ N : ℕ in atTop, ∃ P : ℤ[X][X],
(P.natDegree : ℝ) ≤ A * N ∧
(∀ j, ((P.coeff j).natDegree : ℝ) ≤ A * N) ∧
(∀ j k, |((P.coeff j).coeff k : ℝ)| ≤ Real.exp (A * N)) ∧
P.eval₂ (Polynomial.aeval θ).toRingHom ν ≠ 0 ∧
‖P.eval₂ (Polynomial.aeval θ).toRingHom ν‖ ≤
Real.exp (-c * (N : ℝ) ^ 2 * Real.log N) := by sorry
Source
Senthil Kumar K (2026), Section 3 Lemma 2 (coefficient expansion and Siegel lemma), Section 5 Lemma 8 (auxiliary coefficient selection), and Lemma 10 (linear combination of cleared derivative values). Explicit rectangular polynomial bounds replace field degree/type notation. The conclusion follows conditionally on bounded systems; their construction is not asserted here. https://www.cambridge.org/core/journals/proceedings-of-the-edinburgh-mathematical-society/article/algebraic-independence-of-values-of-weierstrass-elliptic-and-zeta-functions/E91A8EEEB1F63536D95D1DE7D7DD47E2