Strict-capacity initial monic relations
OpenOAI.PiExponent.LogarithmicJetIdeals.strict_capacity_monic_pure_leading_relationsLet be admissible fixed determinant data, with , and let be real scales, multiplicities and truncation orders satisfying the common-scale identity , the strict capacity inequality , and the log-cutoff inequalities . Write for the simultaneous logarithmic jet ideal at the rational centres and for the column weights.
Then there exist a slope with , a positive power , a monomial order , positive integers and polynomials such that, for every , is monic with pure leading power with respect to , the column weight of that pivot is bounded by the capacity budget,
and the difference is supported strictly below the pivot weight,
These are the initial monic relations of the strict-capacity layer: monic relations in every logarithmic direction whose pivot degree grows with the power of the jet ideal at a rate strictly below the scale , with all lower terms confined below the pivot in the column-weight order. They are the input of the weighted monic-relation division theory, which converts them into weighted representatives of every residue class modulo with rate and a fixed additive overhead; in particular they imply that for every every polynomial has a representative modulo of column weight at most for a constant . The existence of such relations is exactly the strict-capacity content of the global-generation argument for the blowup ideal.
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_monic_pure_leading_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 : ℝ)) :
∃ rho : ℝ, 0 < rho ∧ rho < R ∧
∃ k : ℕ, 0 < k ∧ ∃ o : MonomialOrder (Fin (d.m + 1)),
∃ b : Fin (d.m + 1) → ℕ, (∀ i, 0 < b i) ∧
∃ F : Fin (d.m + 1) → MvPolynomial (Fin (d.m + 1)) ℂ,
(∀ i, F i ∈ (simultaneousJetIdeal d.K
(MatrixArithmetic.rationalCenters (finiteNumerators d)
(finiteDenominators d)) T e) ^ k) ∧
(∀ i, o.leadingCoeff (F i) = 1) ∧
(∀ i, o.degree (F i) = Finsupp.single i (b i)) ∧
(∀ i, InterpolationMatrix.columnWeights d.w0
(MatrixArithmetic.logWeights (finiteDenominators d)) i *
(b i : ℝ) ≤ (k : ℝ) * rho) ∧
(∀ 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 : ℝ)) := by
sorry