Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem III.5: For lambdaBar,delta>0 and independent P1,P2, any length-n quantum-side-information code of rates Rbar_i and error≤lambdaBar for th

Open
QAlgorithms.Papers.Independent.Renew46.P43.sourceToMac

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

prove2quantum

Let WWW be a two-sender finite classical-input MAC with independent sender laws P1,P2P_1,P_2P1​,P2​. Choose finite normalized pure decompositions Wx1x2=∑πq(π∣x1,x2)πW_{x_1x_2}=\sum_\pi q(\pi\mid x_1,x_2)\piWx1​x2​​=∑π​q(π∣x1​,x2​)π and form the correlated source law P1(x1)P2(x2)q(π∣x1,x2)P_1(x_1)P_2(x_2)q(\pi\mid x_1,x_2)P1​(x1​)P2​(x2​)q(π∣x1​,x2​). For λˉ,δ>0\bar\lambda,\delta>0λˉ,δ>0, any length-nnn source code of rates Rˉi\bar R_iRˉi​ and average error at most λˉ\bar\lambdaλˉ, with free YnY^nYn at its decoder, yields an actual MAC code satisfying:

eˉMAC≤4λˉ,Ri≥H(Pi)−Rˉi−δ(i=1,2),n≥n0(∣X1∣,∣X2∣,δ).\bar e_{\rm MAC}\le4\bar\lambda,\qquad R_i\ge H(P_i)-\bar R_i-\delta\quad(i=1,2),\quad n\ge n_0(|X_1|,|X_2|,\delta).eˉMAC​≤4λˉ,Ri​≥H(Pi​)−Rˉi​−δ(i=1,2),n≥n0​(∣X1​∣,∣X2​∣,δ).

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 III.5, PDF p.43: source/channel reduction for TWO independent classical
sender laws. The source is constructed from the channel's finite pure decompositions;
the decoder's free side-information register is Y^n. -/
theorem sourceToMac (a : Fin 2 → ℕ) (ha : ∀ i, 0 < a i) (delta : ℝ) (hdelta : 0 < delta) :
    ∃ n0 : ℕ, ∀ (C : QAlgorithms.Papers.Independent.Claimed50.P40.ClassicalChannel 2),
      C.alphabet = a →
      ∀ (P : QAlgorithms.Papers.Independent.Claimed50.P40.InputLaw C.alphabet)
        (b : ℕ) (hb : 0 < b) (pi : Fin b → Matrix (Fin C.output) (Fin C.output) ℂ)
        (hpure : ∀ j, IsPure (pi j) ∧ InBlocks C.block (pi j))
        (hdistinct : Function.Injective pi)
        (q : (∀ i, Fin (C.alphabet i)) → PMF (Fin b)),
      (∀ x, C.state x = ∑ j, ((q x j).toReal : ℂ) • pi j) →
      ∀ (n : ℕ), n0 ≤ n → ∀ (lambda : ℝ), 0 < lambda →
      ∀ c : SideCode (macReductionSource C P b hb pi hpure hdistinct q) n,
      c.error ≤ lambda →
      ∃ d : QAlgorithms.Papers.Independent.Claimed50.P40.MultiwayBlockCode
        (QAlgorithms.Papers.Independent.Claimed50.P40.singleReceiver C) n,
        QAlgorithms.Papers.Independent.Claimed50.P40.averageTupleError d 0 ≤ 4 * lambda ∧
        ∀ i, QAlgorithms.Papers.Independent.Claimed50.P40.codeRate d i ≥
          pmfEntropy (P i) - c.rate i - delta := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 43, Theorem III.5
Read-back

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

For every pair of positive natural alphabet sizes a0,a1a_0,a_1a0​,a1​ and every real δ>0\delta>0δ>0, there exists a natural number n0n_0n0​ with the following property, uniformly over all the subsequent data. Let CCC be any two-sender channel whose alphabet-size function equals aaa, with positive output dimension DDD, block labels β\betaβ, and density-matrix outputs C(x)C(x)C(x) whose entries vanish across different block labels. Choose probability mass functions PiP_iPi​ on its input alphabets, a natural number b>0b>0b>0, injectively indexed letters πj=vjvj†\pi_j=v_jv_j^\daggerπj​=vj​vj†​ with ∥vj∥=1\|v_j\|=1∥vj​∥=1 and entries zero across different block labels, and probability mass functions qxq_xqx​ on the letter indices, and assume

C(x)=∑j=0b−1qx(j)πjfor every input pair x.C(x)=\sum_{j=0}^{b-1}q_x(j)\pi_j \quad\text{for every input pair }x.C(x)=j=0∑b−1​qx​(j)πj​for every input pair x.

Form the hybrid source with joint law μ(x0,x1,j)=P0(x0)P1(x1)qx(j)\mu(x_0,x_1,j)=P_0(x_0)P_1(x_1)q_x(j)μ(x0​,x1​,j)=P0​(x0​)P1​(x1​)qx​(j), letters πj\pi_jπj​, and the same output dimension and block labels. For every natural number n≥n0n\ge n_0n≥n0​, every real λ>0\lambda>0λ>0, and every side-information code ccc for this source at length nnn, suppose its error is at most λ\lambdaλ. Such a code requires n>0n>0n>0, positive message counts MiM_iMi​, encoding functions ei:Xin→{0,…,Mi−1}e_i:\mathcal X_i^n\to\{0,\ldots,M_i-1\}ei​:Xin​→{0,…,Mi​−1}, and, for each message tuple mmm, a POVM DmD_mDm​ on (CD)⊗n(\mathbb C^D)^{\otimes n}(CD)⊗n, indexed by all classical word pairs together with a failure outcome. Every POVM element is positive semidefinite, their sum is the identity, and its entry at basis words un,vnu^n,v^nun,vn is zero if β(ut)≠β(vt)\beta(u_t)\ne\beta(v_t)β(ut​)=β(vt​) for some ttt. The error assumption means

1−∑x0n,x1n,jn(∏t=0n−1μ(x0,t,x1,t,jt))Re⁡tr⁡ ⁣[(⨂tπjt)D(e0(x0n),e1(x1n))(x0n,x1n)]≤λ,1- \sum_{x_0^n,x_1^n,j^n} \left(\prod_{t=0}^{n-1}\mu(x_{0,t},x_{1,t},j_t)\right) \operatorname{Re}\operatorname{tr}\!\left[ \left(\bigotimes_t\pi_{j_t}\right) D_{(e_0(x_0^n),e_1(x_1^n))}(x_0^n,x_1^n) \right] \le\lambda,1−x0n​,x1n​,jn∑​(t=0∏n−1​μ(x0,t​,x1,t​,jt​))Retr[(t⨂​πjt​​)D(e0​(x0n​),e1​(x1n​))​(x0n​,x1n​)]≤λ,

and its sender rates are ri(c)=log⁡2Mi/nr_i(c)=\log_2M_i/nri​(c)=log2​Mi​/n. Then there exists a length-nnn channel code ddd for one receiver with access to the entire output: it has positive message counts LiL_iLi​, encoding functions fi:{0,…,Li−1}→Xinf_i:\{0,\ldots,L_i-1\}\to\mathcal X_i^nfi​:{0,…,Li​−1}→Xin​, and a POVM {Bℓ0,ℓ1}\{B_{\ell_0,\ell_1}\}{Bℓ0​,ℓ1​​} on (CD)⊗n(\mathbb C^D)^{\otimes n}(CD)⊗n, indexed by message pairs, with the same condition of vanishing entries across different coordinatewise block labels. Its uniformly averaged tuple error and rates satisfy

1−1L0L1∑ℓ0,ℓ1Re⁡tr⁡ ⁣[Bℓ0,ℓ1⨂t=0n−1C(f0(ℓ0)t,f1(ℓ1)t)]≤4λ,log⁡2Lin≥H(Pi)−ri(c)−δ(i=0,1),1-\frac1{L_0L_1} \sum_{\ell_0,\ell_1} \operatorname{Re}\operatorname{tr}\!\left[ B_{\ell_0,\ell_1} \bigotimes_{t=0}^{n-1} C\bigl(f_0(\ell_0)_t,f_1(\ell_1)_t\bigr) \right] \le4\lambda, \qquad \frac{\log_2L_i}{n} \ge H(P_i)-r_i(c)-\delta \quad(i=0,1),1−L0​L1​1​ℓ0​,ℓ1​∑​Retr[Bℓ0​,ℓ1​​t=0⨂n−1​C(f0​(ℓ0​)t​,f1​(ℓ1​)t​)]≤4λ,nlog2​Li​​≥H(Pi​)−ri​(c)−δ(i=0,1),

where H(Pi)=−∑xPi(x)log⁡2Pi(x)H(P_i)=-\sum_xP_i(x)\log_2P_i(x)H(Pi​)=−∑x​Pi​(x)log2​Pi​(x), with zero summands interpreted as zero. No upper bound on λ\lambdaλ is assumed, and n0n_0n0​ is chosen before the channel, its output dimension, the probability laws, and the letter decomposition.

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