Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 5, eqs. (51)–(53), p. 14 — perturbing the atoms by factors tending to 1 does not change a compactly supported weak limit

Proved
NechitaRDM.MP.dilation_tendsto

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityweak-convergence

Let (μn)n(\mu_n)_n(μn​)n​ be measures on R\mathbb RR converging weakly to a probability measure ν\nuν with compact support, in the sense that ∫f dμn→∫f dν\int f\,d\mu_n \to \int f\,d\nu∫fdμn​→∫fdν for every bounded continuous fff. Let tn→1t_n \to 1tn​→1 be real numbers and let μntn\mu_n^{t_n}μntn​​ be the image of μn\mu_nμn​ under x↦tnxx \mapsto t_n xx↦tn​x (for an empirical measure, every Dirac mass δx\delta_xδx​ is replaced by δtnx\delta_{t_n x}δtn​x​). Then

∫f dμntn⟶∫f dνfor every bounded continuous f.\int f\,d\mu_n^{t_n} \longrightarrow \int f\,d\nu \qquad \text{for every bounded continuous } f .∫fdμntn​​⟶∫fdνfor every bounded continuous f.

In the proof of Theorem 5 it is applied pathwise with μn=LnW\mu_n = L_n^Wμn​=LnW​, ν=μc\nu = \mu_cν=μc​ (supported in [0,(c+1)2][0, (\sqrt c+1)^2][0,(c​+1)2]) and tn=cn2/Snt_n = cn^2/S_ntn​=cn2/Sn​: "such a perturbation does not change the limit in distribution".

Formalization Note The paper argues through moments; this milestone states the claim the proof needs, with the paper's compact-support assumption on the limit, as a deterministic fact about measures.

Preamble
import Mathlib
import Definitions.Def_NechitaRDM_MP_Basic
Formal statement
namespace NechitaRDM.MP

open MeasureTheory Filter Topology

/-- **Proof of Theorem 5, eqs. (51)–(53)** (p. 14). If measures `μₙ` on `ℝ` converge weakly to a
compactly supported probability measure `ν`, and the atoms are perturbed by factors `tₙ → 1`
(`x ↦ tₙ x`), the perturbed measures still converge weakly to `ν`. -/
theorem dilation_tendsto (μ : ℕ → Measure ℝ) (ν : Measure ℝ) [IsProbabilityMeasure ν]
    (hν : ∃ K : Set ℝ, IsCompact K ∧ ν Kᶜ = 0)
    (hμ : ∀ f : BoundedContinuousFunction ℝ ℝ,
      Tendsto (fun n => ∫ x, f x ∂(μ n)) atTop (𝓝 (∫ x, f x ∂ν)))
    (t : ℕ → ℝ) (ht : Tendsto t atTop (𝓝 1)) :
    ∀ f : BoundedContinuousFunction ℝ ℝ,
      Tendsto (fun n => ∫ x, f x ∂((μ n).map fun x => t n * x)) atTop
        (𝓝 (∫ x, f x ∂ν)) := by sorry

end NechitaRDM.MP
Source
Nechita, Asymptotics of random density matrices, arXiv:quant-ph/0702154v3, p. 14, proof of Theorem 5, eqs. (51)–(53)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me