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

Partial-trace data processing for finite quantum relative entropy

Statement

Let HA,HB be nonzero finite-dimensional complex inner-product spaces, let d=dim⁡HB≥1, and let A,B be non-negative operators on HA⊗HB. Then

D(Tr⁡BA∥Tr⁡BB)≤D(A∥B).

Facts & Assumptions

Given: The spaces and non-negative operators in the Statement.

[F1]

Joint convexity of finite quantum relative entropy: QRE is jointly convex for finite convex mixtures of non-negative operators.

[F2]

Isometric invariance of finite quantum relative entropy: QRE is invariant under simultaneous isometric conjugation.

[F3]

Partial trace over a finite tensor factor: in product bases, (Tr⁡BR)ii′=∑jR(i,j),(i′,j).

[F4]

The partial trace preserves non-negativity and total trace: the partial trace preserves non-negativity and total trace.

[F5]

Ordered tensor registers, their inner product, and wire permutations: ordered product bases and their inner products retain the stated factor order.

[F6]

Finite-dimensional quantum relative entropy: QRE uses support inclusion and the support-restricted spectral logarithms; if inclusion fails its value is +∞.

[F8]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F9]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, so z↦⟨z,es⟩er is linear.

[F10]

Complex de Moivre formula for every integer exponent: for every integer m and real t, (cos⁡t+isin⁡t)m=cos⁡(mt)+isin⁡(mt).

[F12]

exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0: for real t, exp⁡(it)=cos⁡t+isin⁡t and ∣exp⁡(it)∣=1.

[F13]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive x,y, ln⁡(x/y)=ln⁡x−ln⁡y, with ln⁡1=0.

Proof

1.1givenF3F5F8F9F10F11F12constructchoosealgebra

Choose an orthonormal basis (ej)j<d of HB using [F8], and set ω=exp⁡(2πi/d). By [F10] and [F12], ∣ω∣=1 and ωm=exp⁡(2πim/d) for every integer m; by [F11], ωm=1 exactly when d divides m. Thus ω has order d. Define Xej=ej+1 mod d and Zej=ωjej; these maps are unitary because they respectively permute the basis and multiply its vectors by unit-modulus scalars. If d∤m, then q=ωm≠1, qd=1, and (1−q)∑b=0d−1qb=1−qd=0, so d−1∑b=0d−1ωbm=0; if d∣m, that average is 1. Choose an orthonormal basis (ui) of HA by [F8]. For 0≤r,s<d, define the linear block Rrs:HA→HA by Rrsui′=∑i⟨R(ui′⊗es),ui⊗er⟩ui, extending linearly. Expanding R(ui′⊗es) in the product basis [F5] then gives R=∑r,sRrs⊗Mrs, where Mrsz:=⟨z,es⟩er: both sides agree on every product basis vector. Direct application to basis vectors gives ZbMrs(Zb)∗=ωb(r−s)Mrs and XaMrs(Xa)∗=Mr+a,s+a, with indices modulo d. For 0≤r,s<d, d∣(r−s) exactly when r=s, so the proved phase average removes precisely the off-diagonal units. Also d−1∑a=0d−1Mr+a,r+a=IB/d. Therefore T(R):=d−2∑a,b(IA⊗XaZb)R(IA⊗XaZb)∗=∑rRrr⊗IB/d=Tr⁡B(R)⊗IB/d by [F3]. For every a,b, the lifted map IA⊗XaZb sends ui⊗ej to ωbjui⊗ej+a, hence sends an orthonormal product basis to an orthonormal product basis; it is therefore unitary, including d=1. When d=1, X=Z=IB and there is only the diagonal unit, so the same formula holds directly.

1.2givenF6F7F13algebra

For non-negative C,D on HA, their tensor products with IB/d have supports supp⁡(C)⊗HB and supp⁡(D)⊗HB by the tensor-product eigenbases [F7]. Thus support inclusion holds for (C,D) exactly when it holds for (C⊗IB/d,D⊗IB/d). In the finite branch, each positive tensor eigenvalue has the form λ/d, and [F13] gives ln⁡(λ/d)=ln⁡λ−ln⁡d; the two logarithms therefore have the same additive term −ln⁡d, which cancels, while tr⁡(IB/d)=1; hence D(C⊗IB/d∥D⊗IB/d)=D(C∥D). If inclusion fails both sides are +∞ by [F6].

2.1givenF1F2step 1.1algebra

Apply joint convexity [F1] to the finite average defining T and isometric invariance [F2] to each unitary conjugate. This gives D(T(A)∥T(B))≤D(A∥B).

3.1givenF4step 1.1step 1.2step 2.1algebra∎

By [F4], C=Tr⁡BA and D=Tr⁡BB are non-negative. Substitute them into step 1.2, use step 1.1 to identify their twirls, and then apply step 2.1 to obtain D(Tr⁡BA∥Tr⁡BB)≤D(A∥B).

Depends on

Used by

Dependency tree · two levels

69 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