Consequence 4
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_classical_communicationAll 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.
Assume Conjecture 1 as stated above. For , a finite probability law , and bipartite states , define . Then
The first and last expressions use the corresponding marginals. The infimum defining squashed entanglement still ranges over all extensions. The equality describes invariance under sharing classical information.
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.8–9, Consequence 4, (4.3)–(4.4). -/
theorem squashed_classical_communication (hconjecture : LocalMonotonicityConjecture)
(a : ℝ) (ha : DPOrder a) (p : X → ℝ) (hp : IsLaw p)
(rho : X → Op (A × B)) (hrho : ∀ x, IsDensityMatrix (rho x)) :
renyiSquashed a (flagLeft p rho) = renyiSquashed a (flagBoth p rho) ∧
renyiSquashed a (flagBoth p rho) = renyiSquashed a (flagRight p 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
Let be finite register index types with decidable equality, let satisfy and , and let every be a positive semidefinite trace- matrix on . Define three matrices by
and let equal when , and otherwise. For positive semidefinite , let be its spectral power with every zero eigenvalue assigned , including at . For , , define
for on , where the marginals are obtained by partial traces and the embedding acts as the identity on ; define as one half of the extended-real infimum of over all density-matrix extensions of with auxiliary register , for arbitrary . Assume the global conjecture that decreases under every channel on the first register of every tripartite density matrix on finite nonempty registers whenever and , where channels admit finite Kraus operators satisfying . Then every real with , , satisfies
Zero probabilities are allowed, but must be a density matrix even when ; logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.