Strict-capacity weighted bounded representatives
OpenOAI.PiExponent.LogarithmicJetIdeals.strict_capacity_bounded_representativesLet be admissible fixed determinant data with logarithmic jet directions, let be real scales, let be multiplicities and truncation orders for the logarithmic jet coordinates. Assume the common-scale identity for all , the strict capacity inequality , and the strict log-cutoff inequality . Write for the simultaneous logarithmic jet ideal at the rational centres and for the column weights of the ambient interpolation matrix.
Then there are a representative slope with and an additive overhead such that for every and every polynomial there is a polynomial satisfying
where is the exponent of in a monomial of the support of (the inequality is required for every monomial in the support).
This is the weighted bounded-representative statement with strict capacity: it says that classes modulo the -th power of the simultaneous jet ideal have representatives whose column-weighted size grows at most linearly in with slope strictly below the scale , uniformly in the polynomial and in up to a constant overhead. It is the analytic heart of the strict-capacity pillar: the capacity inequality is exactly the statement that the volume of the column-weight simplex of slope exceeds (twice) the volume of the row-weight simplex of height , which is what provides the necessary room for the representative. Together with the elementary construction converting bounded representatives into monic weighted relations, it implies the strict-capacity weighted monic relations statement.
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_bounded_representatives
{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 : ℝ)) :
∃ (rho B : ℝ), 0 < rho ∧ rho < R ∧ 0 ≤ B ∧
∀ k : ℕ, 0 < k → ∀ P : MvPolynomial (Fin (d.m + 1)) ℂ,
∃ Q : MvPolynomial (Fin (d.m + 1)) ℂ,
P - Q ∈ (simultaneousJetIdeal d.K
(MatrixArithmetic.rationalCenters (finiteNumerators d)
(finiteDenominators d)) T e) ^ k ∧
(∀ u ∈ Q.support,
(∑ j, InterpolationMatrix.columnWeights d.w0
(MatrixArithmetic.logWeights (finiteDenominators d)) j *
(u j : ℝ)) ≤ (k : ℝ) * rho + B) := by
sorry