Consequence 7
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_entanglement_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 and let . Then is both monotone under every finite adaptive LOCC protocol and convex over every normalized finite ensemble:
These two properties are exactly the paper's definition of an entanglement monotone.
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,10, Consequence 7: both defining properties. -/
theorem squashed_entanglement_monotone (hconjecture : LocalMonotonicityConjecture)
(a : ℝ) (ha0 : 0 < a) (ha1 : a < 1) :
SquashedLOCC a ∧ SquashedConvex a := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive semidefinite , let denote its spectral power with zero eigenvalues assigned , also at . Define, for , ,
for a tripartite density matrix on , with the indicated partial-trace marginals and identity embedding on . Let be one half of the extended-real infimum of over density-matrix extensions of with arbitrary positive finite auxiliary dimension . Assume the global conjecture that, on every finite nonempty collection of registers, decreases under every channel on its first register whenever , , where channels have finite Kraus representations satisfying . For every , both of the following hold: for every , every density matrix on registers of dimensions , and every finite recursive local protocol to dimensions , ; and, for every finite nonempty , probability weights , and density matrices on , . A finite recursive local protocol is built from identities by local finite Kraus families on either party, satisfying completeness, with outcome-dependent recursive continuations and summation of branches. Zero ensemble weights are allowed, all component states remain required to be density matrices, and logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.