Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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