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.
The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma)
Statement
With the notation of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations and the conclusions of The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]:
(1) Factorization criterion. For any strictly increasing tuple of roots in , including the empty tuple when ,
(2) Linear independence and spherical simplices. If is a nonempty simplex of , then are linearly independent and lie in a common open halfspace, namely for every . Thus is a pointed simplicial cone and is a spherical simplex of dimension . The empty face has and . For any increasing tuple of positive roots, its set is a simplex of if and only if its reverse product lies below in absolute order and has reflection length .
(3) The complex structure and its dimension. For every , the full subcomplex is a finite simplicial complex of dimension ; in particular has dimension . Each is a simplicial complex. If , then and the simplices of not already in are exactly the cones over faces of whose vertices all lie in . The empty face is allowed as a base, giving the new singleton vertex.
(4) Geometric intersections are common faces. For any two faces of , Consequently, the normalized cone map from the ordinary geometric realization of to is an embedding onto , and this image is a finite union of spherical simplices that pairwise meet in common faces. No Choice is used.
Facts & Assumptions
Given: An irreducible finite-type Coxeter system with , the bipartite Coxeter element , its linear action , the ordered positive roots , the vectors and map of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id, and The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]. Let be the reflection with root normal , and use the absolute order, moved spaces and positive-cone complexes of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations.
is invertible, , and . Hence . The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (3)-(4)
The map , , is a bijection; , and distinct positive roots determine distinct reflections. The canonical reflection homomorphism, roots, reflections, and the positive cone (1)-(2) The inversion formula , the root-reflection dictionary and strong exchange (1)
Since is finite, is positive definite and every is a -isometry. Carter's formula gives for every . Absolute order is the partial order defined by reflection-length additivity; it has the triangle inequality and conjugation invariance, and implies and . Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)-(2)
Every subspace has an orthogonal restriction with moved space , and every line is the moved space of a unique orthogonal reflection. Carter's formula transfers this restriction order to absolute order for group elements. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (3)-(4) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)
Writing and using , one has , this fixed space is a line, and . Also if , if within the positive-root range, and for . For , and , so has the one-dimensional fixed space and ; the strict-order sign conditions and the range are empty. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (4) The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (1)-(2)
Every root has -norm ; every positive root is a nonzero vector with nonnegative simple-root coordinates; and for every and , . Root sign coherence and the action of simple reflections on positive roots (1)-(2)
For a root normal of norm , ; it fixes the codimension-one kernel of and negates , so its determinant is . The real Coxeter form, its radical, reflections, and form-preserving maps (3)
For and , is the positive-root set of the reflection subgroup and contains the simple system . The roots are positive, factor , and their increasing reordering has reverse product below with reflection length . The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i)-(ii),(iv)
has the ordered pairwise-edge definition, and are full subcomplexes with on vertices , and . The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3)
An abstract simplicial complex contains the empty simplex and is closed under taking subsets; its geometric realization has the weak topology determined by its finite simplices. An abstract simplicial complex The geometric realization of an abstract simplicial complex
A positive-definite Gram matrix with diagonal defines a spherical simplex; for linearly independent unit vectors its cone section of the sphere is a spherical simplex of dimension one less than the number of vertices, and the radial normalization of the Euclidean simplex onto that section is a homeomorphism. Spherical Gram simplices and angular links of Euclidean faces Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i)-(ii)
The vectors form the -dual basis to the simple roots , so for every . The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (3)
A list is linearly independent exactly when its only vanishing linear combination has all coefficients zero; the empty set is a basis exactly in the zero space. Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
The ordinary realization of a finite abstract simplicial complex is compact A finite simplicial complex has a compact Hausdorff realization. Closed subsets of compact spaces are compact A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact. A continuous image of a compact space is compact: pull back an open cover using the open-preimage characterization of continuity, take a finite subcover, and map those opens forward Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right Continuity of a map of topological spaces at a point and globally For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and . Compact subsets of Hausdorff spaces are closed In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones.
A metric space is Hausdorff. Distinct points of a metric space have disjoint balls around them
The chamber interior is the transfer, under , of the dual chamber interior. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
Proof
By [F1], and . For every , [F2] gives with , and [F8] gives its moved line . Apply the subspace-restriction theorem [F5] to this line inside ; its orthogonal restriction is the unique reflection with normal , so Carter's formula gives . Thus every positive-root reflection lies below .
Let be a reduced reflection factorization. Each factor lies below : if , then is a product of reflections, so the triangle inequality forces . If , the product has reflection length when : their canonical images are distinct involutions with distinct moved lines, so ; its determinant is , whereas every reflection has determinant . Thus is neither the identity nor a reflection, and its reflection length is . Write . Then a product of reflections. The triangle inequality gives the reverse lower bound , so .
Let . If , then and [F1], [F3] give Thus and , so the factorization of is reduced. For , step 1.2 gives . Since by step 1.1, ; also . Hence . By [F2] and [F8] the moved line of is ; by [F3] and [F4] it lies in . The vector spans that fixed line by [F6], so .
Conversely, suppose for all . The matrix is upper triangular with diagonal by [F6]; therefore both the roots and the vectors are linearly independent, so . For the conclusion is by [F3], so assume . Define . Descending on , assume with length . Each factor , , is below by the first claim of step 1.2. Complements reverse order: if , transitivity gives ; writing and with additive reflection lengths then gives , and conjugation invariance gives , hence . Put . For every , complement reversal gives , and [F6] puts in . These independent vectors form a basis of : Carter's formula gives The assumed zero pairings put in by [F4]. Restricting to the line gives the orthogonal reflection by [F2]; the restriction theorem [F5] and Carter's formula therefore give . Write with . Then , whose displayed reflection factors force the factorization to be reduced; consequently and . At this yields and . This proves (1).
For , the two-root instance of (1) says since the product of two distinct positive-root reflections has length by step 1.2. If is a simplex, every pair is an edge by [F10], so these pairwise equivalences make upper triangular with diagonal . Pairing a vanishing combination with each gives ; hence every . Thus the vertices of every nonempty face are linearly independent. Conversely, if the reverse product of an increasing tuple lies below and has length , step 1.2 applied to its reduced factorization shows each pair product is below , so the tuple is a simplex. The empty tuple is the empty simplex by [F10].
Let , with the dual vectors from [F13]. Then for every simple root; since each positive root is a nonzero nonnegative combination of simple roots by [F7], every positive root has positive pairing with . Also [F7] gives positive pairing with every by the chamber transfer [F17]. For a nonempty face , its independent unit roots have a positive-definite Gram matrix with diagonal . By [F12], is the associated spherical simplex of dimension . The independence of the cone generators makes pointed and simplicial. For the empty face, [F10] gives and its sphere section is empty.
The roots of lie in : if , then by definition; [F2] identifies its linear reflection, [F8] gives , and [F3] gives . Thus a face of has at most vertices by step 3.1 and Carter's formula. If , then and has dimension . If and , the rank-one data give , , and ; hence has one vertex and dimension . If and , [F9] gives and . Each lies in the reflection subgroup of [F9], so every is a root of that subgroup; its positivity from [F9] puts it in . Hence the increasing reordering lies in . Its reverse product is below with length by [F9], so step 3.1 makes it a -vertex simplex. Therefore . Finiteness follows from finiteness of in [F1], and the full-subcomplex and claims follow from [F10].
Let . By [F10], has vertices . Any new simplex of must contain the new vertex . Its other vertices form a face of , and the two-root criterion of step 3.1 says each such vertex is joined to exactly when . Conversely, any face of with all vertices in this hyperplane gives a simplex . This includes , proving the cone-over-link description and the nested inclusions.
Put and induct on to prove the cone intersection formula for all faces of . At both cones equal . Suppose the formula holds at and consider faces of . If both are in , use induction. Otherwise each new face has the form with and every vertex of orthogonal to , by step 4.3. For a cone point in such a face, its coefficient on is its pairing with , because by [F6] and its pairings with the base vertices are zero. Every old vertex , , has by [F6]. Therefore a cone on an old face intersects a cone with apex only where the apex coefficient is zero; there the induction hypothesis identifies the intersection with the cone on the common base face. For two faces both containing the apex, equality of a common cone point gives equality of its apex coefficients after pairing with , and then equality of the base cone points; induction identifies their base intersection. In each case the intersection is exactly the cone on the common face. Since every face of belongs to , this proves the formula in (4).
Define the normalized cone map on a barycentric point of the geometric realization by The denominator is nonzero because for every positive root by step 4.1. Its restriction to each simplex is a homeomorphism onto the corresponding spherical simplex by [F12], and it is continuous globally by the weak-topology definition [F11]. If two such images agree, the two positive combinations lie on the same ray; step 5.1 puts that ray in the cone on the common face, and linear independence of that face plus the barycentric sum-one condition makes the original points equal. Thus is a continuous bijection onto . By [F1] and step 4.2, is a finite abstract simplicial complex, so its ordinary realization is compact by [F15]. If is closed in that realization, [F15] makes compact; the open-cover argument in [F15] makes compact, and it is closed in the Hausdorff sphere by [F15] and [F16]. Thus is a closed continuous bijection onto its image and therefore a topological embedding. No Choice is used: the only compactness input is [F15], whose finite-complex proof reduces to finite-dimensional Heine-Borel.
Depends on
- The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
- Root sign coherence and the action of simple reflections on positive roots
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
- An abstract simplicial complex
- The geometric realization of an abstract simplicial complex
- Spherical Gram simplices and angular links of Euclidean faces
- Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- A finite simplicial complex has a compact Hausdorff realization
- A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact
- In a Hausdorff space a point and a disjoint compact set, and two disjoint compact sets, have disjoint open neighbourhoods; hence every compact subset is closed, and in a compact Hausdorff space the compact subsets are exactly the closed ones
- Distinct points of a metric space have disjoint balls around them
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Continuity of a map of topological spaces at a point and globally
- For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and $f(\overline{A}) \subseteq \overline{f(A)}$
Used by
- 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
- Intersection of root subcomplexes and purity under convexity Lemma
- Finite noncrossing intervals are lattices, independently of the Coxeter element 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
156 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
- Thomas Brady and Colum Watt, Lattices in finite real reflection groups (arXiv:math/0501502, 29-page PDF) (standard reference, not scraped)
- Robert Steinberg, Finite reflection groups, Transactions of the American Mathematical Society 91 (1959) 493-504 (AMS free digital archive, 12-page PDF) (standard reference, not scraped)
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages) (standard reference, not scraped)
- Sergey Fomin and Nathan Reading, Root systems and generalized associahedra, IAS/Park City Mathematics Series lecture notes (arXiv:math/0505518) (standard reference, not scraped)