§3.1.1 (3.4): pinching contracts unitarily invariant norms
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.pinching_contracts_every_unitary_normAll 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 .
Every pinching channel contracts every unitarily invariant norm on finite operators, not only the operator norm or one Schatten norm.
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.pinchingnorm
§3.1.1 (3.4): pinching contracts unitarily invariant norms, arXiv:1504.00233v5, PDF p.40. -/
theorem pinching_contracts_every_unitary_norm [Nonempty I] {m : ℕ} (hm : 0 < m) (P : Fin m → paperMat I)
(hP : Resolution P) (v : paperMat I → ℝ) (hv : UnitaryInvariantNorm v) (M : paperMat I) :
v (resolutionPinch P M) ≤ v M := 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, let be a natural number, and let satisfy , , whenever , and ; individual may be zero. Let satisfy, for every matrix , and if and only if ; for every complex and matrix , ; for every , ; and for every square , and imply . Then every satisfies
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.