Theorem IV.1: Any quantum-Dbar achievable pair has R1+R2≥H(A1A2), R1≥H(A1|A2), R2≥H(A2|A1).
OpenQAlgorithms.Papers.Independent.Renew46.P43.doubleSourceConverseConsider 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.1, PDF p.47: hybrid systems and entangled letters are allowed.
Conditional entropies can be negative; only the code resources enforce nonnegative rates. -/
theorem doubleSourceConverse {L : Type*} [Fintype L] (S : MultipleData 2 L) (hS : S.Valid)
(R : Fin 2 → ℝ) (hR : R ∈ quantumSourceRegion S true) :
R 0 + R 1 ≥ vnEntropy S.average ∧
R 0 ≥ vnEntropy S.average - vnEntropy (multipleMarginal S.system S.average {1}) ∧
R 1 ≥ vnEntropy S.average - vnEntropy (multipleMarginal S.system S.average {0}) := 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 finite type, and let consist of two finite systems with positive dimensions , block labels , a probability mass function on , and matrices on their joint system. Assume that every , including those with , equals for some unit vector , that is injective, and that whenever for at least one . Set . Let be real numbers for which there is a compression code at every positive integer length , with positive compressed dimensions , separate encoding channels acting on the copies of system , and a joint decoding channel returning the two systems’ copies. Here a channel is a map admitting a finite representation with . Require that, for every positive semidefinite decoder input, the decoded matrix has zero entry between words if for any party and position . Writing , and writing with coordinates regrouped by party, assume
where . Then, with the marginal obtained by summing over equal row and column indices of the other system,
Here , where is applied by continuous functional calculus, with . No zero-length code is required; the existence of the probability mass function excludes an empty .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.