Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Monic relations from weighted bounded representatives

Proved
OAI.PiExponent.LogarithmicJetIdeals.monic_relations_of_bounded_representatives

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

algebranumber-theoryopenai-pi-exponent-017

Monic relations from weighted bounded representatives

Let m≥0m\ge 0m≥0, let w0,…,wm>0w_0,\dots,w_m>0w0​,…,wm​>0 be positive weights, let I⊆C[X0,…,Xm]I \subseteq \mathbb{C}[X_0,\dots,X_m]I⊆C[X0​,…,Xm​] be an ideal, and let R>ρ>0R>\rho>0R>ρ>0 and B≥0B\ge 0B≥0 be real parameters. Assume that every positive power IkI^kIk (k≥1k\ge 1k≥1) admits weighted bounded representatives with slope ρ\rhoρ and additive overhead BBB: for every polynomial PPP there is a polynomial QQQ with

P−Q∈Ikand∑iwi ui≤kρ+B  for every exponent u in the support of Q.P - Q \in I^k \qquad\text{and}\qquad \sum_i w_i\,u_i \le k\rho + B \ \text{ for every exponent } u \text{ in the support of } Q.P−Q∈Ikandi∑​wi​ui​≤kρ+B  for every exponent u in the support of Q.

Then there exist a common exponent k>0k>0k>0, positive integers b0,…,bmb_0,\dots,b_mb0​,…,bm​, polynomials Fi∈IkF_i \in I^kFi​∈Ik and a real slope 0<a<R0<a<R0<a<R such that for every iii the difference Xibi−FiX_i^{b_i}-F_iXibi​​−Fi​ is supported strictly below the weighted order wi biw_i\,b_iwi​bi​, i.e. every exponent uuu in its support satisfies

∑jwj uj<wi bi,\sum_j w_j\,u_j < w_i\,b_i,j∑​wj​uj​<wi​bi​,

and the pivot weights fit the budget

wi bi≤k a.w_i\,b_i \le k\,a .wi​bi​≤ka.

In other words, weighted bounded representatives whose slope is strictly below RRR force the existence of a system of weighted monic coordinate relations whose pivot cost per ideal power is uniformly bounded by a slope a<Ra<Ra<R. This is the abstract construction step used in the strict-capacity argument for simultaneous logarithmic jet ideals; the bounded-representatives hypothesis is supplied separately by the affine-normal-form (capacity) input.

Constructively, one takes kkk with B+∑iwi<k(R−ρ)B+\sum_i w_i < k(R-\rho)B+∑i​wi​<k(R−ρ), sets bi=⌊(kρ+B)/wi⌋+1b_i = \lfloor (k\rho+B)/w_i\rfloor + 1bi​=⌊(kρ+B)/wi​⌋+1, lets FiF_iFi​ be XibiX_i^{b_i}Xibi​​ minus the bounded representative of XibiX_i^{b_i}Xibi​​, and takes a=ρ+(B+∑iwi)/ka = \rho + (B+\sum_i w_i)/ka=ρ+(B+∑i​wi​)/k; then Xibi−FiX_i^{b_i}-F_iXibi​​−Fi​ has weighted support at most kρ+B<wibik\rho+B < w_i b_ikρ+B<wi​bi​, and wibi≤(kρ+B)+wi≤kaw_i b_i \le (k\rho+B)+w_i \le k awi​bi​≤(kρ+B)+wi​≤ka with a<Ra<Ra<R.

Preamble
import Mathlib.Algebra.MvPolynomial.Basic
import Mathlib.RingTheory.Ideal.Operations
import Mathlib.Algebra.Order.Floor.Semiring
import Mathlib.Data.Complex.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Tactic

open scoped BigOperators
Formal statement
theorem OAI.PiExponent.LogarithmicJetIdeals.monic_relations_of_bounded_representatives
    {m : ℕ} (w : Fin (m + 1) → ℝ) (hw : ∀ i, 0 < w i)
    (I : Ideal (MvPolynomial (Fin (m + 1)) ℂ))
    (R rho B : ℝ) (hrho0 : 0 < rho) (hrhoR : rho < R) (hB : 0 ≤ B)
    (hbound : ∀ k : ℕ, 0 < k → ∀ P : MvPolynomial (Fin (m + 1)) ℂ,
      ∃ Q : MvPolynomial (Fin (m + 1)) ℂ,
        P - Q ∈ I ^ k ∧
        ∀ u ∈ Q.support, ∑ i, w i * (u i : ℝ) ≤ (k : ℝ) * rho + B) :
    ∃ k : ℕ, 0 < k ∧ ∃ b : Fin (m + 1) → ℕ, (∀ i, 0 < b i) ∧
      ∃ F : Fin (m + 1) → MvPolynomial (Fin (m + 1)) ℂ, ∃ a : ℝ,
        0 < a ∧ a < R ∧
        (∀ i, F i ∈ I ^ k) ∧
        (∀ i, ∀ u ∈ (MvPolynomial.X i ^ b i - F i).support,
          (∑ j, w j * (u j : ℝ)) < w i * (b i : ℝ)) ∧
        (∀ i, w i * (b i : ℝ) ≤ (k : ℝ) * a) := by sorry
Source
Prove2Me PiExponent mission, strict-capacity chain for OAI.PiExponent.LogarithmicJetIdeals.strict_capacity_weighted_monic_relations (theorem 11f55011-be19-49a6-a0e5-460ed21573e2); construction component isolated by the team. Mathematical context: OpenAI math repo commit adc7f124, lean/OAI/NumberTheory/PiExponent/Approximation/WeightedGlobalSectionBound.lean (weighted support bounds).

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