Lemma 5.3:
ProvedPermLimits.Existence.convergences_equivalentp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1permutation-limitsprobability
Let be limit permutations. The three notions of convergence of Definition 5.2 are equivalent:
Weak convergence of the associated random points, convergence in rectangular distance, and convergence of all pattern densities are therefore one notion on . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.