§VI, Lemma 7: monotonicity of the minimum relative entropy
ProvedQAlgorithms.Papers.Independent.Gap48.P40.minimumMonotoneAll 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. Let and define as the extended infimum of over pairs of states satisfying . If , then
The minimum relative entropy is monotone on the physical interval of raw norm distances.
At the endpoints, and .
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 p.6, Lemma 7: monotonicity on the physical raw-distance interval. -/
theorem minimumMonotone {d : ℕ} (hd : 2 ≤ d) (N : Mat d → ℝ) (hN : IsUINorm N)
(T1 T2 : ℝ) (hT1 : 0 ≤ T1) (horder : T1 ≤ T2) (hT2 : T2 ≤ N (matrixF d)) :
minimumAt d N T1 ≤ minimumAt d N T2 ∧
minimumAt d N 0 = 0 ∧ minimumAt d N (N (matrixF d)) = ⊤ := 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 the zero matrix, satisfies and for every complex scalar , and satisfies for all unitary . Put . For each real , define
where the infimum is in the extended real numbers, an empty infimum is , and
The matrix functions use functional calculus, with and . For every pair of real numbers satisfying , the assertion is
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.