§3.1.1 (3.16): matrix trace Young inequality
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.trace_youngAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and .
For positive M,N and conjugate p,q, p>1, Tr MN≤Tr M^p/p+Tr N^q/q, equality iff M^p=N^q; for 0<p<1 and M≪N reverse the inequality.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#3.young
§3.1.1 (3.16): matrix trace Young inequality, arXiv:1504.00233v5, PDF p.41. -/
theorem trace_young [Nonempty I] (M N : paperMat I) (hM : M.PosSemidef) (hN : N.PosSemidef)
(p q : ℝ) (hp : 0 < p) (hq : q ≠ 0) (hc : 1/p+1/q = 1) :
(1 < p → (M*N).trace.re ≤ (paperPower M p).trace.re/p+(paperPower N q).trace.re/q) ∧
(1 < p → ((M*N).trace.re = (paperPower M p).trace.re/p+(paperPower N q).trace.re/q ↔ paperPower M p = paperPower N q)) ∧
(p < 1 → paperSupported M N → (paperPower M p).trace.re/p+(paperPower N q).trace.re/q ≤ (M*N).trace.re) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty index type with decidable equality, and let be positive semidefinite complex matrices indexed by . For a real exponent , define by continuous functional calculus using the scalar function that is at and elsewhere; thus zero eigenvalues contribute , including for negative exponents. For every pair satisfying , , and , all three assertions hold:
The hypotheses exclude ; in the third implication they force . Zero matrices are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.