Corollary 5: asymptotic continuity of ER and its regularization
OpenQAlgorithms.Papers.Independent.Support50.P18.entanglement_asymptotic_continuityLet be infinite-dimensional separable systems, and suppose satisfies condition (22). Fix a finite budget . For each positive integer , let be arbitrary states on , with no product-state assumption, such that both mean energies of the additive Hamiltonian are at most . If , all entanglement quantities below are finite and
Here and have their actual relative-entropy and regularized meanings. This applies in particular to oscillator Hamiltonians, which satisfy (22). The formal indexing uses to range over exactly the positive block lengths.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P18
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be countably infinite index types, let satisfy in as , and let satisfy . A trace class matrix on admits , where and ; its size is the infimum of such costs, or if none exists. A state is such a matrix with real nonnegative finite coordinate quadratic forms and summable real diagonal entries of sum . For each natural , let be states on . For , put , write , and define . Assume, for every , that both and are at most , and assume in . For any bipartite matrix , define , where a state is separable when every admits a finite convex combination of product states with , , and , and where
Here ranges over all finite coordinate sets, including the empty set, compressions use the same , and logarithms use continuous functional calculus with . Also define , where the tensor power entries are products of corresponding entries of . Then all four values , , , and are finite for every , and
The superscript denotes conversion to a real number, sending to , though the conclusion asserts that these values are finite. The first block, , contains one copy of each subsystem; all normalization denominators are therefore positive, and no convergence rate for the distances is assumed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.