Section 5.3: relationships among MONO, MPT, SSA and JC
OpenQAlgorithms.Papers.Independent.Intakethird100.P51.inequalityEquivalencesLet MONO, MPT, SSA and JC denote the universal finite-dimensional principles of relative-entropy monotonicity under all CPTP maps, monotonicity under partial trace, strong subadditivity, and joint convexity, respectively. The relative-entropy principles include PSD support-included pairs and unnormalized references; SSA ranges over normalized PSD states. Then
These are relationships among global principles, including the singular block and dilation cases used in their reductions. Equality characterizations are not part of these principles.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate Matrix.Norms.L2Operator
open MeasureTheory
namespace QAlgorithms.Papers.Independent.Intakethird100.P51
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact interfaces from the frozen accepted library; no local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy holevo IsLaw)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy marginalAB channelAdjoint)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Gap48.P33 (measurementInformation)
section Statements
variable {A B C D J K O : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype J] [Fintype K] [Fintype O]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
variable [DecidableEq J] [DecidableEq K] [DecidableEq O]
/-- Section 5.3, equation (37) and Lindblad's completion, PDF pp.14–15:
relationships between the four GLOBAL principles, including PSD/support cases. -/
theorem inequalityEquivalences :
(MONO → MPT) ∧ (MPT ↔ SSA) ∧ (SSA ↔ JC) ∧ (MPT → MONO) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Intakethird100.P51
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
The following four logical statements hold: , , , and , where the properties are defined as follows. Write , with applied by continuous functional calculus, and write for the real conversion of the extended-real quantity
Here is defined by continuous functional calculus using the total real logarithm, whose value at zero is zero; conversion to a real number sends to zero. Property says that for every , every channel from complex matrices to complex matrices, and all positive semidefinite with , one has both and . A channel here means a map admitting a finite representation with . Property says that for every and all positive semidefinite matrices on with , tracing out the first factor preserves this kernel inclusion and does not increase . Property says that for every and every positive semidefinite trace-one matrix on dimensions ,
where each subscript denotes the indicated partial trace. Property says that for every , nonnegative weights summing to one, and positive semidefinite matrices satisfying , their weighted sums satisfy the same kernel inclusion and
All natural-number parameters include zero, so the register dimensions here include one but are never zero; need not have trace one and may be zero, and the weights may vanish.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.