Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 1 result · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Quantum Source Compression and Classical Communication over Quantum Channels

1 · Prerequisites

2 · Summary

This page proves two finite-dimensional asymptotic coding theorems. For the IID source ρ⊗n, the Schumacher rate is S(ρ) nats, measured using squared entanglement fidelity of a channel that factors through the code space. For a fixed finite-input memoryless cq channel x↦ρx, the HSW capacity is the maximum ensemble Holevo information in nats/use, with deterministic codewords, collective output POVMs, and vanishing average block error. Bits are obtained by dividing the displayed nats rates by ln⁡2; no infinite-dimensional or general quantum-input single-letter claim is made.

The source-code diagram records the untouched reference register and the two channels in the code definition. The cq diagram records the encoder word, memoryless output state, and decoder measurement. These are type-level diagrams only; the statements and proofs below use the explicit channel, state, and POVM formulas.

R\otimes A^{\otimes n} \arrow[r,"\operatorname{id}_R\otimes\mathcal E_n"] &
R\otimes C_n \arrow[r,"\operatorname{id}_R\otimes\mathcal D_n"] &
R\otimes\widehat A^{\otimes n}
[M] \arrow[r,"m\mapsto x^n(m)"] &
\mathcal X^n \arrow[r,"x^n\mapsto\bigotimes_i\rho_{x_i}"] &
\mathcal D(H_B^{\otimes n}) \arrow[r,"\{\Lambda_m\}"] &
[M]

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Gentle measurement bound in finite dimensions

Statement

Let ρ be a density operator on a nonzero finite-dimensional complex inner-product space H, let 0⪯Λ⪯IH, and suppose tr⁡(Λρ)≥1−u for some u∈[0,1]. Then

∥ρ−ΛρΛ∥1≤2u.

Here Λ is the unique nonnegative square root, and ∥⋅∥1 is the finite-dimensional trace norm. No normalization is applied after the operation ρ↦ΛρΛ.

Facts & Assumptions

Given: A finite-dimensional density operator ρ, an operator 0⪯Λ⪯IH, and u∈[0,1] with tr⁡(Λρ)≥1−u.

[F1]

Density operator: ρ is nonnegative with trace one.

[F2]

Purifications exist and are unitarily equivalent after padding: every finite-dimensional density operator has a unit-vector purification whose partial trace is the state.

[F3]
[F4]

A non-negative operator has a unique non-negative square root: a nonnegative endomorphism has a unique nonnegative square root.

[F5]

Trace Norm: the trace norm is the sum of singular values.

[F6]

Partial trace contracts the trace norm on Hermitian operators: partial trace does not increase trace norm on Hermitian operators.

Proof

1.1givenF1F2F3F4algebrachoose

Choose a purification ∣ψ⟩∈H⊗R of ρ using [F2]. Let v=(Λ⊗IR)∣ψ⟩, q=⟨v,v⟩=tr⁡(Λρ), and s=⟨ψ,v⟩=tr⁡(ρΛ). By [F3]–[F4], the eigenvalues λ of Λ lie in [0,1] and λ≥λ, so Λ−Λ is nonnegative. Diagonalizing ρ by [F3], s−q=tr⁡(ρ(Λ−Λ)) is a sum of nonnegative eigenvalues of ρ times nonnegative quadratic forms; hence s≥q. Also 0≤q≤1 because Λ⪯I and tr⁡ρ=1.

2.1F3F5F7step 1.1algebracases

The Hermitian operator ∣ψ⟩⟨ψ∣−∣v⟩⟨v∣ is zero off the span of ψ,v. If v is not a scalar multiple of ψ, write v=sˉ ψ+w with w⊥ψ; in the orthonormal basis ψ,w/∥w∥, its 2×2 matrix has trace 1−q and determinant −(q−∣s∣2). By [F7], q−∣s∣2≥0, so the eigenvalues have opposite signs or one is zero. Its trace norm is the square root of the characteristic discriminant, (1+q)2−4∣s∣2. If v is a scalar multiple of ψ, the same formula reduces to the one-dimensional trace norm ∣1−q∣.

3.1F2F6step 1.1step 2.1algebra∎

Since s≥q and 0≤q≤1, step 2.1 gives ∥∣ψ⟩⟨ψ∣−∣v⟩⟨v∣∥12≤(1+q)2−4q2=(1−q)(1+3q)≤4(1−q)≤4u. Taking the partial trace over R gives the claimed bound by [F6], because the partial trace of the first rank-one state is ρ and that of the second is ΛρΛ.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck pendingOpen item page →

The finite positive square root preserves operator order

Statement

If A,B are nonnegative endomorphisms of a nonzero finite-dimensional complex inner-product space and A⪯B, then their nonnegative square roots satisfy A1/2⪯B1/2.

Facts & Assumptions

Given: Nonnegative A,B on a nonzero finite-dimensional complex inner-product space with A⪯B.

[F1]

Non-negative and positive operators: A⪯B means B−A is nonnegative, and positive definite operators have positive quadratic form on nonzero vectors.

[F3]

A non-negative operator has a unique non-negative square root: the nonnegative square root is defined spectrally with eigenvalues λ.

[F4]

Continuity and derivatives of positive-base real powers and The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): the positive powers s1/2 and s−1/2 have their ordinary derivatives, and a continuous derivative integrates to its endpoint difference on each compact positive interval.

[F6]

Monotone change of variable for Riemann-integrable functions: a differentiable monotone change of variable transforms a Riemann integral by its derivative.

[F7]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V and Adjoints satisfy (S+T)∗=S∗+T∗, (λT)∗=λ‾T∗, (ST)∗=T∗S∗, and T∗∗=T: adjoints satisfy the inner-product identity and reverse products, so a congruence by a self-adjoint endomorphism is self-adjoint and preserves nonnegativity by its quadratic-form calculation.

[F8]

If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a): pointwise inequalities between integrable functions on a compact interval imply the same inequality for their integrals.

[F9]

A monotone sequence converges if and only if it is bounded: every bounded monotone sequence of real numbers converges.

[F10]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.

Proof

1.1F1F2F3F7givenalgebra

First suppose P,Q are positive definite and P⪯Q. By [F2], their eigenvalues are strictly positive: applying the positive quadratic form to an eigenvector gives λ∥v∥2>0. Define P−1/2 spectrally by replacing each eigenvalue λ with λ−1/2, and set P−1:=(P−1/2)2; multiplication in the eigenbasis shows these are the inverse square root and inverse of P. Put C:=P−1/2QP−1/2. By the adjoint product rule in [F7], C is self-adjoint, and [F7] gives ⟨v,Cv⟩=⟨P−1/2v,QP−1/2v⟩>0 for v≠0, so C is positive definite. Also C−I=P−1/2(Q−P)P−1/2⪰0 by the same quadratic-form identity and [F1]. Hence every eigenvalue μ of C is at least one by [F2]; define C−1 spectrally by reciprocating its positive eigenvalues, giving C−1⪯I. Since Q=P1/2CP1/2, multiplying this factorization by P−1/2C−1P−1/2 on either side gives the identity, so Q−1=P−1/2C−1P−1/2. Congruence of C−1⪯I by P−1/2 now yields Q−1⪯P−1.

2.1F1step 1.1algebra

For t>0 and nonzero v, ⟨v,(A+tI)v⟩≥t∥v∥2>0, and likewise for B, so A+tI and B+tI are positive definite and ordered. Step 1.1 gives (A+tI)−1⪰(B+tI)−1. Multiplying the order by t and subtracting from I yields A(A+tI)−1=I−t(A+tI)−1⪯I−t(B+tI)−1=B(B+tI)−1.

3.1F2F3F4F5F6F8F9F10step 2.1algebra∎

Set f(s)=s−1/2/(1+s) for s>0. It is continuous, hence integrable on every compact interval in its domain by [F10]. For 0<s≤1, f(s)≤s−1/2; for s≥1, f(s)≤s−3/2. For each integer k≥1, the sequence ak=∫1/k1f(s) ds is nondecreasing by positivity and additivity, and is bounded above by ∫1/k1s−1/2ds=2(1−k−1/2)≤2. For k>1 this evaluation follows from the primitive 2s, whose derivative is s−1/2 by [F4], and the fundamental theorem in [F4]; for k=1 both sides are zero by the equal-endpoint convention in [F5]. The sequence bk=∫1kf(s) ds is likewise nondecreasing and bounded above by ∫1ks−3/2ds=2(1−k−1/2)≤2, using the primitive −2s−1/2 and [F4] when k>1, and [F5] when k=1. Both sequences therefore converge by [F9]. By additivity [F5], ck:=∫1/kkf(s) ds=ak+bk converges to a finite c. For every k≥2, monotonicity [F8] and f(s)≥1/(32) on [1,2] give ck≥∫12f(s) ds≥1/(32), so c>0. For each fixed λ>0, define ck,λ:=∫1/(kλ)k/λf(s) ds. If m≥2 is fixed and k is large enough that 1/(kλ)≤1/m and k/λ≥m, additivity and monotonicity of the integral with the two displayed tail bounds give cm≤ck,λ=cm+∫1/(kλ)1/mf(s) ds+∫mk/λf(s) ds≤cm+2(m−1/2−(kλ)−1/2)+2(m−1/2−(λ/k)1/2)≤cm+4m. Since cm→c and 4/m→0, this proves ck,λ→c for each fixed λ>0. Now [F6] with t=λs in the coefficient integral over the fixed interval [1/k,k] gives ∫1/kkt−1/2λλ+t dt=λ ck,λ⟶cλ; for λ=0 the coefficient is identically zero. For a nonnegative X, let Pλ be its spectral projection at eigenvalue λ and define Jk(X):=∑λ∈spec⁡(X)(∫1/kkt−1/2λλ+t dt)Pλ. The coefficient depends only on λ, so this definition is independent of choices of eigenvectors within eigenspaces. The coefficient convergence and finite spectral sum imply ⟨v,Jk(X)v⟩→c⟨v,X1/2v⟩ for every vector v. For k≥2, this quadratic form is also the integral of the continuous scalar function t↦⟨v,t−1/2X(X+tI)−1v⟩ on [1/k,k], as follows from the finite spectral sum. By step 2.1 these functions for X=A and X=B are pointwise ordered; [F8] therefore gives ⟨v,Jk(A)v⟩≤⟨v,Jk(B)v⟩. Taking limits and using c>0 yields ⟨v,A1/2v⟩≤⟨v,B1/2v⟩ for every v, which is A1/2⪯B1/2.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite Hayashi–Nagaoka operator inequality

Statement

Let S,T be nonnegative endomorphisms of a finite-dimensional complex inner-product space H, with S⪯IH. Define (S+T)−1/2 spectrally on supp⁡(S+T) and set it to zero on ker⁡(S+T). Then

IH−(S+T)−1/2S(S+T)−1/2⪯2(IH−S)+4T.

Facts & Assumptions

Given: Nonnegative S,T on finite-dimensional H with S⪯IH.

[F1]

Non-negative and positive operators: A⪯B means B−A is nonnegative.

[F2]

The finite positive square root preserves operator order: 0⪯X⪯Y implies X⪯Y.

[F3]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely and A non-negative operator has a unique non-negative square root: nonnegative endomorphisms have finite orthonormal eigenbases and their square roots are defined by taking nonnegative square roots of eigenvalues.

Proof

1.1F1F2F3algebra

If H={0}, every endomorphism, including IH, is zero, so the asserted inequality is 0⪯0. Henceforth assume H≠{0}, as required by [F2]. Set X=S+T, R=X, and U=I−R. For c>0 and endomorphisms A,B, expanding (A−cB)∗(A−cB)⪰0 and dividing by c gives A∗B+B∗A⪯c−1A∗A+cB∗B. Apply this with A=TR and B=TU. Since R+U=I, expansion of (R+U)T(R+U) and the preceding inequality give T⪯(1+c−1)RTR+(1+c)UTU. Now T⪯X=R2, so congruence by U gives UTU⪯UR2U=RU2R; the last equality follows because U=I−R commutes with R. Since U2=I−2R+R2=I+S+T−2R, substitution and collection of the two T terms yield T⪯R((2+c+c−1)T+(1+c)(I+S−2R))R. By [F2], R⪰S; [F3] and 0⪯S⪯I give S⪰S by diagonalizing S. Therefore I+S−2R⪯I−S. Taking c=1 in the last display proves T⪯R(4T+2(I−S))R.

2.1F1F3step 1.1algebracases∎

Let P be the orthogonal projection onto supp⁡X. If v∈ker⁡X, then 0=⟨v,Xv⟩=⟨v,Sv⟩+⟨v,Tv⟩; both terms are nonnegative, so each is zero. By [F3], these terms are ∥Sv∥2 and ∥Tv∥2, hence Sv=Tv=0. Since S,T are self-adjoint, they preserve the orthogonal complement PH of ker⁡X as well. Thus both sides of the desired inequality are block diagonal for H=PH⊕ker⁡X. On PH, congruence of step 1.1 by the inverse of the restriction of R gives X−1/2TX−1/2⪯4T+2(I−S). On this block, X−1/2(S+T)X−1/2=IPH, so its left side is IPH−X−1/2SX−1/2. On ker⁡X, the desired inequality is I⪯2I, since S=T=X−1/2=0 there. Combining these two block inequalities proves the Statement, including when either block is zero-dimensional.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite IID quantum source and compression code

Definition

Let HA be a nonzero finite-dimensional complex inner-product space and let ρ be a density operator (Density operator) on HA. The finite IID quantum source with state ρ emits the block state ρ⊗n on HA⊗n at blocklength n≥1.

An (n,M) quantum compression code for ρ consists of a finite-dimensional code space HC with dim⁡HC=M≥1, a quantum channel (Finite-dimensional quantum channel) E:L(HA⊗n)→L(HC), and a quantum channel D:L(HC)→L(HA⊗n). Its squared entanglement fidelity is

Fe(n):=⟨ϕ∣(id⁡R⊗(D∘E))(∣ϕ⟩⟨ϕ∣)∣ϕ⟩,

where HR is any finite-dimensional reference space supporting the chosen unit-vector purification ∣ϕ⟩ of ρ⊗n on HR⊗HA⊗n. The value is independent of the chosen finite purification by the isometric equivalence of Purifications exist and are unitarily equivalent after padding. A sequence of codes is reliable when Fe(n)→1. The code's rate is n−1ln⁡M nats per source letter, equivalently n−1log⁡2M qubits per source letter. The entropy threshold in these units is S(ρ) nats or S2(ρ):=S(ρ)/ln⁡2 qubits, where S is the entropy of Finite-dimensional von Neumann entropy.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Continuity of finite-dimensional quantum entropy

Statement

For each fixed finite dimension d, von Neumann entropy is continuous on density operators (Density operator) on Cd in operator norm (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||). Thus, if ρk→ρ in operator norm, then S(ρk)→S(ρ).

Facts & Assumptions

Given: A fixed finite dimension d and density operators ρk,ρ on Cd.

[F1]

Finite-dimensional von Neumann entropy: S(ρ)=−∑jλjln⁡λj, with 0ln⁡0:=0.

[F2]

Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz: each ordered eigenvalue of Hermitian matrices changes by at most the operator norm of the matrix difference.

[F3]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is continuous, strictly increasing, and onto R. By The natural logarithm as the inverse of the exponential function, ln⁡(exp⁡u)=u and exp⁡(ln⁡t)=t for t>0.

[F5]

Density operator: a density operator is nonnegative with trace one, so its eigenvalues lie in [0,1].

Proof

1.1F3F4algebraconstruct

Define h(t)=−tln⁡t for 0<t≤1 and h(0)=0. It is continuous for positive t by [F3]. Since ln⁡ is increasing and onto, ln⁡t→−∞ as t↓0. Put u=−ln⁡t; then t=exp⁡(−u)=1/exp⁡u by the inverse and reciprocal identities in [F3]. Hence h(t)=u/exp⁡u→0 by [F4] with m=a=1, so h is continuous on [0,1].

2.1F2F5step 1.1givenchoose

Let λ1(ρ)≥⋯≥λd(ρ) and similarly for ρk. By [F5], density eigenvalues lie in [0,1]; [F2] gives ∣λj(ρk)−λj(ρ)∣≤∥ρk−ρ∥ for every j. For any ε>0, continuity of h at the finitely many λj(ρ) gives one positive radius δ such that ∥ρk−ρ∥<δ makes ∣h(λj(ρk))−h(λj(ρ))∣<ε/d for all j.

3.1F1step 1.1step 2.1algebra∎

Sum the d inequalities in step 2.1 and use [F1]. This gives ∣S(ρk)−S(ρ)∣<ε whenever ∥ρk−ρ∥<δ, proving continuity. The zero-eigenvalue boundary is covered by step 1.1, so no full-rank assumption is used.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Finite square-root measurement packing bound for cq states

Statement

Let X be a finite nonempty set, let p be a probability vector, and let σx be density operators on a finite-dimensional H. Let σˉ=∑xpxσx. Suppose that for every x in the support of p, projections Π,Πx satisfy tr⁡(Πσx)≥1−u,tr⁡(Πxσx)≥1−u,rank⁡Πx≤d, and ΠσˉΠ⪯D−1Π, where u∈[0,1] and d,D>0. For M≥1, draw X1,…,XM independently with law p. Then the square-root POVM built from Γm=ΠΠXmΠ has expected average error at most 2(u+2u)+4(M−1)dD.

Facts & Assumptions

Given: A finite ensemble of states, projectors obeying the displayed bounds, and independent random codewords.

[F1]

Density operator: each σx is nonnegative with trace one.

[F2]

Gentle measurement bound in finite dimensions: acceptance at least 1−u implies trace-norm disturbance at most 2u.

[F3]

Finite Hayashi–Nagaoka operator inequality: if 0⪯S⪯I and T⪰0, then I−(S+T)−1/2S(S+T)−1/2⪯2(I−S)+4T, with the inverse on support.

[F5]

Trace Norm Duality And Norm Properties: for an effect E, ∣tr⁡(EX)∣≤∥X∥1 when X is Hermitian.

[F6]

Trace of a product of positive semidefinite matrices is nonnegative: the trace of a product of two nonnegative operators is nonnegative.

[F8]

Trace is a linear functional on Mn(F): trace is linear over finite sums and scalar multiples.

Proof

1.1F4givenconstructalgebra

For a realized codebook, set Γm=ΠΠXmΠ and S=∑mΓm. Since each factor is a projection, 0⪯Γm⪯I. Define Λm=S−1/2ΓmS−1/2 on supp⁡S and zero on its kernel; add Λ0=I−∑mΛm. By [F4], all Λm are nonnegative and ∑mΛm is the support projection of S, so (Λ0,Λ1,…,ΛM) is a POVM.

1.2F1F6F7F8givenalgebra

For j≠m, independence of Xj and Xm gives E tr⁡(ΓjσXm)=tr⁡(Π E[ΠXj] Π σˉ)=tr⁡((Π E[ΠXj] Π)(ΠσˉΠ))≤D−1tr⁡(Π E[ΠXj] Π)≤d/D. The first equality factors the finite independent expectation into the product of its two means and distributes the finite trace sum using [F8]; the second uses [F7] and the support of the first factor. For the first inequality, D−1Π−ΠσˉΠ is nonnegative, so [F6] applied to its product with the nonnegative first factor gives the trace bound. For the last inequality, I−Π is nonnegative and [F6]–[F7] give tr⁡(ΠΠxΠ)=tr⁡(ΠxΠ)≤tr⁡(Πx)≤d.

2.1F1F2F3F5F6F7F8step 1.1algebra

For the transmitted codeword Xm, [F3] applied with S0=Γm and T0=∑j≠mΓj gives the operator inequality I−Λm⪯2(I−Γm)+4∑j≠mΓj. Since σXm is nonnegative by [F1], [F6] applied to its product with the nonnegative difference of the right and left sides preserves the order after taking trace, and trace linearity [F8] expands the resulting right side to tr⁡((I−Λm)σXm)≤2tr⁡((I−Γm)σXm)+4∑j≠mtr⁡(ΓjσXm). The gentle bound [F2] for the global projection gives ∥ΠσXmΠ−σXm∥1≤2u. Since ∥ΠXm∥≤1, trace-norm duality [F5], cyclicity [F7], and Γm=ΠΠXmΠ then give tr⁡(ΓmσXm)=tr⁡(ΠXmΠσXmΠ)≥tr⁡(ΠXmσXm)−2u≥1−u−2u.

3.1step 2.1step 1.2algebrachoose∎

Average step 2.1 over all messages and codebooks. Its first term is at most 2(u+2u) by the acceptance estimate there, and each of the M−1 competing terms is at most 4d/D by step 1.2. Thus the expected average error has the claimed bound. Because the codebook sample space is finite, at least one realization has error no greater than its expectation.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Compression dimension bounds entanglement fidelity

Statement

Let ρ⊗n have decreasing eigenvalues λ1(n)≥λ2(n)≥⋯≥0, padded by zeros, and let an (n,M) compression code have intermediate dimension M as in Finite IID quantum source and compression code. Then

Fe(n)≤∑j=1Mλj(n).

Facts & Assumptions

Given: A finite-dimensional density operator ρ, a purification of ρ⊗n, and encoder and decoder channels factoring through a code space of dimension M.

[F1]

Finite IID quantum source and compression code: the squared entanglement fidelity is the overlap of the purified source with the recovered joint state, and the encoder and decoder are quantum channels.

[F2]

Kraus and Choi characterizations of complete positivity: every finite-dimensional completely positive map has a finite Kraus representation.

[F3]

Trace preservation is Kraus normalization: a trace-preserving Kraus family satisfies ∑jKj∗Kj=I.

[F4]

Schmidt decomposition: a finite bipartite vector has an expansion ∑jsj∣rj⟩∣aj⟩ with sj>0, both factor families orthonormal, and squared norm ∑jsj2.

[F7]

Partial trace over a finite tensor factor: partial trace contracts the repeated factor index in an orthonormal product basis. The trace-pairing identity and basis independence are given by The partial trace is characterized by the trace pairing and is basis-independent.

Proof

1.1F1F2F3algebraconstruct

Choose Kraus families (Ea) and (Db) for the encoder and decoder from [F2]. The composite channel has Kraus operators Kba=DbEa, each of rank at most M because it factors through the M-dimensional code space. By [F3], ∑a,bKba∗Kba=∑aEa∗(∑bDb∗Db)Ea=∑aEa∗Ea=I.

1.2F1F4F5F7algebraconstruct

By [F4], write ∣ϕ⟩=∑j=1rsj∣rj⟩∣aj⟩, ordering the sj decreasingly. Expanding ∣ϕ⟩⟨ϕ∣ and contracting either orthonormal factor family by [F7] gives ρR:=Tr⁡A⊗n(∣ϕ⟩⟨ϕ∣)=∑j=1rsj2∣rj⟩⟨rj∣,ρ⊗n=∑j=1rsj2∣aj⟩⟨aj∣. Indeed each cross term with indices j,k contracts with coefficient ⟨ak∣aj⟩=δjk, or ⟨rk∣rj⟩=δjk, respectively. Thus both reduced operators have exactly the positive eigenvalues sj2, with any remaining eigenvalues zero. Complete (rj)j=1r by an orthonormal basis of ker⁡ρR, available from [F5] applied to the zero operator there. On this full reference basis, ρR has eigenvalues λj(n), with the Statement's zero padding; in particular ∑jλj(n)=∑j=1rsj2=1.

2.1F4F6F7step 1.1step 1.2algebra

For each K=Kba let ∣ηK⟩=(IR⊗K)∣ϕ⟩, and let PK be the projection onto its reference-side Schmidt support (zero if ηK=0). Since ∣ηK⟩∈HR⊗ran⁡K, apply [F4] on these two factors: there are at most dim⁡ran⁡K≤M orthonormal second-factor vectors. Thus rank⁡PK≤M and (PK⊗I)∣ηK⟩=∣ηK⟩. Cauchy–Schwarz and the trace-pairing identity in [F7] give ∣⟨ϕ∣ηK⟩∣2≤⟨ϕ∣(PK⊗I)∣ϕ⟩ ∥ηK∥2=tr⁡(ρRPK)∥ηK∥2.

3.1F5step 1.2step 2.1algebracases

Put qj=⟨rj,PKrj⟩. Then 0≤qj≤1, and the full reference basis from step 1.2 gives ∑jqj=tr⁡(PK)=rank⁡PK≤M. If M≥dim⁡HR, then tr⁡(ρRPK)≤1=∑j≤Mλj(n), since the source has at most dim⁡HR positive eigenvalues. Otherwise, ordering the eigenvalues gives tr⁡(ρRPK)=∑jλj(n)qj≤∑j≤Mλj(n)qj+λM(n)(M−∑j≤Mqj)≤∑j≤Mλj(n). Thus the overlap in step 2.1 is bounded by (∑j≤Mλj(n))∥ηK∥2.

4.1F1F3step 1.1step 3.1algebra∎

Expanding the recovered state in the composite Kraus family from step 1.1 gives Fe(n)=∑a,b∣⟨ϕ∣ηKba⟩∣2. By step 3.1 this is at most (∑j≤Mλj(n))∑a,b∥ηKba∥2. Step 1.1 gives ∑a,b∥ηKba∥2=⟨ϕ∣IR⊗(∑a,bKba∗Kba)∣ϕ⟩=∥ϕ∥2=1, proving the bound.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Finite-input memoryless cq channel

Definition

Let X be a finite nonempty input alphabet and let HB be a nonzero finite-dimensional complex inner-product space. A finite-input cq channel is a map x↦ρx assigning a density operator (Density operator) ρx on HB to each x∈X. Its n-use memoryless extension sends a word xn=(x1,…,xn) to the product state ρxn:=ρx1⊗⋯⊗ρxnon HB⊗n. For an input probability vector p, write ρˉp=∑xpxρx and χp=S(ρˉp)−∑x:px>0pxS(ρx); this is the Holevo information of the ensemble in Finite classical-quantum states and Holevo information, in nats.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite cq block codes, average error, and capacity

Definition

Fix a finite-input cq channel as in Finite-input memoryless cq channel. For integers n,M≥1, an (n,M) cq block code consists of a deterministic encoder m↦xn(m)∈Xn for m∈[M]:={1,…,M} and a finite POVM (Finite POVMs and their outcome law) (Λm)m∈[M] on HB⊗n. Under a uniform message, its average block error is en:=1M∑m=1M(1−tr⁡(Λmρxn(m))). Its rate is n−1ln⁡M nats per channel use, using the natural-log unit convention of Finite-dimensional von Neumann entropy. A sequence of such codes is reliable if en→0. The classical capacity Ccq is the supremum of lim inf⁡n→∞n−1ln⁡Mn over reliable sequences.

For each transmitted state, the POVM outcome weights sum to one by POVM outcome weights are probabilities, so en is the uniform-message block error probability.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Typical-projector bounds for finite quantum sources and cq ensembles

Statement

All logarithms are natural. First, for every density operator ρ on a nonzero finite-dimensional space and every δ>0, there are spectral projectors Πn for ρ⊗n such that, as n→∞, tr⁡(Πnρ⊗n)→1,rank⁡Πn≤en(S(ρ)+δ),Πnρ⊗nΠn⪯e−n(S(ρ)−δ)Πn.

Second, let X be a finite nonempty set, let (px)x∈X be a probability vector, and let σx be density operators on a nonzero finite-dimensional output space. Put σˉ=∑xpxσx and H(B∣X)=∑x:px>0pxS(σx). For every δ>0, there are sets Tn⊆Xn with p⊗n(Tn)→1, global spectral projectors Πn for σˉ⊗n, and conditional spectral projectors Πxn for ⨂iσxi, such that one sequence un→0 satisfies, for every sufficiently large n and every xn∈Tn, tr⁡(Πnσˉ⊗n)→1,tr⁡(Πn⨂iσxi)≥1−un,tr⁡(Πxn⨂iσxi)≥1−un, rank⁡Πn≤en(S(σˉ)+δ),Πnσˉ⊗nΠn⪯e−n(S(σˉ)−δ)Πn, rank⁡Πxn≤en(H(B∣X)+δ),Πxn(⨂iσxi)Πxn⪯e−n(H(B∣X)−δ)Πxn. Zero eigenvalues are omitted from surprisal sums. No identical-distribution assumption is made for the conditional eigenbasis measurements.

Facts & Assumptions

Given: The finite states, ensemble, and δ>0 from the Statement.

[F1]

Finite-alphabet IID information AEP with a variance bound: for a finite IID law, the average surprisal converges in probability to its entropy, with an explicit variance-over-n tail bound.

[F2]

Finite-dimensional von Neumann entropy: S(ρ)=−∑λj>0λjln⁡λj, with zero terms set to zero and units nats.

[F3]

Finite classical-quantum states and Holevo information: σˉ=∑xpxσx is the finite ensemble average state.

[F4]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: each finite-dimensional density operator has an orthonormal eigenbasis with nonnegative eigenvalues.

[F6]

Chebyshev's inequality on a finite probability space and Variance, standard deviation, and covariance on a finite probability space: a finite random variable satisfies P(∣Z−EZ∣≥t)≤Var⁡(Z)/t2, and variance is the expected squared centered value.

[F8]

Trace is a linear functional on Mn(F): trace is linear over finite sums and scalar multiples.

[F9]

Basic identities for a probability measure: the probability of a finite union is at most the sum of its event probabilities.

[F10]

Density operator: every σx and σˉ is nonnegative with trace one.

Proof

1.1F1F2F4F7givenconstructalgebra

Diagonalize ρ=∑j:λj>0λj∣j⟩⟨j∣ by [F4], and sample J with law P(J=j)=λj. The surprisal −ln⁡λJ is a finite-alphabet random variable of mean S(ρ) by [F2]. For a product eigenvector with coordinates j1,…,jn, its eigenvalue is ∏iλji and its surprisal is −ln⁡(∏iλji)=∑i−ln⁡λji by [F7]. Let Πn project onto product eigenvectors whose total surprisal lies in [n(S(ρ)−δ),n(S(ρ)+δ)]. The probability of this set tends to one by [F1]. Every selected product eigenvalue is at most e−n(S(ρ)−δ) and at least e−n(S(ρ)+δ); the first bound gives the operator inequality, and the second together with total mass at most one gives the rank bound.

1.2F3F4F5F6F8F9F10givenchoose

For an input word xn, let Nx count its occurrences of x. Define Tn by Nx=0 when px=0 and ∣Nx/n−px∣≤κ for every px>0. The coordinate indicators are independent under p⊗n and have variance at most 1/4; [F6]–[F9] give p⊗n(Tnc)≤∣X∣/(4nκ2)→0. For each x with px>0, σˉ⪰pxσx by [F3] and [F10]; a vector in ker⁡σˉ therefore has zero quadratic form for σx, so [F5] gives supp⁡σx⊆supp⁡σˉ. The spectral logarithm on the latter positive support is bounded in finite dimension by [F4], making μx:=tr⁡(σx[−ln⁡σˉ]) finite for every such x. Define this family only for px>0; the zero-probability symbols never occur in Tn. Choose κ>0 small enough that the empirical averages of each of the two finite families S(σx) and μx, restricted to px>0, differ from their p-averages by at most δ/2 on Tn. These choices are possible because both restricted families are finite and their entries are finite.

2.1F2F4F6F7step 1.1step 1.2constructalgebra

For each x, diagonalize σx and, conditional on a fixed xn∈Tn, measure each tensor factor in its chosen eigenbasis. The resulting surprisal variables Zi=−ln⁡λJi∣xi are independent, finite, and uniformly bounded over the finite family of positive eigenvalues. By [F7], the product eigenvalue surprisal is their sum. Their means sum to ∑iS(σxi), which is within nδ/2 of nH(B∣X) by step 1.2. Their sum has variance at most nL2 for a fixed finite bound L; independence makes cross-covariances zero. Chebyshev [F6] shows that the probability of leaving the window [n(H(B∣X)−δ),n(H(B∣X)+δ)] tends to zero uniformly over xn∈Tn. Project onto the product eigenvectors whose surprisal lies in this window. Each selected eigenvalue is at most e−n(H(B∣X)−δ) and at least e−n(H(B∣X)+δ), proving conditional acceptance, the operator bound, and the rank bound as in step 1.1.

2.2F2F3F4F5F8F10step 1.2algebra

By [F10], σˉ is a state and σˉ−pxσx=∑z≠xpzσz⪰0. Any v∈ker⁡σˉ has ⟨σxv,v⟩=0 when px>0, so [F5] gives σxv=0. Hence supp⁡σx⊆supp⁡σˉ. On that support, the variable −ln⁡λJ obtained by measuring σx in an eigenbasis of σˉ is finite and uniformly bounded over x with px>0 and positive eigenvalue index. Its mean is μx. The p-average of these means is tr⁡(σˉ[−ln⁡σˉ])=S(σˉ) by [F2], [F3], and [F8].

3.1F2F4F6F7step 1.1step 1.2step 2.2constructalgebra

For fixed xn∈Tn, measuring the product state ⨂iσxi in the product eigenbasis of σˉ⊗n gives independent surprisal variables with means μxi and a common finite bound on their absolute values. By [F7], each product eigenvalue surprisal is the sum of the coordinate surprisals. Their means sum to within nδ/2 of nS(σˉ) by step 1.2, and their sum has variance at most nL′2 for a finite L′. Chebyshev [F6] therefore bounds uniformly by a quantity tending to zero the probability of leaving the δ-window around nS(σˉ). The spectral projector of σˉ⊗n for that window accepts every such conditional product state with probability at least 1−un. Its rank and compressed-operator bounds follow from its eigenvalue window exactly as in step 1.1.

4.1step 1.1step 2.1step 3.1algebra∎

Take un to be the maximum of the uniform failure bounds in steps 2.1 and 3.1; both tend to zero, so un→0. The global state acceptance follows from step 1.1 applied to σˉ; all conditional and operator/rank assertions are those proved in steps 2.1 and 3.1. The constructions use only finite spectra, finite sums, and finite probability spaces, so no choice axiom is invoked.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Finite-dimensional Schumacher quantum source coding theorem

Statement

Let ρ be a density operator on a nonzero finite-dimensional source space, and use the squared entanglement-fidelity code model of Finite IID quantum source and compression code. Write S(ρ) in nats.

  1. For every R>S(ρ) there is a sequence of compression codes with Fe(n)→1 and lim sup⁡nn−1ln⁡Mn≤R.
  2. If a sequence of codes satisfies lim sup⁡nn−1ln⁡Mn<S(ρ), then Fe(n)→0.

Thus the asymptotic reliable compression rate is exactly S(ρ) nats per source letter, or S(ρ)/ln⁡2 qubits per source letter.

Facts & Assumptions

Given: A nonzero finite-dimensional source space, a density operator ρ, and the compression-code convention of the Statement.

[F1]

Finite IID quantum source and compression code: an (n,M) code factors through an M-dimensional code space, and its squared entanglement fidelity is the overlap of a purification with the recovered state.

[F2]

Typical-projector bounds for finite quantum sources and cq ensembles: the spectral typical projector for ρ⊗n has mass tending to one, rank at most en(S(ρ)+δ), and every included eigenvalue is at most e−n(S(ρ)−δ).

[F3]

Compression dimension bounds entanglement fidelity: any code factoring through dimension M has entanglement fidelity at most the sum of the M largest eigenvalues of ρ⊗n.

[F4]

Finite-dimensional quantum channel: a quantum channel is completely positive and trace preserving.

[F5]

Kraus and Choi characterizations of complete positivity and Trace preservation is Kraus normalization: finite channels have finite Kraus families, and a trace-preserving family satisfies ∑jKj∗Kj=I.

Proof

1.1F1F2F4F5F6givenconstruct

Fix δ>0, choose an ordered eigenbasis of ρ once, and take the spectral typical projector Πn from [F2]. Order its finitely many product eigenvectors lexicographically; the resulting map to the first rn standard code basis vectors defines a partial isometry Wn with Wn∗Wn=Πn, where rn=rank⁡Πn. Let the code space have dimension Mn=rn+1 and let ∣⊥⟩ be its extra flag, orthogonal to Pn:=WnWn∗. Define En(X)=WnXWn∗+tr⁡((I−Πn)X)∣⊥⟩⟨⊥∣,Dn(Y)=Wn∗YWn+⟨⊥∣Y∣⊥⟩ ρ⊗n. The encoder Kraus family consists of Wn and ∣⊥⟩⟨ej∣ over an orthonormal basis of ker⁡Πn; its Kraus squares sum to Πn+(I−Πn)=I. The decoder Kraus family consists of Wn∗ and λj∣fj⟩⟨⊥∣ from a spectral decomposition ρ⊗n=∑jλj∣fj⟩⟨fj∣; its Kraus squares sum to Pn+∣⊥⟩⟨⊥∣=I. Thus both maps are channels by [F4]–[F6]. If (Kℓ)ℓ is the finite composite Kraus family, substituting its action into [F1] gives Fe(n)=∑ℓ∣⟨ϕ∣(id⁡R⊗Kℓ)∣ϕ⟩∣2. The branch K0=Wn∗Wn=Πn contributes ∣⟨ϕ∣(id⁡R⊗Πn)∣ϕ⟩∣2=(tr⁡(ρ⊗nΠn))2, and every other branch contributes a nonnegative squared modulus. Therefore Fe(n)≥(tr⁡(ρ⊗nΠn))2→1. The basis order makes the sequence of codes explicit and uses no choice axiom.

1.2F2givenalgebrachoose

Suppose lim sup⁡nn−1ln⁡Mn<S(ρ). Choose δ>0 and N so that Mn≤en(S(ρ)−2δ) for n≥N. Let Πn be the typical projector from [F2], and let ϵn=1−tr⁡(ρ⊗nΠn)→0. Each eigenvalue in its range is at most e−n(S(ρ)−δ). Therefore the sum of any Mn eigenvalues of ρ⊗n is at most ϵn+Mne−n(S(ρ)−δ)≤ϵn+e−nδ→0: the part outside the typical range contributes at most its total mass, and each selected eigenvalue inside contributes at most the displayed maximum.

2.1F2step 1.1algebrachoose

Since rn≤en(S(ρ)+δ) and en(S+δ)≥1, Mn=rn+1≤2en(S(ρ)+δ). Hence lim sup⁡nn−1ln⁡Mn≤S(ρ)+δ. Given R>S(ρ), choose δ<R−S(ρ) to obtain the direct assertion.

3.1F1F3step 1.2∎

Apply [F3] to each n-block code with intermediate dimension Mn. Step 1.2 shows that its fidelity is at most a quantity tending to zero, hence Fe(n)→0. The argument includes zero eigenvalues and requires no full-rank source assumption.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels

Statement

Let x↦ρx be a finite-input, finite-output memoryless cq channel as in Finite-input memoryless cq channel. With the average-error code convention of Finite cq block codes, average error, and capacity, its classical capacity in nats per use is Ccq=max⁡p∈Δ(X)χp,χp:=S ⁣(∑xpxρx)−∑x:px>0pxS(ρx). For every 0≤R<Ccq a sequence of codes with rate tending to R has average error tending to zero, and every reliable sequence has limiting upper rate at most Ccq. This theorem concerns a fixed finite classical input alphabet and does not assert a single-letter formula for general quantum-input channels.

Facts & Assumptions

Given: A finite nonempty alphabet X, nonzero finite-dimensional output space HB, and one density operator ρx for each input symbol.

[F1]

Finite cq block codes, average error, and capacity: codes use a uniform finite message, deterministic input words, a finite decoding POVM, average block error, and rate n−1ln⁡M nats/use.

[F2]

Finite classical-quantum states and Holevo information: χ({px,σx})=S(∑xpxσx)−∑px>0pxS(σx).

[F3]

The finite Holevo measurement bound: for any finite ensemble of states and any finite POVM, the classical mutual information of the input and the measurement outcome is at most the ensemble Holevo information.

[F4]

Typical-projector bounds for finite quantum sources and cq ensembles: for a finite ensemble, a high-probability input typical set has conditional and global output projectors with exponentially controlled rank and operator bounds, and uniform acceptance error tending to zero.

[F5]

Finite square-root measurement packing bound for cq states: projectors satisfying those four bounds give expected average decoding error at most 2(u+2u)+4(M−1)d/D.

[F6]

Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state, S(AB)+S(BC)≥S(B)+S(ABC).

[F7]

Continuity of finite-dimensional quantum entropy: entropy is continuous in operator norm on finite-dimensional state spaces, including at zero eigenvalues.

[F8]

Finite-alphabet Fano inequality: for a finite message M estimated from a finite observation with error probability e, H(M∣M^)≤ln⁡2+eln⁡∣M∣.

[F9]

Finite entropy and mutual-information chain rules: for finite variables, I(M;M^)=H(M)−H(M∣M^).

[F10]

Partial trace over a finite tensor factor and The partial trace is characterized by the trace pairing and is basis-independent: tracing tensor factors gives the usual marginals, is linear, and is independent of the chosen orthonormal basis.

[F11]

Ordered tensor registers, their inner product, and wire permutations: the product basis is ordered factorwise and product operators act on their corresponding tensor factors.

[F13]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is additive on finite products of positive numbers.

[F15]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum of ∥Av∥ over unit vectors v.

[F16]

Density operator: each output state is nonnegative and has trace one.

[F17]

The partial trace is characterized by the trace pairing and is basis-independent and Trace is a linear functional on Mn(F): product-state marginals and finite mixture marginals are computed by partial trace and finite linearity.

Proof

1.1F2F7F12F14F15F16givenalgebra

Write χ∗=sup⁡p∈Δ(X)χp. The simplex is nonempty, closed, and bounded. For each state ρx, [F12] diagonalizes it with nonnegative eigenvalues summing to one by [F16], so its action on a unit vector has norm at most one and [F15] gives ∥ρx∥≤1. Therefore ∥ρˉp−ρˉq∥≤∑x∣px−qx∣. Fix an orthonormal basis identifying HB unitarily with Cdim⁡HB; this preserves spectra and operator norm, so [F7] applies. Thus the first entropy term in χp is continuous in p; the second is a finite linear sum. Thus [F14] shows the supremum is attained, so χ∗=max⁡pχp. A point-mass input law gives χp=0 by [F2], hence χ∗≥0.

1.2F4F12givenalgebrachoose

Fix p and 0<R<χp. Choose δ>0 with R<χp−2δ. Let Tn be the input typical set from [F4], with excluded probability ηn→0. Since ηn→0, p⊗n(Tn)=1−ηn>0 for all sufficiently large n; for each earlier blocklength choose a fixed x0∈X and use the one-message code with word x0n and decoding POVM {I}. Draw each large-n codeword independently from p⊗n conditioned on Tn. Its mean output state is σˉn′=E[ρXn∣Xn∈Tn]⪯(1−ηn)−1ρˉp⊗n,ρˉp=∑xpxρx. The global typical projector from [F4] therefore obeys Πnσˉn′Πn⪯(1−ηn)−1e−n(S(ρˉp)−δ)Πn. Each conditional projector has acceptance at least 1−un, rank at most en(H(B∣X)+δ), and the global projector accepts every conditioned codeword with at least 1−un, where un→0 and H(B∣X)=∑xpxS(ρx).

1.3F1F2F3F8F9givenalgebracases

Consider any (n,M) code with M≥2, uniform message J, output states ωm=⨂iρxi(m), decoding outcome J^, and average error e. The Holevo measurement bound [F3] gives I(J;J^)≤χ({1/M,ωm}). Applying Fano [F8] and the finite mutual-information identity [F9], with H(J)=ln⁡M, yields (1−e)ln⁡M≤χ({1/M,ωm})+ln⁡2. For M=1, [F2] gives χ({1,ω1})=S(ω1)−S(ω1)=0, so the inequality is 0≤ln⁡2.

2.1F1F4F5step 1.2algebraconstructchoose

Since ηn→0, choose N large enough that p⊗n(Tn)=1−ηn>0 and ηn≤1/2 for every n≥N. For the finite prefix n<N, set Mn=1 and use the one-message code from step 1.2. For n≥N, set Mn=⌊enR⌋ and apply the packing lemma [F5] to the conditional input law on Tn, with d=en(H(B∣X)+δ) and D−1=(1−ηn)−1e−n(S(ρˉp)−δ). It gives expected average error at most 2(un+2un)+4(Mn−1)(1−ηn)−1e−n(χp−2δ). Since (1−ηn)−1≤2 for n≥N and R<χp−2δ, this tends to zero. Merge the packing POVM's failure effect Λ0 into message 1: put Λ1′=Λ1+Λ0 and Λm′=Λm for 2≤m≤Mn. These Mn effects are positive and sum to I; message 1's success increases by tr⁡(Λ0ρxn(1))≥0, while every other success is unchanged. Thus their average error obeys the same expectation bound, including Mn=1. The codebook space is finite; order X once and choose its lexicographically first codebook whose average error is at most this expectation. This defines a deterministic code for each n≥N without any choice axiom, and the finite one-message prefix does not affect n−1ln⁡Mn→R.

2.2F2F6F10F11F12F13F16F17step 1.1algebra

Let pi(x)=M−1∣{m:xi(m)=x}∣ and ωˉ=M−1∑mωm. By [F17], its ith marginal is ρˉi=∑xpi(x)ρx, which is a state by [F16]. For any bipartite state τAC, tensor it with the unique state on a one-dimensional middle register B=C: the four entropies in [F6] become S(τA),S(τC),0,S(τAC), because tensoring with this factor leaves the spectrum unchanged. Thus [F6] implies S(τAC)≤S(τA)+S(τC); iterating gives S(ωˉ)≤∑iS(ρˉi). Product entropy is additive: diagonalize each ρxi(m) by [F12], so every positive product eigenvalue has logarithm equal to the sum of its coordinate logarithms by [F13]; zero eigenvalues contribute zero by [F2]. Summing these finite terms gives S(ωm)=∑iS(ρxi(m)). Therefore χ({1/M,ωm})=S(ωˉ)−1M∑mS(ωm)≤∑i=1n[S(ρˉi)−∑xpi(x)S(ρx)]=∑iχpi≤nχ∗.

3.1F1step 1.1step 2.1algebracases

The selected codes have average error tending to zero and n−1ln⁡Mn→R. If R=0, the single-message code has zero error. When χ∗>0, taking a maximizing p from step 1.1 proves achievability of every 0≤R<χ∗. When χ∗=0, the single-message code shows that rate zero is reliable.

4.1F1step 3.1step 1.3step 2.2algebra∎

Combining steps 1.3 and 2.2 gives (1−e)ln⁡M≤nχ∗+ln⁡2. For any reliable sequence, divide by n and let n→∞; since en→0, its limiting upper rate is at most χ∗. Together with step 3.1 and the capacity definition [F1], this proves the theorem.

5 · Examples, counterexamples and false statements

None yet.

Sources