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.
Character lattices of SU(2) and SO(3)
Example
Assume the Axiom of Choice. For type with fundamental weight one has and . The character lattice of the maximal torus of is , while that of the maximal torus of is ; consequently precisely the even highest weights descend to .
Facts & Assumptions
Given: Assume the Axiom of Choice; with maximal torus and the standard central quotient identification .
For a compact connected semisimple group , the simply connected form has character lattice and the adjoint form has character lattice ; central quotients correspond to intermediate lattices (Root and weight lattice sandwich, Central quotients and intermediate character lattices).
For type , and , and characters of are the maps with weight (Characters are the integral weights). [L1]
Verification
is simply connected and semisimple with root system , so by [L1]; the characters are , with weight .
The kernel of is . Since corresponds to in , the character of weight takes the value there, so it is trivial on the kernel exactly when is even.
By [L1] the intermediate lattice of is , and the adjoint-form computation of [L1] gives the same answer.
Hence a dominant highest weight descends to exactly when is even, i.e. exactly when ; this is the explicit form of the finite central quotient obstruction.
Depends on
Used by
- SU(2) and SO(3) share roots but are not isomorphic Counterexample
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
- Brian Conrad and Aaron Landesman, Compact Lie Groups (standard reference, not scraped)