Curve-contact bound yields weighted monic relations below any larger rate
OpenOAI.PiExponent.FormalInterpolation.weightedIdealCurveBound_weighted_monic_relationsA uniform weighted curve-contact bound for a finite-colength affine ideal forces the existence of weighted monic relations in its powers, with degree rate arbitrarily close to the contact rate from above.
Let be an ideal of finite colength, rational degree weights, and let be a rate such that for every one-dimensional generating curve in function-field form the total contact of along the curve is at most times the weighted pole degree. Then, for every rational , there exist:
- a positive integer ,
- positive integers ,
- polynomials ,
such that each monic coordinate relation has all exponents in its support strictly below the weighted degree ,
and the relation degrees satisfy the rate budget
In geometric language, the curve-contact hypothesis controls the weighted Newton polygon of the ideal; the weighted compactification and ampleness (Serre vanishing, ordinary Rees recovery) produce weighted monic relations whose per-power degree cost is at most any prescribed rate strictly larger than . The result is the algebraic input needed to bound representatives modulo all powers of .
import Definitions.Def_OAI_PiExponent_WeightedIdealCurveCriterion open scoped BigOperators open OAI.PiExponent.FormalInterpolation
theorem OAI.PiExponent.FormalInterpolation.weightedIdealCurveBound_weighted_monic_relations
{d : Nat} (I : Ideal (MvPolynomial (Fin d) Complex))
(hfinite : Module.Finite Complex (MvPolynomial (Fin d) Complex ⧸ I))
(w : Fin d → Rat) (hw : ∀ i, 0 < (w i : Real))
(rho : Rat) (hrho : 0 ≤ rho)
(hcurve : WeightedIdealCurveBound I w rho)
(a : Rat) (ha : rho < a) :
∃ k : Nat, 0 < k ∧ ∃ (b : Fin d → Nat), (∀ i, 0 < b i) ∧
∃ (F : Fin d → MvPolynomial (Fin d) Complex),
(∀ i, F i ∈ I ^ k) ∧
(∀ i, ∀ v ∈ (MvPolynomial.X i ^ b i - F i).support,
(∑ j, (w j : Real) * (v j : Real)) < (w i : Real) * (b i : Real)) ∧
(∀ i, (w i : Real) * (b i : Real) ≤ (k : Real) * (a : Real)) := by
sorry