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.
Special unitary groups are connected
Statement
For every integer , the matrix group is path connected.
Facts & Assumptions
Given: An integer and a matrix .
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
For real , , and exactly when . , , and , and exactly when
The complex exponential is entire, hence continuous. The complex exponential is entire and its complex derivative is itself
Proof
The matrix is unitary and therefore normal. By [F1], choose a unitary matrix and real phases such that . Since , [F2] gives for some integer . Replace by ; the eigenvalue is unchanged and the sum of phases is now zero. This uses only finitely many eigenvalues.
Define for . Each is unitary by [F2], and , so . The path is continuous by [F3], , and . Thus every element is joined to the identity, proving path connectedness.
Depends on
- 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$
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- The complex exponential is entire and its complex derivative is itself
Used by
Dependency tree · two levels
25 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
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang, A Modular Functor Which Is Universal for Quantum Computation (standard reference, not scraped)