Alphabeta Math
LemmaStatement: 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.

The two root-fidelity trace expressions agree

Statement

For density operators ρ,σ on a finite-dimensional complex Hilbert space, ∥ρ σ∥1=tr⁡ρ σ ρ.

Facts & Assumptions

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

[F1]

Root fidelity is defined by F(ρ,σ)=∥ρσ∥1 (Fidelity).

[L1]

The finite trace norm is the sum of singular values, including zeros, and SVD supplies orthonormal left and right singular vectors (Trace Norm, Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition). The current QC01 trace-norm definition is present as a draft and uses this finite-map convention.

[F2]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

Proof

1.1givenL1F2algebra

Put A=ρσ. Since A∗=σρ, we have A∗A=σ ρ σ and AA∗=ρ σ ρ. Both are non-negative. By [L1], the eigenvalues of A∗A and AA∗ are the squares of the singular values of A; because A is an endomorphism, the SVD lists the same d singular values on both sides, with zero multiplicity included.

2.1step 1.1F1L1F2∎

The unique non-negative square roots of A∗A and AA∗ therefore have the same eigenvalue list, namely the singular values of A. Their traces both equal the sum of those singular values, which is ∥A∥1 by [L1]. Substituting AA∗=ρ σ ρ proves the stated identity and, by [F1], its equivalent root-fidelity expression.

Depends on

Used by

Dependency tree · two levels

13 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