Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Exact Two-Qubit Cartan Decomposition

Statement

For every U∈U(4) there are A,B,C,D∈SU(2), real a,b,c,δ, and the matrices X=(0110),Y=(0−ii0),Z=(100−1) such that U=eiδ(A⊗B)exp⁡ ⁣(i(aX⊗X+bY⊗Y+cZ⊗Z))(C⊗D). The equality is exact; the scalar eiδ is displayed.

Facts & Assumptions

Given: U is a 4×4 unitary, and the Pauli matrices and magic-basis vectors below are in the stated order.

[F1]

One-Qubit Euler Decomposition: every SU(2) unitary is exactly Rz(α)Ry(θ)Rz(β) for real angles in the QC7 convention.

[F2]

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a real self-adjoint operator on a finite-dimensional real inner-product space has an orthonormal eigenbasis.

[F3]

Every nonzero complex number has a unique polar form r(cos⁡θ+isin⁡θ) with r>0 and −π<θ≤π: every unit complex number is eit for some real t, and every unit complex number has a unit-modulus square root.

[F4]

The Pauli matrices: X=(0110), Y=(0−ii0), and Z=(100−1).

[F5]

For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix: determinant is the alternating permutation sum; conjugating every matrix entry conjugates the value of that sum.

Proof

1.1givenF3F5F6F7choosealgebra

By [F5] and [F7], det⁡(U∗)=det⁡(U‾T)=det⁡(U‾)=det⁡U‾. Then [F6] and U∗U=I give ∣det⁡U∣2=det⁡(U∗U)=1. Choose δ with det⁡U=e4iδ and put W=e−iδU; applying the permutation formula to a scalar multiple of a 4×4 matrix gives det⁡W=e−4iδdet⁡U=1, so W∈SU(4). Use the magic basis e1=(∣00⟩+∣11⟩)/2, e2=i(∣00⟩−∣11⟩)/2, e3=i(∣01⟩+∣10⟩)/2, e4=(∣01⟩−∣10⟩)/2, and let Q have these columns. Direct inner products show each vector has norm one and distinct vectors are orthogonal, so Q is unitary. Then W^=Q∗WQ is unitary with determinant one. The matrix S=W^TW^ is symmetric; since S∗=S‾ and W^ is unitary, S∗S=I, so S is unitary.

2.1step 1.1F2F3F6F7choosealgebra

Direct calculation from the definition of S gives ST=S and S∗S=I. Write S=P+iR with P,R real symmetric. From SS‾=I we obtain P2+R2=I and PR=RP. Apply [F2] first to P. If Pv=λv, then P(Rv)=R(Pv)=λRv, so every eigenspace Eλ of P is invariant under R. The restriction R∣Eλ is self-adjoint for the inherited inner product, since ⟨Ru,v⟩=⟨u,Rv⟩. Apply [F2] separately on each such finite-dimensional eigenspace; the union of these orthonormal eigenbases is an orthonormal common eigenbasis because distinct P eigenspaces are orthogonal. Its columns form a real orthogonal O simultaneously diagonalizing P,R, so OTSO=diag⁡(ζj) with ∣ζj∣=1. If det⁡O=−1, change the sign of one column; the diagonalization is unchanged and now O∈SO(4). Choose unit square roots dj of each ζj. By [F6]–[F7] and det⁡W^=1, det⁡S=det⁡(W^T)det⁡(W^)=1, so ∏jdj is either 1 or −1; if it is −1, change the sign of one root. Then D0=diag⁡(dj) and K=OD0OT satisfy KT=K, K2=S, and det⁡K=1.

3.1step 2.1algebra

Put R0=W^K−1. It is unitary and R0TR0=K−1W^TW^K−1=K−1SK−1=I. Thus R0T=R0∗, which entrywise says R0 is real. Also det⁡R0=1, so R0∈SO(4), and W^=R0OD0OT.

4.1givenF1F4step 3.1algebra

Direct multiplication gives X2=Y2=Z2=I2, and the matrices in [F4] are traceless and Hermitian. In the magic basis let Jij be the real skew-symmetric generator with Jijei=ej, Jijej=−ei, and zero on the other basis vectors. Direct action on the four displayed vectors gives the six local generators iX⊗I↦J13+J24,iY⊗I↦J14−J23,iZ⊗I↦J12−J34, I⊗iX↦J13−J24,I⊗iY↦−J14−J23,I⊗iZ↦J12+J34. These are a basis of the six-dimensional real space so(4) of skew-symmetric matrices. Thus every Jij is the magic-basis image of some real linear combination A⊗I+I⊗B of local generators, where A,B are traceless skew-Hermitian 2×2 matrices. The two summands commute, so its exponential is eA⊗eB. A traceless skew-Hermitian 2×2 matrix has eigenvalues ir,−ir for some real r, so eA,eB∈SU(2). Hence each plane rotation etJij is a local image. Conversely, [F1] expresses every local SU(2) factor as a product of Rz and Ry rotations; their magic-basis images are exponentials of the displayed real skew generators and hence real orthogonal. Finally, Givens elimination writes every R∈SO(4) as a finite product of plane rotations: for a unit first column, successively rotate coordinate pairs to zero its last three entries and make the first entry 1; orthogonality then leaves a lower-right SO(3) block, to which the same procedure applies recursively. Therefore the local image is all of SO(4), and in particular R0O and OT are local images.

5.1step 2.1step 3.1step 4.1F4algebra∎

In the same basis, direct action of the Pauli products gives the diagonal sign lists (+,−,+,−), (−,+,+,−), and (+,+,−,−) for X⊗X, Y⊗Y, and Z⊗Z, respectively. These mutually orthogonal trace-zero lists form a basis of the three-dimensional real trace-zero diagonal subspace. Since D0 is diagonal unitary with determinant one, choose arguments for its four diagonal entries; their sum is a multiple of 2π, so adjusting one argument by that multiple gives phases summing exactly to zero. Therefore those phases are a real linear combination of the three sign lists, and D0=exp⁡(i(aX⊗X+bY⊗Y+cZ⊗Z)) in the magic basis. Conjugating W^=R0OD0OT back by Q, using the local representations from step 4.1, and restoring eiδ gives the stated exact factorization.

Depends on

Used by

Dependency tree · two levels

42 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