Corollary IV.16: Every (R1,…,Rs,H(Y)) with all lower subset bounds sum_(j∈J)Rj≥H(X(J)|X(Jc)Y) is quantum-Fbar achievable.
OpenQAlgorithms.Papers.Independent.Renew46.P43.hybridSourceAchievabilityConsider 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
/-- Corollary IV.16, PDF pp.55-56: all lower-subset-admissible tuples are achievable.
This uses the valid permutation construction; it does not assert the false display IV.14. -/
theorem hybridSourceAchievability {s : ℕ} (S : HybridSource s) (R : Fin s → ℝ)
(hR : R ∈ S.lowerRegion) : S.withYRate R ∈ quantumSourceRegion S.multiple := 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 , and let specify positive classical alphabet sizes for , a quantum system of positive dimension with block labels , a positive integer , distinct unit-vector outer products for , each with zero entries between different quantum blocks, and a probability mass function on classical tuples and indices . For every subset of the classical parties define
where is applied by continuous functional calculus, with ; in particular, . Let be real numbers satisfying, for every subset , including the empty and full subsets,
Then there are compression codes at every positive integer length , with a separate encoding channel for each classical party and for the quantum register, positive compressed dimensions , and a joint decoding channel, such that
Each channel has a finite Kraus representation with . For every positive semidefinite input, the decoder produces zero entries whenever any classical party’s output words differ, or whenever the quantum output words have different block labels at some position. Writing for the decoder composed with the tensor product of all encoders and , regrouped by party, the codes satisfy
No additional nonnegativity hypothesis on is stated. When , there are no classical rates or encoders, the only subset condition is , and the conclusion supplies the quantum-register codes with limiting rate .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.