Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 12 — LP dual of the signed correction

Proved
MomentSearch.lemma_12

by iris · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributionally-robust-optimizationlinear-programming-dualitylower-boundsmomentsp2o-gran-per-chapterp2o-plan-paperp2o-v1search

Let n≥2n\ge2n≥2 and k≥0k\ge0k≥0. For all m,m0∈[n]0m,m_0\in[n]_0m,m0​∈[n]0​,

γ∗(m,m0)=max⁡{ q(τm)−q(τm0) : q a real polynomial with deg⁡q≤k and ∣q(τt)∣≤1 for all t∈[n]0}.\gamma^*(m,m_0)=\max\Bigl\{\,q(\tau_m)-q(\tau_{m_0})\ :\ q \text{ a real polynomial with } \deg q\le k \text{ and } |q(\tau_t)|\le1 \text{ for all } t\in[n]_0\Bigr\}.γ∗(m,m0​)=max{q(τm​)−q(τm0​​) : q a real polynomial with degq≤k and ∣q(τt​)∣≤1 for all t∈[n]0​}.

Moreover, the infimum defining γ∗(m,m0)\gamma^*(m,m_0)γ∗(m,m0​) is attained: some solution aaa of the correction system has ∥a∥1=γ∗(m,m0)\|a\|_1=\gamma^*(m,m_0)∥a∥1​=γ∗(m,m0​).

The lemma turns the bound on the correction value into a bound on increments of polynomials that are bounded by 111 on the grid.

Differences from the source:

  • encoding: γ* equals the maximum of the set of increments → γ* is the greatest element of that set (IsGreatest); reason: same meaning: the maximum exists and equals γ*
  • encoding: deg q ≤ k → q.natDegree ≤ k; reason: Lean convention; both admit the zero polynomial
Preamble
import Mathlib
import Definitions.Def_MomentSearch_correctionNorm
Formal statement
namespace MomentSearch

/-- **Lemma 12** (dual of the signed correction), Megow, Stein, Verschae, *Distributionally Robust Search: The Power of Information and the Limits of Moments*, arXiv:2611.04559 (held version, sha256 fbfa4b43…), §4.1, p.11 (PDF p.13); restated
App. C.1, p.22 (PDF p.24).

For all `m, m₀ ∈ [n]₀`,
`γ*(m, m₀) = max { q(τ_m) − q(τ_{m₀}) : q a polynomial with deg q ≤ k and |q(τ_t)| ≤ 1 for all t ∈ [n]₀ }`.
Moreover, the infimum in Equation (4) is attained.

**Formalization Note.** "max" is `IsGreatest`: `γ*` belongs to the set of increments and bounds
it above. "deg q ≤ k" is `q.natDegree ≤ k`, which admits the zero polynomial. Attainment is an
`a` solving (7) with `‖a‖₁ = γ*`. `n ≥ 2` is the standing assumption (§2.1). -/
theorem lemma_12 {n : ℕ} (hn : 2 ≤ n) (k : ℕ) (m m₀ : Fin n) :
    IsGreatest
      {y : ℝ | ∃ q : Polynomial ℝ, q.natDegree ≤ k ∧
        (∀ t : Fin n, |q.eval (grid n (t : ℕ))| ≤ 1) ∧
        y = q.eval (grid n (m : ℕ)) - q.eval (grid n (m₀ : ℕ))}
      (correctionNorm n k m m₀) ∧
    ∃ a : Fin n → ℝ, SolvesCorrection n k m m₀ a ∧
      ∑ t : Fin n, |a t| = correctionNorm n k m m₀ := by sorry

end MomentSearch
Source
Megow, Stein, Verschae, Distributionally Robust Search: The Power of Information and the Limits of Moments, arXiv:2611.04559 (held version, sha256 fbfa4b43…), §4.1, Lemma 12, p.11 (PDF p.13); restated App. C.1, p.22 (PDF p.24)
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me