Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.1: with uniform marginals, weak convergence equals uniform convergence of joint cdfs

Proved
PermLimits.Cauchy.weak_conv_iff_uniform_cdf

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1permutation-limitsprobability

Let (μn)n≥1(\mu_n)_{n\ge1}(μn​)n≥1​ and μ\muμ be probability measures on [0,1]2[0,1]^2[0,1]2, with random points (Xn,Yn)(X_n,Y_n)(Xn​,Yn​), (X,Y)(X,Y)(X,Y) and joint distribution functions FnF_nFn​, FFF. Assume Xn,Yn∼U[0,1]X_n,Y_n\sim U[0,1]Xn​,Yn​∼U[0,1] for every nnn. Then

(Xn,Yn)→d(X,Y)  ⟺  ∥Fn−F∥∞=sup⁡x,y∈[0,1]∣Fn(x,y)−F(x,y)∣→0.(X_n,Y_n)\xrightarrow{d}(X,Y)\iff \|F_n-F\|_\infty=\sup_{x,y\in[0,1]}|F_n(x,y)-F(x,y)|\to0 .(Xn​,Yn​)d​(X,Y)⟺∥Fn​−F∥∞​=x,y∈[0,1]sup​∣Fn​(x,y)−F(x,y)∣→0.

For general measures on the square only the implication from right to left holds; the uniform marginals are what make the joint cdfs uniformly equicontinuous. The lemma translates weak convergence into a metric statement, which is how rectangular distance enters the theory.

Formalization Note Weak convergence is tested against all continuous functions on the compact square. Uniform convergence of FnF_nFn​ to FFF is TendstoUniformly on [0,1]2[0,1]^2[0,1]2. No marginal assumption is made on μ\muμ, as in the source.

Preamble
import Mathlib
import Definitions.Def_PermLimits_Shared_LimitMeasure
import Definitions.Def_PermLimits_Shared_LimitConvergence
open PermLimits.Shared
Formal statement
namespace PermLimits.Cauchy

open MeasureTheory Filter unitInterval

/-- **Lemma 2.1** (Hoppen et al., *Limits of permutation sequences*, arXiv:1103.5844v2, p. 7).
Let `(μ_n)` and `μ` be probability measures on `[0,1]²`, with joint distribution functions
`F_n` and `F`, and assume that for every `n` both marginals of `μ_n` are uniform on `[0, 1]`.
Then `μ_n ⇒ μ` (convergence in distribution `(X_n, Y_n) →ᵈ (X, Y)`) if and only if
`‖F_n − F‖_∞ = sup_{x,y ∈ [0,1]} |F_n(x, y) − F(x, y)| → 0`.

**Formalization Note.** Weak convergence is the paper's (9) with continuous test functions on the
compact square (`WeakConvMeasures`). `‖F_n − F‖_∞ → 0` is `TendstoUniformly` of the joint
distribution functions on `[0,1]²`. No marginal assumption is made on `μ`, as in the paper. -/
theorem weak_conv_iff_uniform_cdf (μs : ℕ → Measure (I × I)) (μ : Measure (I × I))
    (hμs : ∀ n, IsProbabilityMeasure (μs n)) [IsProbabilityMeasure μ]
    (hX : ∀ n, (μs n).map Prod.fst = volume) (hY : ∀ n, (μs n).map Prod.snd = volume) :
    WeakConvMeasures μs μ ↔
      TendstoUniformly (fun n (p : I × I) => jointCDF (μs n) p.1 p.2)
        (fun p : I × I => jointCDF μ p.1 p.2) atTop := by sorry

end PermLimits.Cauchy
Source
Hoppen, Kohayakawa, Moreira, Ráth, Sampaio, Limits of permutation sequences, arXiv:1103.5844v2, https://arxiv.org/abs/1103.5844v2, p. 7, Lemma 2.1
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

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