Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 38 — for X_n ∼ Poisson(λn), Z = sup_{n ≥ 1} X_n/n has finite mean

Proved
MarketInterference.FluidLimit.lemma_2

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

integrabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1poisson-distribution

Let λ≥0\lambda\ge 0λ≥0 and, on a probability space, let X1,X2,…X_1,X_2,\dotsX1​,X2​,… be random variables with Xn∼Poisson(λn)X_n\sim\mathrm{Poisson}(\lambda n)Xn​∼Poisson(λn) for every n≥1n\ge 1n≥1; no independence or other joint structure is assumed. Put Yn=1nXnY_n=\frac1n X_nYn​=n1​Xn​. Then

Z=sup⁡n≥1YnsatisfiesE[Z]<∞.Z=\sup_{n\ge 1} Y_n\quad\text{satisfies}\quad \mathbb E[Z]<\infty.Z=n≥1sup​Yn​satisfiesE[Z]<∞.

In the proof of Theorem 1 this supplies an integrable dominating function for the scaled matching values.

Formalization Note The paper writes Z=max⁡n=1∞YnZ=\max_{n=1}^\infty Y_nZ=maxn=1∞​Yn​; the maximum need not be attained, so ZZZ is the supremum, taken in [0,∞][0,\infty][0,∞], and the conclusion is that its lower Lebesgue integral is finite. Each XnX_nXn​ is a measurable N\mathbb NN-valued map whose law is Poisson(nλ)\mathrm{Poisson}(n\lambda)Poisson(nλ).

Preamble
import Mathlib
Formal statement
namespace MarketInterference.FluidLimit

open MeasureTheory ProbabilityTheory NNReal ENNReal

/-- Lemma 2 (arXiv:2205.02274v4, p. 38): if `X_n ∼ Poisson(λ n)` for every `n ≥ 1` (any joint law)
and `Y_n = X_n / n`, then `Z = sup_{n ≥ 1} Y_n` has a finite mean. -/
theorem lemma_2 {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (lam : ℝ≥0) (X : ℕ → Ω → ℕ)
    (hX : ∀ n : ℕ, 1 ≤ n → Measurable (X n) ∧ P.map (X n) = poissonMeasure ((n : ℝ≥0) * lam)) :
    ∫⁻ ω, (⨆ (n : ℕ) (_ : 1 ≤ n), ENNReal.ofReal ((X n ω : ℝ) / (n : ℝ))) ∂P < ⊤ := by sorry

end MarketInterference.FluidLimit
Source
Bright, Delarue and Lobel, Reducing Marketplace Interference Bias Via Shadow Prices, arXiv:2205.02274v4, p. 38, Lemma 2
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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