Strict-capacity weighted monic relations below the row scale
OpenOAI.PiExponent.LogarithmicJetIdeals.strict_capacity_weighted_monic_relationsUnder the strict-capacity hypotheses of the row geometry, the simultaneous logarithmic jet ideal admits weighted monic coordinate relations with a slope strictly below .
Let be admissible fixed data with dimension , let be real scales, let , be positive multiplicity and truncation data, and assume:
where are the row weights and , and let
Then there exist a power , positive integers , polynomials , and a real slope with such that for every :
i.e. every exponent in that support satisfies
and the degrees fit in the budget
where are the column weights.
In other words: the strict capacity inequality forces the existence of a system of weighted monic relations whose normal-form weight cost per ideal power is strictly smaller than the scale . This is the geometric input behind bounded-support representatives for all sufficiently large powers of ; the slope budget leaves room to absorb the fixed additive weight overhead of the relations.
import Definitions.Def_OAI_PiExponent_ApproximationDefinitions import Definitions.Def_OAI_NumberTheory_PiExponent_Approximation_DeterminantContradiction_CoreData import Definitions.Def_OAI_PiExponent_AdmissibleFormalInterpolation import Definitions.Def_OAI_PiExponent_PolynomialLogarithmicJets import Mathlib.RingTheory.MvPolynomial.MonomialOrder open OAI.PiExponent OAI.PiExponent.DeterminantContradiction open OAI.PiExponent.AdmissibleFormalInterpolation open OAI.PiExponent.LogarithmicJetIdeals open scoped BigOperators
theorem OAI.PiExponent.LogarithmicJetIdeals.strict_capacity_weighted_monic_relations
{nu : ℝ} (d : FixedData nu) (R S : ℝ)
(e : Fin (d.m + 1) → ℕ) (T : Fin d.m → ℕ)
(hR : 0 < R) (hRS : R < S)
(he : ∀ i, 0 < e i)
(hcommon : ∀ i, S = (e i : ℝ) *
InterpolationMatrix.rowWeights d.v0 d.base.theta
(MatrixArithmetic.logWeights (finiteDenominators d)) i)
(hcapacity : 2 * R ^ (d.m + 1 : ℕ) > S ^ (d.m + 1 : ℕ))
(hT : ∀ i, InterpolationMatrix.rowWeights d.v0 d.base.theta
(MatrixArithmetic.logWeights (finiteDenominators d)) i.succ <
(T i : ℝ) * (d.v0 : ℝ)) :
∃ k : ℕ, 0 < k ∧ ∃ (b : Fin (d.m + 1) → ℕ), (∀ i, 0 < b i) ∧
∃ (F : Fin (d.m + 1) → MvPolynomial (Fin (d.m + 1)) ℂ), ∃ a : ℝ,
0 < a ∧ a < R ∧
(∀ i, F i ∈ (simultaneousJetIdeal d.K
(MatrixArithmetic.rationalCenters (finiteNumerators d)
(finiteDenominators d)) T e) ^ k) ∧
(∀ i, ∀ u ∈ (MvPolynomial.X i ^ b i - F i).support,
(∑ j, InterpolationMatrix.columnWeights d.w0
(MatrixArithmetic.logWeights (finiteDenominators d)) j * (u j : ℝ)) <
InterpolationMatrix.columnWeights d.w0
(MatrixArithmetic.logWeights (finiteDenominators d)) i * (b i : ℝ)) ∧
(∀ i, InterpolationMatrix.columnWeights d.w0
(MatrixArithmetic.logWeights (finiteDenominators d)) i * (b i : ℝ) ≤
(k : ℝ) * a) := by
sorry