Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unnumbered after Eq. (21): dimension-dependent vanishing

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.dimension_dependent_vanishing

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state.

The quantities R, T^infinity and R_H optimize arbitrary finite Bell scenarios and LOCC preprocessing of independent copies, using limsup per positive copy number. Input laws are arbitrary joint laws. T^infinity takes its innermost infimum over a one-copy separable sigma, comparing the same channel and the same measurements on rho^n and sigma^n. R_H counts the successful local-filter branch with its probability, after normalizing that branch; a zero-probability branch scores zero. E_r is the unregularized relative entropy of entanglement. All relative entropies and logarithms use bits and retain infinity on support failure. Let rho_j be PPT density matrices with total dimensions d_j tending to infinity. Suppose rho_j belongs to D(epsilon_j), 0<epsilon_j<1/2, and epsilon_j log_2(d_j) tends to zero. Here D(epsilon_j) requires a normalized separable same-space sigma_j with ||rho_j^Gamma-sigma_j^Gamma||_1<=epsilon_j. Then

R(ρj)⟶0,RH(ρj)⟶0.R(\rho_j)\longrightarrow0,\qquad R_H(\rho_j)\longrightarrow0.R(ρj​)⟶0,RH​(ρj​)⟶0.

In addition, the explicit Eq.(9) states built from any sequence of flat unitaries of shield dimensions j+1 satisfy these two limits. The flat modulus uses the corrected 1/sqrt(j+1) normalization. This formalizes “faster than 1/log d” as a little-o condition, and includes the source’s example.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P09

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

open Filter

open QAlgorithms.Entanglement (IsSeparableDensity)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)

open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Advance50.P47 (Box)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.4, following Eq.(21): little-o condition epsilon log_2(total dimension)->0,
PPT and genuine near-SEP witnesses; both measures vanish. Includes the Eq.(9) example. -/
theorem dimension_dependent_vanishing :
    (∀ (a b : ℕ → ℕ+) (rho : (j : ℕ) → Op (Fin (a j) × Fin (b j))) (epsilon : ℕ → ℝ),
      (∀ j, (transposeSecond (rho j)).PosSemidef ∧ rho j ∈ nearSep (epsilon j) ∧
        0 < epsilon j ∧ epsilon j < 1/2) →
      Tendsto (fun j => ((a j : ℕ) * (b j : ℕ))) atTop atTop →
      Tendsto (fun j => epsilon j * (Real.log ((a j : ℝ) * (b j : ℝ)) / Real.log 2))
        atTop (nhds 0) →
      Tendsto (fun j => asymptoticR false (rho j)) atTop (nhds 0) ∧
      Tendsto (fun j => asymptoticRH false (rho j)) atTop (nhds 0)) ∧
    (∀ U : (j : ℕ) → Matrix.unitaryGroup (Fin (j+1)) ℂ,
      (∀ j i k, ‖(U j : Op (Fin (j+1))) i k‖ = (Real.sqrt (j+1 : ℝ))⁻¹) →
      Tendsto (fun j => asymptoticR false (asFin (pptPrivate ⟨j+1, by omega⟩ (U j))))
        atTop (nhds 0) ∧
      Tendsto (fun j => asymptoticRH false (asFin (pptPrivate ⟨j+1, by omega⟩ (U j))))
        atTop (nhds 0)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 4, Unnumbered after Eq. (21): dimension-dependent vanishing
Read-back

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

Both of the following universally quantified assertions hold. First, let aj,bja_j,b_jaj​,bj​ be arbitrary sequences of positive integers, ρj\rho_jρj​ arbitrary complex matrices on Caj⊗Cbj\mathbb C^{a_j}\otimes\mathbb C^{b_j}Caj​⊗Cbj​, and ϵj\epsilon_jϵj​ arbitrary real numbers, indexed by every j∈Nj\in\mathbb Nj∈N, including j=0j=0j=0. Suppose, for each jjj, that ρjΓ⪰0\rho_j^\Gamma\succeq0ρjΓ​⪰0, that ρj\rho_jρj​ is positive semidefinite of trace 111, that there is a separable density matrix σj\sigma_jσj​ with ∥ρjΓ−σjΓ∥1≤ϵj\|\rho_j^\Gamma-\sigma_j^\Gamma\|_1\le\epsilon_j∥ρjΓ​−σjΓ​∥1​≤ϵj​, and that 0<ϵj<120<\epsilon_j<\tfrac120<ϵj​<21​. If

ajbj⟶+∞as natural numbers,ϵjlog⁡(ajbj)log⁡2⟶0as real numbers,a_jb_j\longrightarrow+\infty \quad\text{as natural numbers},\qquad \epsilon_j\frac{\log(a_jb_j)}{\log2}\longrightarrow0 \quad\text{as real numbers},aj​bj​⟶+∞as natural numbers,ϵj​log2log(aj​bj​)​⟶0as real numbers,

then R(ρj)→0R(\rho_j)\to0R(ρj​)→0 and RH(ρj)→0R_H(\rho_j)\to0RH​(ρj​)→0 in [0,+∞][0,+\infty][0,+∞]. Second, for every sequence of unitary matrices UjU_jUj​ of size j+1j+1j+1 such that every entry has modulus 1/j+11/\sqrt{j+1}1/j+1​, both R(ρ^j)→0R(\widehat\rho_j)\to0R(ρ​j​)→0 and RH(ρ^j)→0R_H(\widehat\rho_j)\to0RH​(ρ​j​)→0, where ρ^j\widehat\rho_jρ​j​ is the following explicitly defined matrix, relabelled on each party by the chosen finite-set equivalence with {0,…,2(j+1)−1}\{0,\ldots,2(j+1)-1\}{0,…,2(j+1)−1}. Set d=j+1d=j+1d=j+1, define a shield matrix on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd by X(r,s),(t,u)=(Uj)r,s/(dd)X_{(r,s),(t,u)}=(U_j)_{r,s}/(d\sqrt d)X(r,s),(t,u)​=(Uj​)r,s​/(dd​) when (t,u)=(s,r)(t,u)=(s,r)(t,u)=(s,r), and 000 otherwise, and put Y=d XΓY=\sqrt d\,X^\GammaY=d​XΓ and p=(d+1)−1p=(\sqrt d+1)^{-1}p=(d​+1)−1. On two binary key registers and this shield, define ZZZ by its key blocks:

Z00,00=1−p2XX†,Z00,11=1−p2X,Z11,00=1−p2X†,Z11,11=1−p2X†X,Z01,01=p2YY†,Z10,10=p2Y†Y,Z_{00,00}=\frac{1-p}{2}\sqrt{XX^\dagger},\quad Z_{00,11}=\frac{1-p}{2}X,\quad Z_{11,00}=\frac{1-p}{2}X^\dagger,\quad Z_{11,11}=\frac{1-p}{2}\sqrt{X^\dagger X},\quad Z_{01,01}=\frac p2\sqrt{YY^\dagger},\quad Z_{10,10}=\frac p2\sqrt{Y^\dagger Y},Z00,00​=21−p​XX†​,Z00,11​=21−p​X,Z11,00​=21−p​X†,Z11,11​=21−p​X†X​,Z01,01​=2p​YY†​,Z10,10​=2p​Y†Y​,

with every other key block zero; regroup ((α,β),(r,s))((\alpha,\beta),(r,s))((α,β),(r,s)) as ((α,r),(β,s))((\alpha,r),(\beta,s))((α,r),(β,s)) before the finite-set relabelling. This assertion includes d=1d=1d=1. In both assertions, Γ\GammaΓ transposes the second party, (XΓ)(i,j),(k,l)=X(i,l),(k,j)(X^\Gamma)_{(i,j),(k,l)}=X_{(i,l),(k,j)}(XΓ)(i,j),(k,l)​=X(i,l),(k,j)​, and ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​; a separable density matrix is a finite convex combination of tensor products of local positive semidefinite trace-111 matrices. The quantities R,RHR,R_HR,RH​ have the following literal meaning. A Bell experiment consists of a map in the closure of finite LOCC maps, with positive finite output dimensions, followed by local POVMs in any positive finite Bell scenario; finite LOCC maps are generated by identities and complete finite local Kraus operations with outcome-dependent continuations. For a box PPP, put N(P)=sup⁡πinf⁡QDπ(P∥Q)\mathcal N(P)=\sup_\pi\inf_Q D_\pi(P\|Q)N(P)=supπ​infQ​Dπ​(P∥Q), where π\piπ ranges over input probability distributions, QQQ ranges over finite convex combinations of deterministic local response boxes, and Dπ=∑x,yπ(x,y)Dcl,2(Pxy∥Qxy)D_\pi=\sum_{x,y}\pi(x,y)D_{\mathrm{cl},2}(P_{xy}\|Q_{xy})Dπ​=∑x,y​π(x,y)Dcl,2​(Pxy​∥Qxy​). Here Dcl,2(p∥q)D_{\mathrm{cl},2}(p\|q)Dcl,2​(p∥q) is +∞+\infty+∞ if some pi>0=qip_i>0=q_ipi​>0=qi​, and otherwise is the nonnegative part of ∑i:pi≠0pilog⁡(pi/qi)/log⁡2\sum_{i:p_i\ne0}p_i\log(p_i/q_i)/\log2∑i:pi​=0​pi​log(pi​/qi​)/log2. Measurement probabilities are Re⁡tr⁡[(Ax,u⊗By,v)θ]\operatorname{Re}\operatorname{tr}[(A_{x,u}\otimes B_{y,v})\theta]Retr[(Ax,u​⊗By,v​)θ]. For each positive block length nnn, Rn(ρ)R_n(\rho)Rn​(ρ) is the supremum of N\mathcal NN of the measured outputs of experiments on the grouped tensor power ρ[n]\rho^{[n]}ρ[n]. The corresponding Hn(ρ)H_n(\rho)Hn​(ρ) additionally optimizes over complete finite local Kraus families and one selected operator on each side after the experiment’s map: a branch ω\omegaω with trace q=0q=0q=0 contributes 000, and otherwise contributes q Nq\,\mathcal NqN of the experiment’s measurements on ω/q\omega/qω/q. Finally, R(ρ)=lim sup⁡n→∞Rn(ρ)/nR(\rho)=\limsup_{n\to\infty}R_n(\rho)/nR(ρ)=limsupn→∞​Rn​(ρ)/n and RH(ρ)=lim sup⁡n→∞Hn(ρ)/nR_H(\rho)=\limsup_{n\to\infty}H_n(\rho)/nRH​(ρ)=limsupn→∞​Hn​(ρ)/n.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me