Proof of Proposition 4, p. 50 — Equation (3) has a unique solution in
ProvedRobustFPA.VarBid.equation3_uniquecalculusfirst-price-auctionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let , and . On the interval :
- the left-hand side of Equation (3), , is nondecreasing;
- the right-hand side, , is strictly decreasing;
- Equation (3),
has exactly one solution .
Uniqueness of the root is what makes the minimax loss bid unique in Proposition 4.
Formalization Note. The page's bound "" is a typo for and is not part of the statement; only the monotonicity claims and the unique root are formalized. Strict decrease of the right-hand side uses (p. 50, "which holds if and only if τ < 1").
Preamble
import Mathlib import Definitions.Def_RobustFPA_VarBid_ClosedForms
Formal statement
namespace RobustFPA.VarBid
theorem equation3_unique (n : ℕ) (hn : 2 ≤ n) (τ L v : ℝ) (hτ0 : 0 < τ) (hτ1 : τ < 1) (hLv : L < v) :
MonotoneOn (fun b => uPlus n τ L v (peakBid n τ L v) - uPlus n τ L v b)
(Set.Icc (peakBid n τ L v) v) ∧
StrictAntiOn (fun b => uPlus n τ L v b - uMinus n τ L v b) (Set.Icc (peakBid n τ L v) v) ∧
∃! b : ℝ, peakBid n τ L v ≤ b ∧ b ≤ v ∧ Equation3 n τ L v b := by sorry
end RobustFPA.VarBid
Source
Kasberger & Schlag, Robust Bidding in First-Price Auctions, SSRN 3044438 (version of 3 Sep 2022), pp. 50–51 (Appendix B.4, proof of Proposition 4: uniqueness of the solution of Equation (3))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.