Lemma 2 — allocation probability at bids below vanishes uniformly
ProvedLargeSupplyFPA.Asymptotic.lemma_2bayes-nash-equilibriumfirst-price-auctionmulti-unit-auctionp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1price-of-anarchy
Fix . Consider a sequence of -unit first-price auctions with agents whose bid distributions satisfy Assumption 4. For any bids ,
Lemma 1 only controls the -th order statistic, which bounds the allocation probability from below (Fact 3). Lemma 2 bounds every agent's allocation probability from above, which is needed in Lemmas 5 and 6.
Differences from the source:
- encoding: a strategy is a map E_i : V_i → Δ(ℝ≥0) from values to bid distributions → a Markov kernel E i : Kernel ℝ ℝ with E i v ((−∞, 0)) = 0 for every v; reason: measurability in v is what makes the marginal bid distribution ∫ E_{i,v} dV_i defined; a law on ℝ with no mass below 0 is a law on ℝ≥0
- encoding: a sequence of k-unit auctions (A^(k))_{k∈ℕ} with n(k) > k agents; subsequences (A^(k_l)) → n : ℕ → ℕ with k < n k, agents Fin (n k), value laws V k and kernels E k indexed by the unit count k (k = 0 included); a subsequence is a strictly increasing φ : ℕ → ℕ and the auction φ l has φ l units; reason: Lean indexing; the term k = 0 does not affect any limit
- encoding: ψ̄_^(k), ψ̲_^(k) := min{b ≥ 0 : E[T^(k)(b)] ≤ k ∓ k^(0.5+δ) − 1}, which 'exist for k large enough' → sInf of the same set, equal to its minimum whenever the set is nonempty and 0 for the finitely many k where it is empty; δ ∈ (0, 0.5) is an explicit parameter; reason: only the eventual behaviour of the thresholds enters the statements
- generalization: E^(k) are the equilibrium bid distributions of the sequence (standing Assumption 1 of §2) → any value laws and strategy profiles with Assumption 4; no equilibrium property, no Assumption 1; reason: the proof uses only Assumption 4 and Chernoff bounds; the printed lemma is the special case
- encoding: max_{i∈N^(k)} → ⨆ over i : Fin (n k), a finite nonempty index set since n k > k ≥ 0; reason: same value
Preamble
import Mathlib import Definitions.Def_LargeSupplyFPA_Asymptotic_Model import Definitions.Def_LargeSupplyFPA_Asymptotic_Assumptions import Definitions.Def_LargeSupplyFPA_Asymptotic_Thresholds open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace LargeSupplyFPA.Asymptotic
theorem lemma_2 (δ : ℝ) (hδ : δ ∈ Set.Ioo (0 : ℝ) 0.5)
(n : ℕ → ℕ) (V : ∀ k, Fin (n k) → Measure ℝ) (E : ∀ k, Fin (n k) → Kernel ℝ ℝ)
(hseq : IsAuctionSequence n V E) (hA4 : ∀ k, IsAtomless (V k) (E k))
(b : ℕ → ℝ) (hb : ∀ k, 0 ≤ b k ∧ b k ≤ lowThreshold δ k (V k) (E k)) :
Tendsto (fun k => ⨆ i : Fin (n k), alloc k (V k) (E k) i (b k)) atTop (𝓝 0) := by sorry
end LargeSupplyFPA.Asymptotic
Source
Hartline, Shah, vonAllmen, Robust Analysis of First-Price Auctions with Large Supply, STOC 2027 submission (manuscript of November 3, 2026, sha256 2ad8363b…), p. 17, Lemma 2 (proof pp. 17–18)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.