Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 11: tripartite trace inequalities

Open
QAlgorithms.Papers.Independent.Intakethird100.P52.tripartite_trace_bounds

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces below are finite dimensional and nonzero over C\mathbb CC. A density operator is positive semidefinite with trace one. Every spectral power is zero on the kernel, including zero and negative powers. Information quantities use base-two logarithms, with log⁡20=−∞\log_2 0=-\inftylog2​0=−∞; the operator logarithms in exponential formulas are natural logarithms.

Let ρ=ρABC\rho=\rho_{ABC}ρ=ρABC​ be a tripartite density operator. Its marginals ρAC,ρBC,ρC\rho_{AC},\rho_{BC},\rho_CρAC​,ρBC​,ρC​ are computed by partial trace from this same state. Operators on fewer registers are extended by identities. Use tensor order A⊗(C⊗B)A\otimes(C\otimes B)A⊗(C⊗B), and set σ=ρAC⊗IB\sigma=\rho_{AC}\otimes I_Bσ=ρAC​⊗IB​ and N=Tr⁡A\mathcal N=\operatorname{Tr}_AN=TrA​. Define Ia(A;B∣C)ρ=Δa(ρ,σ,N)I_a(A;B\mid C)_\rho=\Delta_a(\rho,\sigma,\mathcal N)Ia​(A;B∣C)ρ​=Δa​(ρ,σ,N) and I~a(A;B∣C)ρ=Δ~a(ρ,σ,N)\widetilde I_a(A;B\mid C)_\rho=\widetilde\Delta_a(\rho,\sigma,\mathcal N)Ia​(A;B∣C)ρ​=Δa​(ρ,σ,N). A short quantum Markov chain A−C−BA-C-BA−C−B means that the whole space HCH_CHC​ decomposes as ⨁jHCL,j⊗HCR,j\bigoplus_j H_{C_{L,j}}\otimes H_{C_{R,j}}⨁j​HCL,j​​⊗HCR,j​​ and ρ=⨁jqjρACL,j⊗ρCR,jB\rho=\bigoplus_j q_j\rho_{AC_{L,j}}\otimes\rho_{C_{R,j}B}ρ=⨁j​qj​ρACL,j​​⊗ρCR,j​B​, where qj≥0q_j\ge0qj​≥0, ∑jqj=1\sum_jq_j=1∑j​qj​=1, and both factors in each block are density operators.

Define

RaABC=(ρAC(1−a)/2ρC(a−1)/2ρBC1−aρC(a−1)/2ρAC(1−a)/2)1/(1−a),SaABC=(ρAC(1−a)/(2a)ρC(a−1)/(2a)ρBC(1−a)/aρC(a−1)/(2a)ρAC(1−a)/(2a))a/(1−a).\begin{aligned} R_a^{ABC}&=\left(\rho_{AC}^{(1-a)/2}\rho_C^{(a-1)/2}\rho_{BC}^{1-a}\rho_C^{(a-1)/2}\rho_{AC}^{(1-a)/2}\right)^{1/(1-a)},\\ S_a^{ABC}&=\left(\rho_{AC}^{(1-a)/(2a)}\rho_C^{(a-1)/(2a)}\rho_{BC}^{(1-a)/a}\rho_C^{(a-1)/(2a)}\rho_{AC}^{(1-a)/(2a)}\right)^{a/(1-a)}. \end{aligned}RaABC​SaABC​​=(ρAC(1−a)/2​ρC(a−1)/2​ρBC1−a​ρC(a−1)/2​ρAC(1−a)/2​)1/(1−a),=(ρAC(1−a)/(2a)​ρC(a−1)/(2a)​ρBC(1−a)/a​ρC(a−1)/(2a)​ρAC(1−a)/(2a)​)a/(1−a).​

Then Tr⁡RaABC≤1\operatorname{Tr}R_a^{ABC}\le1TrRaABC​≤1 for 0<a<10<a<10<a<1 and Tr⁡SaABC≤1\operatorname{Tr}S_a^{ABC}\le1TrSaABC​≤1 for 1/2<a<11/2<a<11/2<a<1. If ρABC>0\rho_{ABC}>0ρABC​>0, the respective bounds extend to 1<a<21<a<21<a<2 and every a>1a>1a>1.

These are the tripartite versions of the channel reference trace bounds.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P52
Formal statement
noncomputable section

open scoped Matrix ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P52

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz marginalAB)

open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Renew46.P35 (HasMarkovBlocks)

/-- Corollary 11, PDF p.13, equations (3.52)–(3.53). The displayed products
are the computed R_alpha/S_alpha for sigma=rho_AC tensor I_B, N=Tr_A,
by (1.21); all marginals come from the same rho in order A x (C x B). -/
theorem tripartite_trace_bounds {A C B : Type} [Fintype A] [Fintype C] [Fintype B]
    [DecidableEq A] [DecidableEq C] [DecidableEq B]
    [Nonempty A] [Nonempty C] [Nonempty B]
    (rho : Mat (A × (C × B))) (hrho : IsDensityMatrix rho) :
    (∀ a : ℝ, 0 < a ∧ a < 1 →
      tr (renyiReference a rho (conditionalSigma rho) traceLeft) ≤ 1) ∧
    (∀ a : ℝ, 1 / 2 < a ∧ a < 1 →
      tr (sandwichedReference a rho (conditionalSigma rho) traceLeft) ≤ 1) ∧
    (rho.PosDef →
      (∀ a : ℝ, 1 < a ∧ a < 2 →
        tr (renyiReference a rho (conditionalSigma rho) traceLeft) ≤ 1) ∧
      (∀ a : ℝ, 1 < a →
        tr (sandwichedReference a rho (conditionalSigma rho) traceLeft) ≤ 1)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P52

end
Source
Quantum Markov chains, sufficiency of quantum channels, and Renyi information measures, arXiv:1501.05636v4, PDF p. 13, Corollary 11: tripartite trace inequalities
Read-back

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

For finite nonempty types A,C,BA,C,BA,C,B, each with decidable equality, let ρ\rhoρ be a positive semidefinite complex matrix on A×(C×B)A\times(C\times B)A×(C×B) with trace 111. Define Σ=ρAC⊗IB\Sigma=\rho_{AC}\otimes I_BΣ=ρAC​⊗IB​, where (ρAC)(i,c),(j,d)=∑bρ(i,c,b),(j,d,b)(\rho_{AC})_{(i,c),(j,d)}=\sum_b\rho_{(i,c,b),(j,d,b)}(ρAC​)(i,c),(j,d)​=∑b​ρ(i,c,b),(j,d,b)​, and put ρCB=Tr⁡Aρ\rho_{CB}=\operatorname{Tr}_A\rhoρCB​=TrA​ρ, ΣCB=Tr⁡AΣ\Sigma_{CB}=\operatorname{Tr}_A\SigmaΣCB​=TrA​Σ, with partial trace summing equal AAA-indices. Let St(X)S_t(X)St​(X) be continuous functional calculus for the function zero at zero and xtx^txt otherwise, and set

Ka=S(1−a)/2(Σ)[IA⊗S(a−1)/2(ΣCB)S1−a(ρCB)S(a−1)/2(ΣCB)]S(1−a)/2(Σ),K~a=S(1−a)/(2a)(Σ)[IA⊗S(a−1)/(2a)(ΣCB)S(1−a)/a(ρCB)S(a−1)/(2a)(ΣCB)]S(1−a)/(2a)(Σ),Ra=S1/(1−a)(Ka),R~a=Sa/(1−a)(K~a).\begin{aligned} K_a&=S_{(1-a)/2}(\Sigma) \left[I_A\otimes S_{(a-1)/2}(\Sigma_{CB})S_{1-a}(\rho_{CB})S_{(a-1)/2}(\Sigma_{CB})\right] S_{(1-a)/2}(\Sigma),\\ \widetilde K_a&=S_{(1-a)/(2a)}(\Sigma) \left[I_A\otimes S_{(a-1)/(2a)}(\Sigma_{CB})S_{(1-a)/a}(\rho_{CB})S_{(a-1)/(2a)}(\Sigma_{CB})\right] S_{(1-a)/(2a)}(\Sigma),\\ R_a&=S_{1/(1-a)}(K_a),\qquad \widetilde R_a=S_{a/(1-a)}(\widetilde K_a). \end{aligned}Ka​Ka​Ra​​=S(1−a)/2​(Σ)[IA​⊗S(a−1)/2​(ΣCB​)S1−a​(ρCB​)S(a−1)/2​(ΣCB​)]S(1−a)/2​(Σ),=S(1−a)/(2a)​(Σ)[IA​⊗S(a−1)/(2a)​(ΣCB​)S(1−a)/a​(ρCB​)S(a−1)/(2a)​(ΣCB​)]S(1−a)/(2a)​(Σ),=S1/(1−a)​(Ka​),Ra​=Sa/(1−a)​(Ka​).​

Then Re⁡Tr⁡Ra≤1\operatorname{Re}\operatorname{Tr}R_a\le1ReTrRa​≤1 for every 0<a<10<a<10<a<1, and Re⁡Tr⁡R~a≤1\operatorname{Re}\operatorname{Tr}\widetilde R_a\le1ReTrRa​≤1 for every 1/2<a<11/2<a<11/2<a<1. If ρ\rhoρ is positive definite, these bounds also hold for 1<a<21<a<21<a<2 and a>1a>1a>1, respectively. The first two conclusions include singular ρ\rhoρ, with zero spectral values assigned zero by every StS_tSt​.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me