Theorem IV.7: For fully quantum multiple source, any quantum-Fe achievable R obeys every sum_(i∈I)Ri≥H(A(I)|A(Ic))=H(averageState)−H(averageStat
OpenQAlgorithms.Papers.Independent.Renew46.P43.entanglementSourceConverseConsider a finite pure-letter iid multiple source, allowing correlated classical laws and entangled source letters where the model permits them. Quantum rate regions use separate local CPTP encoders and a joint CPTP decoder, with rates converging and the named average half-trace, average-fidelity or entanglement-fidelity error tending to zero. Entanglement fidelity is used only when every sender system is a full matrix algebra. For classical/hybrid senders , conditional entropies are evaluated in the computed joint source average, the Y rate is exactly , and every sender subset, including empty/full, is tested.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem IV.7, PDF pp.50-51: every subset, empty and full included; no sender
product-state promise or independent sender-law assumption. -/
theorem entanglementSourceConverse {s : ℕ} {L : Type*} [Fintype L]
(S : MultipleData s L) (hS : S.Valid)
(hfull : ∀ i a b, (S.system i).block a = (S.system i).block b)
(R : Fin s → ℝ) (hR : R ∈ entanglementSourceRegion S hfull) :
∀ J : Finset (Fin s), ∑ i ∈ J, R i ≥
vnEntropy S.average - vnEntropy (multipleMarginal S.system S.average Jᶜ) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number, including , let be a finite type, and let specify, for each , a positive system dimension and a block-label function , together with a probability mass function on and joint matrices . Assume that every is the outer product of a unit vector with itself, that is injective, and that its entries vanish whenever some coordinate’s row and column block labels differ. Assume additionally that for every party and every pair of its basis indices . Put , and let . Suppose that at every positive integer length there are positive compressed dimensions , separate encoding channels , and a joint decoding channel , with composite map , such that . A channel here has a finite Kraus representation with . The code also requires decoded positive semidefinite inputs to have zero entries whenever any output block labels differ; under the assumed equality of all labels within each system, this condition imposes no entry restrictions. For , regrouped by party, define and , and suppose
Then every subset satisfies
where is obtained by retaining the coordinates in and summing over matching row and column indices in , and for the functional-calculus function , with . This includes the empty subset and the full subset; when , the joint system is one-dimensional and the sole subset inequality is . All letters, including zero-probability letters, are subject to the purity and injectivity assumptions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.