Lemma 30
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.cmi_product_ancillasAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Let be a state and let be arbitrary mixed ancillary states, independent of it and each other. Put , regrouped by party. For every positive order, with the ordinary continuous value at one,
The formula uses the actual partial traces of this product state. It expresses invariance under adjoining independent local and conditioning ancillas.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.32–33, Lemma 30, (A.1).
The one endpoint is the ordinary CMI extension; all ancillas may be mixed. -/
theorem cmi_product_ancillas {A1 B1 C1 : Type}
[Fintype A1] [Fintype B1] [Fintype C1]
[Nonempty A1] [Nonempty B1] [Nonempty C1]
(a : ℝ) (ha : 0 < a) (rho : Op (A × (B × C))) (hrho : IsDensityMatrix rho)
(sigma : Op A1) (tau : Op B1) (gamma : Op C1)
(hsigma : IsDensityMatrix sigma) (htau : IsDensityMatrix tau) (hgamma : IsDensityMatrix gamma) :
renyiCMI a (addAncillas rho sigma tau gamma) = renyiCMI a rho := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite register types , with the equality decisions needed for matrix operations, every three additional finite nonempty register types , every real , every positive semidefinite trace-one matrix on , and every positive semidefinite trace-one matrix on , respectively, the real quantity defined below satisfies , where
For a matrix on , let be spectral functional calculus with scalar value at and elsewhere. If , set
If , set
where acts on , and subscripts denote partial traces. This assertion includes , has no upper bound on , and permits singular states and one-dimensional ancillary registers. All logarithms are natural and use their total real convention at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.