Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3 — atomless approximation for nonnegative values

Proved
LargeSupplyFPA.Asymptotic.theorem_3_nonnegative_values

by jasonhartline · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

In a multi-unit first-price auction with nonnegative values, every ε\varepsilonε-approximate Bayes–Nash equilibrium can be transformed, for every ω>0\omega>0ω>0, into an atomless (ε+ω)(\varepsilon+\omega)(ε+ω)-approximate Bayes–Nash equilibrium with the same expected welfare. An almost-sure upper bound ttt on any conditional bid distribution becomes the upper bound t+ωt+\omegat+ω.

Preamble
import Definitions.Def_LargeSupplyFPA_Asymptotic_Model
import Definitions.Def_LargeSupplyFPA_Asymptotic_Assumptions

open MeasureTheory ProbabilityTheory Set
Formal statement
namespace LargeSupplyFPA.Asymptotic

theorem theorem_3_nonnegative_values {n : ℕ} (k : ℕ) (V : Fin n → Measure ℝ) (E : Fin n → Kernel ℝ ℝ) (ε : ℝ)
    (hV : IsValueProfile V) (hE : IsStrategyProfile E) (hBNE : IsApproxBNE k V E ε)
    (hValue : ∀ i, ∀ v ∈ (V i).support, 0 ≤ v) (ω : ℝ) (hω : 0 < ω) :
    ∃ Et : Fin n → Kernel ℝ ℝ, IsStrategyProfile Et ∧
      IsApproxBNE k V Et (ε + ω) ∧
      IsAtomless V Et ∧ welfare k V E = welfare k V Et ∧
      (∀ i v t, E i v (Iic t) = 1 → Et i v (Iic (t + ω)) = 1) := by sorry

end LargeSupplyFPA.Asymptotic
Source
Hartline, Shah, and vonAllmen, Robust Analysis of First-Price Auctions with Large Supply, Theorem 3 and its proof, pp. 29–33. https://github.com/sigact-stoc/stoc2027/releases/download/papers-2/1201.pdf. This version makes nonnegativity of supported values explicit and states the bound on bid increases used in Theorem 2.

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