Unnumbered after Eq. (21): dimension-dependent vanishing
OpenQAlgorithms.Papers.Independent.Intakethird100.P09.dimension_dependent_vanishingAll 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
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
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
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 be arbitrary sequences of positive integers, arbitrary complex matrices on , and arbitrary real numbers, indexed by every , including . Suppose, for each , that , that is positive semidefinite of trace , that there is a separable density matrix with , and that . If
then and in . Second, for every sequence of unitary matrices of size such that every entry has modulus , both and , where is the following explicitly defined matrix, relabelled on each party by the chosen finite-set equivalence with . Set , define a shield matrix on by when , and otherwise, and put and . On two binary key registers and this shield, define by its key blocks:
with every other key block zero; regroup as before the finite-set relabelling. This assertion includes . In both assertions, transposes the second party, , and ; a separable density matrix is a finite convex combination of tensor products of local positive semidefinite trace- matrices. The quantities 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 , put , where ranges over input probability distributions, ranges over finite convex combinations of deterministic local response boxes, and . Here is if some , and otherwise is the nonnegative part of . Measurement probabilities are . For each positive block length , is the supremum of of the measured outputs of experiments on the grouped tensor power . The corresponding additionally optimizes over complete finite local Kraus families and one selected operator on each side after the experiment’s map: a branch with trace contributes , and otherwise contributes of the experiment’s measurements on . Finally, and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.