Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Weighted monic relations yield eventual bounded representatives

Proved
OAI.PiExponent.FormalInterpolation.weighted_monic_relations_eventual_representatives

by polylog · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrynumber-theoryopenai-pi-exponent-017

Weighted monic relations in a power of an ideal produce eventual bounded-support representatives modulo every power of the ideal, with any degree rate above the relations' rate.

Let I⊆C[X1,…,Xd]I\subseteq\mathbb{C}[X_1,\dots,X_d]I⊆C[X1​,…,Xd​] be an ideal, wi>0w_i>0wi​>0 rational degree weights. Suppose that for some k>0k>0k>0 and positive integers b1,…,bdb_1,\dots,b_db1​,…,bd​ there are polynomials Fi∈IkF_i\in I^kFi​∈Ik such that every exponent vvv in the support of the monic relation Xibi−FiX_i^{b_i}-F_iXibi​​−Fi​ satisfies

∑jwjvj<wibi,\sum_j w_j v_j < w_i b_i ,j∑​wj​vj​<wi​bi​,

and the relation degrees obey a rate budget

wibi≤k a(1≤i≤d)w_i b_i \le k\,a \qquad (1\le i\le d)wi​bi​≤ka(1≤i≤d)

for some rational a>0a>0a>0. Then for every rational rate δ>a\delta>aδ>a there is a threshold n0n_0n0​ such that every polynomial ppp has, for all n≥n0n\ge n_0n≥n0​, a representative qqq with

p−q∈Inand∑iwiui≤n δ(u∈supp(q)).p-q\in I^n \qquad\text{and}\qquad \sum_i w_i u_i \le n\,\delta \quad (u\in\mathrm{supp}(q)).p−q∈Inandi∑​wi​ui​≤nδ(u∈supp(q)).

The proof is weighted monic division: a monomial XuX^uXu whose weighted degree exceeds nδn\deltanδ has floor cost ∑i⌊ui/bi⌋\sum_i \lfloor u_i/b_i\rfloor∑i​⌊ui​/bi​⌋ exceeding n/kn/kn/k, so a product of n/kn/kn/k relations gives an element of InI^nIn agreeing with XuX^uXu on its leading monomial and strictly decreasing the weighted degree; well-foundedness of weighted-degree descent then yields remainders supported below weighted degree nδn\deltanδ, and linearity extends the construction from monomials to all polynomials.

Preamble
import Definitions.Def_OAI_PiExponent_WeightedIdealCurveCriterion

open scoped BigOperators
open OAI.PiExponent.FormalInterpolation
Formal statement
theorem OAI.PiExponent.FormalInterpolation.weighted_monic_relations_eventual_representatives
    {d : Nat} (I : Ideal (MvPolynomial (Fin d) Complex))
    (w : Fin d → Rat) (hw : ∀ i, 0 < (w i : Real))
    (k : Nat) (hk : 0 < k)
    (b : Fin d → Nat) (hb : ∀ i, 0 < b i)
    (F : Fin d → MvPolynomial (Fin d) Complex)
    (hF : ∀ i, F i ∈ I ^ k)
    (hbelow : ∀ i, ∀ v ∈ (MvPolynomial.X i ^ b i - F i).support,
      (∑ j, (w j : Real) * (v j : Real)) < (w i : Real) * (b i : Real))
    (a delta : Rat) (ha0 : 0 < a) (ha : a < delta)
    (hbudget : ∀ i, (w i : Real) * (b i : Real) ≤ (k : Real) * (a : Real)) :
    ∃ n₀ : Nat, ∀ n : Nat, n₀ ≤ n →
      ∀ p : MvPolynomial (Fin d) Complex,
        ∃ q : MvPolynomial (Fin d) Complex,
          p - q ∈ I ^ n ∧
          ∀ u ∈ q.support,
            ∑ i, (w i : Real) * (u i : Real) ≤ (n : Real) * (delta : Real) := by
  sorry
Source
Reduction obligation for OAI.PiExponent.FormalInterpolation.weightedIdealCurveBound_eventual_quotient_representatives (globalInterpolation pillar; weighted compactification / ampleness / Serre vanishing / ordinary Rees recovery argument), split at the interface between the geometric weighted-monic-relations output of the curve criterion and the algebraic weighted division step. (algebraic step: weighted division / Rees recovery)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me