Sharp regularised relative entropy chain and explicit extremizers
OpenQAlgorithms.Papers.Independent.Support50.P17.regularisedUpperBoundLet be density matrices on the same nonzero -dimensional complex Hilbert space. Fix any positive normalization scalar at this dimension. Put , and , and define . Then
For every , every and every , the actual diagonal densities
have trace distance and satisfy . Both endpoints are included.
This retains the full inequality chain and sharpness for every allowed distance in every dimension at least three. The identity shifts are unnormalised and no formula for is guessed.
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 2, (21)–(23): full inequality chain at arbitrary fixed
positive normalization c, followed by the source's exact diagonal sharpness pair
for every d≥3 and t∈[0,1], including endpoints and zero padding. -/
theorem regularisedUpperBound :
(∀ {I : Type*} [Fintype I] [DecidableEq I] [Nonempty I]
(c : ℝ), 0 < c → ∀ rho sigma : Matrix I I ℂ,
IsDensityMatrix rho → IsDensityMatrix sigma →
let alpha := minEigenvalue rho
let beta := minEigenvalue sigma
let T := traceDistance rho sigma
let bound := c * ((beta + 1 + T) * Real.log (1 + T / (beta + 1)) -
(alpha + 1) * Real.log (1 + T / (alpha + 1)))
regularisedRelativeEntropy c rho sigma ≤ (bound : EReal) ∧
bound ≤ c * T * Real.log (1 + T)) ∧
(∀ d : ℕ, 3 ≤ d → ∀ c : ℝ, 0 < c → ∀ t : ℝ, 0 ≤ t → t ≤ 1 →
let rho := regularisedRho d t
let sigma := regularisedSigma d t
IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧ traceDistance rho sigma = t ∧
regularisedRelativeEntropy c rho sigma =
((c * t * Real.log (1 + t) : ℝ) : 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
The declaration asserts both a universal bound and an equality family. For every nonempty finite index type with decidable equality, every real , and every pair of positive semidefinite complex matrices indexed by with trace , let be their respective smallest eigenvalues and let . Define , where is the extended-real quantity when , and otherwise. Matrix functions use continuous functional calculus, denotes conjugate transpose, is the identity, and logarithms are natural with scalar . Setting , one has , with embedded into the extended reals, and . This includes singular states, , and one-dimensional matrices. Additionally, for every natural , every real , and every real , the diagonal matrices and are positive semidefinite with trace , satisfy , and obey , as an equality in the extended reals, including at and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.