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 disconnected element outside every identity-component torus
Statement refuted
Every element of the compact Lie group lies in a torus contained in its identity component.
Facts & Assumptions
Given: The group of orthogonal matrices with determinant , its identity component , and a reflection .
is a compact Lie group whose identity component is , and a torus is a compact connected abelian Lie group; a maximal torus of a group is a torus subgroup maximal under inclusion (Tori and maximal tori).
The determinant is a continuous homomorphism ; every connected subset of is a singleton, so every connected subgroup of lies in the kernel of the determinant (Tori and maximal tori).
Counterexample
A reflection is an orthogonal matrix with determinant , so .
Every torus contained in the identity component is a connected subgroup of lying in ; by [L2] every connected subgroup of lies in the kernel of the determinant, so no torus of the identity component contains .
Hence is an element of the compact Lie group that lies in no torus of the identity component, refuting the asserted statement and showing that connectedness of the ambient group is a necessary hypothesis for the torus-containment theorems.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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)