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 separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity 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, 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], fix , , put , and write . If , set and ; if , write as in (4)(iv) of The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]. For define For put Then:
(1) The separating-root lemma. If satisfy , , and , there are with , , and
(2) The facet induction. For every index with , The cone is full-dimensional in , closed and convex. Every facet is contained in one of the hyperplanes or . Some listed halfspaces may be redundant; only nonredundant active inequalities support facets. This includes rank one and the empty base at the start of the rank induction.
(3) Spherical convexity and intersection. This set is spherically convex: the shorter great-circle arc between any two of its points lies in it. For , using the common-face cone intersections of The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (4).
(4) Limits. This theorem asserts nothing about for arbitrary , the lattice property of , or for . No Choice is used.
Facts & Assumptions
Given: The irreducible finite-type Coxeter system and the bipartite data 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], together with , , and .
The conditional map is defined, is a -isometry, enumerate in the global order, and . 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
For each positive root , , , and for positive roots in the global order, while . The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]
is the finite reflection subgroup whose positive roots are . Since , this gives . For it has a simple system , every root in is a nonnegative combination of , and the reordered roots give a reduced factorization . The prefix roots are positive. The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i)-(iv) The inversion formula , the root-reflection dictionary and strong exchange (1)
The inversion set is . For a reduced expression , its prefix roots are exactly , and are pairwise distinct positive roots. The geometric inversion set of an element of a Coxeter group The inversion formula , the root-reflection dictionary and strong exchange (2)
; absolute order is the reflection-length order; it has the triangle inequality and conjugation invariance; and if , then exactly when . 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)-(3)
For orthogonal , . Every subspace has an orthogonal restriction with moved space , and for group elements Carter's formula transfers this restriction order to absolute order. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (1),(3)-(5) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
For an increasing root tuple , its set is a simplex of exactly when the reverse product lies below and has reflection length ; every face has independent vertices, and all positive-root vertices lie in a common open halfspace. If , the prefix complexes are nested and each new simplex at is a cone over a face in . The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (1)-(3)
The ordered complex, its full subcomplexes, cones, and inclusive root prefixes have the definitions of The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations (1)-(3). In particular contains precisely the vertices .
The root-reflection map is a bijection from positive roots to reflections; distinct positive roots give distinct reflecting involutions; has determinant and moved line for unit roots; reflections act on roots by their orthogonal root action; and positive roots have norm one. The inversion formula , the root-reflection dictionary and strong exchange (1) The real Coxeter form, its radical, reflections, and form-preserving maps (3) Root sign coherence and the action of simple reflections on positive roots
If and , then is a simple system of (so every root in is a nonnegative combination of these endpoints), , and . The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] (4)(i),(v)
A nonempty simplex cone in is pointed and its normalized map is an embedding; cones of two faces intersect in the cone on their common face. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) (2),(4)
A finite abstract simplicial complex is closed under taking subsets; an empty face is permitted and has dimension . An abstract simplicial complex
For a linear map between finite-dimensional vector spaces, . Rank-nullity:
A finite-dimensional real inner-product space has induced norm . Real and complex inner-product spaces and their induced length
The simple roots are a basis, and the positive roots are exactly the roots with nonnegative simple-root coordinates (the negative roots have nonpositive coordinates). Root sign coherence and the action of simple reflections on positive roots (1)-(2)
Proof
Inversion inside a subinterval. If , (1) is vacuous because has only its single positive root. Assume . Fix , , and let be the simple system of given by [F3]. The item-18 factorization, in its second form with index , is ; it is reduced because . Apply the inversion formula [F4] to the finite Coxeter system with simple system . Its positive roots are exactly , so , where the prefix roots are . The action of preserves , so a root in is negative in this subsystem exactly when it is negative in the ambient positive system. Thus for , .
The first separator. Write and . Since , [F2] and [F6] give and hence . The distinct reflections have product determinant and nonidentity image, whereas every reflection has determinant ; hence . Writing gives with , so . Its moved space is contained in because both normals lie there, hence [F5] gives . The rank-two statement [F10] applied to shows that and are the ordered endpoints of the simple system of . Put . The endpoint pairing in [F10] makes this a nonzero nonnegative combination of the endpoints; [F9] says it is a root, and [F15] makes it positive because its simple-root coordinates are nonnegative. The reflection preserves , so . The endpoints are the least and greatest roots of , hence ; equality would imply , so . Thus as . The pair has reverse product of length , so [F7] gives . Also .
The linear map and finite facet test. Regard as an orthogonal operator. Since is invertible, and , because . Thus for every unit root , . We will use the following finite polyhedral observation at each induction stage: if a full-dimensional cone in a finite-dimensional space is given by finitely many homogeneous linear inequalities, delete the redundant inequalities. For each remaining inequality , nonredundancy gives a point satisfying the other inequalities but with ; join it to an interior point where every remaining inequality is strict. The segment meets while all other inequalities remain strict, so cuts out a facet. Conversely each facet has a relative-interior point where at least one defining inequality is active, and that active hyperplane contains the facet. Hence the cone is the intersection of its active facet halfspaces. This proves the finite facet test without treating a redundant constraint as a facet.
The inclusions and rank base. The root-reflection dictionary and the definition of give . For , the wall statement (4)(iii) of item 18 and from [F2] show that for and otherwise: the wall makes the off-diagonal pairings zero, and is a combination of earlier simple roots. Thus the restrictions form the basis dual to . Since the are a reordering of the , the restricted pairing functionals are this same dual basis in a different order. Therefore [F3] gives for every . For the same inequalities follow directly from . If and , then , so [F2] gives . Consequently ; by definition . If , then : it is the positive root set on the one-dimensional space , and unit normalization leaves one positive root. The only eligible prefix is the singleton, , whose sole facet is the origin in ; this includes the empty base with cone . Suppose henceforth , and let be the unique index with .
The opposite separator. Set . By [F1], ; the hypothesis excludes the inversion roots in [F3], so [F4] and step 1.1 imply . Put and . Write with additive reflection lengths, so and has length ; hence . If is reduced, then and because , so also . The vector is fixed by by [F2], hence by using [F5]-[F6]. Let be the orthogonal projection of onto . Its residual lies in , so as well; projection preserves its pairing with , giving . Therefore . Since and is an isometry, . By [F2], if then this pairing is nonnegative, and equality of the roots would give ; thus . Since and , one has . Write with . Then and has length by conjugation invariance. The distinct reflections and have product of determinant and this product is nonidentity, so its reflection length is ; the length equality therefore gives . Now [F7] gives . Together with step 1.2 this proves (1).
Base of the root-index induction. Put . The prefix is a face of the canonical -simplex by [F7], so and . The tuple is eligible for , so [F3]'s componentwise minimality makes its canonical tuple satisfy for every . In particular , and appending to this tuple gives an increasing reduced tuple for ; componentwise minimality for gives for . Thus for every . Also . The dual-basis result of step 1.4 makes for every , while root order makes this pairing nonpositive when by [F2]; hence every such lies in . This hyperplane has dimension and contains the independent roots , so . Since , the prefix ending at is eligible for . Every has by the dual-basis result above and by the global order, so these earlier roots lie in . Conversely by [F3]. Thus the two prefix vertex sets, and hence their full subcomplexes, agree: . The lower-rank induction gives , a full-dimensional convex cone in with facet supports restricted from for roots .
Transporting the base facets through an apex. The following calculation applies both to the base apex and to an inductive apex . Let , let be the already established full-dimensional base cone in , and let a facet of have support the restriction of for some . Put and . For , the decomposition , with and , is unique. Thus exactly when and . If a facet of is given by with , its transported inequality is , where ; it vanishes at and agrees with on . Since and , , so . The equality of with the intersection of its active facet halfspaces therefore gives a finite halfspace presentation of in by and the transported inequalities; step 1.3 identifies its nonredundant inequalities with its facets. The vector is a signed root in , so its positive representative belongs to by [F3]. Thus every non-base facet of is a root-wall facet.
Inductive root-prefix step. Suppose and . Put and . Since , write with and . Then ; also , since , so and . The subspace lies in because and preserve , and it lies in by absolute-order monotonicity. Both and have dimension : the latter is the kernel of the nonzero functional on , which is nonzero on since . Hence and . The link base on the old vertices orthogonal to satisfies : all old vertices have nonpositive pairing with , so a nonnegative combination pairs to zero exactly when it uses only zero-pairing vertices. Thus . Let be the prefix roots for the canonical simple system of . They lie in , so . If , the distinct reflections and have product length by the determinant argument in [F9]. Since , write with ; then is reduced, so . By [F10] and the increasing order , this is the endpoint factorization of the rank-two element , so . The root is a nonzero nonnegative combination of the endpoints; hence has nonnegative simple-root coordinates and is positive by [F15]. Since it lies in , [F3] puts it in ; it cannot equal , since that would imply . Thus in the global order. Since and preserves , this positive root lies in . Now is negative by step 1.1 applied to , so step 1.1 applied to gives , contradicting . Hence every , and therefore . Let be the last root of at or below ; it exists since is such a root, and . Then , so lower-rank induction gives , full-dimensional and convex in .
Initial cone and its facets. Let . By [F7], , so it is a full-dimensional convex cone. The base support is ; each other facet has support for a positive root by step 2.3. It contains the apex, so . If and , step 2.1 gives two roots of on opposite sides of , contradicting that it supports the cone. Hence every side facet is labelled by a or a root . The inequalities have positive sign on by [F3], the base apex inequality is positive on and zero on , and each later-root inequality is nonpositive on all vertices of the prefix. The finite facet test of step 1.3 therefore gives . With the reverse inclusion from step 1.4, equality holds at ; the same facet argument records that any other listed halfspace not defining one of these facets is redundant.
The new prefix is by [F7], so its cone is with . Apply step 2.3 to each facet of ; every facet of is supported by or by for . Each side facet contains , so . If and is not a -root, step 2.1 produces two vertices of on opposite sides of , contradicting support. Thus every facet label is a , , or a root . Its containing halfspace is respectively , , or , by the sign inequalities in [F2]-[F3]. The cone satisfies all these facet halfspaces; step 1.3 therefore puts it in . Its other half equals . Consequently . The reverse containment follows from step 1.4, proving . The active-facet list is a subset of the defining inequalities; any omitted or repeated inequality is recorded as redundant.
Endpoint. The induction ends at , where . Thus the endpoint equality gives both the full positive-root cone and the claimed intersection with and the halfspaces.
Spherical convexity. The cone is convex, and every nonzero vector in it lies in the common open halfspace of the positive roots by [F7]. For unit vectors in its sphere section, write . If the arc is constant. Otherwise put , so and . The shorter great-circle arc is for . Its coefficients are nonnegative, so lies in the convex cone and has unit norm. This proves spherical convexity.
Since and are full subcomplexes of the finite complex , every face cone of their intersection is a common face. If a point belongs to both and , it lies in cones and for faces in the respective subcomplexes; [F11] identifies their intersection with , which lies in the cone of the common subcomplex. Intersecting the resulting cone equality with proves the realization identity in (3). All inductions are finite and use no Choice. The theorem does not assert a meet of moved spaces or the lattice property of .
Depends on
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma)
- 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 Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations
- 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
- 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
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- 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
- Real and complex inner-product spaces and their induced length
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
Used by
Cited to discharge well-definedness by The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations.
Dependency tree · two levels
89 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)