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 length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
Definition
Let be a Coxeter system of finite type with finite and length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type), with canonical reflection representation on , Coxeter form , root system and reflection set (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Since is finite, is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), so is a real inner product space (Real and complex inner-product spaces and their induced length), and preserves for every (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)). Write for the group of -preserving invertible linear maps (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).
(1) Reflection length. For put
where the empty product () is the identity. The minimum exists because and generates (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so the admitted form a nonempty subset of , which has a least element (The well-ordering principle).
(2) Absolute order. For define if and only if
(3) Moved and fixed spaces. For a linear map (Linear map between vector spaces over the same field) define the moved space and the fixed space
(Kernel and image of a linear map). For define the relation if and only if
(4) Conventions and abstentions. For write and . This definition asserts no property of and beyond the displayed formulas: it asserts neither that either relation is a partial order, nor that , nor that means that a shortest reflection factorization of is a prefix of one of . Those properties are proved in Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound ↗, the recorded justifier of this definition, and by the restriction and factorization lemmas of this page. No Choice is used: , , and are finite and every object is finite-dimensional or set-theoretic.
Depends on
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coxeter diagrams: edges, labels, components and finite type
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Kernel and image of a linear map
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Linear map between vector spaces over the same field
- Real and complex inner-product spaces and their induced length
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- The well-ordering principle
Used by
- Coxeter elements, the noncrossing interval [1,c], and the Kreweras map w ↦ w⁻¹c Definition
- A crossing double transposition whose interval is Boolean, and the two incomparable maximal Coxeter elements of S3 Example
- A moved-space intersection in A₃ that is not the meet Example
- In A3 the moved spaces meet in a line, while the root complexes have no common nonempty face Example
- Ordered roots and the mu-dot-root matrix in A3 Example
- Simple and reflection lengths of a long transposition in S₅ Example
- The noncrossing interval of a dihedral group: a five-reflection claw for I2(5) and its complement Example
- The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound Example
- Moved space of a reversed reflection product with independent normals Lemma
- Root normals inside the moved space, factorizations into reflections, and independent normals Lemma
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] Lemma
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order Lemma
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound Theorem
- Finite noncrossing intervals are lattices, independently of the Coxeter element Theorem
- The Kreweras complement of [1,c], and the type-A model by noncrossing set partitions Theorem
- The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| Theorem
Dependency tree · two levels
90 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
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005), author/class-hosted complete PDF (standard reference, not scraped)
- R. W. Carter, Conjugacy classes in the Weyl group, Compositio Mathematica 25 (1972) 1-59 (Numdam full text) (standard reference, not scraped)
- T. Brady and C. Watt, Lattices in finite real reflection groups (arXiv:math/0501502) (standard reference, not scraped)