Consequence 5
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.squashed_LOCC_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. For , every state and every finite adaptive LOCC protocol satisfy
LOCC is an actual finite tree of complete local Kraus instruments with outcome-dependent continuation, arbitrary intermediate dimensions, ancillary preparation and disposal. This is monotonicity of the complete output, without an average-branch claim.
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.10, Consequence 5. No average-branch strengthening. -/
theorem squashed_LOCC_monotone (hconjecture : LocalMonotonicityConjecture)
(a : ℝ) (ha : DPOrder a) : SquashedLOCC 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 a positive semidefinite matrix , let apply the function to nonzero eigenvalues and assign to zero eigenvalues, including when . For , , and a tripartite density matrix on , put
where and are the corresponding partial traces and the embedding inserts the identity on . Let be one half of the extended-real infimum of over all positive semidefinite trace- extensions of , allowing every auxiliary dimension with . Assume the global conjecture that decreases under every channel on the first register, for every tripartite density matrix on finite nonempty register types and every , ; channels here have finite Kraus representations with . Then, for every such , every , every density matrix on , and every map to matrices on obtainable by the following finite recursive construction,
The construction starts with identity maps and permits either party to apply a finite family of local rectangular Kraus operators satisfying , followed in each outcome branch by another map from the construction, and then to sum all branches. The register dimensions in the asserted inequality are positive even when any of is , and logarithms are natural.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.