Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-block iid pure-state coding bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P76.finiteBlockCoding

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let WWW, its normalized pure outputs, the measurable input law μ\muμ, and the computed average output ρ\rhoρ be as above. For an integer n≥1n\ge1n≥1, use the memoryless channel W⊗nW^{\otimes n}W⊗n with product pure outputs and the iid input law μ⊗n\mu^{\otimes n}μ⊗n. For 0<η<ε<10<\eta<\varepsilon<10<η<ε<1, a finite deterministic code and a joint POVM satisfy

Perr≤ε,log⁡2M≥Hsε−η(ρ⊗n)−log⁡24εη2.P_{\rm err}\le\varepsilon,\qquad \log_2M\ge H_s^{\varepsilon-\eta}(\rho^{\otimes n})-\log_2\frac{4\varepsilon}{\eta^2}.Perr​≤ε,log2​M≥Hsε−η​(ρ⊗n)−log2​η24ε​.

Consequently the same lower bound holds for log⁡2M∗(W⊗n,ε)\log_2M^*(W^{\otimes n},\varepsilon)log2​M∗(W⊗n,ε). This finite-block bound needs no moment or positive-variance hypothesis.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P76
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P76

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo normalCDF normalQuantile)

open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)

open QAlgorithms.Papers.Independent.Dependency50.P39 (coherentCoefficient)

open QAlgorithms.Papers.Independent.Next46.P32 (PositiveKernel)

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.9, (5.2): finite-block iid specialization. No variance, third moment,
or asymptotic approximation is assumed. The message decoder is joint. -/
theorem finiteBlockCoding {X : Type*} {I : Type} [MeasurableSpace X] [Countable I]
    (W : X → I → ℂ) (mu : Measure X) [IsProbabilityMeasure mu]
    (hnorm : ∀ x, IsUnitCoefficientVector (W x))
    (hmeas : ∀ a b, Measurable (fun x => Matrix.vecMulVec (W x) (star (W x)) a b))
    (p : ℕ → ℝ) (hspec : HasSpectralLaw (meanOutput W mu) p)
    (n : ℕ) (hn : 1 ≤ n) (epsilon slack : ℝ)
    (he : 0 < epsilon) (he1 : epsilon < 1) (hs : 0 < slack) (hse : slack < epsilon) :
    let R := spectralInfEntropy (productSpectrum p n) (epsilon - slack) -
      logTwo (4 * epsilon / slack ^ 2)
    HasFiniteCode (productPureCQChannel W n) epsilon R ∧
      (R : EReal) ≤ logMaxCodeSize (productPureCQChannel W n) epsilon := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P76

end
Source
Second-order coding rates for pure-loss bosonic channels, arXiv:1408.5328v3, PDF p. 9, §5, (5.1)–(5.2)
Read-back

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

Let XXX be a measurable type, III a countable type, W:X→(I→C)W:X\to(I\to\mathbb C)W:X→(I→C), and μ\muμ a probability measure on XXX. Assume ∑i′∣W(x)i∣2=1\sum'_i|W(x)_i|^2=1∑i′​∣W(x)i​∣2=1, with this family summable, for every xxx, and assume x↦W(x)aW(x)b‾x\mapsto W(x)_a\overline{W(x)_b}x↦W(x)a​W(x)b​​ is measurable for every a,ba,ba,b. Let p:N→Rp:\mathbb N\to\mathbb Rp:N→R be nonnegative and summable with sum 111, and suppose the matrix ρab=∫W(x)aW(x)b‾ dμ(x)\rho_{ab}=\int W(x)_a\overline{W(x)_b}\,d\mu(x)ρab​=∫W(x)a​W(x)b​​dμ(x) has an expansion ρab=∑j′pjuj(a)uj(b)‾\rho_{ab}=\sum'_j p_j u_j(a)\overline{u_j(b)}ρab​=∑j′​pj​uj​(a)uj​(b)​, where vectors with positive weights have summable squared moduli totaling 111 and distinct such vectors are orthogonal under ∑a′uj(a)‾uk(a)\sum'_a\overline{u_j(a)}u_k(a)∑a′​uj​(a)​uk​(a); zero-weight vectors are unrestricted. For every natural number n≥1n\ge1n≥1 and real numbers 0<ϵ<10<\epsilon<10<ϵ<1, 0<s<ϵ0<s<\epsilon0<s<ϵ, define

W(n)(x)a=∏i=0n−1W(xi)ai,p(n)(j)=∏i=0n−1pji,W^{(n)}(x)_a=\prod_{i=0}^{n-1}W(x_i)_{a_i}, \qquad p^{(n)}(j)=\prod_{i=0}^{n-1}p_{j_i},W(n)(x)a​=i=0∏n−1​W(xi​)ai​​,p(n)(j)=i=0∏n−1​pji​​,

for x∈Xnx\in X^nx∈Xn, a∈Ina\in I^na∈In, and j∈Nnj\in\mathbb N^nj∈Nn, and put

R=sup⁡{γ∈R:1−ϵ+s≤∑j∈Nn′1{p(n)(j)≤2−γ}p(n)(j)}−log⁡2 ⁣(4ϵs2),log⁡2t=ln⁡tln⁡2.R=\sup\left\{\gamma\in\mathbb R: 1-\epsilon+s\le \sum'_{j\in\mathbb N^n} \mathbf1_{\{p^{(n)}(j)\le2^{-\gamma}\}}p^{(n)}(j) \right\} -\log_2\!\left(\frac{4\epsilon}{s^2}\right), \qquad \log_2t=\frac{\ln t}{\ln2}.R=sup⎩⎨⎧​γ∈R:1−ϵ+s≤j∈Nn∑′​1{p(n)(j)≤2−γ}​p(n)(j)⎭⎬⎫​−log2​(s24ϵ​),log2​t=ln2lnt​.

Then there exist a positive integer MMM, an encoding c:{0,…,M−1}→Xnc:\{0,\ldots,M-1\}\to X^nc:{0,…,M−1}→Xn, and matrices EmE_mEm​ indexed by In×InI^n\times I^nIn×In, each having real nonnegative quadratic forms on every finite set of indices, with ∑m(Em)ab=1a=b\sum_m(E_m)_{ab}=\mathbf1_{a=b}∑m​(Em​)ab​=1a=b​, such that

1−1M∑mRe⁡ ⁣(∑a′W(n)(c(m))a‾(∑b′(Em)abW(n)(c(m))b))≤ϵ,R≤log⁡2M.1-\frac1M\sum_m \operatorname{Re}\!\left( \sum'_a\overline{W^{(n)}(c(m))_a} \left(\sum'_b(E_m)_{ab}W^{(n)}(c(m))_b\right)\right) \le\epsilon, \qquad R\le\log_2M.1−M1​m∑​Re(a∑′​W(n)(c(m))a​​(b∑′​(Em​)ab​W(n)(c(m))b​))≤ϵ,R≤log2​M.

Also, RRR, regarded as an extended real number, is at most the extended-real supremum of log⁡2M\log_2Mlog2​M over all positive finite codes of this form with average error at most ϵ\epsilonϵ. Repeated codewords are allowed, and n=0n=0n=0 is excluded.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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