Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Maximal tori and Weyl groups of U(n) and SU(n)

Example

Assume the Axiom of Choice and let n1. The diagonal unitary matrices TU(n)={diag(z1,,zn):zj=1} form a maximal torus of U(n), its determinant-one part TSU(n)={diag(z1,,zn):zj=1, z1zn=1} is a maximal torus of SU(n), and in both cases the Weyl group is the symmetric group Sn acting by permuting the coordinates.

Facts & Assumptions

Given: An integer n1, the groups U(n) and SU(n) with their standard maximal tori and the permutation matrices.

[L1]

A torus is a compact connected abelian Lie group and a maximal torus is maximal under inclusion of torus subgroups; for a compact connected group with maximal torus T the Weyl group is W(G,T)=NG(T)/T and agrees with the root-system Weyl group (Tori and maximal tori, Compact Weyl group, Analytic and root-system Weyl groups agree).

Verification

technique · direct
1.1

The diagonal unitary matrices form a compact connected abelian subgroup of U(n). A matrix commuting with every diagonal unitary matrix has zero (i,j)-entry for ij, by choosing diagonal phases whose ith and jth entries differ; hence the centralizer of TU(n) is itself, so it is maximal. For n2 the same entrywise argument uses determinant-one diagonal phases and shows that the centralizer of TSU(n) in SU(n) is TSU(n); for n=1, SU(1) is trivial. Thus both displayed tori are maximal.

L1algebra
2.1

The permutation matrices πσ are unitary and satisfy πσdiag(z1,,zn)πσ1=diag(zσ(1),,zσ(n)), so they lie in the normalizer and induce Sn in the Weyl group. For SU(n) choose a diagonal unitary dσ with detdσ=(detπσ)1; then dσπσSU(n) and, because dσ commutes with the diagonal torus, it induces the same coordinate permutation.

L1step 1.1algebra
3.1

Conversely, let g normalize the diagonal torus. Choose a regular element t=diag(z1,,zn) of the torus with pairwise distinct zj. Then gtg1T, and the zj are the eigenvalues of t; since gtg1 has the same eigenvalues, and the eigenspaces of t are the coordinate lines, g permutes those lines up to scalars, hence equals a permutation matrix times a diagonal matrix. In U(n) this says that the normalizer is generated by the torus and the permutation matrices. In SU(n), if the induced permutation is σ, step 2.1 supplies the determinant-corrected representative dσπσSU(n); multiplying g by its inverse leaves a diagonal determinant-one matrix, so the normalizer is generated by TSU(n) and these corrected representatives. In either case the quotient is Sn.

L1step 2.1
4.1

Consequently the Weyl groups of U(n) and SU(n) are Sn acting by coordinate permutation, in agreement with the root-system computation for types An1.

L1step 3.1

Depends on

Used by

Dependency tree · two levels

33 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