Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 13: trace norm versus Hilbert–Schmidt norm

Proved
QAlgorithms.Papers.Independent.Intake100.P01.trace_norm_hilbert_schmidt

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For every operator XXX on a finite complex space, let d=rank⁡Xd=\operatorname{rank}Xd=rankX, the dimension of the support of ∣X∣=X†X|X|=\sqrt{X^\dagger X}∣X∣=X†X​. Then

∥X∥12≤d∥X∥22.\|X\|_1^2\le d\|X\|_2^2.∥X∥12​≤d∥X∥22​.

The norms are the trace and Hilbert–Schmidt norms. No positivity, normalization, or Hermiticity is assumed, and the zero operator and zero-dimensional ambient space are included. This is the singular-value norm comparison used in decoupling.

Formalization Note The source's nonzero-eigenvalue support gloss is corrected to singular support; it would otherwise fail for a nonzero nilpotent.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P01
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intake100.P01

open scoped Matrix ComplexConjugate Matrix.Norms.Elementwise

open MeasureTheory

open QAlgorithms.Papers.Independent.Gap20.P11 (IsLOCC productApply finTransport referenceInformation)

open QAlgorithms.Papers.Independent.Bridge50.P40
  (RankMergingCode OneWayMergingCode mergingFidelity SourceProtocolAchievable)

open QAlgorithms.Papers.Independent.Dependency50.P19
  (first marginalRA marginalRB motherTarget motherOutput sourceCopies swap mutualInformation)

open QAlgorithms.Papers.Independent.Information100.P67 (conditionalEntropy)

open QAlgorithms.Papers.Independent.Information100.P32 (purity)

open QAlgorithms.Papers.Independent.Advance50.P29 (weakTypicalProjector)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.20, Lemma 13, (A1): arbitrary finite complex operator.
Printed: support described by nonzero eigenvalues. Changed: rank(X), the
support dimension of |X|. Why: the proof uses singular values and the
printed gloss fails for nonzero nilpotents. No Hermiticity is added. -/
theorem trace_norm_hilbert_schmidt {I : Type} [Fintype I] [DecidableEq I]
    (X : Matrix I I ℂ) :
    traceNorm X ^ 2 ≤ (Matrix.rank X : ℝ) * frobNorm X ^ 2 := by sorry

end QAlgorithms.Papers.Independent.Intake100.P01

end
Source
Quantum state merging and negative information, arXiv:quant-ph/0512247v1, PDF p. 20, Lemma 13: trace norm versus Hilbert–Schmidt norm
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every finite type III equipped with decidable equality and every complex matrix XXX indexed by I×II\times II×I, with no positivity or Hermiticity assumption,

(Re⁡Tr⁡X†X)2≤rank⁡C(X)∑i,j∈I∣Xi,j∣2.\left(\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}\right)^2 \le \operatorname{rank}_{\mathbb C}(X)\sum_{i,j\in I}|X_{i,j}|^2.(ReTrX†X​)2≤rankC​(X)i,j∈I∑​∣Xi,j​∣2.

Here the square root uses continuous functional calculus, the left-hand expression is the square of the defined trace norm, and the sum is the square of the defined Frobenius norm. The statement includes X=0X=0X=0 and empty III; in either case both sides are zero.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me