7.5
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.strong_converse_exponentAll 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. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are and ; the divergences include division by inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation means support inclusion. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation denotes conditional von Neumann entropy. In hypothesis testing, and , with . The value minimizes the first error subject to the second being at most .
For normalized ρ≪σ,R>D(ρ||σ), lim −(1/n)log(1−α_n^*(exp(−nR)))=sup_{s>1} ((s−1)/s)(R−Dtilde_s(ρ||σ)).
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#7.5
7.5, arXiv:1504.00233v5, PDF p.116. -/
theorem strong_converse_exponent [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
(hc : paperSupported r s) (R : ℝ) (hR : paperRelativeD r s < (R:EReal)) :
Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*(-paperLogE (1-alphaStar (paperTensorPower r n) (paperTensorPower s n) ((2:ℝ)^(-(n:ℝ)*R)))))
atTop (nhds (sSup {d : EReal | ∃ a : ℝ, 1 < a ∧
d = (((a-1)/a:ℝ):EReal)*((R:EReal)-renyiFinite true r s a)})) := 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 index type with decidable equality, let on each have trace one, and assume . Define , where and otherwise; define , using the total real logarithm; and set , otherwise. Put
with embedded in the extended reals and evaluated there. Let satisfy . Define
where the first infimum is real-valued. Then, in the extended-real topology,
The supremum and the arithmetic on the right are extended real. A zero argument of gives after negation. The sequence includes , using empty tensor products and the total real convention ; negative powers of singular matrices in use the stipulated value zero on their kernels.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.