Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(24), Sect. 5.1.4, p. 18 — inf over feasible polynomials of p(1) equals γ*

Proved
WaitJudge.Convex.inf_poly_eq_gammaStar

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

calculus-of-variationsmoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-approximation

Let N,dN,dN,d be natural numbers and ϵ(0),…,ϵ(d)∈[0,1]\epsilon(0),\dots,\epsilon(d)\in[0,1]ϵ(0),…,ϵ(d)∈[0,1]. Let γ∗\gamma^*γ∗ be the value of the variational problem (10): the infimum of ξ(1)\xi(1)ξ(1) over the functions ξ∈Cd[0,1]\xi\in C^d[0,1]ξ∈Cd[0,1] with

1k!dkdtkξ(t) ≥ (Nk)tN−k 1[0,1−ϵ(k))(t),t∈[0,1], k=0,1,…,d.\frac1{k!}\frac{\mathrm d^k}{\mathrm dt^k}\xi(t)\ \ge\ \binom Nk t^{N-k}\,\mathbf 1_{[0,1-\epsilon(k))}(t),\qquad t\in[0,1],\ k=0,1,\dots,d.k!1​dtkdk​ξ(t) ≥ (kN​)tN−k1[0,1−ϵ(k))​(t),t∈[0,1], k=0,1,…,d.

Then the infimum of p(1)p(1)p(1) over the polynomials ppp satisfying the same constraints equals γ∗\gamma^*γ∗:

inf⁡MγM∗=inf⁡{p(1): p a real polynomial feasible for (10)}=γ∗.\inf_{M}\gamma^*_M=\inf\{p(1):\ p\ \text{a real polynomial feasible for (10)}\}=\gamma^*.Minf​γM∗​=inf{p(1): p a real polynomial feasible for (10)}=γ∗.

Here γM∗\gamma^*_MγM∗​ is the value of the dual problem (21) rewritten over polynomials of degree MMM, and the union over M≥dM\ge dM≥d of these classes is the set of all real polynomials. The equality identifies the bound obtained by duality with the value of (10).

Formalization Note Cd[0,1]C^d[0,1]Cd[0,1] is ContDiffOn ℝ d on [0,1][0,1][0,1] with derivatives taken within [0,1][0,1][0,1]; a polynomial is feasible when its evaluation map is. Both infima are real sInfs of nonempty sets bounded below by 000.

Preamble
import Mathlib
import Definitions.Def_WaitJudge_Convex_Setting
Formal statement
namespace WaitJudge.Convex

theorem inf_poly_eq_gammaStar (N d : ℕ) (ε : ℕ → ℝ) (hε : ∀ k ≤ d, 0 ≤ ε k ∧ ε k ≤ 1) :
    sInf {y | ∃ q : Polynomial ℝ, IsFeasible10 N d ε (fun t => q.eval t) ∧ y = q.eval 1} =
      gammaStar N d ε := by sorry

end WaitJudge.Convex
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF pp. 17–18, Sect. 5.1.4, rewriting of (21) over P_M and (24)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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