Proof of Theorem 1, p. 2 — , and on the unit ball
ProvedBenyOreshkov.AQEC.traceNorm_dualmatrix-analysisp2o-gran-per-chapterp2o-plan-paperp2o-v1trace-norm
Let be a square complex matrix and . Then
the maximum being attained, and for every operator with . In the proof of Theorem 1 this is applied to the operator with : the inner maximum is the trace norm of , and it does not change when ranges over the unit ball.
Formalization Note is the platform's trace norm WildeQIT.traceNorm; is in the Loewner order.
Differences from the source: none.
Preamble
import Definitions.Def_WildeQIT_traceNorm open Matrix WildeQIT open scoped MatrixOrder
Formal statement
namespace BenyOreshkov.AQEC
/-- **Trace-norm duality.** Bény, Oreshkov, arXiv:0907.5391v4, proof of Theorem 1, p. 2: "we
know that max_U′ |Tr(X_ρU′)| = Tr(|X_ρ|)", and "the max over U′ can also be taken over operators
A′ in the unit ball since then |Tr(X_ρA′)| ≤ Tr(|X_ρ|)". For every square matrix `X`, the trace
norm `Tr|X|` is the largest value of `|Tr(XU)|` over unitaries `U` (attained), and
`|Tr(XA′)| ≤ Tr|X|` for every contraction `A′`.
**Formalization Note** `Tr|X|` is `WildeQIT.traceNorm X = Re Tr √(X†X)`; contractions are
`A′ᴴ * A′ ≤ 1` (operator norm at most 1). -/
theorem traceNorm_dual {n : Type} [Fintype n] [DecidableEq n] (X : Matrix n n ℂ) :
IsGreatest {t : ℝ | ∃ U ∈ Matrix.unitaryGroup n ℂ, t = ‖(X * U).trace‖} (traceNorm X) ∧
∀ A' : Matrix n n ℂ, A'ᴴ * A' ≤ 1 → ‖(X * A').trace‖ ≤ traceNorm X := by sorry
end BenyOreshkov.AQEC
Source
Bény, Oreshkov, General conditions for approximate quantum error correction and near-optimal recovery channels, arXiv:0907.5391v4, §Main result, proof of Theorem 1, p. 2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.