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

Register endianness and a two-qubit partial trace

Example

Take two qubit factors with ordered bases (e0,e1), and order the product basis lexicographically as (e0⊗e0,e0⊗e1,e1⊗e0,e1⊗e1). Let ∣Φ+⟩=(∣00⟩+∣11⟩)/2 and R=∣Φ+⟩⟨Φ+∣. Its matrix in this basis is R=12(1001000000001001). The big-endian index of 101 is 5, and tracing out the second factor gives diag⁡(1/2,1/2), whose trace is 1.

Facts & Assumptions

Given: The big-endian encoding, the ordered product basis, the Bell vector ∣Φ+⟩, its outer-product operator R, and the coordinate definition of partial trace.

[F1]

enc⁡n(x)=∑k<nxk2n−1−k, with the first bit most significant (Big-endian encoding of ordered bit strings).

[F2]

The encoding is a bijection to the slots {0,…,2n−1} (Big-endian bit-string indices are bijective).

[F3]

The one-qubit computational basis is orthonormal and the two-factor product basis uses the stated factor order (The computational basis is orthonormal, The product basis is orthonormal and tensor dimensions multiply).

[F4]

A ket is its vector and the outer product acts by ∣x⟩⟨y∣z=⟨z,y⟩rootx (Dirac Notation Conversion).

[F5]

In orthonormal coordinates, the matrix of ∣x⟩⟨y∣ is [x][y]† (Dirac Notation Coordinate Identity).

[F6]

In the ordered product basis, (Tr⁡BR)aa′=∑b<2R(a,b),(a′,b) (Partial trace over a finite tensor factor).

[F7]

This coordinate contraction is the unique trace-characterized partial trace and is independent of the orthonormal basis of the second factor (The partial trace is characterized by the trace pairing and is basis-independent).

Verification

1.1givenF1F2algebra

By [F1], enc⁡3(1,0,1)=1⋅22+0⋅21+1⋅20=5. By [F2], 5 is one of the eight three-bit register slots.

1.2givenF3algebra

In the ordered product basis, ∣Φ+⟩ has coordinate column v=(1,0,0,1)T/2. Orthonormality [F3] gives ⟨Φ+,Φ+⟩=1.

2.1givenF4F5step 1.2algebra

By [F4]–[F5], the coordinate matrix of R is vv†. Its only nonzero entries are 1/2 at (00,00),(00,11),(11,00),(11,11), so it is the displayed matrix.

3.1givenF6step 2.1algebra

By [F6] and this matrix, (Tr⁡BR)00=R00,00+R01,01=1/2 and (Tr⁡BR)01=R00,10+R01,11=0.

4.1givenF6step 2.1step 3.1algebra

The other entries are (Tr⁡BR)10=R10,00+R11,01=0 and (Tr⁡BR)11=R10,10+R11,11=1/2. Hence Tr⁡BR=diag⁡(1/2,1/2).

5.1step 4.1F7F8algebra∎

By [F7], this contraction is the intrinsic partial trace, and [F8] gives the output trace 1/2+1/2=1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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