Consequence 3
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_local_monotoneAll 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, namely first-register local monotonicity of the optimized Petz conditional mutual information (3.18), uniformly for every finite tripartite state and CPTP map. Let , let be a state, and let and be CPTP maps. With ,
Here is one half the infimum of (3.18) over all finite normalized extensions, without any ancillary dimension cap. This establishes monotonicity under local operations.
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 p.8, Consequence 3, (4.2). -/
theorem squashed_local_monotone (hconjecture : LocalMonotonicityConjecture)
(a : ℝ) (ha : DPOrder a) (rho : Op (A × B)) (hrho : IsDensityMatrix rho)
(N : Superop A C) (M : Superop B D) (hN : IsChannel N) (hM : IsChannel M) :
renyiSquashed a (idTensorSuperop M (applyFirstSuperop N rho)) ≤ renyiSquashed 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
Let be finite register index types with decidable equality, let be a positive semidefinite matrix of trace on , and let and be channels from to and from to , respectively; a channel here has a finite Kraus representation with . For a matrix , write for continuous functional calculus with the real function that is at and elsewhere, so is the support projector when is positive semidefinite. For , , and a state on , define
where , , and . Set
with the infimum taken in the extended real numbers. Assume the global conjecture that, for every choice of finite nonempty registers, every with , every tripartite density matrix, and every channel on its first register, cannot increase under that channel. Then, for every real satisfying and ,
Here a map acting on one register acts on each matrix block indexed by the other register; all logarithms are natural, and the extension dimension has no fixed upper bound.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.