Entropy bounds for local treatment and unitary invariance
ProvedQAlgorithms.Papers.Independent.Support50.P42.local_entropy_boundsLet be a normalized pure state on positive finite-dimensional systems . Let Alice apply a complete finite rectangular Kraus family , retaining environments or refining outcomes so that each conditional joint state is pure. Write for its Born probability, for the conditional Bob density, , and . Zero-probability terms contribute zero. Then
A local unitary leaves Bob's marginal unchanged and conjugates Alice's marginal by that unitary, preserving its spectrum. For every finite adaptive local protocol with pure input and positive-weight pure final leaves, the expected final entanglement is at most the initial entanglement. These statements distinguish unconditional marginal invariance from changes in conditional marginals.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- PDF p.6: entropy interval, unconditional no-signalling marginal, unitary
marginal/spectral invariance, and the iterated pure-output upper bound.
Refined Kraus outcomes keep the complete conditional joint state pure. -/
theorem local_entropy_bounds {a b c k : ℕ} (ha : 0<a) (hb : 0<b) (hc : 0<c)
(psi : Vec (Fin a × Fin b)) (hnorm : ‖psi‖=1)
(A : Fin k → Matrix (Fin c) (Fin a) ℂ) (hA : IsKrausFamily A) :
let p := fun j => ‖aliceKetBranch (A j) psi‖^2
let rho := fun j => ((p j : ℂ)⁻¹) • pureDensity (aliceKetBranch (A j) psi)
(∑ j, (p j : ℂ) • traceLeft (rho j))=traceLeft (pureDensity psi) ∧
vnEntropy (traceLeft (pureDensity psi))-outcomeEntropy p≤
(∑ j, p j*vnEntropy (traceLeft (rho j))) ∧
(∑ j, p j*vnEntropy (traceLeft (rho j)))≤vnEntropy (traceLeft (pureDensity psi)) ∧
(∀ U : Matrix.unitaryGroup (Fin a) ℂ,
traceLeft (pureDensity (aliceKetBranch (U : Op (Fin a)) psi))=traceLeft (pureDensity psi) ∧
traceRight (pureDensity (aliceKetBranch (U : Op (Fin a)) psi))=
(U : Op (Fin a))*traceRight (pureDensity psi)*(U : Op (Fin a))ᴴ) ∧
(∀ s : Shared, IsPureShared s → ∀ out : List (ℝ × Shared), LocalTree s out →
(∀ w∈out, 0<w.1 → IsPureShared w.2) →
(out.map fun w => w.1*ent w.2).sum≤ent s) := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers , any natural number , a unit vector , and matrices indexed by satisfying , put , , and . With and , where is applied by continuous functional calculus, the theorem asserts
For every unitary on , it also asserts
Finally, for every shared state with positive finite local dimensions and a positive semidefinite, trace-one joint matrix, if its matrix is the rank-one density matrix of a unit vector, then every finite local-operation tree from to an output list whose positive-weight outputs are also rank-one density matrices satisfies . Such trees are generated by stopping, finite local instruments followed by outcome-dependent trees, and forgetting an output label by replacing states of common dimensions by their weighted average; a local instrument has nonnegative weights summing to , preserves the other party’s dimension, and satisfies and for lifted local Kraus matrices. Zero-probability branches in the first assertions have , since , and contribute zero. Although is quantified, its Kraus-completeness hypothesis cannot hold because .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.