(23), Sect. 5.1.4, p. 17 — (1/k!) dᵏ/dtᵏ tᵐ = 0 for m < k and C(m,k) t^(m−k) for m ≥ k
ProvedWaitJudge.Convex.iteratedDeriv_pow_div_factorialcalculusp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomials
For all natural numbers and every real ,
In the proof of Theorem 1 this identity turns the constraints of the dual problem (21), after the substitution , into derivative constraints on the polynomial , which is how the variational problem (10) arises.
Formalization Note The -th derivative is Mathlib's iteratedDeriv k, and means no derivative is taken.
Preamble
import Mathlib
Formal statement
namespace WaitJudge.Convex
theorem iteratedDeriv_pow_div_factorial (k m : ℕ) (t : ℝ) :
(1 / (k.factorial : ℝ)) * iteratedDeriv k (fun t : ℝ => t ^ m) t =
if m < k then 0 else (m.choose k : ℝ) * t ^ (m - k) := 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 p. 17, Sect. 5.1.4, (23)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.