Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

3.4

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.schatten_variational

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

prove2quantum

All 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 FFF is squared algebraic fidelity, F∗F_*F∗​ is squared generalized fidelity, P=1−F∗P=\sqrt{1-F_*}P=1−F∗​​ is purified distance, and Δ(ρ,τ)=max⁡0≤M≤I∣Tr⁡((ρ−τ)M)∣\Delta(\rho,\tau)=\max_{0\le M\le I}|\operatorname{Tr}((\rho-\tau)M)|Δ(ρ,τ)=max0≤M≤I​∣Tr((ρ−τ)M)∣.

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.

∥M∥p=max⁡N∈S∘Tr⁡(MN1−1/p) (p≥1),∥M∥p=min⁡N∈S∘, M≪NTr⁡(MN1−1/p) (p≤1).\|M\|_p=\max_{N\in\mathcal S_\circ}\operatorname{Tr}(MN^{1-1/p})\ (p\ge1),\qquad\|M\|_p=\min_{N\in\mathcal S_\circ,\ M\ll N}\operatorname{Tr}(MN^{1-1/p})\ (p\le1).∥M∥p​=N∈S∘​max​Tr(MN1−1/p) (p≥1),∥M∥p​=N∈S∘​, M≪Nmin​Tr(MN1−1/p) (p≤1).

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
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
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 41, 3.4
Read-back

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

For every finite nonempty index type III with decidable equality, positive semidefinite complex matrix MMM indexed by III, and real p>0p>0p>0, let Pu(Z)=fu(Z)P_u(Z)=f_u(Z)Pu​(Z)=fu​(Z) by functional calculus, where fu(0)=0f_u(0)=0fu​(0)=0 and fu(x)=xuf_u(x)=x^ufu​(x)=xu for x≠0x\ne0x=0, and define

Sp(M)=(Re⁡tr⁡Pp ⁣(M†M))1/p.S_p(M)= \left(\operatorname{Re}\operatorname{tr}P_p\!\left(\sqrt{M^\dagger M}\right)\right)^{1/p}.Sp​(M)=(RetrPp​(M†M​))1/p.

If p≥1p\ge1p≥1, there exists a positive semidefinite matrix NNN of trace 111 such that

Re⁡tr⁡ ⁣(MP1−1/p(N))=Sp(M),\operatorname{Re}\operatorname{tr}\!\left(MP_{1-1/p}(N)\right)=S_p(M),Retr(MP1−1/p​(N))=Sp​(M),

and every positive semidefinite trace-111 matrix NNN makes the left-hand side at most Sp(M)S_p(M)Sp​(M). If p≤1p\le1p≤1, there exists a positive semidefinite trace-111 matrix NNN with ker⁡N⊆ker⁡M\ker N\subseteq\ker MkerN⊆kerM giving the same equality, and every such supported NNN makes the left-hand side at least Sp(M)S_p(M)Sp​(M). Both assertions apply at p=1p=1p=1, where the exponent is zero and P0(N)P_0(N)P0​(N) is zero on the kernel of NNN and one on its nonzero eigenspaces. The matrix M=0M=0M=0 is included.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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