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.

Support-sensitive regularization limit for quantum relative entropy

Statement

For non-negative A,B on a finite-dimensional complex inner-product space,

lim⁡ε↓0D(A+εI∥B+εI)=D(A∥B),

where the right side may be +∞ under the support convention of Finite-dimensional quantum relative entropy.

Facts & Assumptions

Given: The finite-dimensional non-negative operators A,B in the Statement.

[F1]

Finite-dimensional quantum relative entropy: D(A∥B) is finite exactly when supp⁡(A)⊆supp⁡(B), and on that branch it is the difference of the two spectral logarithmic traces.

[F3]

A non-negative operator has a unique non-negative square root: ⟨Av,v⟩=∥A1/2v∥2, so zero quadratic form for a non-negative operator implies it annihilates the vector.

[F4]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is strictly increasing and onto R. For every real M, choose u>0 with ln⁡u<M; then 0<t<u implies ln⁡t<M, so ln⁡t→−∞ as t↓0.

[F5]

The natural logarithm is bounded above by its positive argument minus one: for x≥1, 0≤ln⁡x≤x−1.

Proof

1.1givenF1F2F4F5algebrachoose

First suppose supp⁡(A)⊆supp⁡(B), so ker⁡B⊆ker⁡A. Choose an orthonormal eigenbasis (ej) of B with eigenvalues bj≥0, and put aj:=⟨Aej,ej⟩≥0. If bj=0, then ej∈ker⁡A, so aj=0, and therefore tr⁡(Aln⁡(B+εI))=∑j:bj>0ajln⁡(bj+ε)→tr⁡(Aln⁡B). Also εtr⁡(ln⁡(B+εI))→0: positive bj terms use continuity, while zero bj terms use εln⁡ε→0. The latter follows from [F5]: for 0<t≤1, put u=t−1/2≥1. Then 0≤−tln⁡t=2tln⁡u≤2t(u−1)=2(t−t)→0 by applying the bound to u. The same limit gives tln⁡t→0 at zero, so tr⁡((A+εI)ln⁡(A+εI))→tr⁡(Aln⁡A). Substituting these limits in the definition proves the claim in this support-inclusion case.

2.1givenF1F2F3F4F5step 1.1algebrachoose∎

Now suppose supp⁡(A)⊈supp⁡(B). There is a unit vector e∈ker⁡B∖ker⁡A, so a:=⟨Ae,e⟩>0 by [F3]. Choose an orthonormal eigenbasis of B containing a basis (uk) of ker⁡B. At least one coefficient ⟨Auk,uk⟩ is positive: otherwise [F3] would give Auk=0 for every k, hence Ae=0. Therefore the sum c:=∑k⟨Auk,uk⟩ is positive. In tr⁡(Aln⁡(B+εI)), this coefficient multiplies ln⁡ε→−∞, while terms from positive eigenvalues of B remain bounded. The entropy trace tr⁡((A+εI)ln⁡(A+εI)) has a finite limit as in step 1.1, and the additional εtr⁡(ln⁡(B+εI)) tends to zero by [F4]–[F5]. Therefore the relative entropy tends to +∞, equal to the right side of the Statement.

Depends on

Used by

Dependency tree · two levels

23 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