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.
A maximal torus and Weyl group of SO(3)
Example
Assume the Axiom of Choice. Rotations about a fixed axis form a maximal torus , and the Weyl group of with respect to it has order two, acting on the torus by reversing the angle.
Facts & Assumptions
Given: The group of rotations of , the subgroup of rotations about the -axis, and the half-turn about the -axis.
is a compact connected abelian Lie group, hence a torus, and the Weyl group is (Tori and maximal tori, Compact Weyl group).
Every element of is a rotation about some axis through the origin (Euler's theorem for ), and the fixed-point set of a nonidentity rotation is its axis. [L1]
Verification
is a torus by [L1]. If a connected abelian subgroup existed, then every element of would commute with every rotation about the -axis, and a rotation commuting with all of them fixes the -axis, hence is itself a rotation about the -axis; so and is maximal.
The half-turn about the -axis satisfies for : conjugating a rotation about the -axis by reverses its angle, so and its class in is nontrivial.
Conversely, if normalizes , then preserves the axis of every nonidentity element of , namely the -axis as an unoriented line; hence either preserves or reverses the direction of the -axis, and modulo the only two possibilities are the identity and the half-turn's coset.
Therefore , the nontrivial element acting by , i.e. by angle reversal; this agrees with the root-system computation for type with one positive root.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)