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 , write . Write . Let be nonparallel unit vectors, let be the Pauli triple, and put and . If is the operator-norm closure of the subgroup generated by , then .
Facts & Assumptions
Given: Nonparallel unit vectors and the Pauli matrices .
The Pauli-vector product and commutator identities hold, and the Pauli triple is a real basis of traceless Hermitian matrices (Pauli Vector Multiplication and Commutator Formula).
A normal complex matrix has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
The operator norm is submultiplicative (The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).
Euler's formula and the Pythagorean identity give and (, , and ).
Proof
Put . By [F1], , and . Its eigenvalues are by [F2], so the power series gives and its eigenvalues are . By [F4] it is unitary, and its determinant is one. The same holds for . Thus the generated subgroup lies in ; its closure also lies there because the defining matrix equations for are closed. Continuity of multiplication and inversion makes a subgroup.
By [F1], . Let and . For , multiplying the four exponential series gives degree-one coefficient and degree-two coefficient . Submultiplicativity bounds the sum of norms of all degree- terms by . Hence the terms of degree at least three have norm at most , where . For fixed , put . The commutator factor is with . Set . For fixed , the norms of and are bounded uniformly over , because each one-step norm is at most for all sufficiently large . The telescoping identity bounds their difference by . The binomial expansion of converges to the exponential series for : its th term is bounded by , a summable sequence. Swapping and gives for . Every approximant belongs to the generated subgroup, so closedness gives for every real .
The vectors form a basis of , since is nonzero and orthogonal to both and . By [F1], every traceless skew-Hermitian matrix is a real linear combination . For fixed matrices , exponential-series expansion gives and . The one-step difference is ; the norms of intermediate powers up to are bounded by for sufficiently large . Telescoping therefore gives . The same estimate for three factors gives . Every factor lies in by step 1.1 and step 2.1, so closedness gives .
Every is normal, so [F2] diagonalizes it. Its eigenvalues lie on the unit circle and their product is one, so they are for some real . In that orthonormal eigenbasis, the matrix with diagonal entries is traceless and skew-Hermitian, and its exponential is . Step 3.1 gives . Since by step 1.1, .
Depends on
- Pauli Vector Multiplication and Commutator Formula
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
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
- Christopher M. Dawson and Michael A. Nielsen, The Solovay–Kitaev Algorithm, arXiv:quant-ph/0505030v2 (standard reference, not scraped)
- Dieter van Melkebeek and Thomas Watson, Time-Space Efficient Simulations of Quantum Computations (standard reference, not scraped)