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.
Every finite reflection-invariant set of vectors is crystallographic
Statement
False: a finite set of nonzero vectors spanning a Euclidean space that is invariant under all of its root reflections need not be crystallographic; reflection invariance alone does not force the Cartan integers to be integers.
Facts & Assumptions
Given: The regular pentagon and the notation of the root-system axioms.
A reduced crystallographic root system requires and integrality of all Cartan integers (Reduced crystallographic Euclidean root system).
Proof
Let ; it is a finite subset of spanning , and its ten elements lie on five distinct lines, so for each .
The set consists exactly of the unit vectors whose angles are , . If has angle , then is reflection in the perpendicular line at angle . It therefore sends the vector at angle to the vector at angle which again belongs to . Hence for every .
The integrality axiom fails. Take and ; then . With one has and , so dividing by gives , that is and . If were an integer, the integer factor pair would have to be or , neither of which consists of consecutive integers. Hence .
Thus is a finite, spanning, reduced, reflection-invariant set of nonzero vectors whose Cartan integer is not an integer, so is not a crystallographic root system by [L1]; this refutes the claim that reflection invariance alone suffices.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
2 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., Chapter II (standard reference, not scraped)