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.
Root normals inside the moved space, factorizations into reflections, and independent normals
Statement
Let be a Coxeter system of finite type with finite, with , positive definite Coxeter form , canonical reflection representation , 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, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), with the chamber system , the open faces and the root hyperplanes of the transferred dual action (The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset), and let , , and be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator; for write and . Then:
(1) Root normals in the moved space. Let with . Then and there is a root with . For every such root one has , and the reflection with (The inversion formula , the root-reflection dictionary and strong exchange (1), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) satisfies
(2) Factorizations and Carter's formula. Every is a product of reflections , and no product of fewer elements of represents ; equivalently
(3) Independent normals. Let and choose roots with . Then ; and if — in particular if is a shortest reflection factorization of its product — then the vectors
are linearly independent (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent) and span .
Facts & Assumptions
Given: The finite-type Coxeter datum , , , , , and the elements above; , and are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.
For the open face is , the root hyperplane is , and for ; moreover is the disjoint union of the sets over the left cosets with , and for every . The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
No finite family of proper subspaces of a finite-dimensional vector space over an infinite field covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
Every root satisfies , and there is a unique with . The inversion formula , the root-reflection dictionary and strong exchange
The representation is injective. The root-length criterion and faithfulness of the canonical reflection representation
For with the map is linear, preserves , fixes every with , and satisfies ; consequently for every , so . Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order Descent of the reflection representation, unit root norms, and conjugation of reflections
On the positive definite space the Wall form lemma holds: (1) for and for ; (3) for every subspace the operator of the lemma satisfies , and every line is the moved space of exactly one reflection of , namely ; (4) and for every . The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
is a group homomorphism, so and (The canonical reflection homomorphism, roots, reflections, and the positive cone). is the least over products of elements of ; , ; and with presented as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
For a subspace of a finite-dimensional space , , with equality exactly when . A finite-dimensional space has a basis, obtained as the extension of any linearly independent subset; a basis is an independent spanning set and its cardinality is the dimension of the space. If and is a linear subspace of , then is finite-dimensional, , and if and only if Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis
If a vector space has a spanning subset of cardinality , then every linearly independent subset has at most elements. If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with
A list of vectors is linearly dependent exactly when some nontrivial linear relation holds, and dependence of lets one of the vectors be solved for as a combination of the others; the span of a set is the set of its finite linear combinations. Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent Linear combination of a finite list, and the span as the smallest linear subspace containing
Proof
Let . First : otherwise , so and , whence by [F4], a contradiction. Next, a root with exists. If then F6 gives , so and for any is a root with . Suppose now that ; let be the finite set of roots with , so that each with is a proper subspace of the finite-dimensional real space ; the finite family consisting of those subspaces and consists of proper subspaces of , since ; by [F2] its union does not cover , so there is with for every , including when ; for every root the implication holds, and is fixed by , so . By [F1] there are and with and ; since lies in this stabiliser, , so for one has by [F1], the equality following from the -invariance of [F5]; the implication above with gives for the root , so in this case a root with the required property exists as well. Finally, if , then for all , so by F6.
Let and let satisfy , as supplied by [F3]. Then for every by [F5], so and ; also because .
For one has by F6.
For , the telescoping identity is : each summand is , by the homomorphism property of . Thus .
Linear-algebra tool. Let be a finite-dimensional vector space spanned by vectors . Then : by [F8] has a basis with , and is linearly independent while is spanned by , so [F9] gives . If moreover , then are linearly independent: otherwise a nontrivial relation expresses some as a combination of the remaining vectors by [F10], those remaining vectors still span by [F10], and [F9] would give , a contradiction.
A product of elements of has moved dimension at most : by step 1.2 each factor has moved dimension , and step 1.3 applied times bounds the moved dimension of the product by the sum .
Let and put and . Steps 1.2 and 1.4 give . Since is spanned by these vectors, step 1.5 gives ; [F8] applied to the subspace of yields .
Carter's formula and factorization: every satisfies , and is a product of exactly elements of . If , then and the empty product represents , giving both assertions. If with , step 2.2 supplies with ; by induction on (applied to , whose moved dimension is ) there are with , so is a product of elements of . For the reverse inequality let with ; then by step 2.1, so no shorter product of elements of represents and by [F7].
Suppose and put as in step 2.3. Step 2.3 gives with , so and by [F8]. Thus the span , and by step 1.5 the vectors are linearly independent and hence form a basis of : this is the independence and spanning assertion of (3). Finally, if is a shortest reflection factorization of its product , then by step 3.1, so the hypothesis holds and the same conclusion applies. This proves (1), (2) and (3).
Depends on
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coxeter diagrams: edges, labels, components and finite type
- The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Linear subspace of a vector space
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
- The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- The root-length criterion and faithfulness of the canonical reflection representation
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
Used by
- A moved-space intersection in A₃ that is not the meet Example
- The Wall form and line restrictions of a plane rotation, and the necessity of a common upper bound Example
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] Lemma
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound Theorem
Dependency tree · two levels
155 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
- 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)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005), author/class-hosted complete PDF (standard reference, not scraped)