Relative-entropy finite-block reformulation
ProvedQAlgorithms.Papers.Independent.Support50.P23.relativeFiniteBlockLet be normalized states on a finite-dimensional nonzero complex Hilbert space and let . Use binary Umegaki relative entropy and Petz relative entropies , and set . On the finite- branch, for and ,
Here is the negative fixed-reference smooth min entropy with trivial first system, so smoothing is an infimum over this paper's subnormalized sine-distance ball. Support failure gives and a trivial upper bound. For , the smooth max relative entropy is . This is the stated reformulation of Remark 10.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P23
noncomputable section
open Filter
open scoped ENNReal ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Support50.P23
attribute [local instance] Classical.propDecidable
-- Exact accepted bodies. Other similarly named catalogue entries use different
-- smoothing, conditioning order, logarithm base, or channel-level objects.
open QAlgorithms.Papers.Independent.Gap20.P03 (fixedMin)
open QAlgorithms.Papers.Independent.Dependency50.P36 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P69 (matrixPower)
variable {A B C D I : Type*}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype I]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D] [DecidableEq I]
/-- Section V footnote 9, PDF p.6: relative-entropy version with THIS paper's
smoothing. Positive n and finite-eta real-domain guards agree with Remark 10;
support failure gives the trivial +infinity upper bound. -/
theorem relativeFiniteBlock [Nonempty I]
(rho sigma : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(epsilon : ℝ) (hepsilon : 0 < epsilon) (n : ℕ) (hn : 0 < n) :
((epsilon < 1 ∧ relativeUpsilon rho sigma ≠ ⊤ ∧
(8 / 5 : ℝ) * Real.logb 2 (2 / epsilon ^ 2) ≤ (n : ℝ)) →
(((n : ℝ)⁻¹ : ℝ) : EReal) *
smoothMaxRelative (matrixPower rho n) (matrixPower sigma n) epsilon ≤
relativeEntropy rho sigma +
((aepBlockError epsilon (relativeUpsilon rho sigma) / Real.sqrt (n : ℝ) : ℝ) : EReal)) ∧
(¬ supportedBy rho sigma → relativeEntropy rho sigma = ⊤ ∧
(((n : ℝ)⁻¹ : ℝ) : EReal) *
smoothMaxRelative (matrixPower rho n) (matrixPower sigma n) epsilon ≤
relativeEntropy rho sigma) ∧
(1 ≤ epsilon →
smoothMaxRelative (matrixPower rho n) (matrixPower sigma n) epsilon = ⊥) := by sorry
end QAlgorithms.Papers.Independent.Support50.P23
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite type with decidable equality, and let on be positive semidefinite matrices of trace . Say that is supported by when , and define when that inclusion holds, and otherwise. For , define to equal at , to equal when and the support inclusion fails, and otherwise to equal , where functional calculus assigns zero at zero eigenvalues in , and , for . Put , where are respectively and for finite , and put , with assigning zero to . Define
For every real and natural , three assertions hold: if , , and , then ; if , then and ; and if , including equality, then . Tensor-power entries are products over coordinates, the entropy comparisons use extended-real arithmetic, and smoothing includes without requiring trace .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.