Lemma 21 — every x ∈ L^ε_M is within 4ε of some y ∈ L_M
ProvedUnknownLoads.Refined.lemma_21lipschitzp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysisskorokhod-space
Let , and . Let be a real càdlàg function on with and for all (that is, ). Then there is a càdlàg on with and for all () such that
Combined with the compactness of (Arzelà–Ascoli), this turns approximate Lipschitz bounds into relative compactness; it is used in the proof of Proposition 4.
Formalization Note is added (the paper uses with ; for the set is empty when ). The sup-norm bound is stated pointwise on .
Preamble
import Mathlib import Definitions.Def_UnknownLoads_Refined_Load open MeasureTheory ProbabilityTheory Set Filter Topology
Formal statement
namespace UnknownLoads.Refined
theorem lemma_21 (T M ε : ℝ) (hM : 0 ≤ M) (x : ℝ → ℝ) (hx : LipSet T M ε x) :
∃ y : ℝ → ℝ, LipSet T M 0 y ∧ ∀ t ∈ Icc 0 T, |x t - y t| ≤ 4 * ε := by sorry
end UnknownLoads.Refined
Source
Goldsztajn, Borst & van Leeuwaarden, Learning and balancing unknown loads in large-scale systems, arXiv:2012.10142v3, p. 47, Lemma 21 (restatement of Bramson 1998, Lemma 4.2)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.