3.4
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.schatten_variationalAll 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 M≥0,p>0,r=1−1/p, ||M||p=max{N≥0,Tr N=1}Tr(M N^r) for p≥1 and min_{N≥0,Tr N=1,M≪N}Tr(M N^r) for 0<p≤1. Both extrema 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.4
3.4, arXiv:1504.00233v5, PDF p.41. -/
theorem schatten_variational [Nonempty I] (M : paperMat I) (hM : M.PosSemidef) (p : ℝ) (hp : 0 < p) :
(1 ≤ p → (∃ N : paperMat I, IsDensityMatrix N ∧ (M*paperPower N (1-1/p)).trace.re = paperSchatten M p) ∧
∀ N : paperMat I, IsDensityMatrix N → (M*paperPower N (1-1/p)).trace.re ≤ paperSchatten M p) ∧
(p ≤ 1 → (∃ N : paperMat I, IsDensityMatrix N ∧ paperSupported M N ∧ (M*paperPower N (1-1/p)).trace.re = paperSchatten M p) ∧
∀ N : paperMat I, IsDensityMatrix N → paperSupported M N → paperSchatten M p ≤ (M*paperPower N (1-1/p)).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
For every finite nonempty index type with decidable equality, positive semidefinite complex matrix indexed by , and real , let by functional calculus, where and for , and define
If , there exists a positive semidefinite matrix of trace such that
and every positive semidefinite trace- matrix makes the left-hand side at most . If , there exists a positive semidefinite trace- matrix with giving the same equality, and every such supported makes the left-hand side at least . Both assertions apply at , where the exponent is zero and is zero on the kernel of and one on its nonzero eigenspaces. The matrix is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.