Unnumbered E3*: product input expected monotonicity
OpenQAlgorithms.Papers.Independent.Intakenext100.P42.product_expected_monotonicityAll local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, , and Umegaki relative entropy is on failure of support inclusion. The relative entropy of entanglement is , where separability is across the specified Alice:Bob cut.
Let be bipartite density matrices, possibly on different local dimensions, and put , grouping all Alice factors against all Bob factors. For every complete product-Kraus family across that cut, let . Then
The input remains the entanglement of the whole product; no additivity is assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P42
open QAlgorithms QAlgorithms.Entanglement
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy)
open QAlgorithms.Papers.Independent.Information100.P04 (copies)
open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.11, E3*, Eq.(24): expected monotonicity for a product of input states,
without replacing the input's entanglement by a sum of individual values. -/
theorem product_expected_monotonicity {n : ℕ} {I J : Fin n → Type}
[∀ t, Fintype (I t)] [∀ t, Fintype (J t)]
[∀ t, DecidableEq (I t)] [∀ t, DecidableEq (J t)]
[∀ t, Nonempty (I t)] [∀ t, Nonempty (J t)]
(sigma : ∀ t, Matrix (I t × J t) (I t × J t) ℂ)
(hsigma : ∀ t, IsDensityMatrix (sigma t))
{K : Type} [Fintype K]
(L : K → Matrix (∀ t, I t) (∀ t, I t) ℂ)
(R : K → Matrix (∀ t, J t) (∀ t, J t) ℂ) (hcomplete : ProductComplete L R) :
let input := groupedStateProduct sigma
let V := fun k => Matrix.kronecker (L k) (R k)
(∑ k, if 0 < rectangularKrausProbability V input k then
(rectangularKrausProbability V input k : EReal) * relativeEntanglementNats (normalizedBranch V input k)
else 0) ≤ relativeEntanglementNats input := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every pair of families of finite nonempty types , indexed by , with decidable equality on each type, and every family of positive semidefinite matrices on with trace , form the matrix on whose entries are . For every finite type and families of square complex matrices on and on , put and assume . Define and . For a bipartite matrix , let , where “separable” means that is a finite sum with nonnegative real weights summing to and positive semidefinite trace-one factors , and where
with matrix functions interpreted by continuous functional calculus and the total real logarithm satisfying . Then, in the extended real numbers,
The quantification includes , when both product index types are singletons and the empty product defining is . An empty cannot satisfy the completeness hypothesis on these nonempty registers.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.