Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, "The payments are right", p. 12 — limit prices are the highest other limit bids and s*_ij = x*_ij p*_ij

Proved
MultPacing.Existence.theorem_1_payments

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

limit-of-equilibriap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pacingsecond-price-auctionsmoothed-game

In the setting of the proof of Theorem 1 (a convergent sequence of equilibria αl\alpha^lαl of (ϵl,Hl)(\epsilon^l,H^l)(ϵl,Hl)-smoothed pacing games with ϵl→0\epsilon^l\to0ϵl→0, Hl→∞H^l\to\inftyHl→∞, Hl>M/ϵlH^l>M/\epsilon^lHl>M/ϵl, and limits α∗,x∗,p∗,s∗\alpha^*,x^*,p^*,s^*α∗,x∗,p∗,s∗ of the multipliers, allocations, prices and payments), for every buyer iii and good jjj:

pij∗=max⁡k≠iαk∗vkjandsij∗=xij∗ pij∗,p^*_{ij}=\max_{k\ne i}\alpha^*_k v_{kj}\qquad\text{and}\qquad s^*_{ij}=x^*_{ij}\,p^*_{ij},pij∗​=k=imax​αk∗​vkj​andsij∗​=xij∗​pij∗​,

where the maximum is 000 when iii is the only buyer. So the limit price is the second price of the limit bids, and the limit payment is price times allocation.

Formalization Note The limit price is indexed by buyer and good (pij∗p^*_{ij}pij∗​), as the smoothed price is; that the winners of a good see the same price follows from this claim together with the tie condition of the previous claim.

Differences from the source:

  • reading: the limit price pj∗=lim⁡lpjlp^*_j=\lim_l p^l_jpj∗​=liml​pjl​, where pjlp^l_jpjl​ is "the highest bid on jjj among buyers other than iii, minus ϵ\epsilonϵ" → a price pij∗p^*_{ij}pij∗​ for each buyer and good; reason: Definition 3's pjp_jpj​ depends on iii.
  • encoding: "the highest other bid at the limit point" → highestOther, the maximum over k≠ik\ne ik=i, 000 if there is no other buyer; reason: the reserve bid 2ϵl2\epsilon^l2ϵl tends to 000, and the paper gives a lone bidder price 000 (p. 16).
  • encoding: convergence of a subsequence → convergence of the sequence; reason: the paper replaces the sequence by the subsequence before the claims.
Preamble
import Mathlib
import Definitions.Def_MultPacing_Existence_Limit
Formal statement
namespace MultPacing.Existence

theorem theorem_1_payments {N G : Type*} [Fintype N] [DecidableEq N] [Fintype G]
    (P : PacingGame N G) (ε H : ℕ → ℝ) (M : ℝ) (α : ℕ → N → ℝ) (αs : N → ℝ)
    (xs ps ss : N → G → ℝ) (hlim : IsSmoothedLimit P ε H M α αs xs ps ss) :
    (∀ i j, ps i j = highestOther P.v αs i j) ∧ (∀ i j, ss i j = xs i j * ps i j) := by sorry

end MultPacing.Existence
Source
Conitzer, Kroer, Sodomka & Stier-Moses, Multiplicative Pacing Equilibria in Auction Markets, arXiv:1706.07151v5, p. 12 (PDF 12), proof of Theorem 1, claim "The payments are right"
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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