Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Entanglement-assisted capacity of a noiseless qubit

Example

For the identity channel on a qubit, the entanglement-assisted classical capacity is 2ln⁡2 nats per use, or two classical bits per transmitted qubit. A shared Bell pair and the four-message dense-coding protocol attain the value.

Facts & Assumptions

Given: The noiseless identity channel id⁡C2 and prior shared entanglement.

[F1]

Additive entanglement-assisted classical capacity formula: CE(N)=max⁡ρ[S(ρ)+Ic(ρ,N)].

[F2]

Complementary channels and coherent information: Ic(ρ,N)=S(B)−S(RB) for a purification.

[F3]

The maximally mixed state maximizes finite quantum entropy: for a qubit, S(ρ)≤ln⁡2, with equality at I/2.

[F4]

The Bell vectors: the four Bell vectors form an orthonormal basis of C2⊗C2.

[F5]

Dense-coding correctness and resources: the four Pauli encodings on one half of a shared Bell pair produce the four orthogonal Bell states, which Bob distinguishes with zero error using one transmitted qubit.

Verification

1.1F1F2F3givenalgebra

For any qubit input ρ, the identity channel leaves its purification ψRA pure. Hence S(RB)=0 and S(B)=S(ρ), so [F2] gives Ic(ρ,id⁡)=S(ρ). By [F1] and [F3], CE(id⁡)=max⁡ρ2S(ρ)=2ln⁡2.

2.1F4F5step 1.1algebra∎

For a maximally entangled Bell pair, Alice's four Pauli choices produce the four orthogonal Bell states by [F4]–[F5]. Bob's Bell-basis measurement identifies the message without error, so four messages are sent per channel use and the rate is ln⁡4=2ln⁡2. This attains the capacity computed in step 1.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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