Lemma 4.2 — deterministic ERM regret transfer
ProvedInventoryBounds.erm_factor_twoIf true and empirical real objectives differ by at most b at every candidate and the empirical value at the selected candidate is no larger than at a comparator, its true excess objective is at most 2b. No concentration event is proved here.
import Definitions.Def_InventoryBounds_Primitives import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false
namespace InventoryBounds
theorem erm_factor_two {α : Type*} (f fhat : α → ℝ)
(s shat : α) (b : ℝ)
(hdev : ∀ a, |f a - fhat a| ≤ b)
(hemp : fhat shat ≤ fhat s) :
f shat - f s ≤ 2 * b := by sorry
end InventoryBoundsRead-back
What the Lean code literally says, in plain math · gpt-6
For every type in any universe, every two functions , every two elements , and every real , if for every and , then . No structure on , no existence or optimality condition beyond the two supplied elements and the single displayed comparison, and no explicit sign assumption on is required. The supplied elements imply that is nonempty; consequently the uniform absolute-error assumption forces , so for the hypotheses cannot hold. The elements and may coincide, and need not be finite.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.