Proof of Proposition 2, p. 21 — the bracket in z ∈ [0,1] is maximized at z = (1 − r*_n/p)^n = F*_n(p)^n
ProvedRobustSPA.Affiliated.pointwise_bound_affLet , and . For put
Then attains its maximum over at , where is the isorevenue CDF. Its maximum value is
In the proof of Proposition 2, after Lemma 1 replaces by , this pointwise maximization bounds the integrand by its value under the i.i.d. isorevenue law . That identifies the regret of under as the worst case over .
Formalization Note. The page says the derivative is "less than or equal to zero for and greater than or equal to zero" above. The two cases are swapped: the derivative is nonnegative below and nonpositive above, which is what makes the critical point a maximum. The statement here records the maximum, which is the paper's conclusion and what the proof uses. is a real power. The hypothesis excludes , where is affine and the claim fails.
import Mathlib import Definitions.Def_RobustSPA_Affiliated_Setting
namespace RobustSPA.Affiliated
theorem pointwise_bound_aff (n : ℕ) (hn : 2 ≤ n) (r : ℝ) (hr : 0 < r) (p : ℝ) (hp : p ∈ Set.Ioo r 1) :
let g : ℝ → ℝ := fun z => ((n : ℝ) - 1) * r / (p - r) - 1 - ((n : ℝ) - 1) * p / (p - r) * z +
(n : ℝ) * z ^ (((n : ℝ) - 1) / (n : ℝ))
IsGreatest (g '' Set.Icc 0 1) (g ((1 - r / p) ^ n)) ∧
g ((1 - r / p) ^ n) = ((n : ℝ) - 1) * r / (p - r) - 1 - ((n : ℝ) - 1) * p / (p - r) * (1 - r / p) ^ n +
(n : ℝ) * (1 - r / p) ^ (n - 1) := by sorry
end RobustSPA.Affiliated
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.