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.
Reflection cardinalities of the three connected finite rank-three types
Statement
For a Coxeter system of type , or , let be its set of Coxeter reflections, using Coxeter-system, roots, length and weak-order conventions. Then is respectively , or .
Facts & Assumptions
for a finite Coxeter system (The longest element as the opposition of the chamber, and longest elements of finite parabolics, part (1)(ii)).
For irreducible finite type of rank and bipartite Coxeter element of order , (The Coxeter plane, ordered-root enumeration, and invertibility of the Coxeter action minus the identity, part (3)).
For the bipartite Coxeter element , the complexified canonical operator has exact order in type () and in type () (The Coxeter elements of the classical types Aₙ, Bₙ, Dₙ and I₂(m): characteristic polynomials, orders and spectral exponents from their reflection models, Statement). The real canonical operator has exact order in type (The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices, Statement, case).
The standard diagrams , and are three-vertex paths with successive edge labels , and , respectively; each defines a finite irreducible Coxeter system (Classification of finite Coxeter systems, including the H and dihedral families, part (1)).
For a Coxeter system with finite , its canonical reflection homomorphism is injective (The root-length criterion and faithfulness of the canonical reflection representation, part (3)).
Proof
Given: A Coxeter system of one of the stated rank-three types, its canonical representation , roots and reflection set as in Coxeter-system, roots, length and weak-order conventions. Goal: Evaluate using exact supplier statements.
Proof technique: direct.
By [F4] each diagram is connected with three vertices, and its Coxeter group is finite. Thus the system is irreducible finite type with . Number the path vertices in order. The classes and form a bipartition. Since the endpoints are not joined, and the Coxeter relations give . Hence is a bipartite Coxeter element in the convention of the spectrum and root-enumeration suppliers. Reversing the two classes replaces by , so it does not change the order.
The operators in [F3] therefore have exact orders , respectively. For the classical cases, complexification has the same real matrix entries in the simple-root basis, so if and only if for every positive integer . For all three cases, permits [F5], and injectivity gives if and only if . Consequently the group element has exact order , namely , or .
By [F1] and [F2], . Substitution gives , and . The use of canonical roots only evaluates the abstract conjugate set ; it does not assume an unproved identification of the original arrangement with a canonical representation.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- The Coxeter elements of the classical types Aₙ, Bₙ, Dₙ and I₂(m): characteristic polynomials, orders and spectral exponents from their reflection models
- The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices
- The Coxeter plane, ordered-root enumeration, and invertibility of the Coxeter action minus the identity
- Classification of finite Coxeter systems, including the H and dihedral families
- The root-length criterion and faithfulness of the canonical reflection representation
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.