Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Isometric invariance of finite quantum relative entropy

Statement

Let V:H→K be a linear map between finite-dimensional complex inner-product spaces satisfying V∗V=IH, and let A,B be non-negative on H. Then

D(VAV∗∥VBV∗)=D(A∥B).

Facts & Assumptions

Given: V,A,B as in the Statement.

[F1]

Finite-dimensional quantum relative entropy: support inclusion determines the finite branch of D; its value is computed from spectral logarithms on the supports.

[F2]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V: V∗V=IH implies ⟨Vx,Vy⟩=⟨x,y⟩ for every x,y∈H.

[F4]
[F5]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

Proof

1.1givenF5F2F3algebra

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F5]. Let M=ran⁡V. Since V is an isometry, it maps an orthonormal eigenbasis of A to an orthonormal eigenbasis of VAV∗ on M with the same nonzero eigenvalues; VAV∗ is zero on M⊥. The same holds for B. Consequently supp⁡(VAV∗)=V(supp⁡A) and supp⁡(VBV∗)=V(supp⁡B), so support inclusion holds on one side exactly when it holds on the other.

2.1givenF1F3F4step 1.1casesalgebra∎

On M, spectral calculus gives ln⁡(VAV∗)=V(ln⁡A)V∗ on the positive support of A, with the analogous identity for B; on M⊥ both conjugated operators contribute zero to the support-restricted traces. Thus in the finite branch, cyclicity [F4] gives tr⁡(VAV∗ln⁡(VAV∗))=tr⁡(Aln⁡A) and tr⁡(VAV∗ln⁡(VBV∗))=tr⁡(Aln⁡B). By [F1] their difference is D(A∥B). If support inclusion fails, step 1.1 shows both sides are +∞ by [F1].

Depends on

Used by

Dependency tree · two levels

22 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