Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 n≥1, the matrix group SU(n)={A∈Mn(C):A∗A=I, det⁡A=1} is path connected.

Facts & Assumptions

Proof

1.1givenF1F2choosealgebra

The matrix A is unitary and therefore normal. By [F1], choose a unitary matrix Q and real phases α1,…,αn such that A=Qdiag⁡(eiα1,…,eiαn)Q∗. Since det⁡A=1, [F2] gives ∑jαj=2πk for some integer k. Replace α1 by α1−2πk; the eigenvalue is unchanged and the sum of phases is now zero. This uses only finitely many eigenvalues.

2.1givenF2F3step 1.1algebra∎

Define A(t)=Qdiag⁡(eitα1,…,eitαn)Q∗ for 0≤t≤1. Each A(t) is unitary by [F2], and det⁡A(t)=eit∑jαj=1, so A(t)∈SU(n). The path is continuous by [F3], A(0)=I, and A(1)=A. Thus every element is joined to the identity, proving path connectedness.

Depends on

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