Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Exact flat spectral-type reduction of channel information

Statement

Let N:L(A)→L(B) be a finite-dimensional channel, let d=dim⁡A, and let ρ be a state on A. Fix a finite Stinespring dilation of N and its complementary channel. For each integer n≥1 there is an exact decomposition ρ⊗n=∑tptτt into mutually orthogonal flat spectral-type states, with at most (n+1)d positive-weight types and H(T):=−∑t:pt>0ptln⁡pt≤dln⁡(n+1). For the fixed complement and its tensor powers, ∑tptIc(τt,N⊗n)≥nIc(ρ,N)−H(T), ∑tpt[S(τt)+Ic(τt,N⊗n)]≥n[S(ρ)+Ic(ρ,N)]−2H(T). Thus in each inequality some flat type state attains at least the displayed lower bound.

Facts & Assumptions

Given: The channel N:L(A)→L(B), its fixed finite Stinespring dilation and complementary channel, and the state ρ on its input space A. The finite type variable T has probabilities pt and natural-log Shannon entropy H(T)=−∑pt>0ptln⁡pt.

[F1]

Entropy bounds for a finite mixture of states: Entropy bounds for a finite mixture of states.

[F2]

Complementary channels and coherent information: Complementary channels and coherent information.

[F3]

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely.

[F4]

Coherent information equals output entropy minus environment entropy: Ic(σ,M)=S(M(σ))−S(Mc(σ)) for the fixed dilation.

[F6]

Finite distributions, entropy, divergence, and stochastic matrices and Nonnegativity and equality for finite classical relative entropy: H(p)=−∑pi>0piln⁡pi, and D(p∥q)≥0 for finite probability vectors.

Proof

1.1F1F2F3F5F6givenalgebraconstruct

Write ρ=∑j=1dλj∣j⟩⟨j∣, including zero eigenvalues. For each count vector t=(n1,…,nd) with ∑jnj=n, let mt be the number of product basis words of that type, pt=mt∏j:nj>0λjnj (zero if any such λj=0), and omit types with pt=0. Let Pt project onto the span of the words of type t and set τt=Pt/mt. These states are flat, their supports are mutually orthogonal, and ρ⊗n=∑t:pt>0ptτt. There are at most (n+1)d types. If NT is their number and u is the uniform law on them, [F6] gives 0≤D(p∥u)=ln⁡NT−H(T), so H(T)≤dln⁡(n+1). Since S(τt)=ln⁡mt, the logarithm product law [F5] and ∑tptnj=nλj yield ∑tptS(τt)=∑tptln⁡mt=nS(ρ)−H(T).

2.1F1F2F3F4F5givenalgebraconstructstep 1.1

Let Bt=N⊗n(τt) and Et=(Nc)⊗n(τt), with averages Bˉ=∑tptBt=N(ρ)⊗n and Eˉ=∑tptEt=Nc(ρ)⊗n. By [F4], the receiver-minus-environment entropy identity applies to each type. The upper entropy-excess bound [F1] gives ∑tptS(Bt)≥S(Bˉ)−H(T), while its lower entropy-excess bound gives ∑tptS(Et)≤S(Eˉ). Product spectral decompositions and [F5] give S(Bˉ)−S(Eˉ)=n[S(N(ρ))−S(Nc(ρ))]=nIc(ρ,N). Hence ∑tptIc(τt,N⊗n)≥nIc(ρ,N)−H(T). Adding ∑tptS(τt)=nS(ρ)−H(T) from step 1.1 gives the second inequality.

3.1step 2.1givenalgebra∎

Each displayed left side in step 2.1 is an average over the finite positive-probability types, so at least one type attains at least the corresponding average lower bound. These are exact finite-n estimates; no replacement of fixed-dimensional continuity by a uniform bound is involved.

Depends on

Used by

Dependency tree · two levels

37 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