Proof of Theorem 3, p. 37 β if J = 1, then π« = π«^1
ProvedDRConvexOpt.InfConv.single_blockambiguity-setdistributionally-robust-optimizationouter-approximationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be the standardized ambiguity set and a partition of its index set with outer approximations . If the partition has a single block (), then
This identity yields the reverse implications of Theorem 3 in the case : (3), (6) and (7) are then equivalent.
Formalization Note Blocks are indexed by Fin nJ, so "" is nJ = 1 and the single block is index ; the statement is made for every in Fin nJ.
Preamble
import Mathlib import Definitions.Def_DRConvexOpt_InfConv_Setting
Formal statement
namespace DRConvexOpt.InfConv
open MeasureTheory Matrix Filter Topology
/-- Proof of Theorem 3, p. 37: if `J = 1` (one block), then `π« = π«^1`. -/
theorem single_block {nP nQ nK nI nJ : β} (d : AmbData nP nQ nK nI)
(blk : Fin (nI + 1) β Fin nJ) :
nJ = 1 β β j, outerSet d blk j = ambiguitySet d := by sorry
end DRConvexOpt.InfConv
Source
Wiesemann, Kuhn & Sim, Distributionally Robust Convex Optimization, Optimization Online preprint 3757 (version of September 22, 2013), p. 37, proof of Theorem 3, last paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.