Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5: ∣t(τ,σ)−t(τ,Zσ)∣≤1n(k2)|t(\tau,\sigma)-t(\tau,Z_\sigma)|\le\frac1n\binom k2∣t(τ,σ)−t(τ,Zσ​)∣≤n1​(2k​)

Proved
PermLimits.Cauchy.density_stepLimit_close

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

combinatoricsp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1permutation-limits

Let τ∈Sk\tau\in S_kτ∈Sk​ and σ∈Sn\sigma\in S_nσ∈Sn​ with k≤nk\le nk≤n. Then

∣t(τ,σ)−t(τ,Zσ)∣≤1n(k2).(27)|t(\tau,\sigma)-t(\tau,Z_\sigma)|\le\frac1n\binom k2 . \tag{27}∣t(τ,σ)−t(τ,Zσ​)∣≤n1​(2k​).(27)

Densities of a permutation and of its step limit permutation ZσZ_\sigmaZσ​ agree up to O(k2/n)O(k^2/n)O(k2/n), so for sequences with ∣σn∣→∞|\sigma_n|\to\infty∣σn​∣→∞ the two families of densities have the same limits. This is what lets the whole theory be run on Z\mathcal ZZ.

Formalization Note k≥1k\ge1k≥1 is assumed, as in the source (τ∈Sk\tau\in S_kτ∈Sk​ for a positive integer kkk); with k≤nk\le nk≤n it gives n≥1n\ge1n≥1. The source's permutation is named σ\sigmaσ; the Lean statement calls it π\piπ because σ\sigmaσ is reserved notation.

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

open unitInterval

/-- **Lemma 3.5** (Hoppen et al., *Limits of permutation sequences*, arXiv:1103.5844v2, p. 11).
Let `τ ∈ S_k`, `π ∈ S_n`, `k ≤ n`. Then `|t(τ, π) − t(τ, Z_π)| ≤ (1/n) · C(k, 2)` (Eq. (27)).

**Formalization Note.** The paper's permutation is called `σ`; here `π` (`σ` is reserved notation
once `unitInterval` is opened). `k ≥ 1` is the paper's standing convention that `τ ∈ S_k` for a
positive integer `k` (Definition 1.1); with `k ≤ n` it gives `n ≥ 1`, so `1/n` is a genuine
quotient. -/
theorem density_stepLimit_close {k n : ℕ} (τ : Equiv.Perm (Fin k)) (π : Equiv.Perm (Fin n))
    (hk : 0 < k) (hkn : k ≤ n) :
    |permDensity τ π - limitDensity τ (stepLimit π)| ≤ (1 / (n : ℝ)) * (Nat.choose k 2 : ℝ) := 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. 11, Lemma 3.5 (Eq. (27))
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