Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

IV-source-region-properties: Applicable source regions are closed, convex, upward closed; Rq,Fe⊆Rq,Fbar⊆Ra,Fbar; Rq,Fbar=Rq,Dbar and Ra,Fbar=Ra,Dbar.

Open
QAlgorithms.Papers.Independent.Renew46.P43.multipleSourceRegionProperties

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

prove2quantum

For a finite pure-letter iid multiple source, use actual separate CPTP quantum encoders and a joint CPTP decoder, with all component rates converging and the chosen error vanishing. Every defined rate region is closed, convex and upward closed. The Fe region is asserted only for fully quantum systems; the arbitrary-encoder regions and corresponding inclusions are asserted only for product-letter ensembles, whose joint law may still be correlated.

Rq,Fe⊆Rq,Fˉ=Rq,Dˉ⊆Ra,Fˉ=Ra,Dˉ.\mathcal R_{q,F_e}\subseteq\mathcal R_{q,\bar F}=\mathcal R_{q,\bar D}\subseteq\mathcal R_{a,\bar F}=\mathcal R_{a,\bar D}.Rq,Fe​​⊆Rq,Fˉ​=Rq,Dˉ​⊆Ra,Fˉ​=Ra,Dˉ​.

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

/-- Unnumbered source-region properties, PDF p.46. The arbitrary part is restricted
to product-letter ensembles and Fe to full matrix systems. All equivalences/inclusions
in the printed diagram are retained. -/
theorem multipleSourceRegionProperties {s : ℕ} {L : Type*} [Fintype L]
    (S : MultipleData s L) (hS : S.Valid) :
    SourceRegionProperties (quantumSourceRegion S) ∧
    SourceRegionProperties (quantumSourceRegion S true) ∧
    quantumSourceRegion S = quantumSourceRegion S true ∧
    (∀ hfull : ∀ i a b, (S.system i).block a = (S.system i).block b,
      SourceRegionProperties (entanglementSourceRegion S hfull) ∧
      entanglementSourceRegion S hfull ⊆ quantumSourceRegion S) ∧
    (∀ P : ProductData s, P.Valid →
      SourceRegionProperties (arbitrarySourceRegion P) ∧
      SourceRegionProperties (arbitrarySourceRegion P true) ∧
      arbitrarySourceRegion P = arbitrarySourceRegion P true ∧
      quantumSourceRegion P.multiple ⊆ arbitrarySourceRegion P) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 46, IV-source-region-properties
Read-back

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

Let sss be any natural number and LLL any type equipped with a finite enumeration. For each party i∈{0,…,s−1}i\in\{0,\ldots,s-1\}i∈{0,…,s−1}, let di>0d_i>0di​>0 be a dimension and βi:{0,…,di−1}→N\beta_i:\{0,\ldots,d_i-1\}\to\mathbb Nβi​:{0,…,di​−1}→N a block label function. Let SSS consist of these systems, a probability mass function ppp on LLL, and complex matrices ρx\rho_xρx​ indexed by ∏i{0,…,di−1}\prod_i\{0,\ldots,d_i-1\}∏i​{0,…,di​−1}. Assume that every ρx\rho_xρx​, including those with p(x)=0p(x)=0p(x)=0, has the form vxvx†v_xv_x^\daggervx​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 βi(ui)≠βi(vi)\beta_i(u_i)\ne\beta_i(v_i)βi​(ui​)=βi​(vi​) for at least one party iii. The following definitions specify the regions in the conclusion. A density matrix is positive semidefinite with trace 111, and a channel here is a map having a finite Kraus representation Φ(X)=∑jKjXKj†\Phi(X)=\sum_j K_jXK_j^\daggerΦ(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Write H(X)=−Re⁡tr⁡(f(X))H(X)=-\operatorname{Re}\operatorname{tr}(f(X))H(X)=−Retr(f(X)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus, and write

dtr(X,Y)=12Re⁡tr⁡(X−Y)†(X−Y).d_{\mathrm{tr}}(X,Y)=\frac12\operatorname{Re}\operatorname{tr} \sqrt{(X-Y)^\dagger(X-Y)}.dtr​(X,Y)=21​Retr(X−Y)†(X−Y)​.

For a word w=(w0,…,wn−1)∈Lnw=(w_0,\ldots,w_{n-1})\in L^nw=(w0​,…,wn−1​)∈Ln, set pn(w)=∏t=0n−1p(wt)p_n(w)=\prod_{t=0}^{n-1}p(w_t)pn​(w)=∏t=0n−1​p(wt​) and define its matrix ρw\rho_wρw​ on the party registers u=(ui,t)u=(u_{i,t})u=(ui,t​) by (ρw)u,v=∏t(ρwt)(ui,t)i,(vi,t)i(\rho_w)_{u,v}=\prod_t(\rho_{w_t})_{(u_{i,t})_i,(v_{i,t})_i}(ρw​)u,v​=∏t​(ρwt​​)(ui,t​)i​,(vi,t​)i​​. A quantum code of length n>0n>0n>0 chooses positive integers kik_iki​, a channel EiE_iEi​ from party iii’s nnn input registers to a kik_iki​ dimensional register, and a channel DDD from the combined compressed registers back to all party input registers. For every positive semidefinite compressed input TTT, the decoder must satisfy (D(T))u,v=0(D(T))_{u,v}=0(D(T))u,v​=0 if βi(ui,t)≠βi(vi,t)\beta_i(u_{i,t})\ne\beta_i(v_{i,t})βi​(ui,t​)=βi​(vi,t​) for some i,ti,ti,t. Its combined map is Λ=D∘⨂iEi\Lambda=D\circ\bigotimes_iE_iΛ=D∘⨂i​Ei​, where the tensor product of maps is defined on matrix units by

(⨂iEi)(T)a,b=∑u,vTu,v∏i(Ei(∣ui⟩⟨vi∣))ai,bi.\left(\bigotimes_iE_i\right)(T)_{a,b} =\sum_{u,v}T_{u,v}\prod_i \left(E_i(|u_i\rangle\langle v_i|)\right)_{a_i,b_i}.(i⨂​Ei​)(T)a,b​=u,v∑​Tu,v​i∏​(Ei​(∣ui​⟩⟨vi​∣))ai​,bi​​.

Its party rates, average fidelity, and average distortion are respectively

ri=log⁡2kin,F=∑wpn(w)Re⁡tr⁡ ⁣(Λ(ρw)ρw),Δ=∑wpn(w)dtr ⁣(Λ(ρw),ρw).r_i=\frac{\log_2k_i}{n},\qquad F=\sum_w p_n(w)\operatorname{Re}\operatorname{tr}\!\left(\Lambda(\rho_w)\rho_w\right), \qquad \Delta=\sum_w p_n(w)d_{\mathrm{tr}}\!\left(\Lambda(\rho_w),\rho_w\right).ri​=nlog2​ki​​,F=w∑​pn​(w)Retr(Λ(ρw​)ρw​),Δ=w∑​pn​(w)dtr​(Λ(ρw​),ρw​).

Define QF(S)\mathcal Q_F(S)QF​(S) to contain exactly the vectors RRR for which there is a code at every positive integer length nnn, with ri→Rir_i\to R_iri​→Ri​ for every iii and 1−F→01-F\to01−F→0 as n→∞n\to\inftyn→∞; define QΔ(S)\mathcal Q_\Delta(S)QΔ​(S) by replacing the last convergence with Δ→0\Delta\to0Δ→0. If all labels within each party’s system are equal, define Qe(S)\mathcal Q_e(S)Qe​(S) using the same sequences of codes and rate limits, but require

1−Re⁡tr⁡((id⁡⊗Λ)(Pρ‾n)Pρ‾n)⟶0,ρ‾n=(∑xp(x)ρx)⊗n,1-\operatorname{Re}\operatorname{tr} \left((\operatorname{id}\otimes\Lambda)(P_{\overline\rho_n})P_{\overline\rho_n}\right)\longrightarrow0, \qquad \overline\rho_n=\left(\sum_xp(x)\rho_x\right)^{\otimes n},1−Retr((id⊗Λ)(Pρ​n​​)Pρ​n​​)⟶0,ρ​n​=(x∑​p(x)ρx​)⊗n,

where Pσ=∣Ωσ⟩⟨Ωσ∣P_\sigma=|\Omega_\sigma\rangle\langle\Omega_\sigma|Pσ​=∣Ωσ​⟩⟨Ωσ​∣ and (Ωσ)a,b=(σ)b,a(\Omega_\sigma)_{a,b}=(\sqrt{\sigma})_{b,a}(Ωσ​)a,b​=(σ​)b,a​; the extension id⁡⊗Λ\operatorname{id}\otimes\Lambdaid⊗Λ applies Λ\LambdaΛ separately to each matrix block selected by the two reference indices. For any region TTT, let the stated region property mean that TTT is closed, convex over R\mathbb RR, and contains every vector coordinatewise above any of its elements. The theorem asserts that QF(S)\mathcal Q_F(S)QF​(S) and QΔ(S)\mathcal Q_\Delta(S)QΔ​(S) both have this property and are equal; moreover, for every choice of the hypothesis that all labels within each party are equal, Qe(S)\mathcal Q_e(S)Qe​(S) has this property and Qe(S)⊆QF(S)\mathcal Q_e(S)\subseteq\mathcal Q_F(S)Qe​(S)⊆QF​(S). It further asserts the following for every product source PPP with sss parties: each party has a positive dimensional system with block labels, a positive finite alphabet, and an injective family of unit-vector density matrices σi,x\sigma_{i,x}σi,x​ whose entries vanish between different blocks, while the joint alphabet has an arbitrary probability mass function π\piπ, with no independence assumption. Its joint letter is ⨂iσi,xi\bigotimes_i\sigma_{i,x_i}⨂i​σi,xi​​. An arbitrary encoder code for this source chooses, for each party and each local word xinx_i^nxin​, a density matrix ηi,xin\eta_{i,x_i^n}ηi,xin​​ on a positive kik_iki​ dimensional register, and uses a decoder channel DDD satisfying the same output block condition as above; its output on a joint word is D(⨂iηi,xin)D(\bigotimes_i\eta_{i,x_i^n})D(⨂i​ηi,xin​​). Define AF(P)\mathcal A_F(P)AF​(P) and AΔ(P)\mathcal A_\Delta(P)AΔ​(P) by sequences of these codes at every positive length, rates log⁡2ki/n→Ri\log_2k_i/n\to R_ilog2​ki​/n→Ri​, and respectively average fidelity tending to 111 or average trace distance tending to 000, averaging joint words with weight ∏tπ(xt)\prod_t\pi(x_t)∏t​π(xt​) against the target matrices ⨂t⨂iσi,xt,i\bigotimes_t\bigotimes_i\sigma_{i,x_{t,i}}⨂t​⨂i​σi,xt,i​​. Then both arbitrary encoder regions are closed, convex, and upward closed, they are equal, and QF(P)⊆AF(P)\mathcal Q_F(P)\subseteq\mathcal A_F(P)QF​(P)⊆AF​(P), where QF(P)\mathcal Q_F(P)QF​(P) uses the joint letters just described and channel encoders. The quantification includes s=0s=0s=0; all code lengths used in these regions are positive, and the given probability mass function on LLL 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