Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (49): σn→Z  ⟺  Zσn→tZ\sigma_n\to Z\iff Z_{\sigma_n}\xrightarrow{t}Zσn​→Z⟺Zσn​​t​Z

Proved
PermLimits.Cauchy.converges_iff_stepLimit_densityConv

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

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

Let (σn)(\sigma_n)(σn​) be a permutation sequence with ∣σn∣→∞|\sigma_n|\to\infty∣σn​∣→∞ and let Z∈ZZ\in\mathcal ZZ∈Z. Then

σn→Z  ⟺  Zσn→tZ.(49)\sigma_n\to Z\iff Z_{\sigma_n}\xrightarrow{t}Z . \tag{49}σn​→Z⟺Zσn​​t​Z.(49)

Convergence of a permutation sequence to ZZZ is thereby reduced to convergence of limit permutations in the density sense.

Formalization Note ∣σn∣→∞|\sigma_n|\to\infty∣σn​∣→∞ is the standing assumption stated in the sentence preceding (49).

Preamble
import Mathlib
import Definitions.Def_PermLimits_Shared_LimitPermutation
import Definitions.Def_PermLimits_Shared_ConvergesTo
import Definitions.Def_PermLimits_Shared_StepLimit
import Definitions.Def_PermLimits_Shared_LimitConvergence
open PermLimits.Shared
Formal statement
namespace PermLimits.Cauchy

open Filter unitInterval

/-- **Eq. (49)** (Hoppen et al., *Limits of permutation sequences*, arXiv:1103.5844v2,
Sect. 5.2, p. 17). For a permutation sequence `(σ_m)` with `|σ_m| → ∞` and `Z ∈ 𝒵`,
`σ_m → Z ⟺ Z_{σ_m} →ᵗ Z`.

**Formalization Note.** The sequence is named `s` (`σ` is reserved notation once `unitInterval`
is opened). `|σ_m| → ∞` is the standing assumption the paper sets in the sentence before (49).
-/
theorem converges_iff_stepLimit_densityConv (s : ℕ → Σ n : ℕ, Equiv.Perm (Fin n))
    (hs : Tendsto (fun m => (s m).1) atTop atTop) (Z : I → I → ℝ) (hZ : IsLimitPerm Z) :
    ConvergesTo s Z ↔ DensityConv (fun m => stepLimit (s m).2) Z := 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. 17, Sect. 5.2, Eq. (49)
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