Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Single-letter quantum and private capacities of degradable channels

Statement

Let N:A→B be a finite-dimensional degradable channel with a fixed complement Nc. Then

Q(N)=P(N)=max⁡ρ∈D(A)Ic(ρ,N),

and both regularizations in the quantum and private capacity formulas collapse to this one-use maximum.

Facts & Assumptions

Given: The finite-dimensional degradable channel and chosen complement in the Statement.

[F1]

Degradable and antidegradable channels: a degrading channel D:B→E satisfies Nc=D∘N.

[F2]

Coherent-information concavity and subadditivity for degradable channels: for a degradable channel, coherent information is concave and nonnegative; for product degradable channels it is subadditive on joint inputs and its optimized value is additive.

[F3]

Finite channel information maxima are attained: the finite-dimensional coherent information maximum is attained.

[F4]

Regularized coherent-information formula for quantum capacity and Regularized private-information formula for quantum channel capacity: the general capacities equal their regularized coherent-information and private-information sequences, respectively.

[F5]

Private information is an average coherent-information difference: for an ensemble {px,ρx}, Ip=Ic(ρˉ,N)−∑xpxIc(ρx,N).

Proof

1.1F1F2F3F4givenalgebra

The tensor power of a degradable channel is degradable: the product degrading map D⊗n is a channel by Finite-dimensional channels compose and tensor, and it maps (N⊗n)(ρ) to (Nc)⊗n(ρ). Therefore [F2] gives sup⁡ρIc(ρ,N⊗n)=nmax⁡ρIc(ρ,N). Substituting in the regularized quantum formula [F4] yields Q(N)=max⁡ρIc(ρ,N).

2.1F2F5step 1.1algebra

For any n-use input ensemble {px,ρx}, its tensor-power channel is degradable by step 1.1. By [F5], its private information is the coherent information of the average minus the average branch coherent information. Each branch term is nonnegative by [F2], so this private information is at most Ic(ρˉ,N⊗n)≤nmax⁡ρIc(ρ,N). Hence the n-use private-information supremum has the same upper bound.

3.1F2F3F4F5F6step 2.1algebraconstruct

Choose a maximizing state ρ∗ using [F3], and decompose it spectrally as ρ∗=∑jpj∣uj⟩⟨uj∣ using [F6]. For a pure input ∣uj⟩⟨uj∣, choose a one-dimensional purification reference; the joint output-reference state has the same nonzero eigenvalues as N(∣uj⟩⟨uj∣), so the defining formula in Complementary channels and coherent information gives Ic(∣uj⟩⟨uj∣,N)=0. Therefore the pure-state ensemble has private information Ic(ρ∗,N) by [F5]. Thus p1≥max⁡ρIc(ρ,N); step 2.1 with n=1 gives the reverse inequality, and step 2.1 for all n gives pn/n≤max⁡ρIc(ρ,N). The regularized formula [F4] therefore yields P(N)=max⁡ρIc(ρ,N).

4.1step 1.1step 3.1algebra∎

The identities in steps 1.1 and 3.1 prove the stated equality and remove both regularizations.

Depends on

Used by

Dependency tree · two levels

71 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