Nonzero weighted auxiliary polynomial with vanishing jet packets
ProvedOAI.PiExponent.LogarithmicJetIdeals.eventually_exists_rawPacket_kernelLet , let be real parameters, let be the finite logarithmic weight profile, and let be the rational centers of the determinant construction. Write for the column weights , , and for the row weights , . For a real scale suppose the strict volume inequality
where is the cardinality of the finite center index set, and suppose that for all sufficiently large real heights the auxiliary cardinality comparison
holds, where the right-hand count is the number of exponent vectors with and the left-hand count is times the number of row-weight indices of the strict simplex .
Then for all sufficiently large there is a nonzero polynomial in complex variables whose monomials all satisfy the weighted degree bound , and whose raw logarithmic jet packet at scale vanishes at every center and every strict row index: .
This is the auxiliary-polynomial kernel lemma of the strict-capacity argument: the monomial count at slope strictly exceeds the number of jet conditions at slope , so the linear "jet evaluation at height " map from the weighted monomial space into the packet space has a nontrivial kernel; any nonzero kernel element is an auxiliary polynomial of bounded weighted degree that vanishes on all the -jets. It is the algebraic counting input that, together with the padded packet-kernel inclusion and the quotient-representative machinery, produces the bounded representatives modulo powers of the simultaneous logarithmic jet ideal required by the strict-capacity pillar.
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.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.LinearAlgebra.Dimension.Constructions open OAI.PiExponent OAI.PiExponent.DeterminantContradiction open OAI.PiExponent.AdmissibleFormalInterpolation open OAI.PiExponent.LogarithmicJetIdeals open Filter Topology open scoped BigOperators
theorem OAI.PiExponent.LogarithmicJetIdeals.eventually_exists_rawPacket_kernel
{m : ℕ} (K : ℕ) (w0 v0 theta : ℝ)
(w : Fin m → ℝ) (r : Fin m → ℂ)
(hv : ∀ i, 0 < InterpolationMatrix.rowWeights v0 theta w i)
{a : ℝ} (ha : 0 < a)
(hvol : (K : ℝ) * a ^ (m + 1) *
(∏ i, InterpolationMatrix.columnWeights w0 w i) /
(∏ i, InterpolationMatrix.rowWeights v0 theta w i) < 1)
(hcard : ∀ᶠ N : ℝ in atTop,
K * (strictWeightedSimplex (InterpolationMatrix.rowWeights v0 theta w) (a * N)).card <
(realWeightedSimplex (InterpolationMatrix.columnWeights w0 w) N).card) :
∀ᶠ N : ℝ in atTop,
∃ P : MvPolynomial (Fin (m + 1)) ℂ, P ≠ 0 ∧
(∀ u ∈ P.support,
(∑ i, InterpolationMatrix.columnWeights w0 w i * (u i : ℝ)) ≤ N) ∧
rawPacketMap K v0 theta w (a * N) r P = 0 := by sorry