§VI, Theorem 4: sharp lower bound for every UI norm (seed headline)
OpenQAlgorithms.Papers.Independent.Gap48.P40.sharpLowerBoundAll matrices act on a complex Hilbert space of positive finite dimension . A state is positive semidefinite with trace one. All logarithms are natural, and denotes support-aware Umegaki relative entropy, with value when support containment fails. Let be any genuine unitarily invariant norm on complex matrices. Write and, when , . The symbols , and mean operator, full trace and Hilbert–Schmidt norms, respectively. For , define , and set . For and every pair of states,
For every , a pair of commuting states in that same dimension attains equality and has rescaled distance .
This is the sharp all-UI-norm lower bound, including the orthogonal-state infinite endpoint.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P40
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Topology Matrix.Norms.L2Operator
open Filter MeasureTheory Asymptotics
open QAlgorithms
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P50 (IsUINorm)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P60 (copies)
open QAlgorithms.Papers.Independent.Information100.P44 (Mat)
namespace QAlgorithms.Papers.Independent.Gap48.P40
/-- PDF pp.7–8, Theorem 4: sharp lower bound for every UI norm, including
attainment at every rescaled distance in every d>=2. Endpoints use extended entropy. -/
theorem sharpLowerBound {d : ℕ} (hd : 2 ≤ d) (N : Mat d → ℝ) (hN : IsUINorm N) :
(∀ rho sigma : Mat d, IsDensityMatrix rho → IsDensityMatrix sigma →
binaryProfile (rescaled N (rho - sigma)) ≤ relativeEntropy rho sigma) ∧
(∀ t : ℝ, 0 ≤ t → t ≤ 1 → ∃ rho sigma : Mat d,
IsDensityMatrix rho ∧ IsDensityMatrix sigma ∧
rescaled N (rho - sigma) = t ∧ rho * sigma = sigma * rho ∧
relativeEntropy rho sigma = binaryProfile t) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a natural number, and let be a real-valued function on complex matrices that is nonnegative, vanishes exactly at zero, is subadditive, satisfies for every complex scalar , and satisfies for all unitary . Write and . For square matrices define
using functional calculus with , and define
as an extended-real infimum. Then every pair of positive semidefinite trace-one matrices satisfies
Furthermore, for every real with , there exist positive semidefinite trace-one matrices such that , , and . This includes , where because its defining infimum is empty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.