Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.3: Zn⇒Z  ⟺  Zn→□Z  ⟺  Zn→tZZ_n\Rightarrow Z\iff Z_n\xrightarrow{\square}Z\iff Z_n\xrightarrow{t}ZZn​⇒Z⟺Zn​□​Z⟺Zn​t​Z

Proved
PermLimits.Existence.convergences_equivalent

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

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

Let Z,Z1,Z2,…Z,Z_1,Z_2,\dotsZ,Z1​,Z2​,… be limit permutations. The three notions of convergence of Definition 5.2 are equivalent:

Zn⇒Z  ⟺  Zn→□Z  ⟺  Zn→tZ.Z_n\Rightarrow Z\iff Z_n\xrightarrow{\square}Z\iff Z_n\xrightarrow{t}Z .Zn​⇒Z⟺Zn​□​Z⟺Zn​t​Z.

Weak convergence of the associated random points, convergence in rectangular distance, and convergence of all pattern densities are therefore one notion on Z\mathcal ZZ. Combined with compactness of the space of laws on the square, this is the engine of the existence proof.

Formalization Note The chain of equivalences is stated as the conjunction of two equivalences.

Preamble
import Mathlib
import Definitions.Def_PermLimits_Shared_LimitPermutation
import Definitions.Def_PermLimits_Shared_LimitConvergence
open PermLimits.Shared
Formal statement
namespace PermLimits.Existence

open unitInterval

/-- **Lemma 5.3** (Hoppen et al., *Limits of permutation sequences*, arXiv:1103.5844v2, p. 16).
Let `Z, Z₁, Z₂, …` be limit permutations. The three notions of convergence of Definition 5.2 are
equivalent: `Z_n ⇒ Z ⟺ Z_n →□ Z ⟺ Z_n →ᵗ Z`.

**Formalization Note.** The chain of equivalences is the conjunction of two `↔`. -/
theorem convergences_equivalent (Zs : ℕ → I → I → ℝ) (Z : I → I → ℝ)
    (hZs : ∀ n, IsLimitPerm (Zs n)) (hZ : IsLimitPerm Z) :
    (WeakConv Zs Z ↔ RectConv Zs Z) ∧ (RectConv Zs Z ↔ DensityConv Zs Z) := by sorry

end PermLimits.Existence
Source
Hoppen, Kohayakawa, Moreira, Ráth, Sampaio, Limits of permutation sequences, arXiv:1103.5844v2, https://arxiv.org/abs/1103.5844v2, p. 16, Definition 5.2 and Lemma 5.3
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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