Corollary 11: tripartite trace inequalities
OpenQAlgorithms.Papers.Independent.Intakethird100.P52.tripartite_trace_boundsAll Hilbert spaces below are finite dimensional and nonzero over . 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 ; the operator logarithms in exponential formulas are natural logarithms.
Let be a tripartite density operator. Its marginals are computed by partial trace from this same state. Operators on fewer registers are extended by identities. Use tensor order , and set and . Define and . A short quantum Markov chain means that the whole space decomposes as and , where , , and both factors in each block are density operators.
Define
Then for and for . If , the respective bounds extend to and every .
These are the tripartite versions of the channel reference trace bounds.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P52
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty types , each with decidable equality, let be a positive semidefinite complex matrix on with trace . Define , where , and put , , with partial trace summing equal -indices. Let be continuous functional calculus for the function zero at zero and otherwise, and set
Then for every , and for every . If is positive definite, these bounds also hold for and , respectively. The first two conclusions include singular , with zero spectral values assigned zero by every .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.