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.

Trace Distance Range And Equality

Statement

For finite-dimensional density operators ρ,σ, 0≤D(ρ,σ)≤1. Moreover, D(ρ,σ)=0 iff ρ=σ, and D(ρ,σ)=1 iff their supports are orthogonal.

Facts & Assumptions

Given: Density operators ρ,σ on a finite-dimensional complex Hilbert space.

[F1]

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

[F2]

Density operators are non-negative with trace one (Density operator). The current QC03 definition is present as a draft; its declared existence supplier is still unresolved.

[L1]

If Δ=ρ−σ is Hermitian with trace zero, then its positive and negative spectral parts have equal trace 12∥Δ∥1 (Hermitian Trace Norm Positive Negative Parts).

[F3]

For nonnegative Y, write supp⁡Y:=(ker⁡Y)⊥. If P is an orthogonal projection and tr⁡(PY)=0, cyclicity gives tr⁡(PY)=tr⁡((PY)∗(PY)), a sum of squared coordinate moduli, so PY=0. The positive spectral decomposition gives ker⁡Y=ker⁡Y, hence range⁡Y=supp⁡Y (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA), A non-negative operator has a unique non-negative square root, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

Proof

1.1givenF1F2L1

Let Δ=ρ−σ=Δ+−Δ−. Since tr⁡Δ=0, [L1] gives tr⁡Δ+=tr⁡Δ−=D≥0, proving the lower bound.

1.2givenF1F2algebra

If supp⁡ρ⊥supp⁡σ, then ρσ=0 and Δ acts as ρ on supp⁡ρ, as −σ on supp⁡σ, and as zero on the orthogonal complement. Hence ∥Δ∥1=tr⁡ρ+tr⁡σ=2 and D=1.

2.1step 1.1F2L1L2

Let P+ project onto the strictly positive eigenspaces of Δ. Then 0≤P+≤I and D=tr⁡(P+Δ)=tr⁡(P+ρ)−tr⁡(P+σ)≤tr⁡(P+ρ)≤1. The first inequality uses tr⁡(P+σ)≥0 by [L2], and the last follows from tr⁡((I−P+)ρ)≥0 by [L2] and tr⁡ρ=1.

2.2F1step 1.1algebra

If D=0, [F1] gives ∥ρ−σ∥1=0, so definiteness of the trace norm gives ρ=σ. Conversely equal states have distance zero by [F1].

3.1step 2.1F2F3∎

Conversely, if D=1, then both inequalities in step 2.1 are equalities: tr⁡(P+ρ)=1 and tr⁡(P+σ)=0. Thus tr⁡((I−P+)ρ)=0 and tr⁡(P+σ)=0. Applying [F3] to each positive operator gives (I−P+)ρ=0 and P+σ=0, so supp⁡ρ⊆ran⁡P+ and supp⁡σ⊆ker⁡P+. These subspaces are orthogonal.

Depends on

Used by

Dependency tree · two levels

31 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