§7.1.2 (7.8): fixed-error Stein formulation
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.fixed_error_steinAll 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 fixed 0<ε<1 and normalized ρ≪σ, −(1/n)log min{β_n(T;σ):0≤T≤I, α_n(T;ρ)≤ε}→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#7.steinalternative
§7.1.2 (7.8): fixed-error Stein formulation, arXiv:1504.00233v5, PDF p.115. -/
theorem fixed_error_stein [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
(hc : paperSupported r s) (e : ℝ) (he : 0 < e) (he1 : e < 1) :
Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*(-paperLogE (paperBetaStar (paperTensorPower r n) (paperTensorPower s n) e)))
atTop (nhds (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 index type with decidable equality, let on each have trace one, assume , and let satisfy . For same-sized matrices , define the real-valued infimum
Let , let and otherwise, and define using the total real logarithm, whose value at zero is zero. Then, in the extended-real topology,
where the right side is embedded in the extended reals. A zero value of gives after applying ; the sequence is defined at using empty products, the real reciprocal , and extended-real multiplication.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.