Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem IV.1: Any quantum-Dbar achievable pair has R1+R2≥H(A1A2), R1≥H(A1|A2), R2≥H(A2|A1).

Open
QAlgorithms.Papers.Independent.Renew46.P43.doubleSourceConverse

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.

R1+R2≥H(A1A2),R1≥H(A1∣A2),R2≥H(A2∣A1).R_1+R_2\ge H(A_1A_2),\qquad R_1\ge H(A_1\mid A_2),\qquad R_2\ge H(A_2\mid A_1).R1​+R2​≥H(A1​A2​),R1​≥H(A1​∣A2​),R2​≥H(A2​∣A1​).

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

/-- 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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 47, Theorem IV.1
Read-back

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

Let LLL be any finite type, and let SSS consist of two finite systems with positive dimensions d0,d1d_0,d_1d0​,d1​, block labels bi:{0,…,di−1}→Nb_i:\{0,\ldots,d_i-1\}\to\mathbb Nbi​:{0,…,di​−1}→N, a probability mass function ppp on LLL, and matrices ρx\rho_xρx​ on their joint system. Assume that every ρx\rho_xρx​, including those with p(x)=0p(x)=0p(x)=0, equals ∣vx⟩⟨vx∣|v_x\rangle\langle v_x|∣vx​⟩⟨vx​∣ for some unit vector vxv_xvx​, that x↦ρxx\mapsto\rho_xx↦ρx​ is injective, and that (ρx)u,v=0(\rho_x)_{u,v}=0(ρx​)u,v​=0 whenever bi(ui)≠bi(vi)b_i(u_i)\ne b_i(v_i)bi​(ui​)=bi​(vi​) for at least one i∈{0,1}i\in\{0,1\}i∈{0,1}. Set ρˉ=∑x∈Lp(x)ρx\bar\rho=\sum_{x\in L}p(x)\rho_xρˉ​=∑x∈L​p(x)ρx​. Let R0,R1R_0,R_1R0​,R1​ be real numbers for which there is a compression code at every positive integer length NNN, with positive compressed dimensions D0(N),D1(N)D_0(N),D_1(N)D0​(N),D1​(N), separate encoding channels Ei,NE_{i,N}Ei,N​ acting on the NNN copies of system iii, and a joint decoding channel DND_NDN​ returning the two systems’ NNN copies. Here a channel is a map admitting a finite 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. Require that, for every positive semidefinite decoder input, the decoded matrix has zero entry between words u,vu,vu,v if bi(ui,t)≠bi(vi,t)b_i(u_{i,t})\ne b_i(v_{i,t})bi​(ui,t​)=bi​(vi,t​) for any party iii and position ttt. Writing TN=DN∘(E0,N⊗E1,N)\mathcal T_N=D_N\circ(E_{0,N}\otimes E_{1,N})TN​=DN​∘(E0,N​⊗E1,N​), and writing ρw=⨂t=0N−1ρwt\rho_w=\bigotimes_{t=0}^{N-1}\rho_{w_t}ρw​=⨂t=0N−1​ρwt​​ with coordinates regrouped by party, assume

lim⁡N→∞log⁡2Di(N)N=Ri,lim⁡N→∞∑w∈LN(∏t=0N−1p(wt))12∥TN(ρw)−ρw∥1=0,\lim_{N\to\infty}\frac{\log_2D_i(N)}N=R_i,\qquad \lim_{N\to\infty}\sum_{w\in L^N}\left(\prod_{t=0}^{N-1}p(w_t)\right) \frac12\|\mathcal T_N(\rho_w)-\rho_w\|_1=0,N→∞lim​Nlog2​Di​(N)​=Ri​,N→∞lim​w∈LN∑​(t=0∏N−1​p(wt​))21​∥TN​(ρw​)−ρw​∥1​=0,

where ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​. Then, with ρˉi\bar\rho_iρˉ​i​ the marginal obtained by summing over equal row and column indices of the other system,

R0+R1≥H(ρˉ),R0≥H(ρˉ)−H(ρˉ1),R1≥H(ρˉ)−H(ρˉ0).R_0+R_1\ge H(\bar\rho),\qquad R_0\ge H(\bar\rho)-H(\bar\rho_1),\qquad R_1\ge H(\bar\rho)-H(\bar\rho_0).R0​+R1​≥H(ρˉ​),R0​≥H(ρˉ​)−H(ρˉ​1​),R1​≥H(ρˉ​)−H(ρˉ​0​).

Here H(X)=−Re⁡tr⁡f(X)H(X)=-\operatorname{Re}\operatorname{tr}f(X)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. No zero-length code is required; the existence of the probability mass function excludes an empty LLL.

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