Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5: asymptotic continuity of ER and its regularization

Open
QAlgorithms.Papers.Independent.Support50.P18.entanglement_asymptotic_continuity

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let A,BA,BA,B be infinite-dimensional separable systems, and suppose HA≥0H_A\ge0HA​≥0 satisfies condition (22). Fix a finite budget E≥E0E\ge E_0E≥E0​. For each positive integer nnn, let ρn,σn\rho_n,\sigma_nρn​,σn​ be arbitrary states on AnBnA^nB^nAnBn, with no product-state assumption, such that both mean energies of the additive Hamiltonian HAn=∑j=1nHA(j)H_{A^n}=\sum_{j=1}^n H_A^{(j)}HAn​=∑j=1n​HA(j)​ are at most nEnEnE. If ∥ρn−σn∥1→0\|\rho_n-\sigma_n\|_1\to0∥ρn​−σn​∥1​→0, all entanglement quantities below are finite and

lim⁡n→∞∣ER(ρn)−ER(σn)∣n=0,lim⁡n→∞∣ER∞(ρn)−ER∞(σn)∣n=0.\lim_{n\to\infty}\frac{|E_R(\rho_n)-E_R(\sigma_n)|}{n}=0,\qquad\lim_{n\to\infty}\frac{|E_R^\infty(\rho_n)-E_R^\infty(\sigma_n)|}{n}=0.n→∞lim​n∣ER​(ρn​)−ER​(σn​)∣​=0,n→∞lim​n∣ER∞​(ρn​)−ER∞​(σn​)∣​=0.

Here ERE_RER​ and ER∞E_R^\inftyER∞​ have their actual relative-entropy and regularized meanings. This applies in particular to oscillator Hamiltonians, which satisfy (22). The formal indexing uses n+1n+1n+1 to range over exactly the positive block lengths.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P18
Formal statement
noncomputable section

open Filter

open scoped ENNReal NNReal BigOperators Topology

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Support50.P18

open QAlgorithms.Papers.Independent.Dependency50.P33 (State PureState traceSize rankOne)

open QAlgorithms.Papers.Independent.Frontier18.P01 (convexOperatorMixture traceSecond)

open QAlgorithms.Papers.Independent.Frontier18.P07
  (extendedEntropyNats extendedRelativeEntropyNats)

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Claimed50.P39 (g)

open QAlgorithms.Papers.Independent.Renew46.P08
  (coefficientEnergy entropySupremum extendedHalfTraceDistance)

/-- Corollary 5, PDF p.16: arbitrary correlated block states, indexed by n+1
so that every quotient has positive denominator. The per-copy energy budget
is fixed and neither input sequence is required to consist of tensor powers. -/
theorem entanglement_asymptotic_continuity {I J : Type}
    [Countable I] [Infinite I] [Countable J] [Infinite J]
    (energy : I → ℝ≥0) (h22 : Condition22 energy) (E : ℝ)
    (hE : spectralGround energy ≤ E)
    (rho sigma : (n : ℕ) → State ((Fin (n + 1) → I) × (Fin (n + 1) → J)))
    (hrho : ∀ n, coefficientEnergy (additiveEnergy energy (n + 1))
      (traceSecond (rho n).coefficients) ≤ ENNReal.ofReal ((n + 1 : ℝ) * E))
    (hsigma : ∀ n, coefficientEnergy (additiveEnergy energy (n + 1))
      (traceSecond (sigma n).coefficients) ≤ ENNReal.ofReal ((n + 1 : ℝ) * E))
    (hdist : Tendsto (fun n => nuclearStateDistance (rho n) (sigma n)) atTop (nhds 0)) :
    (∀ n, countableRelativeEntanglementNats (rho n).coefficients < ⊤ ∧
      countableRelativeEntanglementNats (sigma n).coefficients < ⊤ ∧
      regularizedCountableEntanglementNats (rho n).coefficients < ⊤ ∧
      regularizedCountableEntanglementNats (sigma n).coefficients < ⊤) ∧
    Tendsto (fun n =>
      |(countableRelativeEntanglementNats (rho n).coefficients).toReal -
        (countableRelativeEntanglementNats (sigma n).coefficients).toReal| / (n + 1 : ℝ))
      atTop (nhds 0) ∧
    Tendsto (fun n =>
      |(regularizedCountableEntanglementNats (rho n).coefficients).toReal -
        (regularizedCountableEntanglementNats (sigma n).coefficients).toReal| / (n + 1 : ℝ))
      atTop (nhds 0) := by sorry

end QAlgorithms.Papers.Independent.Support50.P18

end
Source
Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use, arXiv:1609.07044v5, PDF p. 16, Corollary 5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let I,JI,JI,J be countably infinite index types, let e:I→[0,∞)e:I\to[0,\infty)e:I→[0,∞) satisfy (∑ie−λei)λ→1\left(\sum_i e^{-\lambda e_i}\right)^\lambda\to1(∑i​e−λei​)λ→1 in [0,∞][0,\infty][0,∞] as λ↓0\lambda\downarrow0λ↓0, and let E∈RE\in\mathbb RE∈R satisfy inf⁡iei≤E\inf_i e_i\le Einfi​ei​≤E. A trace class matrix on LLL admits Xij=∑rur(i)vr(j)‾X_{ij}=\sum_ru_r(i)\overline{v_r(j)}Xij​=∑r​ur​(i)vr​(j)​, where ur,vr∈ℓ2(L;C)u_r,v_r\in\ell^2(L;\mathbb C)ur​,vr​∈ℓ2(L;C) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞; its size τ(X)\tau(X)τ(X) is the infimum of such costs, or +∞+\infty+∞ if none exists. A state is such a matrix with real nonnegative finite coordinate quadratic forms and summable real diagonal entries of sum 111. For each natural nnn, let ρn,σn\rho_n,\sigma_nρn​,σn​ be states on In+1×Jn+1I^{n+1}\times J^{n+1}In+1×Jn+1. For m≥1m\ge1m≥1, put e(m)(a)=∑k<me(ak)e^{(m)}(a)=\sum_{k<m}e(a_k)e(m)(a)=∑k<m​e(ak​), write (XA)ab=∑c∈JmX(a,c),(b,c)(X_A)_{ab}=\sum_{c\in J^m}X_{(a,c),(b,c)}(XA​)ab​=∑c∈Jm​X(a,c),(b,c)​, and define Ee(m)(XA)=∑a∈Ime(m)(a)[Re⁡(XA)aa]+\mathcal E_{e^{(m)}}(X_A)=\sum_{a\in I^m}e^{(m)}(a)[\operatorname{Re}(X_A)_{aa}]_+Ee(m)​(XA​)=∑a∈Im​e(m)(a)[Re(XA​)aa​]+​. Assume, for every nnn, that both Ee(n+1)((ρn)A)\mathcal E_{e^{(n+1)}}((\rho_n)_A)Ee(n+1)​((ρn​)A​) and Ee(n+1)((σn)A)\mathcal E_{e^{(n+1)}}((\sigma_n)_A)Ee(n+1)​((σn​)A​) are at most [(n+1)E]+[(n+1)E]_+[(n+1)E]+​, and assume τ(ρn−σn)/2→0\tau(\rho_n-\sigma_n)/2\to0τ(ρn​−σn​)/2→0 in [0,∞][0,\infty][0,∞]. For any bipartite matrix XXX, define ER(X)=inf⁡ω separable stateD(X∥ω)E_{\mathrm R}(X)=\inf_{\omega\text{ separable state}}D(X\|\omega)ER​(X)=infω separable state​D(X∥ω), where a state ω\omegaω is separable when every δ>0\delta>0δ>0 admits a finite convex combination Y=∑rpr(Ar⊗Br)Y=\sum_rp_r(A_r\otimes B_r)Y=∑r​pr​(Ar​⊗Br​) of product states with pr≥0p_r\ge0pr​≥0, ∑rpr=1\sum_rp_r=1∑r​pr​=1, and τ(ω−Y)<δ\tau(\omega-Y)<\deltaτ(ω−Y)<δ, and where

D(X∥ω)=sup⁡s{[Re⁡tr⁡(Xslog⁡Xs−Xslog⁡ωs+ωs−Xs)]+,ker⁡ωs⊆ker⁡Xs,+∞,otherwise.D(X\|\omega)=\sup_s \begin{cases} [\operatorname{Re}\operatorname{tr}(X_s\log X_s-X_s\log\omega_s+\omega_s-X_s)]_+, &\ker\omega_s\subseteq\ker X_s,\\ +\infty,&\text{otherwise}. \end{cases}D(X∥ω)=ssup​{[Retr(Xs​logXs​−Xs​logωs​+ωs​−Xs​)]+​,+∞,​kerωs​⊆kerXs​,otherwise.​

Here sss ranges over all finite coordinate sets, including the empty set, compressions use the same sss, and logarithms use continuous functional calculus with log⁡0=0\log0=0log0=0. Also define ERreg(X)=inf⁡r≥1ER(X[r])/rE_{\mathrm R}^{\mathrm{reg}}(X)=\inf_{r\ge1}E_{\mathrm R}(X^{[r]})/rERreg​(X)=infr≥1​ER​(X[r])/r, where the tensor power entries are products of rrr corresponding entries of XXX. Then all four values ER(ρn)E_{\mathrm R}(\rho_n)ER​(ρn​), ER(σn)E_{\mathrm R}(\sigma_n)ER​(σn​), ERreg(ρn)E_{\mathrm R}^{\mathrm{reg}}(\rho_n)ERreg​(ρn​), and ERreg(σn)E_{\mathrm R}^{\mathrm{reg}}(\sigma_n)ERreg​(σn​) are finite for every nnn, and

∣ER(ρn)♭−ER(σn)♭∣n+1⟶0,∣ERreg(ρn)♭−ERreg(σn)♭∣n+1⟶0.\frac{|E_{\mathrm R}(\rho_n)^\flat-E_{\mathrm R}(\sigma_n)^\flat|}{n+1}\longrightarrow0, \qquad \frac{|E_{\mathrm R}^{\mathrm{reg}}(\rho_n)^\flat-E_{\mathrm R}^{\mathrm{reg}}(\sigma_n)^\flat|}{n+1}\longrightarrow0.n+1∣ER​(ρn​)♭−ER​(σn​)♭∣​⟶0,n+1∣ERreg​(ρn​)♭−ERreg​(σn​)♭∣​⟶0.

The superscript ♭\flat♭ denotes conversion to a real number, sending +∞+\infty+∞ to 000, though the conclusion asserts that these values are finite. The first block, n=0n=0n=0, contains one copy of each subsystem; all normalization denominators are therefore positive, and no convergence rate for the distances is assumed.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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