Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — ∣φ(x)−φ(y)∣1≤2e2K∣x−y∣1|\varphi(x)-\varphi(y)|_1\le 2e^{2K}|x-y|_1∣φ(x)−φ(y)∣1​≤2e2K∣x−y∣1​ when ∣x∣∞,∣y∣∞≤K|x|_\infty,|y|_\infty\le K∣x∣∞​,∣y∣∞​≤K

Proved
GivenDegreeSeq.GraphLimit.lemma_2_2

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

lipschitzmaximum-likelihoodp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-graphs

Let d∈Rnd\in\mathbb R^nd∈Rn and let φ\varphiφ be the map of (4)–(5). Let x,y∈Rnx,y\in\mathbb R^nx,y∈Rn and K∈RK\in\mathbb RK∈R with max⁡{∣x∣∞,∣y∣∞}≤K\max\{|x|_\infty,|y|_\infty\}\le Kmax{∣x∣∞​,∣y∣∞​}≤K. Then

∣φ(x)−φ(y)∣1≤2e2K ∣x−y∣1,|\varphi(x)-\varphi(y)|_1\le 2e^{2K}\,|x-y|_1,∣φ(x)−φ(y)∣1​≤2e2K∣x−y∣1​,

where ∣z∣1=∑i∣zi∣|z|_1=\sum_i|z_i|∣z∣1​=∑i​∣zi​∣ is the L1L^1L1 norm and ∣z∣∞=max⁡i∣zi∣|z|_\infty=\max_i|z_i|∣z∣∞​=maxi​∣zi​∣.

This Lipschitz bound in L1L^1L1 is the technical input that lets the proof of Theorem 1.1 control the iterates xℓ=φ(xℓ−1)x_\ell=\varphi(x_{\ell-1})xℓ​=φ(xℓ−1​) in the L1L^1L1 norm, eq. (26).

Formalization Note ∣⋅∣∞|\cdot|_\infty∣⋅∣∞​ is Mathlib's norm on Fin n → ℝ; the L1L^1L1 norms are written as explicit sums. No positivity of ddd is assumed: log⁡di\log d_ilogdi​ cancels in each coordinate of φ(x)−φ(y)\varphi(x)-\varphi(y)φ(x)−φ(y).

Preamble
import Mathlib
import Definitions.Def_GivenDegreeSeq_GraphLimit_Phi
Formal statement
namespace GivenDegreeSeq.GraphLimit

/-- **Lemma 2.2** (Chatterjee–Diaconis–Sly, arXiv:1005.1136v5, p. 14). Let `x, y ∈ ℝⁿ` with
`max{|x|∞, |y|∞} ≤ K`. Then `|φ(x) − φ(y)|₁ ≤ 2e^{2K} |x − y|₁`, where `|·|₁` is the `L¹` norm on
`ℝⁿ`. Here `‖·‖` on `Fin n → ℝ` is the sup norm `|·|∞`; the `L¹` norms are written out as sums.
The terms `log d_i` cancel in `φ(x) − φ(y)`, so no condition on `d` is needed. -/
theorem lemma_2_2 (n : ℕ) (d x y : Fin n → ℝ) (K : ℝ) (hx : ‖x‖ ≤ K) (hy : ‖y‖ ≤ K) :
    ∑ i, |phi d x i - phi d y i| ≤ 2 * Real.exp (2 * K) * ∑ i, |x i - y i| := by sorry

end GivenDegreeSeq.GraphLimit
Source
Chatterjee, Diaconis & Sly, Random Graphs with a Given Degree Sequence, arXiv:1005.1136v5, p. 14, Lemma 2.2
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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