6.23
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.smooth_max_aep_upperAll 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 ρ, positive σ on the SAME system and 0<ε<1, the limit of (1/n)Dmax^ε(ρ^⊗n||σ^⊗n) exists in EReal and is at most D(ρ||σ).
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.23
Theorem 6.23, PDF p.109. Printed: sigma in S(B). Changed: sigma on A.
Why: both displayed divergences and equations (6.97)-(6.100) require the same system. -/
theorem smooth_max_aep_upper [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : s.PosSemidef)
(e : ℝ) (he : 0 < e) (he1 : e < 1) :
∃ L : EReal, Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*
smoothMaxD (paperTensorPower r n) (paperTensorPower s n) e) atTop (nhds L) ∧ L ≤ paperRelativeD r s := 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 a finite nonempty type with decidable equality. Let have complex trace , let be any complex matrix on , and let . Write , define using spectral functional calculus, and let consist of all with and . Define and , with extended-real infima. For , define on , and likewise for . Define
where the matrix logarithm applies the real function by spectral functional calculus, with its total-function value . There exists an extended real such that
The sequence is defined also at : the tensor products use empty products equal to , and the real reciprocal is . No support or trace-normalization hypothesis is imposed on , so the upper bound may be .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.