Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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.

Open
QAlgorithms.Papers.Independent.Renew46.P43.hybridSourceAchievability

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Consider 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 X1,…,Xs,YX_1,\ldots,X_s,YX1​,…,Xs​,Y, conditional entropies are evaluated in the computed joint source average, the Y rate is exactly H(Y)H(Y)H(Y), and every sender subset, including empty/full, is tested.

[∀J, ∑j∈JRj≥H(X(J)∣X(Jc)Y)]⟹(R1,…,Rs,H(Y))∈Rq,Fˉ.\left[\forall J,\ \sum_{j\in J}R_j\ge H(X(J)\mid X(J^c)Y)\right]\Longrightarrow(R_1,\ldots,R_s,H(Y))\in\mathcal R_{q,\bar F}.​∀J, j∈J∑​Rj​≥H(X(J)∣X(Jc)Y)​⟹(R1​,…,Rs​,H(Y))∈Rq,Fˉ​.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 55, Corollary IV.16
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let sss be any natural number, including 000, and let SSS specify positive classical alphabet sizes aia_iai​ for i∈{0,…,s−1}i\in\{0,\ldots,s-1\}i∈{0,…,s−1}, a quantum system of positive dimension ddd with block labels bbb, a positive integer hhh, distinct unit-vector outer products πℓ=∣vℓ⟩⟨vℓ∣\pi_\ell=|v_\ell\rangle\langle v_\ell|πℓ​=∣vℓ​⟩⟨vℓ​∣ for 0≤ℓ<h0\le\ell<h0≤ℓ<h, each with zero entries between different quantum blocks, and a probability mass function p(x,ℓ)p(x,\ell)p(x,ℓ) on classical tuples x∈∏i{0,…,ai−1}x\in\prod_i\{0,\ldots,a_i-1\}x∈∏i​{0,…,ai​−1} and indices ℓ\ellℓ. For every subset JJJ of the classical parties define

ΩJ=∑x,ℓp(x,ℓ) ∣xJ⟩⟨xJ∣⊗πℓ,H(X)=−Re⁡tr⁡f(X),\Omega_J=\sum_{x,\ell}p(x,\ell)\, |x_J\rangle\langle x_J|\otimes\pi_\ell, \qquad H(X)=-\operatorname{Re}\operatorname{tr}f(X),ΩJ​=x,ℓ∑​p(x,ℓ)∣xJ​⟩⟨xJ​∣⊗πℓ​,H(X)=−Retrf(X),

where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus, with f(0)=0f(0)=0f(0)=0; in particular, Ω∅=∑x,ℓp(x,ℓ)πℓ\Omega_\varnothing=\sum_{x,\ell}p(x,\ell)\pi_\ellΩ∅​=∑x,ℓ​p(x,ℓ)πℓ​. Let RiR_iRi​ be real numbers satisfying, for every subset J⊆{0,…,s−1}J\subseteq\{0,\ldots,s-1\}J⊆{0,…,s−1}, including the empty and full subsets,

H(Ω{0,…,s−1})−H(ΩJc)≤∑i∈JRi.H(\Omega_{\{0,\ldots,s-1\}})-H(\Omega_{J^c}) \le\sum_{i\in J}R_i.H(Ω{0,…,s−1}​)−H(ΩJc​)≤i∈J∑​Ri​.

Then there are compression codes at every positive integer length NNN, with a separate encoding channel for each classical party and for the quantum register, positive compressed dimensions Di(N),Dq(N)D_i(N),D_{\mathrm q}(N)Di​(N),Dq​(N), and a joint decoding channel, such that

log⁡2Di(N)N⟶Ri,log⁡2Dq(N)N⟶H(Ω∅).\frac{\log_2D_i(N)}N\longrightarrow R_i, \qquad \frac{\log_2D_{\mathrm q}(N)}N\longrightarrow H(\Omega_\varnothing).Nlog2​Di​(N)​⟶Ri​,Nlog2​Dq​(N)​⟶H(Ω∅​).

Each channel has a finite Kraus representation X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. 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 TN\mathcal T_NTN​ for the decoder composed with the tensor product of all encoders and ρw=⨂t(∣xt⟩⟨xt∣⊗πℓt)\rho_w=\bigotimes_t(|x_t\rangle\langle x_t|\otimes\pi_{\ell_t})ρw​=⨂t​(∣xt​⟩⟨xt​∣⊗πℓt​​), regrouped by party, the codes satisfy

lim⁡N→∞[1−∑w=((xt,ℓt))t=0N−1(∏tp(xt,ℓt))Re⁡tr⁡(TN(ρw)ρw)]=0.\lim_{N\to\infty} \left[ 1-\sum_{w=((x_t,\ell_t))_{t=0}^{N-1}} \left(\prod_t p(x_t,\ell_t)\right) \operatorname{Re}\operatorname{tr}\bigl(\mathcal T_N(\rho_w)\rho_w\bigr) \right]=0.N→∞lim​​1−w=((xt​,ℓt​))t=0N−1​∑​(t∏​p(xt​,ℓt​))Retr(TN​(ρw​)ρw​)​=0.

No additional nonnegativity hypothesis on RRR is stated. When s=0s=0s=0, there are no classical rates or encoders, the only subset condition is 0≤00\le00≤0, and the conclusion supplies the quantum-register codes with limiting rate H(Ω∅)H(\Omega_\varnothing)H(Ω∅​).

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me