Equation (22): purified/weak-monotonicity form of SSA
OpenQAlgorithms.Papers.Independent.Intakethird100.P51.purifiedSSALet be any pure four-party state with , and form all marginals by partial trace. Then
Under this purification the displayed inequality is equivalent to SSA for . This records the purified weak-monotonicity form of SSA, including singular reduced states.
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]
/-- Equation (22), PDF pp.9,15: the purified weak-monotonicity inequality and its
pointwise equivalence to SSA of the complementary triple. Equation (36) omits S
in print; (22) and the purification argument determine the entropy reading. -/
theorem purifiedSSA [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] (psi : EuclideanSpace ℂ (A × (B × (C × D)))) (h : ‖psi‖ = 1) :
let rho := pureDensity psi
WeakMonotonicity (marginalABD rho) ∧
(0 ≤ ssaGap (marginalABC rho) ↔ WeakMonotonicity (marginalABD rho)) := 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
For finite nonempty index types , each with decidable equality, and every Euclidean unit vector , form , whose entries are , and denote its reduced matrices by subscripts, obtained by summing over discarded indices. With , where is applied by continuous functional calculus using natural logarithms and , the assertion is
together with the equivalence
The first displayed inequality is precisely the stated weak-monotonicity condition on ; all four registers may be singletons.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.