Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark II.3: II.2 also holds with the output system replaced by an arbitrary finite *-subalgebra A.

Open
QAlgorithms.Papers.Independent.Renew46.P43.hybridNonstationaryCoding

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

prove2quantum

Fix a nonzero finite output system of dimension ddd. The nonstationary channels WiW_iWi​ are nonempty measurable state sets; C(Wi)=sup⁡PI(P;Wi)C(W_i)=\sup_PI(P;W_i)C(Wi​)=supP​I(P;Wi​) optimizes over ALL probability laws on that set. A code has temporal product codewords, a collective block POVM with optional failure, positive length and a nonempty finite message set. N(n,λ)N(n,\lambda)N(n,λ) optimizes actual codes under maximum error, with 0<λ<10<\lambda<10<λ<1. In the maximal-code statements, 0<τ<10<\tau<10<τ<1, the laws PiP_iPi​ are arbitrary, and the measurable event AAA has product mass at least τ\tauτ; constants K′,δ>0K',\delta>0K′,δ>0 are chosen before the channel, laws, event and length. In the converse ϵ>0\epsilon>0ϵ>0 and the threshold is uniform over channel sequences. The hybrid version uses intrinsic output trace and algebra-valued decoding.

∣log⁡2N(n,λ)n−1n∑i=1nC(Wi)∣⟶0for intrinsic output algebra A.\left|\frac{\log_2N(n,\lambda)}n-\frac1n\sum_{i=1}^nC(W_i)\right|\longrightarrow0\quad\text{for intrinsic output algebra }\mathcal A.​nlog2​N(n,λ)​−n1​i=1∑n​C(Wi​)​⟶0for intrinsic output algebra A.

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

/-- Remark II.3, PDF p.24: the full nonstationary theorem also holds for a finite
intrinsic output algebra. Measurements and state restriction use that algebra's trace. -/
theorem hybridNonstationaryCoding (A : IntrinsicSystem) (W : ℕ → StateChannel A)
    (lambda : ℝ) (hlambda : 0 < lambda) (hsmall : lambda < 1) :
    Tendsto (fun n : ℕ => |Real.logb 2 (nonstationaryN W (n+1) lambda) / (n+1 : ℝ) -
      (∑ i : Fin (n+1), (W i.val).capacity) / (n+1 : ℝ)|) atTop (nhds 0) := by sorry

end QAlgorithms.Papers.Independent.Renew46.P43

end
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 24, Remark II.3
Read-back

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

Let AAA consist of a positive integer dimension ddd and a block label β:{0,…,d−1}→N\beta:\{0,\ldots,d-1\}\to\mathbb Nβ:{0,…,d−1}→N. For every sequence W=(Wi)i≥0W=(W_i)_{i\ge0}W=(Wi​)i≥0​ of nonempty measurable sets of d×dd\times dd×d complex matrices, each of whose members ρ\rhoρ is positive semidefinite, has trace 111, and satisfies ρab=0\rho_{ab}=0ρab​=0 whenever β(a)≠β(b)\beta(a)\ne\beta(b)β(a)=β(b), and every real 0<λ<10<\lambda<10<λ<1, the following limit holds. Define H(ρ)=−Re⁡tr⁡(f(ρ))H(\rho)=-\operatorname{Re}\operatorname{tr}(f(\rho))H(ρ)=−Retr(f(ρ)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus. For density matrices define D2(ρ∥σ)=+∞D_2(\rho\Vert\sigma)=+\inftyD2​(ρ∥σ)=+∞ if ker⁡σ⊈ker⁡ρ\ker\sigma\not\subseteq\ker\rhokerσ⊆kerρ, and otherwise define it as the nonnegative part of Re⁡tr⁡(ρlog⁡ρ−ρlog⁡σ)/log⁡2\operatorname{Re}\operatorname{tr}(\rho\log\rho-\rho\log\sigma)/\log2Retr(ρlogρ−ρlogσ)/log2, with the logarithms interpreted by functional calculus and log⁡0=0\log0=0log0=0; its defined value is 000 if either argument is not a density matrix. For a probability measure μ\muμ on WiW_iWi​, put ρˉμ=∫Wiρ dμ(ρ)\bar\rho_\mu=\int_{W_i}\rho\,d\mu(\rho)ρˉ​μ​=∫Wi​​ρdμ(ρ), and set

Ci=sup⁡μ(∫Wi−D2(ρ∥ρˉμ) dμ(ρ))real,C_i=\sup_\mu\left(\int_{W_i}^{-}D_2(\rho\Vert\bar\rho_\mu)\,d\mu(\rho)\right)_{\mathrm{real}},Ci​=μsup​(∫Wi​−​D2​(ρ∥ρˉ​μ​)dμ(ρ))real​,

where the integral is nonnegative and extended real, and conversion to a real number sends +∞+\infty+∞ to 000. A length-LLL code has M>0M>0M>0 messages, assigns each message mmm states ρm,i∈Wi\rho_{m,i}\in W_iρm,i​∈Wi​ for 0≤i<L0\le i<L0≤i<L, and has positive semidefinite decoding matrices D⊥,D0,…,DM−1D_\bot,D_0,\ldots,D_{M-1}D⊥​,D0​,…,DM−1​ summing to the identity; every decoding matrix has entry zero between words a,ba,ba,b whenever β(ai)≠β(bi)\beta(a_i)\ne\beta(b_i)β(ai​)=β(bi​) for some coordinate iii. Its error is

max⁡m<M[1−Re⁡tr⁡ ⁣((⨂i<Lρm,i)Dm)].\max_{m<M}\left[1-\operatorname{Re}\operatorname{tr}\!\left(\left(\bigotimes_{i<L}\rho_{m,i}\right)D_m\right)\right].m<Mmax​[1−Retr((i<L⨂​ρm,i​)Dm​)].

Let NW(L,λ)N_W(L,\lambda)NW​(L,λ) be the supremum in N\mathbb NN of message counts of such codes with error at most λ\lambdaλ. This natural-number supremum is 000 for an empty or unbounded set, and the real logarithm convention gives log⁡20=0\log_2 0=0log2​0=0. The assertion is

lim⁡n→∞∣log⁡2NW(n+1,λ)n+1−∑i=0nCin+1∣=0.\lim_{n\to\infty}\left| \frac{\log_2N_W(n+1,\lambda)}{n+1} -\frac{\sum_{i=0}^{n}C_i}{n+1} \right|=0.n→∞lim​​n+1log2​NW​(n+1,λ)​−n+1∑i=0n​Ci​​​=0.
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