Relative entropy bound using only the reference minimum
ProvedQAlgorithms.Papers.Independent.Support50.P17.referenceMinimumUpperBoundLet be density matrices on the same nonzero finite-dimensional complex Hilbert space, and suppose . Write . Then
and
At the zero-weight logarithmic term is zero and both formulas apply. No positive lower bound on is assumed.
This is the paper's corrected rederivation of the earlier reference-minimum bound. The positive- domain is inherited from Theorem 1 and the scaling proof.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P17
noncomputable section
open MeasureTheory
open scoped Matrix ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Support50.P17
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact frozen support predicate and signed, unnormalised entropy.
open QAlgorithms.Papers.Independent.Dependency50.P21 (IsSupported relativeEntropy)
/-- PDF p.9, Corollary 1, (19)–(20): only the reference minimum is given.
The beta>0 domain comes from Theorem 1 and its scaling proof. At T=beta both
branches apply and the vanishing logarithmic weight contributes zero. -/
theorem referenceMinimumUpperBound {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(rho sigma : Matrix I I ℂ) (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hbeta : 0 < minEigenvalue sigma) :
let beta := minEigenvalue sigma
let T := traceDistance rho sigma
(T ≤ beta → relativeEntropy rho sigma ≤
(((beta + T) * Real.log (1 + T / beta) +
(beta - T) * Real.log (1 - T / beta) : ℝ) : EReal)) ∧
(beta ≤ T → relativeEntropy rho sigma ≤
(((beta + T) * Real.log (1 + T / beta) : ℝ) : EReal)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P17
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every nonempty finite index type with decidable equality and every pair of positive semidefinite complex matrices indexed by with trace , assume that the smallest eigenvalue of is strictly positive, and put . Here denotes conjugate transpose and the square root uses continuous functional calculus. Let be if , and otherwise, with matrix logarithms defined by continuous functional calculus and scalar . Both implications hold: if , then ; if , then . The logarithms are natural and the real bounds are embedded into the extended reals. At , both implications apply and the term is under the stated convention; , singular , and one-dimensional matrices are also included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.