6.25
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.aep_converseAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
For normalized ρ_AB and 0≤ε<1, the regularized smooth min-entropy limit is ≤H(A|B), and the regularized smooth max-entropy limit is ≥H(A|B). Include ε=0 without claiming equality at zero.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.25
6.25, arXiv:1504.00233v5, PDF p.111. -/
theorem aep_converse [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : IsDensityMatrix r)
(e : ℝ) (he : 0 ≤ e) (he1 : e < 1) :
(∃ L : EReal, Tendsto (minRate r e) atTop (nhds L) ∧ L ≤ (conditionalVN r:EReal)) ∧
(∃ L : EReal, Tendsto (maxRate r e) atTop (nhds L) ∧ (conditionalVN r:EReal) ≤ L) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, let be a complex matrix on with , and let , including . Write , set using spectral functional calculus, and define . For a matrix on , define , , , and , where all extrema are extended-real and , while otherwise . Let on . Let , define by spectral functional calculus with , using the real logarithm’s value at , and put . Then there exist extended reals and , independently, satisfying
The limits are along natural numbers tending to infinity; the sequences include , with empty products equal to and real reciprocal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.