Section 2.2: product and split-middle equality cases
OpenQAlgorithms.Papers.Independent.Intakethird100.P51.productSSAEqualityFor a faithful trace-one tripartite state, the SSA entropy gap and the logarithm condition vanish whenever
In particular this includes a product of three marginal states. More generally, if subsystem is , any faithful trace-one states and give equality for
with canonical regrouping of the four factors. These are sufficient cases and are not claimed to exhaust equality.
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 2.2, PDF p.7: all product and split-middle sufficient cases.
No tensor decomposition is asserted necessary. -/
theorem productSSAEquality [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] :
(∀ rho : Mat (A × (B × C)), FaithfulDensity rho →
(rho = Matrix.kronecker (traceRight (marginalAB rho)) (traceLeft rho) ∨
rho = liftAB (marginalAB rho) * liftBC (Matrix.kronecker (1 : Mat B)
(traceLeft (traceLeft rho)))) → ssaGap rho = 0 ∧ SSAlogCondition rho) ∧
(∀ X : Mat (A × B), ∀ Y : Mat (D × C), FaithfulDensity X → FaithfulDensity Y →
ssaGap (splitProduct X Y) = 0 ∧ SSAlogCondition (splitProduct X Y)) := 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, write , where is applied by continuous functional calculus and is the natural logarithm, with its total-function value . A faithful density matrix means a positive definite complex matrix of trace . For a matrix on , let denote the corresponding partial traces, and put . Lift an -matrix by tensoring with , a -matrix by tensoring with , and a -matrix by inserting identities on . The assertion is the conjunction of two statements: every faithful density matrix satisfying either or satisfies and
and, for every faithful density matrix on and every faithful density matrix on , the matrix on defined by satisfies the same zero-gap and logarithmic identity, with as its middle register. All these index types may have cardinality .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.