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.
Bipartite Coxeter Elements and Ordered Root Complexes
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chains, Antichains, Sperner and Dilworth
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Finite Reflection Length and Orthogonal Moved Spaces
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Spherical Simplex Metrics, Angular Links, and Cones
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page constructs the ordered positive-root model for an irreducible finite Coxeter group and proves the geometry of its root complex. The companion bipartite-coxeter-elements-and-ordered-root-complexes-examples gives explicit rank-two and type- calculations.
Bipartite data and root order
The tree Coxeter diagram splits into two commuting color classes. The page's first item defines their Coxeter element, cyclic simple-root and dual-vector recursions, and the conditional map , with . The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id proves the Coxeter-plane angle, the positive-root enumeration , and invertibility of . The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] proves the -root sign and vanishing rules and constructs the canonical simple systems and increasing reduced tuples for every .
The ordered root complex
The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations defines from its ordered two-root compatibility relation, then defines the full subcomplexes , their inclusive root prefixes, and positive-cone realizations. It makes no geometric claim. The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) proves the exact factorization and zero-pairing criterion, independence of simplex roots, the prefix link rule, and common-face intersections of geometric cones.
The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| proves the separating-root lemma and the rank-and-prefix facet induction. Each transported facet normal is computed from ; the proof identifies its sign and excludes unsupported earlier roots. At the endpoint, is the positive-root cone cut out by the canonical halfspaces, so its unit-sphere section is spherically convex. The theorem also records the exact realization intersection identity and explicitly abstains from asserting that arbitrary moved-space intersections are meets or that is a lattice.
Prerequisites
The reading path places finite-reflection-length-and-orthogonal-moved-spaces, finite-lattice-projections-and-coxeter-chain-labels and spherical-simplex-metrics-angular-links-and-cones before this page. The first supplies the reflection-length and orthogonal moved-space framework; the second is the earlier lattice and chain-label context; the third supplies the spherical Gram-simplex result used to identify each face-cone section in step 4.1 of item 20. Item-level inputs are recorded in the authored items and their batch manifest.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
Definition
For the irreducible case, let be a finite-type Coxeter system with finite of cardinality , length function , Coxeter diagram and standard parabolics (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups); let , let be the Coxeter form with (The real Coxeter form, its radical, reflections, and form-preserving maps, Descent of the reflection representation, unit root norms, and conjugation of reflections (3)), and let , and be the canonical reflection representation, the root system and the reflection set (The canonical reflection homomorphism, roots, reflections, and the positive cone); assume is connected, equivalently is irreducible (Coxeter diagrams: edges, labels, components and finite type). The form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite). Write for the simple roots and for the reflection with normal . Clause (5) separately specifies the componentwise extension to reducible finite-type systems.
(1) The bipartition. is connected and has no cycle, hence is a tree (Exclusions for positive definite diagrams: trees, valency, labels, chains and arms (2)); a tree has a bipartition, i.e. there is a partition with for all distinct in the same part (A bipartite graph and a proper two-colouring of its vertices, A finite graph is bipartite if and only if it has no odd cycle). Concretely, fix , let be the set of vertices at even distance from in and the set at odd distance, and note that the pair is determined up to interchanging the two classes. Choose such a bipartition and order the simple reflections and their simple roots as , with corresponding simple reflections and reflections , so that and for . For distinct in either class, ; the Coxeter relators therefore imply (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). Thus the products and do not depend on the order of their factors, and
are well defined ( is finite, so ). For one has , , , , and ; empty products are . For both classes are nonempty because is connected.
(2) Cyclic indexing. Read subscripts of , , and cyclically modulo : , , , and for the dual family below. The cyclic indexing of the is part of the convention: it is what makes the vector below well defined for every (see (3)).
(3) Prefix roots and dual vertices. Let be the Gram matrix. It is invertible: for , the basis property gives , so . Set ; symmetry of gives . These vectors are unique, since a vector orthogonal to every basis vector is orthogonal to itself and hence is zero by positive definiteness. Thus is the -dual family of . Define, for every integer ,
the empty product for being the identity. Put . The recursions and (valid for all ) follow by separating the first factors and using cyclic indexing; they are also recorded in The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id ↗.
(4) The conditional vector map . For put
defined only if the linear map is invertible (Invertible linear maps, linear isomorphisms, and inverse linear maps). This definition asserts neither the invertibility of nor the identity ; both are proved in The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id ↗, the recorded justifier of this definition. Once defined, is a linear map on all of , with for every and for all and , since commutes with .
(5) Reducible and empty systems. For a finite-type system with connected components , apply (1)--(4) to each irreducible factor , where (Disconnected diagrams, direct products, and comparison of invariant forms). With component bipartitions , let be the resulting group elements and . The product is a product of the simple reflections in every component. Under the direct-product decomposition, exactly when for every , so its order is . Choose a block order of the components and list the root and dual-vector families in that order. The operator is the direct sum of ; as in (4), the map is defined exactly when every is invertible, and then is their direct sum. For one has , , , (the empty lcm is ), and empty root and dual-vector families; the unique endomorphism of is invertible, so is that unique map. No single number is claimed for reducible systems whose components have unequal Coxeter numbers.
(6) Abstentions. Each is a root by definition, since and . This item does not assert that the first roots enumerate the positive roots, any sign pattern for , or a spherical realization of the ordered root complex; those are proved by later items in this pair. No Choice is used.
The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
Statement
Let be an irreducible finite-type Coxeter system with , with bipartition and data , , , , and conditional map as in The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a. Put , so and . Let denote the linear action of , let be the primal chamber in and its interior, and let be the root hyperplanes (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). Write for the longest element (The longest element as the opposition of the chamber, and longest elements of finite parabolics). Then:
(1) The Coxeter-plane eigenvector. The matrix has nonnegative entries, zero diagonal, and connected nonzero off-diagonal pattern. There are and with , and .
(2) The invariant plane and chamber sector. Put , , and . Then , , , the plane is invariant under , and , and
Thus is a rotation through , where . The intersection is a sector of angle whose relative interior lies in ; it contains a point with trivial -stabiliser. The restrictions of and generate a dihedral group of order on . Its translates of are exactly the full-dimensional chamber sections : they are the sectors cut out by the root-hyperplane traces, with pairwise disjoint relative interiors. The set of traces is exactly the set of reflection lines of this dihedral action.
(3) Enumeration of the roots. Every is a root, for all , and
with all listed roots pairwise distinct; hence the sequence has exact period . Moreover . If is even then . If is odd then is even, , and . Accordingly, the word
is a reduced expression of of length , with prefix roots exactly in this order.
(4) Invertibility of the linear action minus the identity. The operator is invertible. Consequently the conditional map from the preceding definition is defined on all of and satisfies for every .
For the conclusions are direct: , and . Reducible systems are handled componentwise using the preceding definition's clause (5), and no uniform count is asserted for unequal component Coxeter numbers. No Choice is used.
Facts & Assumptions
Given: An irreducible finite-type Coxeter system with , 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 operator , the positive definite space with root system and reflection set , and the transferred primal chamber and root hyperplanes .
The defining data have connected, , , pairwise orthogonal simple roots within each class, and , for every . The vectors satisfy . The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1)-(3)
is positive definite, is faithful and preserves , and every root satisfies ; for each , is the reflection . Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Descent of the reflection representation, unit root norms, and conjugation of reflections (1)-(3), The root-length criterion and faithfulness of the canonical reflection representation (3)
The roots split as with and consists exactly of the roots with nonnegative simple-root coordinates; each sends to and permutes . Root sign coherence and the action of simple reflections on positive roots (1)-(3)
The transferred chamber is with interior defined by strict inequalities; the chambers tile with disjoint interiors, and a point in has stabiliser . In particular a point of has trivial stabiliser, and a point in the relative interior of has stabiliser . The interior of every chamber is disjoint from every root hyperplane, and . 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 (1),(3)
For every and , if and only if . The root-length criterion and faithfulness of the canonical reflection representation (1)
The longest element satisfies , , , and it is the unique element of length . The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii)-(iv)
The map , , is a bijection, , and exactly when . Thus root hyperplanes are in bijection with . The inversion formula , the root-reflection dictionary and strong exchange (1)(i)-(iv)
The coordinate norm and inner product are the standard Euclidean ones on . For the coordinate unit sphere is nonempty (it contains each simple basis vector ) and compact. The identity map is continuous, and a linear map is continuous because for some . The inner product of continuous vector-valued maps is continuous, so is continuous; every continuous real-valued function on a nonempty compact subset of attains a maximum. The real Coxeter form, its radical, reflections, and form-preserving maps, The Euclidean inner product on , Every Euclidean linear map has a unique matrix and satisfies for some , A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions (3), For , every Euclidean closed ball and every Euclidean sphere of positive radius is compact, For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent (4)
For a reducible diagram with components , is the direct product of the and is their orthogonal direct sum; the root, reflection and bipartite constructions are componentwise. Disconnected diagrams, direct products, and comparison of invariant forms, Coxeter diagrams: edges, labels, components and finite type
Proof
Write for the standard coordinate norm and set . If for distinct , then , contradicting positive definiteness; hence every off-diagonal Coxeter exponent is finite. Therefore and for , with exactly on the edges of the connected diagram. Also for every nonzero .
For , the first prefix vectors satisfy for and for : the earlier reflections in the same color class fix , while each reflection in the other class adds its and fixes the other roots of that class. Hence the coordinate matrix of relative to the ordered basis is block upper triangular with identity diagonal blocks, so these vectors form a basis. The cyclic definitions give and for every , because each block of reflections has product . Each is a root, being the image of a simple root by an element of .
The unit sphere for is compact, so attains a maximum there; normalizing for an edge gives a positive value of , so , and step 1.1 at a maximizer gives . Let be a unit maximizer. For with , maximality at gives for every real . If , a sufficiently small of the same sign makes the linear term dominate the quadratic term, a contradiction. Thus is orthogonal to every , so it is a multiple of ; pairing with gives .
For , duality gives for every , so for every and in particular . Also . Thus , so .
Since every entry of is nonnegative, , while , so is also a maximizer and satisfies by step 2.1. Put . If and , then ; since and the edge graph of is connected, positivity propagates to every coordinate. Thus we may take , proving the existence claim in (1).
The vectors form a basis by the construction in the preceding definition, and form a basis by 1.2; thus 2.2 shows that maps one basis to the other up to the nonzero scalar , so it is invertible. If with and , then the cyclic recursions in F1 and the identity in 2.2 give . Applying the conditional map of the preceding definition now yields for all , proving (4) and the definition's well-definedness justification.
Put . Since distinct simple roots in either color class are orthogonal, and . Multiplying the eigenvector equations by and summing over gives ; summing the equations indexed by gives the same left side equal to , hence . Finally . The Gram matrix on is with determinant , so are independent and is a plane.
For , fixes for and negates ; the corresponding statement holds in . For , the commuting reflections in give , and for , . Summing with coefficients and and using yields , , , and . Thus is invariant under and .
In the basis , , , and . The vectors and are -orthonormal, and direct substitution gives . With these coefficients are and ; since preserves and has determinant on , it is the rotation through .
For , one has for and for . Thus is given by and ; because , these inequalities imply , and their strict versions place the relative interior in . Its boundary rays are (the simple-root hyperplanes) and (the simple-root hyperplanes). Their squared -norms are both and , so the sector angle has cosine and equals . The restrictions of and are reflections in the lines and : they fix those lines, are involutions, and are nonidentity on by 4.1.
Let be the order of . Since it rotates through , and for an integer with and . The subgroup consists of the distinct rotations and the distinct reflections , so . Distinct elements of have lifts with distinct restrictions to , hence are distinct elements of ; by F4 their chamber interiors are distinct and disjoint. Thus the orbit of consists of distinct sectors of angle , each of the form , with pairwise disjoint relative interiors. Hence , so and ; equality shows the sectors cover . As by F1, the element fixes every point of , in particular a point of ; its stabiliser is trivial, so and . Thus and , completing (1) and the angle claims of (2).
For every root , the trace is a line: if , the nonidentity reflection fixes a point of , contradicting its trivial stabiliser; otherwise the nonzero linear functional restricts to a nonzero functional on the two-plane , whose kernel is a line. Each such line is a root-hyperplane trace and cannot meet the relative interior of any sector , because that relative interior lies in the chamber interior , which is disjoint from the arrangement. Conversely the two boundary lines of are traces of simple-root hyperplanes by 7.1, and their images under are root-hyperplane traces because permutes roots. These images are all the sector boundary lines: the sectors from 8.1 tile and have distinct boundary rays, while every root trace must be one of those lines because it cannot meet a sector interior. Opposite rays define the same line, so the traces are exactly distinct lines. The connected components of the complement of these lines are the sector interiors. Each component is connected and the ambient chamber interiors form a disjoint open cover of it, so it lies in one chamber interior. Conversely, if a full-dimensional chamber section contained points from two components, choose them in its relative interior; their segment lies in that relative interior by convexity and crosses a root trace, contradicting disjointness of chamber interiors from the arrangement. Hence the full-dimensional chamber sections are exactly the sectors.
The ray lies in the relative interior of the face , so its stabiliser is ; similarly the stabiliser of is . Every element of reduces to a product of a subset because its simple generators are commuting involutions; the subset products are distinct because their -images have different signs on the independent simple roots and is faithful by [F2]. The image of the product for acts by on and by on its -orthogonal complement, so its -eigenspace has dimension ; therefore it is a reflection exactly when , and the reflections in are precisely its simple generators. The same reasoning gives exactly reflections in . The distinct boundary rays from 8.1 alternate between the two types, so there are of each; conjugating the stabiliser count around them gives incidences between rays and ambient root hyperplanes. Each hyperplane contributes exactly two incidences because its trace is a line. Hence the arrangement has hyperplanes, so by the root-reflection correspondence of [F7].
If is odd, a semicircle from a point of to its antipode crosses each trace line once; since every root-hyperplane trace is one of these lines, it meets each ambient root hyperplane exactly once. The boundary-ray types alternate, so one type occurs times and the other times. Counting the hyperplanes met using 10.1 gives if the more frequent rays have type , and the same equation with and interchanged if they have type . Either equation gives . Thus is even and .
Choose the direction around the circle so that the first boundary ray of is . The rays then occur in the cyclic order and for : reflects across the boundary, while advances by two sector angles. The hyperplanes through are exactly for , and those through are exactly for , by the stabiliser counts and the description of the reflections in from 10.1. These are precisely the blocks and by the cyclic prefix definition in 1.2. The first rays carry hyperplanes: this is from complete color pairs when is even, and when is odd by 11.1. The opposite semicircle carries the other hyperplanes. Each half-turn list is pairwise distinct because every trace line meets that semicircle only once, and the listed hyperplanes in each boundary block are distinct simple-root images.
Fix . The first half-turn list of hyperplanes in 12.1 is pairwise distinct, so for every . For , put , with and ; for , , since otherwise applying would give . Each preserves the sign of every root other than by [F3], so and have the same sign. Since , descending induction gives for every .
Let . The word for even , or for odd , has exactly letters; in the odd case this uses from 11.1. Its prefix roots are by the cyclic definition, and these are positive by 13.1. At each step the root-length criterion therefore increases the prefix length by one, so the word is reduced and . By uniqueness of the longest element, , proving the formulas for in (3).
The full word represents and splits after its first letters, whose product is by 14.1. Its remaining -letter suffix also represents , so it is reduced. Every prefix of a reduced word is reduced; applying the root-length criterion at each next letter shows that every prefix root of this suffix is positive. Its corresponding global prefix root is obtained by applying and is therefore negative by [F6]. The second half in 12.1 has pairwise distinct hyperplanes, so these negative roots are pairwise distinct as well. Hence the first roots are all of because by [F6] and 10.1, and the second are all of . The first and second lists are disjoint by sign, giving pairwise distinctness of all roots; gives period , and that distinctness makes it exact. This proves (3).
In rank one, , , , , and , so the stated conclusions hold. For a reducible finite-type system, , , , the root systems and split over the components by [F9]; each rank-one or irreducible component satisfies the result just proved, so is a direct sum of invertible operators and the map and root enumeration hold componentwise. The total number of positive roots is , with no common formula asserted when the component orders differ. No Choice is used.
The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]
Statement
Let be an irreducible Coxeter system of finite type with finite of cardinality , with the data , , , , , , , , , and the linear map of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, and assume the conclusions of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (so that and ). Let , , , be reflection length, absolute order and the moved and fixed spaces, and let for , where is the reflection with normal (The inversion formula , the root-reflection dictionary and strong exchange (1), 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). Then:
(1) The basic identities. For every : , , and , i.e. ; moreover is one dimensional and is its unique vector satisfying .
(2) Sign and vanishing identities. (a) for all ; (b) whenever ; (c) for and all ; (d) whenever .
(3) Separation from earlier cones. If , then is not a nonnegative linear combination of .
(4) Canonical simple systems of the subintervals. Fix with , put and write in the global -order. Then:
(i) is the set of positive roots of the reflection subgroup , and it contains a simple system : every root of is a nonnegative linear combination of the 's and are linearly independent; moreover and, recursively, is the last root of lying in ; equivalently is the first root of in , with the product empty for , so in particular .
(ii) is a positive root for each , and
(iii) Let be the spherical simplex, where . Its closed spherical wall opposite is and its supporting hyperplane in is .
(iv) If and in the global order, then , so and commute; the reordering of in the global order satisfies and is lexicographically first among all increasing -tuples in for which and .
(v) If then is a simple system of , the only factorizations of as a product of two reflections in are , and while for ; dually, for distinct positive roots with one has: if then , and if then .
(vi) Whenever is an increasing tuple of roots of for which and , one has for every .
No Choice is used.
Facts & Assumptions
Given: The finite-type irreducible datum with 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 enumeration of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id, and an element .
with the pairwise distinct and , for all , where ; is invertible, , and . Hence . The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (1)-(4) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)
for all , and is -equivariant. For , : each preceding reflection fixes by duality. The pairing and fixed-line assertions of (1) are derived in step 1.1 below. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (4) The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (3)-(4)
is positive definite, every root has -norm , reflections act by , and . For each positive root there is a unique reflection with ; its moved space is . The real Coxeter form, its radical, reflections, and form-preserving maps (3) Descent of the reflection representation, unit root norms, and conjugation of reflections (2),(3) The inversion formula , the root-reflection dictionary and strong exchange (1) Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)
Positive roots have nonnegative simple-root coefficients, and for every and . Root sign coherence and the action of simple reflections on positive roots (1),(2)
Carter's formula gives ; iff ; implies ; if , then iff ; and is invariant under conjugation and satisfies the triangle inequality. Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)-(3)
On the positive-definite space , for orthogonal . For there is a unique orthogonal restriction with moved space , and every line is the moved space of the unique orthogonal reflection . For group elements, orthogonal order and reflection order agree by Carter's formula. 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 (1),(2)
In a reduced reflection factorization , the prefix-conjugated root normals form a basis of . Root normals inside the moved space, factorizations into reflections, and independent normals (3)
Every nonidentity has a reduced reflection factorization of length ; the factorization lemma also supplies a root normal in for its induction step. Root normals inside the moved space, factorizations into reflections, and independent normals (1)-(3)
The root arrangement is finite. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
For every nonzero point , its stabilizer is . In a finite Coxeter system the chambers are translates of the simplicial fundamental chamber, whose inward unit normals are its simple roots. The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1)-(3)
For a canonical rank-two system with finite exponent , the simple-root Gram entry is and the product of its two reflections is a rotation of exact order , through an angle of magnitude . Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)
No finite family of proper linear subspaces of a finite-dimensional real vector space covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
For a reduced simple-generator expression , every prefix-conjugated normal is a positive root. The inversion formula , the root-reflection dictionary and strong exchange (2)
is the Coxeter system of the restricted matrix, with intrinsic length equal to ambient length; every element of has a reduced expression using only letters of . If and , strong exchange expresses as a prefix-conjugate of one letter of any reduced expression of . Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)-(2) The inversion formula , the root-reflection dictionary and strong exchange (3)
Proof
For every , [F2] gives . Since is an isometry and , follows by expanding . The same identity gives , so and . For , the reflection word cancels to , so its reflection length is at most ; the triangle inequality and give the lower bound . Thus its fixed space is one-dimensional. Since , the same dimension holds for all . The vector is nonzero because , and it is the unique vector in that line with this pairing. This proves (1).
For all , . Indeed, by [F2], so , using the isometry of and [F1]-[F2]. This is (2)(a).
Suppose . If , then and -equivariance gives . Repeating reduces to a first index at most while keeping both indices positive and ordered. For , , and is the coefficient of in the positive root ; this is nonnegative by [F4]. Thus (2)(b) holds.
Every reflection lies below . Indeed, by [F1]. For a positive root , the orthogonal reflection with moved line is uniquely by [F3],[F6]; the Wall restriction for this line is below and has moved space . The Wall dimension identity and Carter's formula therefore give .
We use two elementary consequences of absolute order. First, if is a reduced reflection factorization and , then : distinct root-reflections have product moved space the two-plane spanned by their distinct normal lines, so their product has reflection length by Carter's formula. Write ; then , a product of reflections because conjugation preserves reflections. The triangle inequality forces this complement to have length . Second, if , then : write , with additive reflection lengths; then , while has the same length as , so . These facts will be used below.
Put and . Then is the pointwise stabilizer of , because . If , choose outside and every proper subspace ; this is possible by [F9] and [F12]. By [F10], for some . Each conjugate simple generator has a root hyperplane containing , hence, by the choice of , containing all of ; therefore every generator of this stabilizer fixes pointwise. Conversely every element fixing fixes , so . If , take and .
To prove (2)(c), first reduce modulo using -equivariance, which preserves , and assume . If , then and has no coefficient, so the pairing is zero. If , put , so . By (2)(a), , since is supported on . Now if and , (2)(d) is (2)(c) with ; if , (2)(a) and (2)(b) give . This proves (2)(c)-(d).
For every , one has . If , then by [F5]. Conversely, if , then by step 1.4 and , so moved-space rigidity in [F5] gives . Also spans : choose a reduced reflection factorization of ; its prefix-conjugated normals are a basis of by [F7], and the reflections with those normals have moved lines in , hence lie below by the same common-upper-bound argument. Taking the positive sign of each normal puts a spanning set in .
For any increasing tuple of positive roots, one has if and only if for all . If , the left side is by [F1], and the zero-pairing condition is vacuous; hence assume . Put . The length equality is equivalent to the reverse product being a reduced element below : its complement is . In fact, if , then and , so both inequalities are equalities; the converse is the defining absolute-order equality. For the forward implication, the pair-product fact in step 1.5 gives whenever . Since , this gives from ; hence . The vector is a nonzero member of the one-dimensional fixed space , so . Conversely, suppose all these pairings vanish. The matrix is upper triangular with diagonal by (1), so both the and the are linearly independent; in particular . Induct downward on to prove with length . The base is step 1.4. If , then each factor with satisfies : writing a reduced factorization , the product uses one fewer reflections, and the triangle inequality makes that expression reduced. Put . Complement order reversal from step 1.5 gives , so for every . These independent vectors form a basis of , whose dimension is by Carter's formula. The assumed zero pairings give . The Wall restriction for the line gives ; writing then gives , with lengths adding, so and . At this proves the claimed equivalence. The same argument applies to every subtuple because the vanishing conditions are inherited.
If with and , then (2)(d) gives for every , so , a contradiction. This proves (3).
Let be the intrinsic root system from [F14]; its representation is the restriction to , since the reflection formulas agree. An ambient reflection has a reduced -expression by [F14]. Apply strong exchange to : it expresses as a prefix-conjugate of a letter of that expression, so its root normal belongs to by [F3]. Conversely every intrinsic root gives an ambient reflection in . Conjugating by , the root-reflection dictionary therefore identifies the roots of with precisely the ambient roots whose reflections fix pointwise, namely by step 2.2. Their span is both and , since spans .
Choose and project it orthogonally to . Its pairing with every root of is positive by [F4], so it avoids the subsystem arrangement. Apply [F10] to the finite Coxeter system and transfer its chambers to by . The chamber containing the projection has inward unit normals for some . These are a basis of , their reflections are the conjugates of the simple generators of , and their Gram matrix is the restricted Coxeter Gram matrix. In particular distinct normals have nonpositive pairings. By the root-sign theorem [F4] applied to this conjugate Coxeter system, its positive roots are exactly the roots positive on the projection, hence , and every such root is a nonnegative combination of . This supplies the simple system and the Coxeter presentation used below.
In any such positive root subsystem with simple system , its first root in the global order is a member of . For if the first root were not simple, write with ; each is later than , so (2)(d) gives . Linearity of and (1) would give , impossible. Also the last root of belongs to : otherwise it is a nonnegative combination of the earlier simple roots, contrary to step 3.1.
We prove the recursive selection and the factorization by induction on . For , has rank one, has its single positive root , and . For , order the simple roots increasingly; step 4.2 makes the last one . Put . Since , write with ; then has length . Write with . The identity and the bounds and force , so . Also fixes pointwise, hence .
Let be the global index with and put . For every one has and, by (2)(a) and -equivariance, by (2)(b); at this is . Since , conjugating by gives ; and , so and . Moreover : its complement is , of length , while ; the lengths add to . Hence is contained in , and both have dimension because . Thus . The roots span by step 2.2. Each is a nonnegative combination of and is orthogonal to ; since and for every , every root in is a combination only of the for which . Those zero-pairing simple roots must span the -space , so they are exactly . They form a simple system for . Induction gives and proves the reverse selection at each rank. Therefore . For each , its prefix and complementary suffix multiply to and have at most and reflections, so both lengths attain these bounds. Thus , contained in , has dimension and equals that span. Since , the induction shows that is the last root of in this subspace.
The other recursive description follows by considering the suffix . The factorization in step 6.1 gives : its prefix and suffix factors together multiply to of length , and their lengths are bounded by their numbers of reflections, whose sum is . Writing , the same length equality forces , so has length and . If as above, then has length at most ; the triangle inequality forces equality, so . Its moved space is , since its factors fix the orthogonal complement of that span and its moved dimension is . Thus , and is a simple system for this subsystem: a root in the tail span has zero coefficients on in its nonnegative -expansion. By step 4.2 the first root of is a simple root of this tail system; its first simple root is . Finally by cancellation, so is the first root of in the moved space in (4)(i), and . This proves (4)(i).
Put and . The prefix has reflection length by the factorization of and the triangle inequality, so this simple-generator word in the Coxeter system of is reduced. The root-inversion formula [F13], applied to that parabolic system, gives , hence it is a positive root. Conjugation gives ; multiplying these identities and cancelling adjacent inverse prefixes yields . Also . This proves (4)(ii).
Suppose and . By (4)(i), and . Step 4.1 realizes this as a canonical rank-two system. If its exponent is , [F11] gives simple-root angle and a rotation of magnitude . Write its generators as and . The identities and reduce every word to or , ; their distinct actions are the rotations and reflections in lines spaced by . Every reflection is a conjugate of or : the conjugates give respectively and . The root-reflection dictionary thus gives positive roots, equally spaced between the simple-root rays. The global order agrees with angular order: a decrease after would put in the cone on earlier roots , contrary to step 3.1. A product of reflections has rotation angle twice the difference of its normal angles, modulo ; hence the two-reflection factorizations of are exactly . These exhaust factorizations in : if , then , and both spaces have dimension , so the positive representatives of lie in by step 2.2. The endpoint angle gives , while each adjacent angle gives .
Fix . The second factorization in (4)(ii) writes where is the product of the other simple reflections in . Thus , , and . Since with , is reduced, so . It follows that . The moved space is exactly : it is contained there because those are its reflection normals, and both dimensions are . Hence for . Since is a linear combination of , (1) gives . Thus the restrictions to of the functionals form the dual basis to . For with , ; intersecting the cone with this zero hyperplane and with the unit sphere proves the wall equality, and the supporting hyperplane in is . This proves (4)(iii).
If distinct positive roots satisfy , their product has reflection length and belongs to the rank-two case of step 8.1. Both roots lie in the corresponding by moved-space rigidity. If , the only increasing-order two-factorization in step 8.1 is the endpoint factorization, so . If , the factorization is one of the adjacent descending pairs, so . This proves (4)(v).
If and , the factorization is reduced, and the pair-product fact of step 1.5 gives . The rank-two sign result of step 9.1 gives . On the other hand, since distinct simple roots have nonpositive pairings by step 4.1, applying successively to yields a nonnegative combination of , and . Thus the pairing is zero, and the two reflections commute. Sorting the into global order uses only swaps of such inverted commuting pairs, so the product is unchanged and .
The tuple has reverse product of length , so it is among the tuples in (4)(iv). Let be any other such tuple. By step 2.3 every prefix also has reverse product below of length , so its roots are linearly independent. For each , every root with has : its pairing is nonnegative because is a nonnegative combination of and the restricted pairing functionals are dual to by step 8.2, while it is nonpositive by (2)(d). The restrictions to of the functionals are independent, again by the dual-basis property. Their common kernel in therefore has dimension . If , the independent roots all lie in that kernel, a contradiction. Hence for every , which proves componentwise domination (4)(vi) and the lexicographic minimality in (4)(iv). No Choice is used.
The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations
Definition
Let be an irreducible Coxeter system of finite type with finite, , and let , , , , , , , , , and be as in 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], so in the global order. Write for the reflection with normal and .
(1) The complex . Its vertex set is . For , join to by an edge exactly when . Let contain the empty simplex and every finite nonempty set of vertices whose every two-element subset is an edge. Thus is the abstract simplicial complex (An abstract simplicial complex) determined by this ordered edge relation.
(2) The subcomplexes . For , put and let be the full subcomplex of on the vertex set . For a positive root in the global order, let be the full subcomplex on vertices in that are less than or equal to ; thus has vertex set when .
(3) Positive cones and realizations. Every vertex is a unit vector. For a finite set of vertices define For a subcomplex put and , its positive-cone realization in the unit sphere. For and a positive root , write
(4) Abstentions. This definition does not assert that is nondegenerate for each simplex , that is a spherical simplex, that the cone realization embeds or any , or that these realizations are convex or have dimension . It also does not assert an equivalence between higher simplex membership and a single full-tuple product condition. No Choice is used.
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.
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 .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Thomas Brady and Colum Watt, Lattices in finite real reflection groups (arXiv:math/0501502, 29-page PDF)
- Robert Steinberg, Finite reflection groups, Transactions of the American Mathematical Society 91 (1959) 493-504 (AMS free digital archive, 12-page PDF)
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages)
- Sergey Fomin and Nathan Reading, Root systems and generalized associahedra, IAS/Park City Mathematics Series lecture notes (arXiv:math/0505518)