§3.1.1 (3.11): Schatten norm duality
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.schatten_dualityAll 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 conjugate p,q>1, ||L||_p is the maximum of |Tr L†K| over ||K||_q≤1, attained.
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.normduality
§3.1.1 (3.11): Schatten norm duality, arXiv:1504.00233v5, PDF p.41. -/
theorem schatten_duality [Nonempty I] (L : paperMat I) (p q : ℝ) (hp : 1 < p) (hq : 1 < q) (hc : 1/p+1/q = 1) :
(∃ K : paperMat I, paperSchatten K q ≤ 1 ∧ ‖(Lᴴ*K).trace‖ = paperSchatten L p) ∧
∀ K : paperMat I, paperSchatten K q ≤ 1 → ‖(Lᴴ*K).trace‖ ≤ paperSchatten L p := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite nonempty index type with decidable equality, arbitrary complex matrix indexed by , and real numbers satisfying , define
where matrix functions are interpreted by functional calculus. There exists a complex matrix indexed by such that and
and every complex matrix with satisfies . Neither nor is required to be positive semidefinite or nonzero, and the constraint on is an inequality rather than equality.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.