Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
RobustSPA.Affiliated.pointwise_bound_aff

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

calculusmechanism-designminimax-regretp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥2n\ge 2n≥2, r>0r>0r>0 and p∈(r,1)p\in(r,1)p∈(r,1). For z∈[0,1]z\in[0,1]z∈[0,1] put

g(z)=(n−1)rp−r−1−(n−1)pp−r z+n z(n−1)/n.g(z)=\frac{(n-1)r}{p-r}-1-\frac{(n-1)p}{p-r}\,z+n\,z^{(n-1)/n}.g(z)=p−r(n−1)r​−1−p−r(n−1)p​z+nz(n−1)/n.

Then ggg attains its maximum over [0,1][0,1][0,1] at z⋆=(1−r/p)n=Fn∗(p)nz^\star=(1-r/p)^n=F^*_n(p)^nz⋆=(1−r/p)n=Fn∗​(p)n, where Fn∗(p)=1−r/pF^*_n(p)=1-r/pFn∗​(p)=1−r/p is the isorevenue CDF. Its maximum value is

g(z⋆)=(n−1)rp−r−1−(n−1)pp−r Fn∗(p)n+n Fn∗(p)n−1.g(z^\star)=\frac{(n-1)r}{p-r}-1-\frac{(n-1)p}{p-r}\,F^*_n(p)^n+n\,F^*_n(p)^{n-1}.g(z⋆)=p−r(n−1)r​−1−p−r(n−1)p​Fn∗​(p)n+nFn∗​(p)n−1.

In the proof of Proposition 2, after Lemma 1 replaces Fn−1(1)(p)F^{(1)}_{n-1}(p)Fn−1(1)​(p) by Fn(1)(p)(n−1)/nF^{(1)}_n(p)^{(n-1)/n}Fn(1)​(p)(n−1)/n, this pointwise maximization bounds the integrand by its value under the i.i.d. isorevenue law Fn∗F^*_nFn∗​. That identifies the regret of Φn∗\Phi^*_nΦn∗​ under Fn∗F^*_nFn∗​ as the worst case over Faff\mathcal F_{\mathrm{aff}}Faff​.

Formalization Note. The page says the derivative −(n−1)p/(p−r)+(n−1)z−1/n-(n-1)p/(p-r)+(n-1)z^{-1/n}−(n−1)p/(p−r)+(n−1)z−1/n is "less than or equal to zero for z≤Fn∗(p)nz\le F^*_n(p)^nz≤Fn∗​(p)n and greater than or equal to zero" above. The two cases are swapped: the derivative is nonnegative below Fn∗(p)nF^*_n(p)^nFn∗​(p)n 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. z(n−1)/nz^{(n-1)/n}z(n−1)/n is a real power. The hypothesis n≥2n\ge2n≥2 excludes n=1n=1n=1, where ggg is affine and the claim fails.

Preamble
import Mathlib
import Definitions.Def_RobustSPA_Affiliated_Setting
Formal statement
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
Source
Anunrojwong, Balseiro & Besbes, On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design, arXiv:2204.10478v5, p. 21, proof of Proposition 2 (derivative step; printed sign slip, see paper.md slip 11)
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me