Alphabeta Math
Pipeline-generated
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.

Quantum Relative Entropy, Data Processing, and Strong Subadditivity — Examples

1 · Prerequisites

2 · Summary

The examples compute an exact strict decrease under qubit dephasing, a strict strong-subadditivity instance for a pure GHZ state, and a nonlinear map on a specified family of diagonal qubit states. The counterexample preserves root fidelity and contracts trace distance on that family while making a finite relative entropy infinite; it is explicitly not a quantum channel.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Qubit dephasing decreases quantum relative entropy

Statement

On the qubit space with computational basis ∣0⟩,∣1⟩, define the dephasing channel Δ(X)=∣0⟩⟨0∣X∣0⟩⟨0∣+∣1⟩⟨1∣X∣1⟩⟨1∣. For ∣+⟩=(∣0⟩+∣1⟩)/2 and ρ=∣+⟩⟨+∣, σ=diag⁡(3/4,1/4), one has D(ρ∥σ)=12ln⁡(16/3)>12ln⁡(4/3)=D(Δ(ρ)∥Δ(σ)). For the orthogonal pure states ∣+⟩,∣−⟩=(∣0⟩−∣1⟩)/2, the input relative entropy is +∞, whereas both dephased states equal I/2 and their relative entropy is 0.

Facts & Assumptions

Given: The finite qubit register with ordered orthonormal basis ∣0⟩,∣1⟩ and the operators in the Statement.

[F1]

Finite-dimensional quantum relative entropy: the finite branch is D(A∥B)=tr⁡(Aln⁡A)−tr⁡(Aln⁡B), and support failure gives +∞.

[F2]

Density operator: a state is nonnegative with trace one.

[F3]

Finite registers and their ordered computational bases: ∣0⟩,∣1⟩ is an orthonormal basis of the two-dimensional qubit register.

[F4]

Completely positive maps: complete positivity means every finite ancillary amplification sends positive operators to positive operators.

[F5]

Finite-dimensional quantum channel: a quantum channel is complex-linear, completely positive, and trace-preserving.

[F6]

For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA): for compatible finite-dimensional operators, tr⁡(AB)=tr⁡(BA).

[F7]

The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is the natural logarithm on positive numbers, is strictly increasing, and satisfies the product and quotient laws.

[F8]

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: a positive semidefinite operator is diagonalizable with nonnegative eigenvalues; rank-one orthogonal projections have eigenvalues 0,1.

[F9]

Channel data processing for finite quantum relative entropy: a finite quantum channel does not increase quantum relative entropy, including its support-sensitive extended value.

Diagram convention

The one wire is the qubit operator input/output, and the rectangular box denotes the linear map Δ defined above. This is only a map schematic; the channel and entropy claims are proved by the finite matrix calculations below.

\begin{center} \begin{tikzpicture}[>=stealth, every node/.style={font=\small}] \draw[->] (0,0) -- (1.2,0) node[midway,above] {X}; \node[draw,rounded corners,minimum width=1.5cm,minimum height=.75cm] (deph) at (2,0) {Δ}; \draw[->] (deph.east) -- (3.3,0) node[midway,above] {Δ(X)}; \end{tikzpicture} \end{center}

Proof

1.1givenF3F4F5F6algebra

Put Pj=∣j⟩⟨j∣ for j=0,1. Then Pj=Pj†=Pj2 and P0+P1=I by [F3]. The map Δ(X)=∑jPjXPj is complex-linear. For any finite ancilla dimension r and positive Q on H⊗Cr, its amplification is ∑j(Pj⊗Ir)Q(Pj⊗Ir)†, a sum of positive operators since each summand has quadratic form ⟨Q(Pj⊗Ir)†z,(Pj⊗Ir)†z⟩≥0. Thus [F4] gives complete positivity. Also [F6] gives tr⁡(Δ(X))=∑jtr⁡(PjXPj)=tr⁡(X(P0+P1))=tr⁡(X). Hence Δ is a channel by [F5].

2.1givenF1F2F3F7F8F9step 1.1algebra

The state ρ has eigenvalues 1,0, while σ has eigenvalues 3/4,1/4; both are density operators by direct trace and positivity. Since ρ is the rank-one projection onto ∣+⟩, tr⁡(ρln⁡ρ)=0 under 0ln⁡0=0, and ⟨+∣ln⁡σ∣+⟩=12ln⁡(3/4)+12ln⁡(1/4). Therefore [F1] gives D(ρ∥σ)=12ln⁡(16/3). Dephasing gives Δ(ρ)=I/2 and Δ(σ)=σ; the diagonal trace formula gives D(I/2∥σ)=12ln⁡((1/2)/(3/4))+12ln⁡((1/2)/(1/4))=12ln⁡(4/3). Since 16/3>4/3, strict monotonicity of the logarithm in [F7] proves the strict decrease; this explicit calculation is consistent with [F9] applied to the channel in step 1.1.

3.1givenF1F3algebra∎

The supports of ∣+⟩⟨+∣ and ∣−⟩⟨−∣ are distinct one-dimensional subspaces, so the first is not contained in the second and [F1] gives input divergence +∞. Their diagonal entries are both (1/2,1/2), so Δ(∣+⟩⟨+∣)=Δ(∣−⟩⟨−∣)=I/2; consequently the output relative entropy is D(I/2∥I/2)=0 by [F1].

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Strong subadditivity for a pure GHZ tripartite state

Statement

For three qubit registers A,B,C, let ∣GHZ⟩=(∣000⟩+∣111⟩)/2,ρABC=∣GHZ⟩⟨GHZ∣. Each one-register marginal and each two-register marginal has entropy ln⁡2, while S(ρABC)=0. In particular, for the displayed order, S(ρAB)+S(ρBC)=2ln⁡2>ln⁡2=S(ρB)+S(ρABC), so strong subadditivity is strict.

Facts & Assumptions

Given: The three-qubit computational basis and the normalized vector ∣GHZ⟩ in the Statement.

[F1]

Finite-dimensional von Neumann entropy: S(ρ)=−∑λ>0λln⁡λ over the positive eigenvalues.

[F2]

Density operator: a density operator is positive semidefinite and has trace one.

[F3]

Partial trace over a finite tensor factor and Partial trace over the first tensor factor: marginals are obtained by summing the diagonal matrix blocks for the traced-out last or first register.

[F4]

Ordered tensor registers, their inner product, and wire permutations and Finite registers and their ordered computational bases: the three qubit factors are ordered A,B,C and their computational product basis is the corresponding tensor product basis.

[F5]

Schmidt decomposition: a bipartite vector has an expansion ∑jsjuj⊗vj with positive coefficients and orthonormal factor families, and its squared norm is ∑jsj2.

[F6]

Strong subadditivity of finite-dimensional quantum entropy: every finite tripartite state satisfies S(AB)+S(BC)≥S(B)+S(ABC).

[F7]
[F9]

Finite wire permutations are unitary basis permutations: permuting tensor wires is a unitary basis permutation, preserving the spectrum under conjugation.

Diagram convention

The central node denotes the state-preparation map C→HA⊗HB⊗HC taking 1 to ∣GHZ⟩; the three outgoing legs are its ordered tensor factors. They describe one joint state, not a product of three states. No proof step relies on this diagram.

\begin{center} \begin{tikzpicture}[>=stealth, every node/.style={font=\small}] \node[draw,rounded corners,minimum width=1.8cm,minimum height=.8cm] (state) at (0,0) {∣GHZ⟩}; \draw[->] (state.north west) -- (-1.1,1) node[above] {A}; \draw[->] (state.north) -- (0,1) node[above] {B}; \draw[->] (state.north east) -- (1.1,1) node[above] {C}; \end{tikzpicture} \end{center}

Proof

1.1givenF1F2F4F7F8algebra

By [F4], the vectors g=∣GHZ⟩, h=(∣000⟩−∣111⟩)/2, and the six computational basis vectors other than ∣000⟩,∣111⟩ form an orthonormal basis. Direct multiplication by ρABC=gg∗ gives ρABCg=g and zero on the other seven basis vectors. Thus its spectrum is (1,0,…,0); it is non-negative by [F8] and has trace one, so it is a state by [F2]. Consequently S(ρABC)=−1ln⁡1=0 by [F1] and [F7].

1.2givenF3F4F5F9algebra

Expanding ρABC gives the four terms 12∣000⟩⟨000∣, 12∣000⟩⟨111∣, 12∣111⟩⟨000∣, and 12∣111⟩⟨111∣. For any traced register, the first- or last-factor formula [F3], after the wire permutation [F9] when needed, kills both off-diagonal terms because tr⁡(∣0⟩⟨1∣)=tr⁡(∣1⟩⟨0∣)=0; the resulting two-register marginal is 12∣00⟩⟨00∣+12∣11⟩⟨11∣. Tracing out two registers similarly gives I/2 for each one-register marginal. These diagonal matrices have positive eigenvalues 1/2,1/2, with two additional zero eigenvalues for each two-register marginal. Across each one-versus-two split, the displayed vector itself is a Schmidt expansion of the form [F5], with coefficients 1/2,1/2.

2.1F1F6F7step 1.1step 1.2algebra∎

For each reduced state in step 1.2, [F1] gives entropy −2(12ln⁡12)=ln⁡2. Hence the left side of the claimed SSA instance is 2ln⁡2, and the right side is ln⁡2+0. Since 2>1 and ln⁡2>0 by strict monotonicity in [F7], the inequality is strict and equals the stated comparison.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Fidelity and trace-distance inequalities do not imply QRE data processing

Statement

Write ρp=diag⁡(1−p,p) for a diagonal qubit state. Set a=π/12 and Sa={ρsin⁡2θ:a≤θ≤π/4},Ta(ρsin⁡2θ)=ρsin⁡2(θ−a). On this family, Ta preserves root fidelity and contracts trace distance for every pair, but it sends the finite input relative entropy D(ρsin⁡2(π/4)∥ρsin⁡2a) to D(ρsin⁡2(π/4−a)∥ρ0)=+∞. The map is nonlinear and is not the restriction of a quantum channel. Thus metric inequalities on a family under an arbitrary map do not by themselves prove quantum-relative-entropy data processing for channels.

As a separate support check, ∣0⟩⟨0∣ and ∣+⟩⟨+∣ have root fidelity and trace distance both 1/2, while D(∣0⟩⟨0∣∥∣+⟩⟨+∣)=+∞.

Facts & Assumptions

Given: The qubit computational basis and the diagonal states and maps in the Statement.

[F1]

Finite-dimensional quantum relative entropy: D(A∥B) is the natural-log spectral expression under support inclusion and equals +∞ when support inclusion fails.

[F2]

Fidelity: root fidelity is F(ρ,σ)=∥ρσ∥1.

[F3]

Trace Distance: the supplier defines trace distance as D(ρ,σ)=12∥ρ−σ∥1; in this item write dtr(ρ,σ):=D(ρ,σ) to distinguish it from relative entropy D(ρ∥σ).

[F4]

Trace Norm: the trace norm is the sum of the singular values.

[F5]

Density operator: a density operator is nonnegative and has trace one.

[F6]

A non-negative operator has a unique non-negative square root: positive diagonal operators have the diagonal positive square roots obtained by taking square roots of their eigenvalues.

[F7]

The natural logarithm as the inverse of the exponential function and Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is defined on positive reals, is strictly increasing, and obeys the usual logarithm laws.

[F8]

Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on [−π/2,π/2].

[F9]

Quarter-turn values and shifts by pi/2 and pi: sin⁡(π/2)=1 and cos⁡(π/2)=0.

[F10]

The addition formulas for sine and cosine: sine and cosine satisfy their addition formulas, including sin⁡(u−v)=sin⁡ucos⁡v−cos⁡usin⁡v and cos⁡(u−v)=cos⁡ucos⁡v+sin⁡usin⁡v.

[F11]

Parity and the Pythagorean identity for sine and cosine: sin⁡2t+cos⁡2t=1 for every real t.

[F12]

The derivatives of sine and cosine are cosine and minus sine: (sin⁡t)′=cos⁡t and cos⁡′t=−sin⁡t.

[F14]

A function differentiable at c is continuous at c: differentiability of cosine implies continuity at the endpoint limit used below.

[F15]

Pi as twice the smallest positive zero of cosine: π is positive, so the intervals and angles in the Statement have the stated order.

Proof

1.1givenF5F8F11F12F15algebra

For θ∈[a,π/4], ρsin⁡2θ=diag⁡(cos⁡2θ,sin⁡2θ) is nonnegative and has trace one by [F11], so is a state by [F5]. Since a>0 by [F15], [F8] and [F12] make sine positive and strictly increasing on [a,π/4]; squaring preserves strict order there, so the angle parametrization is injective and Ta is well-defined. Its output angle lies in [0,π/4−a], so its output is also a density operator.

1.2givenF8F9F10F11F12F13F14F15algebra

The family Sa is the line segment {ρp:sin⁡2a≤p≤1/2}. If Ta were affine on this segment, interpolation between its endpoint states would make its output's ∣1⟩ diagonal entry affine in p. The same is necessary for the restriction of a quantum channel, by complex-linearity. Thus there would be constants A,B with sin⁡2(θ−a)=A+Bsin⁡2θ for every θ∈[a,π/4]. Differentiating twice on the open interval and using [F10]–[F13] gives cos⁡(2θ−2a)=Bcos⁡(2θ). By [F14], cosine is continuous, so taking θ↑π/4 yields sin⁡(2a)=0, because cos⁡(π/2−2a)=sin⁡(2a) and cos⁡(π/2)=0. But 0<2a=π/6<π/2 by [F15], so [F8]–[F9] give sin⁡(2a)>0, a contradiction. Hence Ta is not affine on the family, and no quantum channel agrees with it there.

2.1givenF2F4F6F10step 1.1algebra

For θ,ϕ∈[a,π/4], the square roots in [F6] are diagonal with entries (cos⁡θ,sin⁡θ) and (cos⁡ϕ,sin⁡ϕ). Their product is positive diagonal, so by [F2] and [F4], F(ρsin⁡2θ,ρsin⁡2ϕ)=cos⁡θcos⁡ϕ+sin⁡θsin⁡ϕ=cos⁡(θ−ϕ). The cosine addition formula [F10] justifies the last equality. Applying Ta subtracts a from both angles, leaving their difference unchanged; root fidelity is therefore preserved for every pair.

2.2givenF3F4F8F9F10F11F12step 1.1algebra

For diagonal qubit states, [F3] and [F4] give dtr(ρp,ρq)=∣p−q∣. Take θ≥ϕ in [a,π/4]. The addition formulas and Pythagorean identity [F10]–[F11] give sin⁡2u−sin⁡2v=sin⁡(u+v)sin⁡(u−v). Therefore sin⁡2θ−sin⁡2ϕ=sin⁡(θ+ϕ)sin⁡(θ−ϕ), sin⁡2(θ−a)−sin⁡2(ϕ−a)=sin⁡(θ+ϕ−2a)sin⁡(θ−ϕ). Here 0≤θ+ϕ−2a≤θ+ϕ≤π/2, so [F8]–[F12] make the first sine factor in the second line no larger than the corresponding nonnegative factor in the first line; the other factor is the same and nonnegative. Thus the output coordinate difference is at most the input difference, proving trace-distance contraction for every pair.

2.3givenF1F7F8F9F12F15step 1.1algebra

Take θ=π/4 and ϕ=a. By strict increase of sine from sin⁡0=0 to sin⁡(π/2)=1 in [F8], [F9], and [F12], every angle strictly between zero and π/2 gives 0<sin⁡2θ<1; thus both input diagonal states have full support and their relative entropy is finite by [F1] and [F7], since the positive spectral entries have finite natural logarithms. The outputs are ρsin⁡2(π/4−a) and ρ0=∣0⟩⟨0∣. Since 0<π/4−a<π/2 by [F15], the first output has full support, while the second has one-dimensional support; support inclusion fails and [F1] gives output divergence +∞.

3.1givenF1F2F3F4F6algebra∎

Independently, the root fidelity of ∣0⟩⟨0∣ and ∣+⟩⟨+∣ is 1/2: the product of their positive square roots is (1/2)∣0⟩⟨+∣, whose only nonzero singular value is 1/2. Their difference is 12(1−1−1−1), whose square is I/2, so both singular values are 1/2 and [F3]–[F4] give trace distance 1/2. The first support is not contained in the second, so [F1] gives infinite relative entropy.

Sources