Analytic extraction with arithmetic derivative decay supplied
ProvedWeierstrassEllipticZeta.exists_complex_auxiliary_systems_from_arithmetic_jet_decayLet be a complex period pair, and let have regular auxiliary-grid data. Thus integer grid points are distinct, their lattice congruences are determined by their first two coordinates, and every point shifted by is outside the lattice. The finite grids have cardinality and shifted radius at most
The data also include the elliptic periodicity formulas and
Assume the canonical zeta derivative identity and the multiplied elliptic and zeta addition identities at regular arguments. Let be transcendental over , let , and let be monic of positive -degree with
For a fixed with , assume the eighteen auxiliary values admit presentations of -degree less than after multiplication by . Those values are
Assume reduced arithmetic jet-system data as follows.
Fix a period pair , complex numbers , and . For a polynomial, denotes the sum of the absolute values of all integer coefficients.
Reduced arithmetic jet-system data mean that there exist positive integers with the following property. For any nonnegative , let
Choose eight numerator and denominator polynomials , whose total degrees are at most and lengths at most , respectively. There exists a matrix
of integer bivariate polynomials. Writing , every entry satisfies
This matrix precedes the following points and coefficient vectors. For any outside the lattice, suppose the coordinate presentations satisfy
where
For , set
The exact entry evaluations are
If additionally is regular and all eight evaluated denominators are nonzero, then for every complex vector ,
where
The exact evaluation identities also hold with zero coordinate denominators; nonzero denominators are required only for kernel equivalence. Constants are uniform in all cutoffs, orders, and presentations. The property assembles bounded reduced derivative presentations into finite linear equations. It does not produce grid-coordinate presentations, prove that their denominators are nonzero, choose asymptotic parameters, or establish a small nonzero test value.
Also assume auxiliary-grid interpolation data as follows.
Fix complex numbers . For a triple of nonnegative integers , let
Auxiliary-grid interpolation data mean the following property. Choose a nonnegative integer , functions , with entire and analytic at every point of . Suppose in a neighborhood of each grid point and
For all and with and on , put . Then
and, whenever and ,
The multiplier need not be nonzero. Empty grids and are included. This predicate records the effect of analytic regularization and interpolation once the regularized entire function and its outer-circle bound have been provided. It does not assert existence or growth estimates for a Weierstrass sigma regularizer.
Also assume the following elliptic regularization data.
Fix a period pair and complex numbers . Write
Elliptic regularization data mean the following property. Supply entire functions satisfying
For any finite index set , complex shift , complex coefficients , and nonnegative integers with
put
There is an entire function , chosen independently of the radius, grid, and bounds, with outside the lattice. If bounds the absolute values of throughout , define
Then on . Moreover, choose nonnegative integers and radii such that
Suppose all derivatives of below order vanish on
Then, with ,
The definition supplies the analytic extension and its interpolation consequences conditional on the four entire factors and their bounds. It does not assert existence of those factors or an order-two growth bound for them. At lattice points the entire extension need not equal the product formed from totalized meromorphic values.
Also assume cleared-addition entire data, as follows.
Let be a complex period pair, with lattice and canonical functions . Assume their multiplied addition identities at regular arguments. Supply entire functions satisfying
Let be any finite index set, let , and choose complex coefficients and nonnegative integers with
Define the translated, cleared auxiliary sum
There exists a single entire function , chosen before any radius or bounds, with
Put
For every and , if all four basic entire functions are bounded in absolute value by on , then
The finite set may be empty, coefficients may vanish, and is allowed. Neither nor the addition factor is assumed nonzero. The identity is restricted to regular arguments; the entire extension supplies its own values at poles. This is a conditional version of the construction in Lemma 6(ii), with a coarse explicit growth constant. It does not construct the basic sigma factors or assert the source's sharper displayed numerical bound.
For fixed , cleared-addition entire data assert the preceding entire-extension and disk-bound property for every choice of the four basic factors, regular shift, finite coefficients, and exponents. The data also assert the following interpolation consequences for the same entire function .
Let and be nonnegative integers. Suppose , , the four factors are bounded by on the closed radius- disk, and
Write
Assume for every , and
Then
The entire function precedes all choices of grids, radii and bounds. The data do not provide the four basic factors, establish their nonvanishing or growth, or prove that a test value is nonzero.
Also assume the following period arithmetic jet-system data at .
For fixed , a monic relation , and , the period arithmetic jet-system data assert the following uniform property. Write and . There exist positive integers such that for every integer and nonnegative integers , with
there is a matrix over satisfying
The same matrix, chosen before all coefficient vectors, satisfies for every
The denominator exponent is a uniform padding from coordinatewise clearing. It is explicitly coarser than the exponent in source equation (28); the degree and logarithmic height still have the required linear dependence on the degree and derivative parameters. The data concern only shifts by integer multiples of . They neither supply coordinates at other grid points nor prove the zero estimate.
Also assume the following rounded-parameter and actual-grid estimates.
For a nonnegative integer , define
Only sufficiently large enter the estimates. The formal definitions use nonnegative integer floors, which agree with the displayed floors there. The constant is one explicit small choice for the source's freely chosen grid constant.
Write for the period lattice and put
The grid parameter data assert that, for every fixed , all sufficiently large satisfy
Here the grids are the actual finite sets, so their cardinalities count distinct points. All shifted points are regular, including shifts whose unshifted point lies in the lattice. The counts allow vanishing conditions on the entire shifted grid; the data do not assert that an auxiliary function satisfying those conditions has already been constructed. Basic sigma factors, arithmetic coordinate presentations, coefficient envelopes, and the zero estimate are separate obligations.
Also assume the following uniform decay data on translated grids.
For fixed complex , put
The decay data assert the following proposition for every fixed and , for all sufficiently large integers , uniformly in all subsequent choices.
Let and write . Supply functions such that is entire, while are analytic near every point of and satisfy locally there. Assume
For every complex and nonnegative integer with
the regularized derivative satisfies
If are also analytic near , with there, and
then
The double inner radius accommodates arbitrary translates with . The constant is a coarse explicit choice, not a quoted constant from the source. This predicate supplies the interpolation implication; construction and growth of the basic sigma factors, the inverse multiplier bound, and a nonzero test derivative remain separate obligations. No regularity or nonvanishing is inferred from totalized meromorphic values.
Also assume the following bounded period-jet data at .
Fix a complex period pair , complex numbers , and polynomials , . Write , , and let be the sum of the absolute values of all integer coefficients of .
For sufficiently large positive integers , use the auxiliary parameters
Bounded auxiliary period-jet data mean the following property. For every fixed nonnegative integer , there is a real constant such that, for all sufficiently large , one can choose a nonnegative integer with
This same degree bound works for every integer satisfying . For each such , there is a matrix
such that, for every entry and every nonnegative ,
Writing , the exact evaluations are
Moreover, for every complex coefficient vector , set
The same matrix satisfies
The constant and threshold precede the period index, the matrix precedes the vector, and is common to all period indices. The length bound also bounds each individual integer coefficient. Order zero, , and both signs of are included. The padded denominator exponent is inherited from the earlier period-jet construction; it is coarser than the source's exponent in (28). These data do not assert a nonzero derivative or any estimates at nonlattice translates.
Also assume the following conditional nonlattice matrix bounds.
Fix a complex period pair , complex numbers , and . Write and let denote the sum of the absolute values of all integer coefficients of .
For all sufficiently large positive integers , put
For nonnegative integers , define the eight coordinate degree and logarithmic length bounds
The derivative weights are
Bounded auxiliary nonlattice jet data assert that, for every , there is such that, for all sufficiently large , one can choose a nonnegative integer satisfying
This degree bound is chosen before the following coordinate presentations. Choose eight numerator and denominator polynomials and nonnegative integer length bounds such that
There is a polynomial matrix
with
The matrix is chosen before any complex evaluation points . Suppose lie outside the period lattice and
Put
Then the exact entry evaluations are
If in addition lies outside the lattice and every is nonzero, then, for every complex vector , writing
the same matrix satisfies
The constant and threshold precede all coordinate polynomials; is common to every presentation and derivative order. The matrix precedes the points and vectors. Both and are allowed. Zero denominators are permitted for the exact evaluation identity, and nonzero evaluated denominators are explicit hypotheses of the kernel equivalence. This is a conditional bound for nonlattice derivative matrices: existence of coordinate presentations satisfying the profiles, their denominator nonvanishing, and a nonzero test derivative are separate obligations.
Also assume assembled grid jet-matrix data, including the retained coordinate presentations, as follows.
Fix a complex period pair with lattice , and complex numbers . Write and let be the sum of the absolute values of the integer coefficients of a polynomial . For a nonnegative integer , put
For a nonnegative integer , use the coordinate degree and logarithmic length profiles
A coordinate presentation at consists of eight numerator polynomials , denominator polynomials in , and nonnegative integers , such that
Auxiliary nonlattice coordinate data assert
The constant and threshold precede all points. Every evaluated denominator is nonzero. The four fixed-coordinate bounds are independent of , the ordinary coordinate has fixed degree and polynomial length in , and the three moving elliptic coordinates have degree and logarithmic length . No derivative matrices or analytic estimates are part of this coordinate property.
With the coordinate presentations and notation just specified, let , , , and . Put
Auxiliary grid jet-matrix data assert that there is a single nonnegative integer such that, for each nonnegative integer , there is with the following property for every sufficiently large . There are a nonnegative integer , a polynomial matrix family
and coordinate presentations with the profiles at every nonlattice point of , satisfying
Define the ordinary monomials and cleared translates by
Write for the denominators in the retained presentation at a nonlattice point, and put
The entries retain their exact evaluations in both cases:
For every point and every complex coefficient vector , writing , the same matrix family satisfies
The matrices and retained presentations precede every coefficient vector. Their degree and length bounds are uniform in the grid point, derivative order, and monomial. Order zero and are included. The dimension gap refers to the smaller grid with equations per point; it does not assert a dimension gap for the whole enlarged derivative family. This interface supplies matrices and their derivative interpretation, while existence and estimates for a nonzero analytic test value remain separate.
In addition, suppose a normalized entire sigma differential solution and three entire functions are supplied, with
Suppose a single real constant bounds these four entire functions globally:
Assume also that outside . For all sufficiently large integers , suppose that the two sigma regularizers obey
Here is the auxiliary degree, , and , as in the supplied grid data.
Assume additionally the following decay property for the period arithmetic values. Write . For every fixed real and , all sufficiently large satisfy the following assertion uniformly in . For , let
If all derivatives of orders vanish at every point of the smaller shifted grid, then for every lattice point and nonnegative integer with all lower derivatives of zero at , one has
The exponent of is exactly the padded exponent used by the supplied period-jet matrices. This hypothesis asserts smallness conditional on lower-derivative vanishing; it does not assert a nonzero derivative.
Assume additionally the following uniform growth envelope after clearing a common moving-coordinate denominator. For every fixed real , all sufficiently large integers satisfy the following assertion, uniformly in the subsequent choices. Use the same and . Let , let with , and let satisfy
Set
There is an entire , chosen before , with
The scalar may be zero. The assertion supplies an entire extension and its outer bound; derivative vanishing and recovery are subsequent obligations.
Assume additionally the following uniform nonlattice derivative decay. For every fixed real and , all sufficiently large integers satisfy the following assertion uniformly in all subsequent choices. Put and
Suppose vanishes on the smaller shifted grid for every . For every and every complex satisfying
every nonnegative integer with for satisfies
The scalar may be zero. This estimate is conditional on the given common-denominator bound and lower-derivative vanishing; it does not construct or assert a nonzero derivative.
Assume additionally fully denominator-cleared nonlattice derivative decay. For every fixed , and , all sufficiently large work uniformly in the following data. Let
Suppose its derivatives of orders below vanish on the smaller shifted grid. For each , each NonlatticeCoordinatePresentation for , and each integer whose lower derivatives vanish at , put
Then
All eight denominator powers are included. This remains a conditional size estimate: the derivative may be zero, and no bounded-order nonzero derivative is asserted.
Then there exist such that every sufficiently large admits a complex auxiliary system with
The system has the degree, height, size, and dimension-gap bounds in ComplexAuxiliarySystem. Every nonzero vector in its evaluated equation kernel with coordinate magnitudes at most has a nonzero test value of magnitude at most . The matrices and finite test family precede the choice of vector.
The original hypotheses and exact complex-auxiliary-system conclusion are retained. Both the period estimate and the fully denominator-cleared nonlattice estimate are inputs. Remaining work includes the bounded-order nonzero derivative, conversion to the exact matrix-row evaluations, and assembly of the finite test family before the coefficient vector is selected.
import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Definitions.Def_WeierstrassEllipticZeta_GridJetMatrices import Definitions.Def_WeierstrassEllipticZeta_NonlatticeJetBounds import Definitions.Def_WeierstrassEllipticZeta_PeriodJetBounds import Definitions.Def_WeierstrassEllipticZeta_InterpolationDecay import Definitions.Def_WeierstrassEllipticZeta_AuxiliaryParameters import Definitions.Def_WeierstrassEllipticZeta_ReducedJetSystems import Definitions.Def_WeierstrassEllipticZeta_GridInterpolation import Definitions.Def_WeierstrassEllipticZeta_EntireRegularization import Definitions.Def_WeierstrassEllipticZeta_ClearedEntire import Definitions.Def_WeierstrassEllipticZeta_PeriodJets import Definitions.Def_WeierstrassEllipticZeta_AuxiliaryGrids import Definitions.Def_TranscendenceTheory_ComplexAuxiliarySystem import Mathlib.RingTheory.Algebraic.Defs import Mathlib.Algebra.Polynomial.AlgebraMap open scoped Polynomial open Filter open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.exists_complex_auxiliary_systems_from_arithmetic_jet_decay
(L : PeriodPair) (ω u₁ u₂ : ℂ)
(h_grid : RegularAuxiliaryGridData L ω u₁ u₂)
(h_parameters : AuxiliaryGridParameterData L ω u₁ u₂)
(h_decay : AuxiliaryGridDecayData ω u₁ u₂)
(h_zeta_deriv : ∀ z : ℂ, z ∉ L.lattice →
HasDerivAt (weierstrassZeta L) (-L.weierstrassP z) z)
(h_zeta_addition : ∀ z v : ℂ,
z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
2 * (L.weierstrassP v - L.weierstrassP z) * weierstrassZeta L (z + v) =
2 * (weierstrassZeta L z + weierstrassZeta L v) *
(L.weierstrassP v - L.weierstrassP z) +
L.derivWeierstrassP v - L.derivWeierstrassP z)
(h_wp_addition : ∀ z v : ℂ,
z ∉ L.lattice → v ∉ L.lattice → z + v ∉ L.lattice →
4 * (L.weierstrassP v - L.weierstrassP z) ^ 2 * L.weierstrassP (z + v) =
-4 * (L.weierstrassP z + L.weierstrassP v) *
(L.weierstrassP v - L.weierstrassP z) ^ 2 +
(L.derivWeierstrassP v - L.derivWeierstrassP z) ^ 2)
(θ : ℂ) (hθ : Transcendental ℚ θ)
(ν : ℂ)
(g : ℤ[X][X]) (hg_monic : g.Monic) (hg_degree : 0 < g.natDegree)
(hg_kernel : ∀ p : ℤ[X][X],
p.eval₂ (Polynomial.aeval θ).toRingHom ν = 0 ↔ g ∣ p)
(h_jet_systems : ReducedArithmeticJetSystemData L θ ν g)
(h_nonlattice_bounds : BoundedAuxiliaryNonlatticeJetData L θ ν g)
(h_interpolation : AuxiliaryGridInterpolationData ω u₁ u₂)
(h_regularization : EllipticRegularizationData L ω u₁ u₂)
(h_cleared_entire : ClearedAdditionEntireData L ω u₁ u₂)
(d : ℤ[X]) (hd : Polynomial.aeval θ d ≠ 0)
(h_period_jets : PeriodArithmeticJetSystemData L ω (u₁ / 2) θ ν g d)
(h_period_bounds : BoundedAuxiliaryPeriodJetData L ω (u₁ / 2) θ ν g d)
(h_grid_matrices : AuxiliaryGridJetMatrixData L ω u₁ u₂ θ ν g d)
(h_data : ∀ i : Fin 18, ∃ p : ℤ[X][X],
p.natDegree < g.natDegree ∧
p.eval₂ (Polynomial.aeval θ).toRingHom ν = Polynomial.aeval θ d *
(![L.g₂/4, L.g₃/4, ω, zetaQuasiPeriod L ω, u₁/2, u₂,
weierstrassZeta L (u₁/2), L.weierstrassP (u₁/2),
L.derivWeierstrassP (u₁/2), deriv L.derivWeierstrassP (u₁/2),
L.weierstrassP u₁, L.derivWeierstrassP u₁, deriv L.derivWeierstrassP u₁,
weierstrassZeta L u₁, L.weierstrassP u₂, L.derivWeierstrassP u₂,
deriv L.derivWeierstrassP u₂, weierstrassZeta L u₂] i))
(D : EllipticSigmaDifferentialData L) (S : Fin 3 → ℂ → ℂ)
(h_factors_entire : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(h_factors_eq : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 3,
S j z = D.sigma z ^ (j.val + 1) * ellipticPoleCoordinates L z j)
(A : ℝ) (hA : 0 < A)
(h_sigma_growth : ∀ z : ℂ, ‖D.sigma z‖ ≤ Real.exp (A * (1 + ‖z‖ ^ 2)))
(h_factor_growth : ∀ (z : ℂ) (j : Fin 3),
‖S j z‖ ≤ Real.exp (A * (1 + ‖z‖ ^ 2)))
(h_sigma_nonzero : ∀ z : ℂ, z ∉ L.lattice → D.sigma z ≠ 0)
(h_sigma_inverse : ∀ᶠ N : ℕ in Filter.atTop,
‖D.sigma (u₁ / 2) ^ (15 * auxiliaryL N)‖⁻¹ ≤ Real.exp ((N : ℝ) ^ 2) ∧
∀ v ∈ auxiliaryGrid u₁ u₂ ω
![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
v ∈ L.lattice →
‖D.sigma (u₁ / 2 + v) ^ (3 * auxiliaryL N)‖⁻¹ ≤
Real.exp ((N : ℝ) ^ 2))
(h_period_decay : ∀ B K : ℝ, 0 ≤ B → 0 < K → ∀ᶠ N : ℕ in atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∀ i, ‖c i‖ ≤ Real.exp (B * N)) →
let f : ℂ → ℂ := fun z => ∑ i, c i * z ^ i.1.val *
L.weierstrassP z ^ i.2.1.val * weierstrassZeta L z ^ i.2.2.val
(∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω
![auxiliaryS N, auxiliaryS N, auxiliaryS3 N],
∀ j < m + 1, iteratedDeriv j f x = 0) →
∀ v ∈ auxiliaryGrid u₁ u₂ ω
![3 * auxiliaryS N, 3 * auxiliaryS N, 3 * auxiliaryS3 N],
v ∈ L.lattice → ∀ n : ℕ, (n : ℝ) ≤ K * m →
(∀ j < n, iteratedDeriv j f (u₁ / 2 + v) = 0) →
‖(Polynomial.aeval θ d) ^ (7 * (m + 2 * l + n)) * iteratedDeriv n f (u₁ / 2 + v)‖ ≤
Real.exp (-(N : ℝ) ^ 2 * Real.log N / 147456))
(h_scaled_cleared_growth : ∀ B : ℝ, 0 ≤ B → ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
let s := auxiliaryS N
let R := auxiliaryRadius N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∑ i, ‖c i‖) ≤ Real.exp (B * N) →
∀ v : ℂ, ‖v‖ ≤ R → v ∉ L.lattice → ∀ Q : ℂ,
‖Q‖ + ‖Q * weierstrassZeta L v‖ + ‖Q * L.weierstrassP v‖ +
‖Q * L.derivWeierstrassP v‖ ≤ Real.exp (B * ((s : ℝ) ^ 2 + Real.log N)) →
∃ G : ℂ → ℂ, AnalyticOnNhd ℂ G Set.univ ∧
(∀ z : ℂ, z ∉ L.lattice → z + v ∉ L.lattice →
G z = D.sigma z ^ (15 * l) * (Q ^ (5 * l) *
clearedAuxiliarySum L v c (fun i => i.1.val) (fun i => i.2.1.val)
(fun i => i.2.2.val) l z)) ∧
∀ z : ℂ, ‖z‖ ≤ R → ‖G z‖ ≤ Real.exp ((11 * B + 112) * (N : ℝ) ^ 2))
(h_nonlattice_decay : ∀ B K : ℝ, 0 ≤ B → 0 < K → ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
let s := auxiliaryS N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∑ i, ‖c i‖) ≤ Real.exp (B * N) →
let F : ℂ → ℂ := fun w => ∑ i, c i * w ^ i.1.val *
L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val
(∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω ![s, s, auxiliaryS3 N],
∀ j < m + 1, iteratedDeriv j F x = 0) →
∀ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * auxiliaryS3 N],
v ∉ L.lattice → ∀ Q : ℂ,
‖Q‖ + ‖Q * weierstrassZeta L v‖ + ‖Q * L.weierstrassP v‖ +
‖Q * L.derivWeierstrassP v‖ ≤ Real.exp (B * ((s : ℝ) ^ 2 + Real.log N)) →
∀ n : ℕ, (n : ℝ) ≤ K * m →
(∀ j < n, iteratedDeriv j F (u₁ / 2 + v) = 0) →
‖Q ^ (5 * l) * (2 * (L.weierstrassP v - L.weierstrassP (u₁ / 2))) ^
(3 * l) * iteratedDeriv n F (u₁ / 2 + v)‖ ≤
Real.exp (-(N : ℝ) ^ 2 * Real.log N / 73728))
(h_arithmetic_nonlattice_decay : ∀ (C : ℕ) (B K : ℝ), 0 ≤ B → 0 < K → ∀ᶠ N : ℕ in Filter.atTop,
let m := auxiliaryL0 N
let l := auxiliaryL N
let s := auxiliaryS N
∀ c : Fin (m + 1) × Fin (l + 1) × Fin (l + 1) → ℂ,
(∑ i, ‖c i‖) ≤ Real.exp (B * N) →
let F : ℂ → ℂ := fun w => ∑ i, c i * w ^ i.1.val *
L.weierstrassP w ^ i.2.1.val * weierstrassZeta L w ^ i.2.2.val
(∀ x ∈ shiftedAuxiliaryGrid u₁ u₂ ω ![s, s, auxiliaryS3 N],
∀ j < m + 1, iteratedDeriv j F x = 0) →
∀ v ∈ auxiliaryGrid u₁ u₂ ω ![3 * s, 3 * s, 3 * auxiliaryS3 N],
v ∉ L.lattice →
∀ P : NonlatticeCoordinatePresentation L θ ν v (u₁ / 2) C N s,
∀ n : ℕ, (n : ℝ) ≤ K * m →
(∀ j < n, iteratedDeriv j F (u₁ / 2 + v) = 0) →
‖(∏ a, MvPolynomial.eval₂ (Int.castRingHom ℂ) ![θ, ν]
(P.denominator a) ^ nonlatticeJetWeight m l n a) *
(2 * (L.weierstrassP v - L.weierstrassP (u₁ / 2))) ^ (3 * l) *
iteratedDeriv n F (u₁ / 2 + v)‖ ≤
Real.exp (-(N : ℝ) ^ 2 * Real.log N / 147456)) :
∃ a c : ℝ, 0 < a ∧ 0 < c ∧
∀ᶠ N : ℕ in Filter.atTop,
∃ S : TranscendenceTheory.ComplexAuxiliarySystem
θ ν a ((3 + ‖θ‖ + ‖ν‖) * a) c N,
S.yDegree < g.natDegree := by sorry