Theorem 1 (§V): max-relative entropy of entanglement is an entanglement monotone
ProvedQAlgorithms.Papers.Independent.Support50.P21.maxRelative_entanglement_monotoneAll systems are nonzero finite-dimensional complex Hilbert spaces, and logarithms have base two.
Let be a bipartite density operator, and let be the set of all separable density operators on the same space. The minimum
is attained and finite. It is nonnegative, vanishes exactly on separable states, and is invariant under local unitaries. For every finite adaptive LOCC instrument producing normalized conditional states with probabilities ,
The statement includes every one-step local instrument and allows local dimension changes, outcome-dependent continuations, and discarded transcripts. This makes an entanglement monotone.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P21
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P21
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
-- Use the accepted declarations directly; no paper-local aliases hide dimension binders.
open QAlgorithms.Papers.Independent.Claimed50.P33
(FiniteState IsAverageLocalMonotone IsAdaptiveLOCCMonotone)
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Dependency50.P35 (tr elog maxRelative)
open QAlgorithms.Papers.Independent.Information100.P67 (IsSubnormalized)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
variable {I J : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
section Statements
variable [Nonempty I] [Nonempty J]
/-- Theorem 1, PDF p.6, (35), with the definition of monotone on pp.6,12.
The false proof identity (36), which uses a sum instead of a maximum for
orthogonal blocks, is not assumed. Minimum attainment and finiteness are explicit. -/
theorem maxRelative_entanglement_monotone :
(∀ rho : Mat (I × J), IsDensityMatrix rho →
∃ z : ℝ, 0 ≤ z ∧ eMax rho = (z : EReal) ∧
∃ sigma : Mat (I × J), IsSeparableDensity sigma ∧ maxRelative rho sigma = eMax rho) ∧
(∀ rho : Mat (I × J), IsDensityMatrix rho →
(eMax rho = 0 ↔ IsSeparableDensity rho)) ∧
(∀ (rho : Mat (I × J)), IsDensityMatrix rho →
∀ (U : Matrix.unitaryGroup I ℂ) (V : Matrix.unitaryGroup J ℂ),
eMax (conjSuperop (Matrix.kronecker (U : Mat I) (V : Mat J)) rho) = eMax rho) ∧
IsAverageLocalMonotone bundledEMax ∧ IsAdaptiveLOCCMonotone bundledEMax := by sorry
end Statements
end QAlgorithms.Papers.Independent.Support50.P21
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty basis types with decidable equality, write
with extended-real infima, where “separable” means a finite convex combination of tensor products of local positive semidefinite, trace-one matrices. The theorem asserts all of the following together: for every positive semidefinite, trace-one on , there is a real such that , and there is a separable attaining ; for every such , if and only if is separable; and, for every such and every pair of local unitaries ,
It also asserts two monotonicity properties of the real-valued function obtained by reindexing a two-party finite state's density matrix as a pair-indexed matrix, applying , and converting the result to a real number, with either infinite value converted to zero. First, for every finite state with positive local dimensions, every natural , weights summing to one, and finite output states , one has whenever these data constitute a local instrument: there is a chosen party, finitely many Kraus matrices for each outcome, unchanged dimensions at the other party, lifted Kraus matrices acting as the identity there, their adjoint products sum to the input identity, and their action on 's density matrix gives in outcome . Second, for every and every finite weighted output list obtainable by the specified finite adaptive rules, . Those rules allow stopping with output , applying any such local instrument and recursively continuing each branch while multiplying branch weights, and replacing an obtainable output list by its weighted mixture when all its states have the same dimensions. Mixture equality is required entrywise, with state entries extended by zero outside their local dimension ranges. The instrument case cannot satisfy the requirement that its weights sum to one, while zero-probability outcomes are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.