Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

3.3

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.holder

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 conjugate real exponents 1/p+1/q=1, p>1: |Tr LK|≤Tr|LK|≤||L||_p||K||_q, with an attaining K for each L. For 0<p<1 and M supported by N: Tr MN≥||M||p / ||N^{-1}||{-q}. For positive M,N equality holds when M^p=a N^q, a≥0.

∣Tr⁡(LK)∣≤Tr⁡∣LK∣≤∥L∥p∥K∥q,Tr⁡(MN)≥∥M∥p∥N−1∥−q−1.|\operatorname{Tr}(LK)|\le\operatorname{Tr}|LK|\le\|L\|_p\|K\|_q,\qquad \operatorname{Tr}(MN)\ge\|M\|_p\|N^{-1}\|_{-q}^{-1}.∣Tr(LK)∣≤Tr∣LK∣≤∥L∥p​∥K∥q​,Tr(MN)≥∥M∥p​∥N−1∥−q−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.3
3.3, arXiv:1504.00233v5, PDF p.40. -/
theorem holder [Nonempty I] (p q : ℝ) (hp : 0 < p) (hq : q ≠ 0) (hc : 1/p+1/q = 1) :
    (1 < p → ∀ L K : paperMat I, ‖(L*K).trace‖ ≤ traceNorm (L*K) ∧ traceNorm (L*K) ≤ paperSchatten L p*paperSchatten K q) ∧
    (1 < p → ∀ L : paperMat I, ∃ K : paperMat I, ‖(L*K).trace‖ = traceNorm (L*K) ∧ traceNorm (L*K) = paperSchatten L p*paperSchatten K q) ∧
    (p < 1 → ∀ M N : paperMat I, M.PosSemidef → N.PosSemidef → paperSupported M N →
      paperSchatten M p*(paperSchatten (paperPower N (-1)) (-q))⁻¹ ≤ (M*N).trace.re) ∧
    (∀ M N : paperMat I, M.PosSemidef → N.PosSemidef → (∃ a : ℝ, 0 ≤ a ∧ paperPower M p = (a:ℂ) • paperPower N q) →
      (1 < p → ‖(M*N).trace‖ = traceNorm (M*N) ∧ traceNorm (M*N) = paperSchatten M p*paperSchatten N q) ∧
      (p < 1 → paperSupported M N → (M*N).trace.re = paperSchatten M p*(paperSchatten (paperPower N (-1)) (-q))⁻¹)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 40, 3.3
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 and real numbers p,qp,qp,q satisfying p>0p>0p>0, q≠0q\ne0q=0, and 1/p+1/q=11/p+1/q=11/p+1/q=1, define 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 put

τ(Z)=Re⁡tr⁡Z†Z,Su(Z)=(Re⁡tr⁡Pu ⁣(Z†Z))1/u.\tau(Z)=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}, \qquad S_u(Z)=\left(\operatorname{Re}\operatorname{tr}P_u\!\left(\sqrt{Z^\dagger Z}\right)\right)^{1/u}.τ(Z)=RetrZ†Z​,Su​(Z)=(RetrPu​(Z†Z​))1/u.

The assertion is the conjunction of the following claims: if p>1p>1p>1, then every pair of complex matrices L,KL,KL,K indexed by III satisfies

∣tr⁡(LK)∣≤τ(LK)≤Sp(L)Sq(K),|\operatorname{tr}(LK)|\le\tau(LK)\le S_p(L)S_q(K),∣tr(LK)∣≤τ(LK)≤Sp​(L)Sq​(K),

and, for every such LLL, there exists a matrix KKK for which both inequalities are equalities, with no requirement that KKK be nonzero; if p<1p<1p<1, then every positive semidefinite pair M,NM,NM,N satisfying ker⁡N⊆ker⁡M\ker N\subseteq\ker MkerN⊆kerM obeys

Sp(M)(S−q(P−1(N)))−1≤Re⁡tr⁡(MN);S_p(M)\bigl(S_{-q}(P_{-1}(N))\bigr)^{-1} \le \operatorname{Re}\operatorname{tr}(MN);Sp​(M)(S−q​(P−1​(N)))−1≤Retr(MN);

and, for every positive semidefinite pair M,NM,NM,N, if there exists a real a≥0a\ge0a≥0 such that Pp(M)=aPq(N)P_p(M)=aP_q(N)Pp​(M)=aPq​(N), then both forward inequalities are equalities when p>1p>1p>1, while, when p<1p<1p<1 and ker⁡N⊆ker⁡M\ker N\subseteq\ker MkerN⊆kerM, the reverse inequality is an equality. The hypotheses exclude p=1p=1p=1; they give q>1q>1q>1 when p>1p>1p>1 and q<0q<0q<0 when 0<p<10<p<10<p<1. All scalar inverses use the convention 0−1=00^{-1}=00−1=0, and P−1(N)P_{-1}(N)P−1​(N) assigns zero to a zero eigenvalue.

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