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.

Trace Distance, Fidelity, and Information Limits — Examples

1 · Prerequisites

2 · Summary

The orthogonal pure qubit states ∣0⟩ and ∣1⟩ have trace distance one, and their computational-basis PVM achieves total variation one. The calculation checks the factor 1/2 in the state-distance convention against a finite measurement that distinguishes the states perfectly.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Trace distance of orthogonal pure states

Example

Let H=C2 with orthonormal computational basis ∣0⟩,∣1⟩, and set ρ=∣0⟩⟨0∣ and σ=∣1⟩⟨1∣. Their trace distance is maximal, and the computational-basis projective measurement distinguishes them with total variation one.

Facts & Assumptions

Given: The two orthogonal computational-basis unit vectors in C2.

[F1]

The rank-one operators associated with orthonormal unit vectors are rank-one orthogonal projections (Pure state and ray, Ray-to-projector is well-defined and bijective).

[F2]

D(ρ,σ)=12∥ρ−σ∥1 (Trace Distance).

[F3]

A PVM with effects Ea has outcome law pa=tr⁡(ρEa) (Finite POVMs and their outcome law).

Verification

1.1givenF1F2

In the basis ∣0⟩,∣1⟩, ρ−σ=diag⁡(1,−1), whose singular values are 1,1. Thus ∥ρ−σ∥1=2 and [F2] gives D(ρ,σ)=1.

2.1givenF1F3step 1.1algebra∎

The computational-basis PVM has effects E0=∣0⟩⟨0∣ and E1=∣1⟩⟨1∣. By [F3], the outcome laws are (1,0) on ρ and (0,1) on σ, with total variation 12(∣1−0∣+∣0−1∣)=1. This equals the trace distance from step 1.1.

Sources