(39), p. 27 — coefficient dual equals variational problem
ProvedWaitJudge.Generic.gammaStarN_eq_gammaStar31dualitymoment-problemp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials
Let γ_N be the infimum of the coefficient dual (36) at M=N and let γ be the infimum over feasible degree-at-most-N polynomials in (31). Then
The equality identifies the coefficient dual bound with the variational quantity appearing in Theorem 3. Under the polynomial correspondence q(t)=∑_{m=0}^{N}λ_m t^m, evaluation at 1 gives ∑λ_m, while q^{(k)}(t)/k! gives the dual polynomial for index k.
Formalization Note Both sides are real infima of explicitly defined feasible-value sets. The identity is algebraic and has no probabilistic hypotheses. The reading of P_N as degree at most N matches the N+1 free coefficients.
Preamble
import Mathlib import Definitions.Def_WaitJudge_Generic_Setting
Formal statement
namespace WaitJudge.Generic
open MeasureTheory
theorem gammaStarN_eq_gammaStar31
(N : ℕ) (ε : ℕ → ℝ) :
gammaStarDualN N ε = gammaStar31 N ε := by sorry
end WaitJudge.Generic
Source
Campi & Garatti, Wait-and-judge scenario optimization, Math. Program. (2018), doi:10.1007/s10107-016-1056-9 (accepted manuscript), PDF p. 27, (39), with coefficient formula displayed immediately above
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.