Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, "A buyer with α*_i < 1 spends her entire budget", p. 12 — α*_i < 1 implies Σ_j s*_ij = B_i

Proved
MultPacing.Existence.theorem_1_spend_all

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

budgetslimit-of-equilibriap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pacingsmoothed-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>0ϵl>0, ∑jvij+2ϵl≤M\sum_j v_{ij}+2\epsilon^l\le M∑j​vij​+2ϵl≤M, Hl>M/ϵlH^l>M/\epsilon^lHl>M/ϵl, ϵl→0\epsilon^l\to0ϵl→0, Hl→∞H^l\to\inftyHl→∞, limit multipliers α∗\alpha^*α∗ and limit payments s∗s^*s∗), a buyer who is paced at the limit spends her entire budget:

αi∗<1 ⟹ ∑jsij∗=Bi.\alpha^*_i<1\ \Longrightarrow\ \sum_j s^*_{ij}=B_i .αi∗​<1 ⟹ j∑​sij∗​=Bi​.

Together with the budget claim this gives the no-unnecessary-pacing condition of Definition 2.

Differences from the source:

  • 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_spend_all {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, αs i < 1 → ∑ j, ss i j = P.B i := 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 "A buyer with α*_i < 1 spends her entire budget"
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