Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Two Nonparallel One-Parameter Subgroups Generate SU(2) After Closure

Statement

For a matrix M, write eM=∑j≥0Mj/j!. Write SU(2):={M∈M2(C):M∗M=I2,det⁡M=1}. Let a,b∈R3 be nonparallel unit vectors, let σ=(X,Y,Z) be the Pauli triple, and put A=i a⋅σ and B=i b⋅σ. If H is the operator-norm closure of the subgroup generated by {etA,etB:t∈R}, then H=SU(2).

Facts & Assumptions

Given: Nonparallel unit vectors a,b∈R3 and the Pauli matrices X,Y,Z.

[F1]

The Pauli-vector product and commutator identities hold, and the Pauli triple is a real basis of traceless Hermitian 2×2 matrices (Pauli Vector Multiplication and Commutator Formula).

[F4]

Euler's formula and the Pythagorean identity give eit=cos⁡t+isin⁡t and cos⁡2t+sin⁡2t=1 (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

Proof

1.1F1F2F4givenalgebra

Put Pa=a⋅σ. By [F1], Pa=Pa∗, Pa2=I and tr⁡Pa=0. Its eigenvalues are 1,−1 by [F2], so the power series gives etA=Icos⁡t+iPasin⁡t and its eigenvalues are eit,e−it. By [F4] it is unitary, and its determinant is one. The same holds for B. Thus the generated subgroup lies in SU(2); its closure H also lies there because the defining matrix equations for SU(2) are closed. Continuity of multiplication and inversion makes H a subgroup.

2.1F1F3step 1.1construct

By [F1], [A,B]=−2i(a×b)⋅σ. Let c=a×b≠0 and s0=max⁡(∥A∥,∥B∥). For ∣t∣≤1, multiplying the four exponential series etAetBe−tAe−tB gives degree-one coefficient A+B−A−B=0 and degree-two coefficient AB−BA=[A,B]. Submultiplicativity bounds the sum of norms of all degree-m terms by (4s0)m/m!. Hence the terms of degree at least three have norm at most K∣t∣3, where K=(4s0)3e4s0/6. For fixed r≥0, put t=r/n. The commutator factor is Xn=I+r[A,B]/n+Rn with ∥Rn∥≤Kr3/2n−3/2. Set Yn=I+r[A,B]/n. For fixed r, the norms of Xnk and Ynk are bounded uniformly over 0≤k≤n, because each one-step norm is at most 1+Cr/n for all sufficiently large n. The telescoping identity Xnn−Ynn=∑k=0n−1Xnn−1−k(Xn−Yn)Ynk bounds their difference by O(n−1/2). The binomial expansion of Ynn converges to the exponential series for er[A,B]: its kth term is bounded by (r∥[A,B]∥)k/k!, a summable sequence. Swapping A and B gives e−r[A,B] for r≥0. Every approximant belongs to the generated subgroup, so closedness gives es[A,B]∈H for every real s.

3.1F1step 1.1step 2.1algebra

The vectors a,b,c form a basis of R3, since c is nonzero and orthogonal to both a and b. By [F1], every traceless skew-Hermitian 2×2 matrix L is a real linear combination xA+yB+z[A,B]. For fixed matrices S,T, exponential-series expansion gives eS/neT/n=I+(S+T)/n+O(n−2) and e(S+T)/n=I+(S+T)/n+O(n−2). The one-step difference is O(n−2); the norms of intermediate powers up to n are bounded by e∥S∥+∥T∥+1 for sufficiently large n. Telescoping therefore gives (eS/neT/n)n→eS+T. The same estimate for three factors gives (exA/neyB/nez[A,B]/n)n→eL. Every factor lies in H by step 1.1 and step 2.1, so closedness gives eL∈H.

4.1F2step 1.1step 3.1algebra∎

Every U∈SU(2) is normal, so [F2] diagonalizes it. Its eigenvalues lie on the unit circle and their product is one, so they are eiθ,e−iθ for some real θ. In that orthonormal eigenbasis, the matrix with diagonal entries iθ,−iθ is traceless and skew-Hermitian, and its exponential is U. Step 3.1 gives U∈H. Since H⊆SU(2) by step 1.1, H=SU(2).

Depends on

Used by

Dependency tree · two levels

21 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