Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A, Theorem 7

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.appendixTraceNorm

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

prove2quantum

For arbitrary positive trace-class operators A,BA,BA,B on a finite- or countably infinite-dimensional complex Hilbert space,

∥A−B∥12+4(Tr⁡(A1/2B1/2))2≤(Tr⁡(A+B))2.\|A-B\|_1^2+4\bigl(\operatorname{Tr}(A^{1/2}B^{1/2})\bigr)^2\le\bigl(\operatorname{Tr}(A+B)\bigr)^2.∥A−B∥12​+4(Tr(A1/2B1/2))2≤(Tr(A+B))2.

No normalization or invertibility is assumed. The overlap is the plain real trace of the product of square roots, rather than its trace norm.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P15 (positiveMatrixRpow)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

section HilbertAppendix

open QAlgorithms.Papers.Independent.Dependency50.P13
  (IsTraceClass operatorTrace traceNormValue)

variable {H : Type} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]

/-- arXiv:0708.4282v1, PDF pp.17,32,33: Appendix A, Theorem 7. -/
theorem appendixTraceNorm {K : Type} [Countable K] (b : HilbertBasis K ℂ H)
    (A B : H →L[ℂ] H) (hA : A.IsPositive) (hB : B.IsPositive)
    (htA : IsTraceClass A) (htB : IsTraceClass B) :
    (traceNormValue (A-B))^2 +
      4*((operatorTrace b ((cfc Real.sqrt A).comp (cfc Real.sqrt B))).re)^2 ≤
      ((operatorTrace b (A+B)).re)^2 := by sorry

end HilbertAppendix

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 32, Appendix A, Theorem 7
Read-back

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

Let HHH be a complete complex inner-product space with its compatible normed additive-group structure, let KKK be a countable type, and let b=(bi)i∈Kb=(b_i)_{i\in K}b=(bi​)i∈K​ be a Hilbert basis of HHH. For any bounded complex-linear positive operators A,B:H→HA,B:H\to HA,B:H→H, assume that each admits sequences ur,vr∈Hu_r,v_r\in Hur​,vr​∈H with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞ and Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ for every xxx, with T=AT=AT=A or T=BT=BT=B, respectively. Then

N(A−B)2+4(Re⁡Tr⁡b(A1/2B1/2))2≤(Re⁡Tr⁡b(A+B))2.\mathcal N(A-B)^2+ 4\left(\operatorname{Re}\operatorname{Tr}_b(A^{1/2}B^{1/2})\right)^2 \le \left(\operatorname{Re}\operatorname{Tr}_b(A+B)\right)^2.N(A−B)2+4(ReTrb​(A1/2B1/2))2≤(ReTrb​(A+B))2.

Here Tr⁡bT=∑i∈K⟨bi,Tbi⟩\operatorname{Tr}_bT=\sum_{i\in K}\langle b_i,Tb_i\rangleTrb​T=∑i∈K​⟨bi​,Tbi​⟩, the square roots are defined by continuous functional calculus, and A1/2B1/2A^{1/2}B^{1/2}A1/2B1/2 means composition in that order. The quantity N(T)\mathcal N(T)N(T) is defined by taking, over all sequence representations Tx=∑r⟨vr,x⟩urTx=\sum_r\langle v_r,x\rangle u_rTx=∑r​⟨vr​,x⟩ur​ satisfying ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, the infimum in [0,+∞][0,+\infty][0,+∞] of ∑rofReal⁡(∥ur∥∥vr∥)\sum_r\operatorname{ofReal}(\|u_r\|\|v_r\|)∑r​ofReal(∥ur​∥∥vr​∥), and then converting that infimum to a real number, with +∞+\infty+∞ converted to 000. There is no trace-normalization or nonzero assumption on AAA or BBB, and the zero-dimensional space 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