Transfer from bounded complex coefficients to polynomial auxiliary systems
ProvedTranscendenceTheory.bounded_system_of_complex_auxiliary_systemFix and such that every polynomial vanishing at is divisible by . Let and .
Suppose a complex auxiliary system at has arithmetic exponent , complex coefficient exponent , and small-value exponent , where
Assume its outer degree bound satisfies . Then
Thus the same equations and test forms satisfy the polynomial-vector small-value requirement of BoundedBivariateSystem. Reducedness ensures nonvanishing after evaluation, while the size, degree, and coefficient bounds give the required complex coefficient bound. This transfers an analytic estimate for bounded complex vectors to the interface used by integer Siegel selection.
Formalization Note. This is a single- statement and does not require positive . Positivity is imposed by the mission's eventual system-existence theorem. It assumes the complex system's analytic estimate and does not establish that estimate.
import Definitions.Def_TranscendenceTheory_BoundedBivariateSystem import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem open Polynomial TranscendenceTheory open scoped Polynomial
theorem TranscendenceTheory.bounded_system_of_complex_auxiliary_system (θ ν : ℂ) (g : ℤ[X][X])
(hker : ∀ p : ℤ[X][X], p.eval₂ (aeval θ).toRingHom ν = 0 → g ∣ p)
(a c : ℝ) (N : ℕ)
(S : ComplexAuxiliarySystem θ ν a ((3 + ‖θ‖ + ‖ν‖) * a) c N)
(hred : S.yDegree < g.natDegree) :
Nonempty (BoundedBivariateSystem θ ν a c N) := by sorry