Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

57 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources