Theorem IV.17: Every quantum-Fbar achievable (R1,…,Rs,H(Y)) obeys all lower subset bounds sum_(j∈J)Rj≥H(X(J)|X(Jc)Y).
OpenQAlgorithms.Papers.Independent.Renew46.P43.hybridSourceConverseConsider 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.17, PDF p.56: the printed theorem allows correlated classical laws.
Its proof invokes III.5 outside that lemma's independence domain; this proof limitation
is recorded without adding independence to the theorem. -/
theorem hybridSourceConverse {s : ℕ} (S : HybridSource s) (R : Fin s → ℝ)
(hR : S.withYRate R ∈ quantumSourceRegion S.multiple) : R ∈ S.lowerRegion := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let consist of positive alphabet sizes for , a positive dimension with a block-label function , a positive number of distinct matrices , and a probability mass function on pairs , where and ; each has the form with , and whenever . No independence of the coordinates of is required. Write , where is applied by continuous functional calculus, and, for each sender subset , define the matrix , indexed by pairs consisting of an alphabet assignment on and a quantum basis index, by
For every real vector , suppose the following coding condition holds. Regard each letter as the state of parties, the first having dimension and block label equal to their basis index, and the last having dimension and block label . For every positive length , there is a code with a positive compressed dimension for every party, a separate channel from that party’s systems to dimension , and a joint decoding channel . Here every channel is a map of the form for a finite family satisfying . For every positive semidefinite decoder input, the decoded matrix has zero entry between two output configurations whenever, at some party and some position, their block labels differ. Let , and let for a word of letters. The code sequence satisfies
as . Then, for every subset ,
The quantification includes and empty subsets; when , the asserted subset inequality is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.