Regular cell complexes in total positivity

Fomin and Shapiro conjectured that the link of the identity in the Bruhat stratification of the totally nonnegative real part of the unipotent radical of a Borel subgroup in a semisimple, simply connected algebraic group defined and split over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathbb{R}}$\end{document} is a regular CW complex homeomorphic to a ball. The main result of this paper is a proof of this conjecture. This completes the solution of the question of Bernstein of identifying regular CW complexes arising naturally from representation theory having the (lower) intervals of Bruhat order as their closure posets. A key ingredient is a new criterion for determining whether a finite CW complex is regular with respect to a choice of characteristic maps; it most naturally applies to images of maps from regular CW complexes and is based on an interplay of combinatorics of the closure poset with codimension one topology.


Introduction
In this paper, the following conjecture of Sergey Fomin and Michael Shapiro from [11] is proven. This is done in Theorem 6.1. The result includes, for instance, the special case that the link of the identity in the Bruhat stratification of the space of upper triangular matrices with 1's on the diagonal whose minors are all nonnegative is a regular CW complex homeomorphic to a ball; more specifically, this is the collection of upper triangular, totally nonnegative matrices with 1's on the diagonal and entries immediately above the diagonal summing to a positive constant, stratified according to which minors are strictly positive and which are 0. The poset (partially ordered set) of closure relations is Bruhat order.
This positively answers the question below regarding synthetic Schubert varieties which appeared in a paper of Björner (see [4]), but was actually posed by Joseph Bernstein (personal communication, Anders Björner):

Question 1.2 It would be of considerable interest to know which (CW) posets can be reasonably interpreted as face posets of cellular decompositions of complex algebraic varieties, and whether there is a synthetic construction for doing so. In particular, can 'synthetic Schubert varieties' be naturally associated with the (lower) Bruhat intervals of any Coxeter group.
Results of Björner [4] combine with results of Björner and Wachs [6] to imply that each interval of Bruhat order is the closure poset of a regular CW complex. This is what led to Question 1.2. Fomin and Shapiro proved in [11] that the closure relations for Y w = u≤w Y ∩ B u are exactly those of the lower interval (1, w) in Bruhat order, they obtained substantial homological results regarding this space (especially in type A), and they formulated Conjecture 1.1. Lusztig interpreted Y w in [20] as the image of a continuous map f (i 1 ,...,i d ) given by a reduced word (i 1 , . . . , i d ) for w, which is the viewpoint we will take as well. The tools we develop in order to prove Conjecture 1.1 give a new approach to the general question of how to prove that the image of a map from a polytope (or slightly more general regular CW complex) which restricts to a homeomorphism on the interior but not necessarily on the boundary is a regular CW complex homeomorphic to a ball.
Motivation for studying these totally nonnegative parts Y w of varieties comes from a relationship observed by Lusztig to his theory of canonical bases. The change of coordinates map resulting from applying a braid move to a reduced word specifying a canonical basis is a tropicalized version of the corresponding change of coordinates for a totally nonnegative variety (cf. [20][21][22]). Trying to understand such changes of coordinates was also an inspiration for the theory of cluster algebras (see [2,13]). Our topological approach seems to give a somewhat new perspective on these changes of coordinates. The explicit collapsing maps we develop and use later will give quite explicit information about fibers of a map whose inverse has been the subject of considerable study (see e.g. [13] and the preprint [25]). For instance, we deduce connectedness of fibers indirectly, using our Theorem 1.3 below.
Our starting point was the following new criterion for determining whether a finite CW complex is regular with respect to a choice of characteristic maps. See Sect. 2 for a review of the requisite definitions. This result below gave us a route through which to approach Conjecture 1.1.
Conditions 1 and 2 below imply that the closure poset is graded by cell dimension, ensuring that the subsequent conditions make sense. Condition 3 is a combinatorial condition which (together with Condition 2) enables injectivity of attaching maps to be proven by an induction on difference in dimensions. Condition 4 gives the base case for this induction. Notably absent is a more general requirement of injectivity for the attaching maps.  3. Examples are also given in Sect. 3 demonstrating that each of Conditions 2, 3, 4, and 5 is not redundant. Condition 5 makes Theorem 1.3 seem likely to be applicable primarily to images of maps from regular CW complexes, which is indeed how we will use Theorem 1.3.
Our proof of Conjecture 1.1 relies critically upon the fact that condition 4, codimension one injectivity, follows easily in our setting from the exchange axiom for Coxeter groups (which is reviewed in Sect. 2). The analogous Coxeter-theoretic statement is not true in higher codimensions, seemingly demonstrating the efficacy of Theorem 1.3. One reason for interest in proving stratified spaces to be regular CW complexes is the appealing feature of regular CW complexes that their topological structure (homeomorphism type) is determined by the combinatorics of their posets of closure relations.
The proof of Conjecture 1.1 also involves the development of a combinatorial topological toolkit for performing a series of collapses on a convex polytope (which in our case is a simplex) in a manner that preserves regularity and homeomorphism type at each step. Each collapse reduces the number of cells by eliminating some cells and identifying other cells with each other. These collapses that we introduce in Theorem 4.21 (and its extension in Corollary 4.24) are much in the spirit of elementary collapses, but with a tighter control on the maps which enables us to preserve not just homotopy type but homeomorphism type as well. They resemble the process of Bing shrinking (cf. [3]) in that we extend collapsing maps across collars by giving paths of homeomorphisms deforming each collapsing map to the identity map. We specifically needed to develop a class of collapses that would only identify points having the same image under f (i 1 ,...,i d ) , while restricting ourselves to operations where we could control homeomorphism type and regularity. To this end, we collapse cells across families of curves which seem typical enough of fibers of maps of interest arising e.g. in combinatorial representation theory to be likely to be useful for other examples of interest as well.
While these collapses are topological in nature, we have gone to considerable effort to make the criteria one must check in order to use them as combinatorial as possible. This is done not only to help us with the proof of Conjecture 1.1, but also to facilitate possible future applications to other stratified spaces of interest in combinatorics and representation theory such as the double Bruhat decomposition for the totally nonnegative part of the Grassmannian or the totally nonnegative part of the flag variety, as discussed briefly in Sect. 1.2. Taken together, Theorem 1.3 and Theorem 4.21 provide a fairly combinatorial general approach to proving that images of sufficiently nice maps from polytopes are regular CW complexes homeomorphic to balls.
Another crucial ingredient in the proof of Conjecture 1.1 is the 0-Hecke algebra associated to a Coxeter group W . The relations of the 0-Hecke algebra capture in a completely natural way which faces of a simplex (indexed by subwords of a reduced word) map to the same cell under f (i 1 ,...,i d ) , and in fact provide a dictionary from the topology of point identifications to the combinatorics of cell identifications through suppression of a parameter. Checking the requirements for our collapses thereby translates to an analysis of properties of reduced and nonreduced words in this 0-Hecke algebra.
While f (i 1 ,...,i d ) itself is not a homeomorphism, we use the aforementioned collapses to construct a quotient space upon which the induced map f (i 1 ,...,i d ) will act homeomorphically, allowing us to understand its image based upon our understanding of this quotient space. These collapses eliminate exactly the faces of a simplex indexed by the subwords of a reduced word (i 1 , . . . , i d ) that are themselves non-reduced. Theorem 1.3 gives a way then to prove that the induced map f (i 1 ,...,i d ) on the resulting quotient space is a homeomorphism. This is what guarantees that no further identification is necessary once we have performed all of the identifications which the non-reduced subwords necessitate.
The remainder of the introduction gives a more thorough overview of the main ideas going into the proof of the Fomin-Shapiro Conjecture, including the new tools leading up to it, then briefly discusses other possible future applications of our approach. Section 2 provides background and terminology in topology, topological combinatorics, Coxeter groups and their 0-Hecke algebras, and in total positivity theory, respectively; readers might find it useful to read one or more of these background sections even prior to reading the proof overview. Sections 3 and 4 establish the key topological tools, namely Theorem 1.3 (our regularity criterion for CW complexes) and Theorem 4.21 (our method for collapsing cells), respectively. Section 5 develops combinatorial properties of the 0-Hecke algebra.
Then Sect. 6 pulls this all together in the (mainly combinatorial) proof of Conjecture 1.1, with the most difficult combinatorics appearing in Lemma 6.30. Theorem 6.32 assembles the various lemmas which together imply that the complex resulting from our series of collapses is indeed regular and homeomorphic to a ball. Finally, the Fomin-Shapiro Conjecture is proven in Theorem 6.34. Throughout the paper, we deliberately include a high level of detail, so as to help readers bridge between the combinatorics, topology, and representation theory.

Proof overview
Following Lusztig [20], we realize the stratified spaces Y w from Conjecture 1.1 as images of maps f (i 1 ,...,i d ) from polytopes (which in our case are simplices) to spaces of matrices.
Let (i 1 , . . . , i d ) be a reduced word for w ∈ W . Consider the surjective map f (i 1 ,...,i d ) : R d ≥0 → Y w sending (t 1 , . . . , t d ) to the product of matrices x i 1 (t 1 ) · · · x i d (t d ) where x i (t) = I n + tE i,i+1 in type A, and more generally x i (t) = exp(te i ) for e i a Chevalley generator. Lusztig proved that f (i 1 ,...,i d ) applied to R d >0 is a homeomorphism. On the other hand, f (i 1 ,...,i d ) is far from injective on R d ≥0 , due to the relations (a) x i (u)x i (v) = x i (u + v) and (b) the type A braid relations (b)x i (c) = x i+1 ( bc a+c )x i (a + c)x i+1 ( ab a+c ) for a, b, c > 0 and similar relations x i (t 1 )x j (t 2 )x i (t 3 ) · · · = x j (t 1 )x i (t 2 )x j (t 3 ) · · · of degree m(i, j ) in other types, where m(i, j ) is the order of s i s j and (t 1 , . . . , t m(i,j ) ) is obtained from (t 1 , . . . , t m(i,j ) ) by a change of coordinates map as in [20]. We study the image of f (i 1 ,...,i d ) restricted to the intersection of R d ≥0 with the hyperplane t i = 1, denoting this domain by R d ≥0 ∩ S d−1 1 . This has the benefit of being compact while already reflecting the full structure of the image of f (i 1 ,...,i d ) on domain R d ≥0 . This domain is a simplex, with faces specified by which parameters t i are positive and which are 0. Since x i (0) is the identity, it is natural to index the faces of the simplex by the subwords of (i 1 , . . . , i d ). Lusztig's result for R d >0 together with the above relations implies that f (i 1 ,...,i d ) restricted to the interior of a face is injective if and only if the subword of (i 1 , . . . , i d ) indexing that face is a reduced word.
The above relations will enable us to construct for any face of the simplex indexed by a nonreduced word a family of curves covering the face such that each curve lives in a single fiber of f (i 1 ,...,i d ) . These curves result from the relations x i (u)x i (v) = x i (u + v) either directly or after a suitable series of (long and short) braid moves. We will collapse each such non-reduced face across a family of such curves. While every nonreduced expression will admit a series of braid moves leading to such a "stutter" x i (u)x i (v), a serious challenge to be overcome is that the requisite long braid moves give change of coordinate maps which a priori are not even well-defined on the closures of the cells to be collapsed, let alone homeomorphisms on them.
We get around this by doing certain other collapses earlier than a collapse requiring long braid moves. Specifically, we choose the collapsing order so that earlier identifications in the boundary of a cell requiring long braid moves will ensure that the change of coordinates map will in fact be a well-defined homeomorphism on each closed cell to be collapsed just prior to its collapse. The key conceptual lemma behind these change of coordinates maps being homeomorphisms is Lemma 6.20, while the technical details are handled in Lemma 6.24.
To see which faces of the simplex should be identified with each other in this manner, we suppress parameters, replacing x i (t) by x i for each t that is positive, omitting the letters where t is 0. We thereby associate a so-called x-expression to each face. An examination of which x-expressions correspond to faces having the same image under f (i 1 ,...,i d ) yields the relations (1) Going beyond type A, we replace (2) and (3) by analogous long braid relations x i x j x i · · · = x j x i x j · · · of degree m(i, j ) for each pair of Coxeter group generators {s i , s j }. In this manner, the (unsigned) 0-Hecke algebra of the Coxeter group W emerges. Two faces of the simplex will have the same image under f (i 1 ,...,i d ) exactly when their x-expressions represent the same element of the 0-Hecke algebra, or equivalently, in the language of [18] if they have the same Demazure product.
In Sect. 4, we introduce a general class of collapsing maps which may be performed sequentially on a polytope, preserving homeomorphism type and regularity on the resulting quotient cell complexes at each step. Each such map is defined by first covering a polytope face with a family of parallel line segments across which the face is collapsed, or more generally in subsequent steps covering a cell to be collapsed with a family of curves which we call parallel-like (see Definition 4.7), due to their being the image of a family of parallel line segments under a map g with certain convenient properties (such as being a homeomorphism on the interior of the cell to be collapsed). The following simple example already captures much of the idea of our collapses. Example 1.4 Let 2 be the convex hull of (0, 0), (1, 0), (0, 1/2) in R 2 , and let 1 be the convex hull of (0, 0) and (1, 0) in R 2 . We will construct a surjective, continuous function h : R 2 → R 2 that acts homeomorphically on R 2 − 2 sending it to R 2 − 1 . The idea is to map parallel, vertical line segments covering 2 onto their endpoints in 1 , then take a neighborhood N of 2 , specifically a collar for R 2 − 2 , and define h in such a way that it stretches N to cover 2 by mapping extensions of the parallel line segments surjectively onto the extended segments. For Remark 1.5 See pp. 42-43 in Spanier [32] for a closely related, though fundamentally different, homeomorphism also given by explicit maps.
Each curve in a family of parallel-like curves will have one endpoint in a closed cell G 1 in the boundary of the cell F to be collapsed, and the other endpoint in another closed boundary cell G 2 . In Example 1.4, this is the segment from (0, 1/2) to (1, 0), and the segment from (0, 0) to (1, 0), respectively. The collapse given by this family of curves will map each curve to its endpoint in G 2 , stretching a collar for the closed complement of F within the boundary of a cell of dimension one higher than F so as to homeomorphically cover F by the part of this closed collar given by G 1 × [0, 1]. Convexity of each face of the polytope whose image we are studying will enable this stretching to be accomplished by a continuous map. Corollary 4.24 generalizes our collapsing maps somewhat beyond polytopes to help accommodate requisite changes of coordinates, using that these collapsing maps may be transferred from one regular CW ball to a homeomorphic one, provided that both have the same cell structure on the closed cell to be collapsed, with the homeomorphism of regular CW complex restricting to a cell structure preserving one on this closed cell.
To relate this to our main application, notice e.g. that {(t 1 , t 2 , t 3 ) ∈ R 3 ≥0 |t 1 + t 2 = k 1,2 and t 3 = k 3 } for the various choices of constants k 1,2 , k 3 adding to 1 give parallel line segments covering the simplex {(t 1 , t 2 , t 3 ) ∈ R 3 ≥0 | t i = 1} and comprising exactly the fibers of the map (t 1 , t 2 , t 3 All of our families of parallel-like curves will result either directly from stuttering pairs x i (u)x i (v) of consecutive letters in a non-reduced expression yielding such parallel line segments, or as families of curves obtained from such parallel line segments by the composition of a series of earlier collapsing maps (that restrict to homeomorphisms on the interior of the cell now under consideration) with the change of coordinate homeomorphisms given by the long braid moves used to create a stuttering pair.
We require the following properties for parallel-like curves: (1) Distinct initial points condition (DIP): the endpoints of the parallel-like curves in G 1 are distinct. (2) Distinct endpoints condition (DE): for each nontrivial curve in the collection, its endpoints in G 1 and G 2 are distinct, by virtue of open cells in G 1 and G 2 , respectively, not having already been identified with each other.
We also require a combinatorial property of the collapses themselves: • Least upper bound condition (LUB): whenever two cells are identified by the collapse of a cell that is a least upper bound for the pair of them just prior to the collapse, then all cells that are least upper bounds for them just prior to the collapse also get collapsed in that same step.
The condition (DIP) is needed for the collapsing map across parallel-like curves to be well-defined, since the endpoint of each curve in G 1 (along with the rest of the curve) is mapped onto the other endpoint of the curve, which is in G 2 . Condition (DE) will allow us to extend the parallel-like curves across a collar for the closed complement of the cell being collapsed within the boundary of a cell of dimension one higher, once we prove such a collar exists. The proof that regularity is preserved under our collapses relies heavily on (LUB).
Collapses meeting the more precisely formulated versions of these conditions given later will automatically meet a further condition we call the inductive manifold condition, namely that the closure of the complement of an i-cell within the boundary of an (i + 1)-cell is a compact topological manifold with boundary, hence has a collar. This will allow us to extend the collapsing map for a low dimensional cell F from a low-dimensional subcomplex where it is most naturally defined to our entire complex; this extension process in based upon the existence of requisite collars together with the fact that our particular collapsing maps admit approximations by homeomorphisms; in fact, we use that each comes with a path of homeomorphisms to the identity map, enabling each collapsing map to be deformed to the identity map across the layers of a collar.
Checking the above conditions for a family of curves covering a cell to be collapsed in our main application will rely on a combinatorial analysis of which cells have been identified with each other at the time of each collapse. In preparation for these combinatorial arguments, we develop in Sect. 5 properties of the 0-Hecke algebra, based mainly on the following convenient notion: we say that a pair of letters {i r , i s } for r < s in a non-reduced word (i 1 , . . . , i d ) is a deletion pair if (i r , . . . , i s−1 ) and (i r+1 , . . . , i s ) are both reduced while (i r , . . . , i s ) is non-reduced. The 0-Hecke algebra lacks a cancellation law, adding to the challenge of working with it. However, focusing on deletion pairs will enable some critical properties of Coxeter groups to be transferred to the 0-Hecke algebra, using the fact that reduced expressions in the 0-Hecke algebra are exactly the reduced expressions in the associated Coxeter group. Section 6 gives a particular series of cell collapses, performed sequentially on a simplex R d ≥0 ∩ S d−1 1 , to produce a regular CW complex (R d ≥0 ∩ S d−1 1 )/ ∼ homeomorphic to a ball. The guiding principle behind our choice of ordering is that we want a collapsing order amenable to proof by induction on d. This will allow us to assume all our results for smaller d; this guarantees when we perform a long braid move on the expression associated to a face to be collapsed that all possible identifications based on subexpressions of the expression to be braided will have already been done. To this end, we collapse faces in an order consistent with linear order on the position of the right endpoint of the leftmost deletion pair in the (highest priority) x-expression representing that face. This implies at the time of the collapse of a face whose leftmost deletion pair is {i r , i s } that all possible point identifications based on letters strictly to the left of position s will have already been done, so that we may apply braid moves to the segment from positions r through s − 1 so as to create a stutter with the letter at position s.
In this manner, we collapse away all faces of the simplex indexed by nonreduced words based on point and cell identifications which are clearly necessary. However, this still leaves the challenge of proving that these identifications are enough, that there are no remaining instances of two points mapping to the same place under the induced quotient space map f (i 1 ,...,i d ) . This is where we turn to Theorem 1.3, to prove that f (i 1 ,...,i d ) is indeed a homeomorphism from (R d ≥0 ∩ S d−1 1 )/ ∼ to Y w . Corollary 3.9 sets up the framework in which Theorem 1.3 will be used, both in this paper and most likely in other applications as well. It focuses on images of maps from regular CW complexes having a maximal cell, with the further requirement that the map be a homeomorphism on this open big cell. It singles out conditions 3 and 4 of Theorem 1.3 to be checked for the particular application, with conditions 1, 2 and 5 then following automatically from the general set-up.
In the setting of the Fomin-Shapiro Conjecture, condition 3 is immediate from the result of Björner and Wachs that Bruhat order is thin and shellable [6]. The idea we will use in Lemma 6.33 to verify condition 4 is as follows. Given a reduced expression s i 1 · · · s i d , the Coxeter group element obtained by deleting a single letter s i u cannot be the same as the Coxeter group element obtained by deleting a letter s i v for u = v. This combines with Lusztig's result that f (i 1 ,...,i d ) restricts to a homeomorphism on the interior of a cell indexed by reduced word (i 1 , . . . , i d ) to allow us to verify codimension one injectivity. The point is that approaching the boundary of a cell by letting a single parameter t i go to 0 as opposed to approaching the boundary by letting a different, individual parameter t j go to 0 must give points in distinct cells, hence distinct points.
We will use the map ..,i d ) along with its restriction to various closed cells as the characteristic maps with respect to which we will prove that Y w is a regular CW complex. Our results will imply that ∼ identifies exactly those points having the same image under Lusztig's map f given by any reduced word (i 1 , . . . , i d ) for w ∈ W . We will prove in Theorem 6.34

Potential further applications
Lusztig and Rietsch have studied a combinatorial decomposition for the totally nonnegative part of a flag variety, namely the decomposition into double Bruhat cells (cf. [20] and [28]). Lusztig proved contractibility of the entire space in [20] while Rietsch and Williams proved contractibility of each cell closure in [30]. Williams conjectured in [35] that this is a regular CW complex homeomorphic to a ball. It seems quite plausible that Theorem 1.3 together with tools from Sect. 4 could also be used to prove that conjecture, though we believe that significant further new ideas would also be needed.
Rietsch determined the closure poset of this decomposition in [28]. Williams proved in [35] that this poset is shellable and thin, implying it meets Condition 3 of Theorem 1.3. Postnikov, Speyer and Williams proved in [26] in the case of the Grassmannian that its double Bruhat decomposition is a CW decomposition; Rietsch and Williams subsequently generalized this to all flag varieties in [29]. In each case, it remains open whether these CW complexes are regular and whether the spaces themselves are homeomorphic to balls. Remark 1. 6 Williams' conjecture is related to Conjecture 1.1 in that the stratified spaces we prove to be regular CW complexes arise as links of cells in the double Bruhat stratification of the flag variety. However, Williams' conjecture does not imply Conjecture 1.1 since links of cells in regular CW complexes are not always themselves regular. Consider e.g. the double suspension of a Poincare homology 3-sphere with a big cell glued in (personal communication, Anders Björner).
In the case of an arbitrary flag variety, the preimage polytope that has been constructed in [29] is quite abstract, guaranteed to exist by properties of canonical bases. In the special case of the Grassmannian, much more explicit combinatorics is known about Postnikov's polytope of plabic graphs as well as the map from this polytope to the totally nonnegative part of the Grassmannian (see [25]).

Background and Terminology
Now we collect together basic terminology and facts from topology, combinatorics, the theory of Coxeter groups, and total positivity theory that will be essential to this paper. See e.g. [4,5,7,15,16,20,24,31,32], or [33] for further details.

Background in topology
Definition 2.1 A CW complex is a space X and a collection of disjoint open cells e α whose union is X such that: (1) X is Hausdorff. The following (which appears as Theorem 38.2 in [24]) will enable us to build CW complexes by induction on dimension.

Theorem 2.3
Let Y be a CW complex of dimension at most p − 1, let B α be a topological sum of closed p-balls, and let g : Bd(B α ) → Y be a continuous map. Then the adjunction space X formed from Y and B α by means of g is a CW complex, and Y is its (p − 1)-skeleton. Definition 2.4 Let g : X → Y be a continuous, surjective function. Then the quotient topology on Y is the topology whose open sets are the sets whose inverse images are open in X. Say that g is an identification map if the topology on Y is the quotient topology induced by g.
The requirement needed for a continuous, surjective g : X → Y to be an identification map is automatic if X, Y are compact and Hausdorff, which will always hold for our upcoming collapsing maps. Next we review the notion of a collaring, since this will be critical to our general construction of cell collapses in Theorem 4.21. A proof of the following appears in [8] and in Appendix II of [34].

Theorem 2.8
If M is a compact, topological manifold with boundary ∂M, then M has a collar.
We will extend collapsing maps from low-dimensional cell boundaries in which they are most naturally defined to higher dimensional cells by proving existence of requisite collars and showing that our collapsing maps can be approximated by homeomorphisms, in fact constructing a continuous path of homeomorphisms from our collapsing map (which itself is not a homeomorphism) to the identity map.
Finally, we briefly recall from [14] the notion of link for Whitney stratified spaces, and we refer the reader to [14] for further details. Let Z be a Whitney stratified subset of a smooth manifold M, let N be a smooth submanifold which contains a given point p of Z and which is transverse to each stratum of Z containing p. Let B δ (p) be the closed ball of radius δ centered at p. Then the link, denoted L(p), of a stratum S at the point p is the set L(p) = N ∩ Z ∩ ∂D δ (p).

Definition 2.9
The closure poset of a finite CW complex is the partially ordered set (or poset) of open cells with σ ≤ τ iff σ ⊆ τ . By convention, we adjoin a unique minimal element0 which is covered by all the 0-cells, which may be regarded as representing the empty set.

Definition 2.10
The order complex of a finite partially set is the simplicial complex whose i-dimensional faces are the chains u 0 < · · · < u i of i + 1 comparable poset elements.
In this case, we say that the poset interval [u, v] has rank k. Recall that a finite, graded poset with unique minimal and maximal elements is Eulerian if each interval [u, v] has equal numbers of elements at even and odd ranks. This is equivalent to its Möbius function satisfying μ(u, v) = (−1) rk(v)−rk(u) for each pair u < v, or in other words the order complex of each open interval (u, v) having the same Euler characteristic as that of a sphere S rk(v)−rk(u)−2 . A finite, graded poset is thin if each rank two closed interval [u, v] has exactly four elements, in other words if each such interval is Eulerian.

Remark 2.11
The order complex of the closure poset of a finite regular CW complex K (with0 removed) is the first barycentric subdivision of K, hence is homeomorphic to K. In particular, this implies that the order complex for any open interval (0, v) in the closure poset of K will be homeomorphic to a sphere S rk(v)−2 .
In [4], Björner characterized which finite, graded posets are closure posets of regular CW complexes, calling such posets CW posets: Results of Danaraj and Klee in [9] give a convenient way to verify (2) for a finite, graded poset P , namely by proving P is thin and shellable.
Remark 2.13 Two finite CW complexes may have the same closure poset in spite of having very different topological structure, so proving that the closure poset of a stratified space is a CW poset gives evidences that the stratified space is a regular CW complex, but is not enough to determine topological structure of the stratified space itself. Definition 2.14 A convex polytope is the convex hull of a finite collection of points in R n , or equivalently it is an intersection of closed half spaces that is bounded.
For simplicial complexes and polytopes, the closure poset is often called the face poset. Let [σ, τ ] denote the subposet consisting of elements z such that σ ≤ z ≤ τ , called the closed interval from σ to τ . Likewise, the open interval from σ to τ , denoted (σ, τ ), is the subposet of elements z with σ < z < τ . A cell σ covers a cell ρ, denoted ρ ≺ σ , if ρ < σ and each z with ρ ≤ z ≤ σ must satisfy z = ρ or z = σ .
For a regular cell complex in which the link of any cell is also regular, (u, v) is homeomorphic to the link of u within the boundary of v, hence is homeomorphic to S dim(v)−dim(u)−2 . The stratified spaces we consider in our main application have closure posets that are the intervals of Bruhat order, which were proven to be thin and shellable by Björner and Wachs in [6]. An expression for a Coxeter group element w is a way of writing it as a product of simple reflections s i 1 · · · s i r . An expression is reduced when it minimizes r among all expressions for w, in which case r is called the length of w. An expression s i 1 · · · s i d may be represented more compactly by its word, namely by (i 1 , . . . , i d ). Breaking now from standard terminology, we also speak of the wordlength of a (not necessarily reduced) expression s i 1 · · · s i r , by which we again mean r. Given simple reflections s i , s j , define m(i, j ) to be the least positive integer such that (s i s j ) m(i,j ) = 1.
The following basic lemma will be key to our proof that the complexes Y w satisfy Condition 4 in our CW complex regularity criterion: 16 Given a reduced word s i 1 s i 2 · · · s i r for a Coxeter group element w, any two distinct subwords of length r − 1 which are both themselves reduced must give rise to distinct Coxeter group elements.
We include a short proof of this vital fact for completeness sake.
Proof Suppose deleting s i j yields the same Coxeter group element which we get by deleting s i k for some pair 1 ≤ j < k ≤ r. This implies s i j s i j +1 · · · s i k−1 = s i j +1 · · · s i k−1 s i k . Multiplying on the right by s i k yields contradicting the fact that the original expression was reduced.
The expression s 1 s 2 s 1 in the symmetric group demonstrates that the statement of the above lemma no longer holds if we replace r − 1 by r − i for i > 1. Thus, it really seems to be quite essential to our proof of the Fomin-Shapiro Conjecture that Theorem 1.3 enables us to focus on codimension one cell incidences. Lemma 2.17 (Exchange Condition, [16]) Let w = s 1 · · · s r (not necessarily reduced) where each s i is a simple reflection. If l(ws) < l(w) for some simple reflection s = s α , then there exists index i for which ws = s 1 · · ·ŝ i · · · s r . In particular, w has a reduced expression ending in s if and only if l(ws) < l(w).
Given a (not necessarily reduced) expression s i 1 · · · s i d for a Coxeter group element w, define a braid-move to be the replacement of s i s j s i · · · by s j s i s j · · · yielding a new expression for w by virtue of a braid relation (s i s j ) m(i,j ) = 1 with i = j . Define a nil-move to be the replacement of a substring s i s i appearing in consecutive positions by 1. We call braid moves with m(i, j ) = 2 commutation moves and those with m(i, j ) > 2 long braid moves. (1) Any expression s i 1 s i 2 · · · s i d for w can be transformed into a reduced expression for w by a sequence of nil-moves and braid-moves.

(2) Every two reduced expressions for w can be connected via a sequence of braid-moves.
The Bruhat order is the partial order on the elements of a Coxeter group W having u ≤ v iff there are reduced expressions r(u), r(v) for u, v with r(u) a subexpression of r(v). Bruhat order is also the closure order on the cells B w = B − wB − of the Bruhat stratification of the reductive algebraic group having W as its Weyl group.
Associated to any Coxeter system (W, S) is a 0-Hecke algebra, with generators {x i |i ∈ S} and the following relations: for each braid relation s i s j · · · = s j s i · · · in W , there is an analogous relation x i x j · · · = x j x i · · · , again of degree m(i, j ); there are also relations x 2 i = −x i for each i ∈ S. In our set-up, we will need relations x 2 i = x i , but this sign change is inconsequential in our setting, so refer to the algebra with relations x 2 i = x i as the (unsigned) 0-Hecke algebra of W . This variation on the usual 0-Hecke algebra has previously arisen in work on Schubert polynomials (see e.g. [12] or [23]). We refer to x 2 i → x i as a modified nil-move. It still makes sense to speak of reduced and non-reduced expressions, and many properties (including Lemma 2.16 and Theorem 2.18) carry over to the 0-Hecke algebra by virtue of having the same braid moves; there are important differences though too, largely resulting from the lack of inverses and a cancellation law.

Background in total positivity theory
Recall that a real matrix is totally nonnegative (resp. totally positive) if each minor is nonnegative (resp. positive). The totally nonnegative part of SL n (R) consists of the matrices in SL n (R) whose minors are all nonnegative. Motivated by connections to canonical bases, Lusztig generalized this dramatically in [20] as follows. The totally nonnegative part of a reductive algebraic group G defined and split over R is the semigroup generated by the sets for I indexing the simple roots. In type A, we have x i (t) = I n + tE i,i+1 , namely the identity matrix modified to have the value t in position (i, i + 1), and likewise, y i (t) = I n + tE i+1,i . More generally, x i (t) = exp(te i ) and y i (t) = exp(tf i ) for {e i , f i |i ∈ I } the Chevallay generators. In other words, if we let φ i be the homomorphism of SL 2 into G associated to the i-th simple root, then Let B + , B − be opposite Borel subgroups with N + (or simply N ) and N − denoting their unipotent radicals. In type A, we may choose B + , B − to consist of the upper and lower triangular matrices in GL(n), respectively. In this case, N + , N − are the matrices in B + , B − with diagonal entries all equalling one. The totally nonnegative part of N + , denoted Y , is the submonoid generated by {x i (t i )|i ∈ I, t i ∈ R >0 }. Let W be the Weyl group of G. One obtains a combinatorial decomposition of Y by taking the usual Bruhat decomposition of G and intersecting each open Bruhat cell We follow [20] in using the standard topology on R throughout this paper.
Fomin and Shapiro suggested for each u < w in Bruhat order that the link of the open cell Y o u within Y w should serve as a good geometric model for the Bruhat interval (u, w], namely as a naturally arising regular CW complex with (u, w] as its closure poset. They define lk(u, w) as we describe next.
Fomin and Shapiro introduced the following projection map π u : Fomin and Shapiro proved that each x ∈ Y ≥u has a unique expression as x = x u x u with x u ∈ N u and x u ∈ N(u). In light of results in [FS], π u (x) may be defined as equalling a sufficiently small sphere about x u (cf. p. 11 in [11]). Thus, points of lk(u, w) belong to cells Y u for u < u ≤ w, and closure relations are inherited from Y w . They proved that each of the proposed open cells in lk(u, w) is indeed homeomorphic to R n for some n.
Recall from [13,20], the relations (1) 3 = e and any t 1 + t 3 = 0. These are not difficult to verify directly. In [20], it is proven that there are more general relations of a similar nature for each braid relation (s i s j ) m(i,j ) = e in W , i.e., relations

Lemma 2.20
The new parameters after applying a braid relation will have the same sum as the old ones; moreover, this preservation of sum refines to the subset of parameters for any fixed x i .
Proof This follows from the description of x i (t) as exp(te i ), simply by comparing the linear terms in the expressions appearing in a braid relation.
Thus, our description of R d ≥0 ∩ S d−1 1 may be used even after a change of coordinates (as in Lemma 6.24) resulting from a braid relation.

A new regularity criterion for CW complexes
Before proving Theorem 1.3, the new regularity criterion, we first give a few examples demonstrating the need for its various hypotheses. It seems likely that this new criterion will mainly apply to images of regular CW complexes.
The CW complex consisting of a 2-cell with its entire boundary attached to a 0-cell violates condition 2 of Theorem 1.3. Condition 2 is designed also to preclude examples such as a CW complex whose 1-skeleton is the simplicial complex comprised of the faces {v 1 , v 2 , v 3 , e 1,2 , e 1,3 , e 2,3 }, also having a two cell with a nontrivial closed interval of its boundary mapped to v 2 and the remainder of its boundary mapped homeomorphically to the rest of the 1-skeleton.
Remark 3.2 In the latter example above, one may choose a different characteristic map which is a homeomorphism. Whether this can always be done for finite CW complexes graded by cell dimension and satisfying conditions 1, 3, 4, and 5 seems subtle at best, in light of examples such as the Alexander horned sphere: a ball which cannot be contracted to a point without changing the topology of its complement, since that is not simply connected.
The next two examples give non-regular CW complex satisfying conditions 1, 2, 4, and 5 of Theorem 1.3, but violating condition 3. The first example violates thinness, while the second one violates the requirement that open intervals of rank at least 3 be connected.  One might ask if condition 3 could be replaced by the requirement that the closure poset be Eulerian, i.e. whether this could replace the connectedness part of the requirement. Closure posets do have the feature that open intervals (0, u) with rk(u) > 2 are connected, by virtue of the fact that the image of a continuous map from a sphere S d with d > 0 is connected. However, there are Eulerian closure posets of CW complexes having disconnected intervals (u, v) with rk(v) − rk(u) > 2 (personal communication, Hugh Thomas). Still, it seems plausible that condition 3 in Theorem 1.3 might be replaceable by the Eulerian property for the closure poset, i.e. that this together with conditions 1, 2, 4, and 5 could imply regularity.
Next is a non-regular CW decomposition of RP 2 satisfying conditions 1, 2, 3, and 5 of Theorem 1.3, but failing condition 4.
Example 3.5 Let K be the CW complex having as its 1-skeleton the simplicial complex with maximal faces e 1,2 , e 2,3 , e 1,3 . Additionally, K has a single 2-cell whose boundary is mapped to the 1-cycle which goes twice around the Notice that this CW decomposition of RP 2 has the same closure poset as a 2-simplex, but the attaching map for the 2-cell is a 2 to 1 map onto the lower dimensional cells.
Finally, we give an example (due to David Speyer) of a CW complex with characteristic maps meeting conditions 1, 2, 3 and 4, but failing condition 5, though this CW complex is regular with respect to a different choice of characteristic maps. David Speyer also helped with the formulation of condition 5.  This motivates us to say that a finite CW complex is dimension-graded whenever it meets conditions 1 and 2 of Theorem 1.3. Now to the proof of Theorem 1.3.
Proof Conditions 1, 2, and 4 are each necessary tautologically. The necessity of 3 follows easily from the fact that a regular CW complex is homeomorphic to the order complex of its closure poset. To see that 5 is also necessary, note that if K is regular with respect to the characteristic maps {f α }, then e σ ⊆ e τ implies that f σ factors as Now to the sufficiency of these five conditions. We must prove that each attaching map f σ is a homeomorphism from ∂(B dim σ ) to the set of open cells comprising e σ \ e σ . Since K is a CW complex in which the closure of each cell is a union of cells, f σ must be continuous and surjective onto a union of lower dimensional cells, leaving us to prove injectivity of f σ and continuity of f −1 σ . However, once we prove injectivity, we may use the fact that any bijective, continuous map from a compact set to a Hausdorff space is a homeomorphism to conclude continuity of the inverse, so it suffices to prove injectivity.
If the attaching maps for K were not all injective, then we could choose open cells e ρ , e σ with dim(e σ ) − dim(e ρ ) as small as possible such that e ρ ∈ e σ and f σ restricted to the preimage of e ρ is not 1-1. Then we could choose a point z ∈ e ρ with |f −1 σ (z)| = k for some k > 1. By condition 4, dim(e σ ) − dim(e ρ ) must be at least 2. We will now show that the open interval (e ρ , e σ ) in the closure poset has at least k connected components, which by condition 3 forces [e ρ , e σ ] to have rank exactly two. The point is to show for each point p i ∈ f −1 σ (z) that there is an open cell e τ i ⊆ e σ such that p i ∈ ι(B dim e τ i ), and then to show for distinct points p i , p j ∈ f −1 σ (z) that the open cells e τ i , e τ j are incomparable in the closure poset. To prove the first part, take an infinite sequence of smaller and smaller balls about p i , which by condition 2 must each intersect f −1 σ (e τ ) for some e τ < e σ with dim e σ − dim e τ = 1; by finiteness of K, the preimage of some such e τ i is hit , hence e ρ ⊆ e τ i . We prove next that the collections of cells whose closures contain the various points in f −1 σ (z) must belong to distinct components of (e ρ , e σ ), yielding the desired k com- , contradicting the fact that f τ j restricted to the preimage of ρ is a homeomorphism. Thus, (e ρ , e σ ) has no comparabilities between cells whose preimages under f σ have closures containing distinct points of f −1 (z); in particular, (e ρ , e σ ) has at least k connected components, hence must be rank two.
Finally, we show that (e ρ , e τ ) has at least 2k elements, forcing k to be 1, by the thinness requirement in condition 3. This will contradict our assumption that k was strictly larger than 1. Lemma 3.8 provides the desired 2k elements by showing that for each of the k preimages of z, there are at least two open cells e τ in (e ρ , e σ ) with f −1 σ (e τ ) containing that particular preimage of z.
Proof Condition 2 ensures that the boundary of B dim e τ does not include any open (dim e τ − 1)-ball, all of whose points map are mapped by f τ into e ρ . In particular, each such ball containing x includes points not sent by f τ to e ρ . Since K is finite, there must be some particular cell e σ 1 such that points arbitrarily close to x within the boundary of B dim τ map into e σ 1 , implying x ∈ e σ 1 , with dim e ρ < dim e σ 1 < dim e τ . Thus, e ρ ⊆ e σ 1 and dim e σ 1 = dim e ρ + 1, just as needed. Now let us find a suitable e σ 2 . Here we use the fact that removing the boundary of e σ 1 from a sufficiently small ball B dim e τ −1 about x yields a disconnected region, only one of whose components may include points from e σ 1 . This forces the existence of the requisite open cell e σ 2 which includes points of the other component and has x in its closure.
We will actually use Theorem 1.3 within the following framework: Proof The restrictions of f to a collection of closures of cells of the (p − 1)skeleton give the characteristic maps needed to prove that the (p − 1)skeleton of f (K) is a finite CW complex. Now we use Theorem 2.3 to attach the p-cells and deduce that f (K) is a finite CW complex with characteristic maps given by the various restrictions of f .
Conditions 1 and 2 are immediate from our assumptions on f . If there are two open cells σ 1 , σ 2 in K (of dimension at most p − 1) with identical image under f , then the fact that σ 1 and σ 2 are both regular with isomorphic closure posets gives a homeomorphism from σ 1 to σ 2 preserving cell structure, namely the map sending each x to the unique y with f (y) = f (x). This allows us to use the embedding of either σ 1 or σ 2 in the closure of any higher cell of K to deduce Condition 5. We use that L is Hausdorff and that we have finitely many cells to deduce requirements (1) and (3) of CW complexes.
Although the requirements of Corollary 3.9 may seem quite demanding, Corollary 3.9 is well-suited to proving for a family of regular CW complexes that their images under f are also regular CW complexes by an induction on dimension. We will use Corollary 3.9 in our main application in the proof of Theorem 6.34, a key inductive result.

Topological collapsing lemmas
In this section, we introduce certain types of collapses that may be performed sequentially on a convex polytope, and we prove that these preserve homeomorphism type as well as the property of being a finite regular CW complex, though they do not preserve polytopality. In Theorem 4.21, we explicitly define the maps accomplishing these collapses. Then we give a relaxation of the requirements of Theorem 4.21 so as to enable the transfer of a parametrization function on curves in a closed cell σ meeting the requirements of Theorem 4.21 to a closed cell with the same cell structure in a different, homeomorphic regular CW complex which does not necessarily have the same cell structure outside of σ .
In preparation for these results, we first introduce some helpful properties a topological space or a map may have, with the commonality that in practice these properties may be verified using primarily combinatorics. In what follows, we will typically have a topological space X endowed with the structure of a finite, regular CW complex K. We denote this by X K and call X K a regular CW space. Denote by K/(ker g) the quotient space obtained from an identification map g on a topological space K by setting x ∼ y iff g(x) = g(y).
We begin by establishing the following convenient general notion of collapse which is much in the spirit of the concept of elementary collapse, but in fact will preserve homeomorphism type rather than just homotopy type. This section will then be devoted to developing a specific set of checkable conditions which will yield such a collapse. (2) g restricts to a homeomorphism from K \ L to K \ τ and acts homeomorphically on τ . (3) The images under g of the cells of K form a regular CW complex with new characteristic maps obtained by composing the original characteristic maps of K with g −1 : X K → X K for those cells of K contained either in τ or in (K \ L).
We call such a map g a collapsing map. Remark 4.2 will show that these collapses preserve homeomorphism type.
The collapse of a cell L often will also collapse other cells in its closure in the process.

Remark 4.2
The induced map g : X K /(ker g) → X is continuous by Remark 2.5, and it is bijective by how it is defined. Since K is Hausdorff and K/(ker g) is compact, we may conclude that g is a homeomorphism. Thus, face collapses preserve homeomorphism type.

Remark 4.3
If g is a collapsing map on X K , and h is a homeomorphism from the underlying space X to itself, then g • h, composing functions right to left, is a collapsing map as well.
For example, Remark 4.3 may enable a change of coordinates for convenience prior to a collapse. The following may also be helpful for controlling how such a homeomorphism such as a change of coordinates map may interact with subsequent cell collapses. Lemma 4.4 Suppose K 1 and K 2 are topological spaces, f is a homeomorphism from K 1 to K 2 , π 1 : K 1 → K 1 and π 2 : K 2 → K 2 are identification maps giving rise to quotient spaces K 1 / ∼ and Proof This follows easily from Proposition 13.5 in Chap. 1 of [7] by constructing a suitable commutative diagram. Remark 4.6 Convexity of P implies len is continuous, which in turn implies that p is also continuous on int(F ) and everywhere on F except at points comprising parallel line segments consisting of just single points, though here nearby parallel line segments also approach length 0. Moreover, if h is any homeomorphism from int(F ) to another topological space, then p • h −1 is also continuous.
Continuity of len will allow us to perform collapses across families of parallel-like curves, as defined next, according to a continuous function that stretches a collar to cover a face being collapsed. This stretching function is provided in Theorem 4.21.
i and there is a composition g i • · · · • g 1 of face collapses (cf. Definition 4.1) on K 0 such that: .
Remark 4.8 These conditions are designed so that they only need to be checked just prior to the k-th collapsing step for the curves covering a cell to be collapsed in the k-th collapse.
Notice that Definition 4.7, part (3), implies the curves are nonoverlapping except perhaps at their endpoints in g i • · · · • g 1 (G 2 ). Verifying (3) mainly requires showing curves have distinct endpoints in g i • · · · • g 1 (G 1 ), leading to the following: Remark 4.10 In practice, we will verify Definition 4.7, part (2), by verifying Condition 4.11 below; this suffices because g i • · · · • g 1 acts homeomorphically on each open cell not collapsed by any g j for j ≤ i.
We say that a curve is nontrivial if it includes more than one point. In our main application, and quite possibly in other future applications as well, the last condition will follow immediately from our set-up; more specifically, it will follow from how each collapse replace a pair of parameters t r k −1 and t r k by a single parameter equalling their sum. Next we give the ingredients that will allow us to extend our collapsing maps through collars, culminating in Condition 4.17 and Lemma 4.18.

Definition 4.13
Given a continuous, surjective function g i+1 : X → X, define an interpolating family of maps {g i+1,t |t ∈ [0, 1]} from X to X as a collection of maps with g i+1,0 = g i+1 and g i+1,1 = id, requiring (1) for each t ∈ (0, 1] that g i+1,t be a homeomorphism from X to X and (2) continuity of the map h i+1 : Remark 4.14 This notion of interpolating family of maps is almost exactly the topological notion of isotopy, except that our initial map g i+1,0 is not a homeomorphism. In our setting, g i+1,0 is a collapsing map which will admit approximations by homeomorphisms. Proof By definition, we must have 0 = a 1 < · · · < a k = 1 and 0

Lemma 4.16
If a collapsing map g i+1 on a regular CW space X K homeomorphic to a sphere gives rise to an interpolating family of maps {g i+1,t |t ∈ [0, 1]} on X K , then g i+1 extends to a collapsing map on any ball B having X K as its boundary, implying g i+1 (B) is a regular CW complex homeomorphic to a ball.
Proof Choose a collar X × [0, 1] for B, which exists by Theorem 2.8.  Next we show how to use collars to extend a collapsing map from the boundary of a low-dimensional closed cell to an entire cell complex. Proof First choose a series of cells τ = σ 1 , σ = σ 2 , σ 3 , . . . , σ k such that σ j ⊆ σ j +1 with dim σ j +1 = dim σ j + 1 for each j , letting σ k be the unique maximal cell of K. We are given g i+1 defined on ∂σ and will now describe for each 2 ≤ j ≤ k − 1 how to extend g i+1 from ∂σ j to σ j and then to ∂σ j +1 . Lemma 4.16 enables us to extend g i+1 from ∂σ j to σ j . If σ j is the big cell, we are done. Otherwise, choose σ j +1 with σ j ⊆ ∂σ j +1 and take a collar for ∂σ j +1 \ σ j within ∂σ j +1 , which exists by Condition 4.17 and Theorem 2.8. Use an interpolating family to extend g i+1 from σ j to ∂σ j +1 , defining the interpolating family as follows.
Assuming g i+1 has been defined on the first r − 1 collars in the above alternation, let g i+1 (x, t 1 , t 2 , . . . , t r ) = (g i+1,1−(1−t 1 )···(1−t r ) (x), t 2 , . . . , t r ) for each (t 1 , . . . , t r ) ∈ [0, 1] r , and let g i+1 act as the identity on all points of σ r (resp. ∂σ r+1 \ σ r ) not in our collar for σ r (resp. ∂σ r+1 \ σ r ) as well as for points that are in our collar but sit over points that were not in the collar at an earlier stage. Now to a condition that will be used to prove that our upcoming collapses preserve regularity:

Condition 4.19
Let g be an identification map on a regular CW space X K such that g maps cells onto cells, maps an open cell F onto one of its boundary cells, and acts homeomorphically on X K \ F . Then g satisfies the least upper bound condition (LUB) if for any pair of open cells A, B ⊆ F such that g(A) = g(B) and any face F that is a least upper bound for A and B in the closure poset just prior to the application of g, F is also mapped onto one of its boundary cells by g.
Remark 4.20 At each collapsing step, there will be one cell among those getting collapsed that has all other cells getting collapsed in the same step in its closure. (LUB) then implies for any pair of cells F, F which are both least upper bounds for cells σ and σ just prior to the collapse of F such that this collapse identifies σ with σ , then this step also collapses a larger cell having both F and F in its closure, doing so in a way that induces the collapses of F and F .
Next is the main result of this section, a topological construction showing how under certain (mainly combinatorial) conditions a regular CW ball admits a cell collapse (in the sense of Definition 4.1), hence admits an identification map preserving homeomorphism type and regularity. The result is phrased as an inductive statement so as to allow the performance of a series of such collapses by showing that after each collapse the conditions are preserved that are needed to apply the theorem again. The proof is largely devoted to defining explicitly a suitable continuous, surjective map based on a collection of parallel-like curves covering the cell to be collapsed. Figures 1  and 2 provide pictures that may be helpful to seeing what these maps are doing.

Theorem 4.21
Let K 0 be a convex polytope. Let g 1 , . . . , g i be collapsing maps with g j : X K j −1 → X K j for regular CW complexes K 0 , . . . , K i all having underlying space X. Suppose K i satisfies Condition 4.17 (IM) and that there is an open cell L 0 i in ∂K 0 upon which g i • · · · • g 1 acts homeomorphically and a collection C = {g i • · · · • g 1 (c)|c ∈ C 0 i } of parallel-like curves covering L i for L i = g i • · · · • g 1 (L 0 i ) ∈ K i . Then there is an identification map g i+1 : X K i → X K i+1 specified by C. If g i+1 also satisfies Condition 4.19 (LUB), then g i+1 is a collapsing map and K i+1 is a regular CW complex also satisfying Condition 4.17 (IM).
Proof We may assume L i is top dimensional in ∂K i , because otherwise we may choose a cell L in K i with dim L = dim L i + 1 and L i ⊆ ∂L , define the collapsing map on ∂L as described below, then use Lemma 4.18 to extend g i+1 to the entire complex. We will define g i+1 on ∂L in such a way that Lemma 4.16 will enable its extension to L .
We will construct a continuous, surjective function g i+1 that maps entire curves in C to points in G 2 (cf. Definition 4.7), thereby collapsing L i onto G 2 , and in the process identifying each point of G 1 with a point of G 2 ; g i+1 restricted to K i \ L i will be a homeomorphism. First we define an auxiliary family C of curves that covers not only L i but also a collar just outside its boundary. We will stretch these curve extensions from the collar to cover L i ; the introduction of additional curves within the collar will enable interpolation from the action of g i+1 on L i to the identity map outside this collar. Now to the details.
First consider any c ∈ C with c ∩ ∂(L i ) = {x, y} for points x ∈ G 1 and y ∈ G 2 . Extend c to include all points (y, t) and (x, t) for t ∈ [0, 1] to obtain a lengthened curve c . Since c 1 = c 2 for c 1 , c 2 ∈ C implies that c 1 and c 2 have distinct endpoints in G 1 by Definition 4.7, part 3, the curve extensions {(x, t)|t ∈ [0, 1]} given by the various points x ∈ G 1 are nonoverlapping. It will not matter if distinct c 1 , c 2 ∈ C have the same endpoint y ∈ G 2 , because g i+1 | G 2 ×[0,1] = ID. In this situation, let y × [0, 1] be part of both c 1 and c 2 .
Next consider any family F c of elements of C covering c × [0, 1] for some c ∈ C with c ⊆ ∂(L i ). The map here is designed so as to interpolate from the collapsing map needed in ∂L i to the identity map outside the collar. Points are represented as ordered pairs (c(t 1 ), t 2 ) for t 1 by appropriate scaling of the parameter, and g i+1 stretches , again by reparametrization by a suitable linear scaling factor. See Fig. 2. In other words, . Note that g i+1 acts as the identity on ∂(N i ) and acts injectively on N i \ L i . We describe next how to choose the parametrizations of various curves in C in a way that makes g i+1 continuous. We use that the relative interiors of the curves in C have preimages that are a family of parallel line segments covering a convex region (a face of a polytope), enabling us to choose parametrizations within this simplex which induce suitable ones for C; the point is to use Remark 4.5 to give a continuous function from L i 0 to [0, 1] recording for each point how it is parametrized within a curve in C. From this, we obtain suitable parametrizations for C by virtue of the collar that is also covered by C being homeomorphic to ∂(L i ) × [0, 1].
Surjectivity and continuity of g i+1 imply it induces a continuous, bijective function g i+1 from K i /(ker g i+1 ) to K i+1 . Continuity of (g i+1 ) −1 is then immediate, because any bijective, continuous function from a compact set to a Hausdorff space has continuous inverse. Thus, g i+1 (X K i ) = X K i+1 is homeomorphic to X K i /(ker g i+1 ) via g i+1 . It is straightforward to see that the equivalence relation under ker g i+1 gives a closed subset of X k × X k , implying X K i /(ker g i+1 ) is Hausdorff. Now let us check that regularity is also preserved under g i+1 . Condition 4.19 (LUB) implies for any cell G not collapsed by g i+1 • · · · • g 1 that any cells σ 1 , σ 2 ⊆ ∂(G) identified by g i+1 must have some least upper bound A ⊆ ∂(G) which is also collapsed by g i+1 . Thus, our homeomorphism g i+1 will restrict to G/(ker g i+1 ), enabling us to define the attaching map for G as a composition of three maps, first applying the attaching map for G within K i , then composing this with g −1 i+1 | G f inal , regarded as a map from X K i to X K i , then composing with g i+1 : X K i → X K i+1 , the point of the second map being to send points the cells of K i to the cells of K i+1 ; here we let G f inal denote the set of cells mapped homeomorphically to themselves by g i+1 or in other words the cells that the various fibers of g i+1 are mapped onto. Lemmas  Proof Consider any pair of cells τ ⊆ σ in K i+1 with dim σ = dim τ + 1. We must show that ∂σ \ τ is a compact manifold with boundary. By our definition of collapsing map, there must be cells τ i , σ i in K i with g i+1 mapping τ i homeomorphically to τ and σ i homeomorphically to σ with τ i ⊆ σ i . The proof of Theorem 4.21 shows that g i+1 is a homeomorphism from σ i /(ker g i+1 ) to σ . In particular, this implies that g i+1 gives a bijection from (∂σ i \ τ i )/(ker g i+1 ) to ∂σ \ τ . By definition, g i+1 is continuous and ker(g i+1 ) = {(x, x )|g i+1 (x) = g i+1 (x )} ⊆ K i × K i is closed, implying that g i+1 ((∂σ i \ τ i )/(ker g i+1 )) is compact and Hausdorff by Proposition 13.8 in Chap. 1 of [7]. Since g i+1 is a continuous, bijective map from a compact set to a Hausdorff space, g i+1 also has continuous inverse. Hence, the property of being a compact manifold with boundary transfers as desired.
Our collapsing map as defined in the proof of Theorem 4.21 is defined in terms of curve parametrizations and their extensions across collars. Polytopality of K 0 is only used to supply such a parametrization function that is continuous. Thus, Theorem 4.21, Lemma 4.22, and Proposition 4.26 all hold in more generality than how they are stated, without requiring any modifications to their proofs, yielding: An especially useful special case is the following, which in our main application will allow us to incorporate a change of coordinates homeomorphism ch which changes the reduced word with respect to which we work and hence may change the cell structure outside of the closed cell being collapsed: Corollary 4.24 Let K be a regular CW complex with closed cell L covered by a family of curves C and let φ be a homeomorphism from K to a regular CW complex K with closed cell L covered by a family C of parallel-like curves such that φ restricted to L is a cell-structure preserving homeomorphism to L mapping each curve in C to a curve in C . Then we may transfer the parametrization function for L to one for L, enabling the collapse of L across the curves in C via exactly the collapsing map given in the proof of Theorem 4.21. Specifically, it does not matter if K has an entirely different cell structure from K outside of the closed cell L.
Next we turn to the links of the cells. Following [11], we use (essentially) the notion of link in the sense of Whitney stratified spaces (as defined in [14]) for a series of quotient cell complexes obtained by repeated application of Theorem 4.21 and its extension in Corollary 4.24. In the following proposition, we use a polyhedral cone C whose cross-sectional slices are copies of our polytope, as well as using the quotient spaces of C under our collapses, denoted C/∼ k . We assume that for each τ ⊆ σ we have a projection map π σ τ onto the region R τ of C/∼ k indexed by the cell τ . We require that the inverse image under π σ τ of each point p ∈ R τ lives in a transversal to the open cell τ where τ is obtained by restricting R τ to the cross-sectional slice of C/∼ containing p; moreover, we require that this transversal also gives transversals through sufficiently nearby cross-sectional slices farther from the origin as well. The map π σ τ is defined to have as its domain the intersection of the following two sets S 1 and S 2 : (1) S 1 is the part of C/∼ k consisting of the cross-sectional slice containing p as well as all slices farther from the origin, while (2) S 2 is the set of regions of C/∼ k indexed by the cells in σ having τ in their closure.

giving rise to links as defined above both after the current collapsing step and at all earlier steps. Also suppose that the preimage under the current collapse of each transversal is the closure of a disjoint union of such transversals given by the corresponding projection maps on the preimage restricted to int(L i )
and that this closure is contained in the disjoint union of the transversals for the projection maps on L i . Then the collapse will preserve the property that the link of each cell is a closed ball with induced cell decomposition a regular CW decomposition.
Proof Let F i+1 be the maximal cell collapsed at this step, and let g i+1 be the collapsing map. The result is immediate for cells whose links (prior to the collapse) do not intersect F i+1 , since g i+1 acts homeomorphically everywhere except on F i+1 , leaving such links unchanged.
Letting G 2 be the closed cell onto which g i+1 maps F i+1 , we now check the result for the link of the open cell G 2 . Let G 1 be the closed cell containing the other endpoints of the parallel-like curves across which F i+1 is collapsed. The point is to show that g −1 i+1 (lk(p)) for p ∈ G 2 is a ball and that homeomorphism type is preserved under application of g i+1 . Our use of parallel-like curves allows us to decompose g −1 i+1 (lk(p)) into three pieces, namely its restrictions to (a) points sitting over G 1 , (b) points sitting over G 2 and (c) points sitting over F i+1 \ (G 1 ∪ G 2 ). The fact that earlier collapses were performed successfully yielding links that were regular CW balls implies that (a) and (c) are each regular CW balls and that (b) is the product of a regular CW ball with the open interval (0, 1). The parallel-like curves glue these together in a natural way that makes the union also a regular CW ball, since (b) is (0, 1) × lk σ/∼ i F i+1 where the desired link is being taken in σ and ∼ i is the equivalence relation resulting from the first i collapses, while (a) and (c) are each homeomorphic to lk σ/∼ i F i+1 . Moreover, applying g i+1 glues the ball sitting over G 2 to the ball sitting over G 1 by identifying the endpoints of curves sitting over F i+1 \ (G 1 ∪ G 2 ), yielding a ball. This would be more subtle without our assumption that dim(G 1 ) = dim(G 2 ).
The same approach applies to the link of any open cell contained in G 2 which likewise is not collapsed by g i+1 but also has some cell of dimension one higher than it collapsed onto it by g i+1 . Finally, consider the link of any cell σ that is not collapsed by g i+1 , but is in the closure of a cell that is collapsed by g i+1 ; the only remaining such case is for a face σ that is covered by parallel-like curves that are each just a single point. In this case, the result follows from the fact that our homeomorphism from X/(ker g i+1 ) to X naturally restricts to some neighborhood of any point in σ by choosing a neighborhood whose boundary is a union of points which are fixed by g i+1 together with entire curves from our family of parallel-like curves across which F i+1 is collapsed. The regular cell structure is obtained by restriction of cells of X/(ker g i+1 ) to the resulting ball.

Combinatorial 0-Hecke algebra lemmas
The relations x i x i = x i will yield a 0-Hecke algebra variant on the deletion exchange property for Coxeter groups, namely our upcoming notion of "deletion pair". In preparation, we first discuss a poset map from a Boolean algebra to Bruhat order.
It is natural (and will be helpful) to associate a Coxeter group element w(x i 1 · · · x i d ) to any 0-Hecke algebra expression x i 1 · · · x i d . This is done by applying braid moves and modified nil-moves to x i 1 · · · x i d to obtain a new expression x j 1 · · · x j s such that s j 1 · · · s j s is reduced, then letting w(x i 1 · · · x i d ) = s j 1 · · · s j s . The fact that this does not depend on the choice of braid moves and modified nil-moves will follow from the geometric description for w(x i 1 · · · x i d ) given next in Proposition 5.1.

Proposition 5.1 Lusztig's map
Proof This follows from Theorem 2.18, which ensures the existence of a series of braid moves and modified nil-moves which may be applied to x i j 1 · · · x i j k mapping the points of R S onto the points of some cell R T indexed by a reduced expression, sending each x ∈ R S to some y ∈ R T with the property that f (i 1 ,...,i d ) (x) = f (i 1 ,...,i d ) (y).

Corollary 5.2
The Coxeter group element w(x i j 1 · · · x i j k ) does not depend on the series of braid moves and modified nil-moves used to convert x i j 1 · · · x i j k into a reduced expression. See [1] for additional properties of this poset map w from a Boolean algebra to Bruhat order.

Corollary 5.3 If
The following 0-Hecke algebra notion, that of deletion pair, will play a key role in various lemmas in Sect. 6.2, i.e. in checking the combinatorial conditions needed in our proof of the Fomin-Shapiro Conjecture in order to use the cell collapses developed in Sect. 4.

Definition 5.4 Define a deletion pair in a 0-Hecke algebra expression
x i 1 · · · x i d to be a pair {x i r , x i s } such that the subexpression x i r · · · x i s is not reduced butx i r · · · x i s and x i r · · ·x i s are each reduced.
For example, in type A the expression x 1 x 2 x 1 x 2 has deletion pair {x i 1 , x i 4 }.

Lemma 5.5 If {x i r , x i s } comprise a deletion pair, then
Proof w(x i r · · ·x i s ) ≤ w(x i r · · · x i s ) and w(x i r · · · x i s ) ≤ w(x i r · · · x i s ) in Bruhat order, while all three of these Coxeter group elements have the same length, so the equalities follow.
See [10] for a faithful representation of the 0-Hecke algebra in which the simple reflections which do not increase length act by doing nothing.

Remark 5.6
If {x i u , x i v } comprise a deletion pair in a word x i 1 · · · x i d and we apply a braid relation in which x i u is the farthest letter from x i v in the segment being braided, then the resulting expression will have as a deletion pair x i v together with the nearest letter to it in the segment that was braided. We regard this as a braided version of the same deletion pair. Given a reduced expression x i 1 · · · x i d , associate a Coxeter group element R(x i j ) to each x i j by letting R(x i j ) = s i 1 · · · s i j −1 s i j s i j −1 · · · s i 1 . For finite Coxeter groups, these will be the reflections. In the case of a nonreduced expression, if w(x i 1 · · · x i j ) = w(x i 1 · · · x i j −1 ), then we find the largest j < j such that s i j · · · s i j −1 = s i j +1 · · · s i j and let R( Our original proof of the next lemma relied on the fact that all finite Coxeter groups are also reflection groups. Sergey Fomin provided us with the proof presented below which avoids passing to reflection groups. In particular, this allows us to avoid assuming here, and thereby throughout the paper, that our Coxeter groups are of finite type. Lemma 5.8 Given a reduced expression x i 1 · · · x i m in the 0-Hecke algebra of a Coxeter group in which R(x i m ) = s i 0 , then x i 0 x i 1 · · · x i m has {x i 0 , x i m } as a deletion pair.
Proof Let us show that x i 0 x i 1 · · · x i m−1 is reduced whereas x i 0 x i 1 · · · x i m is not. By Exercise 8 in [5,Chap. 1], it suffices to prove R(x i j ) = R(x i k ) for all 0 ≤ j < k ≤ m − 1 along with proving R(x i 0 ) = R(x i m ). But x i 1 · · · x i m−1 is reduced, which implies s i 1 · · · s i j −1 s i j s i j −1 · · · s i 1 = s i 1 · · · s i k−1 s i k s i k−1 · · · s i 1 for 1 ≤ j < k ≤ m − 1. This in turn implies R(x i j ) = R(x i k ) for 1 ≤ j < k ≤ m − 1 with respect to the expression x i 0 x i 1 · · · x i m , since we simply conjugate the previous inequalities by s i 0 to obtain the desired inequalities. On the other hand, R(x i 0 ) = s i 0 = s 3 i 0 = s i 0 (s i 1 · · · s i m · · · s i 1 )s i 0 , completing the proof.

Proof of the Fomin-Shapiro Conjecture
In this section, we apply Theorem 1.3 to the stratified spaces Y w introduced by Fomin and Shapiro in [11] to prove the following.

Theorem 6.1 The Bruhat decomposition Y w of the link of the identity in the totally nonnegative real part of the unipotent radical of a Borel subgroup in a semisimple, simply connected group defined and split over R is a regular CW complex homeomorphic to a ball. Moreover the link of each cell is as well.
Much of the proof will consist of first constructing a regular CW complex K that will be a quotient space (R d ≥0 ∩ S d−1 1 )/ ∼ of a simplex; this is obtained from the simplex by a series of collapses in Sect. 6.2. Then we prove that the quotient space map induced from f (i 1 ,...,i d ) will act on K in a manner that meets all the requirements of Corollary 3.9. As preparation, we first define a much simpler equivalence relation in Sect. 6.1, denoted ∼ C , doing identifications based only on stuttering pairs which may be obtained in nonreduced expressions exclusively by applying commutation moves. Then we give the more difficult analogous argument for ∼. Finally, Sect. 6.3 applies Theorem 1.3 to show that the induced map f (i 1 ,...,i d ) from K to Y w is a homeomorphism.
Let us now establish some convenient notation for the proof. Let R d ≥0 ∩ S d−1 1 denote the restriction of R d ≥0 to the hyperplane with coordinates summing to 1. We will make extensive use of the fact that this is a convex polytope. Define the regions or faces in R d We associate the 0-Hecke algebra expression x i j 1 · · · x i j k to the region R To keep track of the positions of the nonzero parameters, we sometimes also include 1's as placeholders, e.g. describing the region R {1,3} given by the map f (1,2,1) by the expression x 1 · 1 · x 1 . We say that an x-expression is stuttering if it directly admits a modified nil-move Sect. 2.3). An expression is commutation equivalent to a stuttering expression if it admits a series of commutation moves yielding a stuttering expression.
In Sect. 6.2, we will define the equivalence relation ∼ on R d ≥0 ∩ S d−1 1 by repeated application of the following idea: if the x-expression x i j 1 · · · x i j k associated to a point (t 1 , . . . , t d ) ∈ R d ≥0 is not reduced, then we may apply commutation moves and long braid moves to it, causing a coordinate change to new coordinates (u 1 , . . . , u d ) in which we may apply a substitution x i (u s−1 )x i (u s ) = x i (u s−1 + u s ). Each region R {j 1 ,...,j k } indexed by a non-reduced word is collapsed by such a move, at which point we say  (u 1 , . . . , u d ) ∼ (u 1 , . . . , u d ) for those points (u 1 , . . . , u d such that u s−1 + u s = u s−1 + u s and u i = u i for i = s − 1, s. It is important to our collapsing argument that for each non-reduced subword (i j 1 , . . . , i j k ) of (i 1 , . . . , i d ), we choose exactly one such way of identifying points of the open cell R {j 1 ,...,j k } with points having strictly fewer nonzero parameters, namely the identifications dictated by the collapse we choose to apply to R {j 1 ,...,j k } . Additional identifications will hold by transitivity of ∼.
Before turning to the details, let us briefly enumerate the main upcoming definitions, lemmas and theorems and how they fit together. Definition 6.6 introduces the parallel-like curves that will be used to induce the collapses leading to ∼ C . Then we verify the distinct endpoints condition (DE) in Lemma 6.9, the least upper bound condition (LUB) in Lemma 6.12, the distinct initial points condition (DIP) in Lemma 6.10, and deduce from all this the regularity of the quotient cell complex (R d ≥0 ∩ S d−1 1 )/∼ C in Theorem 6.13. Afterwards, we characterize exactly which faces are identified with each other by ∼ C in Lemma 6.14.
Now in the general case of ∼, we prove a similar series of lemmas, after first showing that long braid moves may be accomplished by change of coordinates maps that are homeomorphisms on the closed cells to be collapsed. The requisite parallel-like curves are specified in Definition 6.18. The result about changes of coordinates is obtained through Lemmas 6.20, 6.22, 6.23, and 6.24. Next we verify the conditions (DIP) in Lemma 6.28, (DE) in Lemma 6.29, (LUB) in Lemma 6.30, and we show the requisite equidimensionality to deduce regularity of links in Lemma 6.27. In proving these results for a particular collapse, we assume inductively that all earlier collapses were already performed successfully, and we also assume inductively that all results in the paper hold for all d < d to prove the results for reduced word (i 1 , . . . , i d ) of length d. We then combine these ingredients to deduce homeomorphism type and regularity of (R d ≥0 ∩ S d−1 1 )/∼ in Theorem 6.32. Finally, we prove that the induced map f (i 1 ,...,i d ) from this quotient space to Y w is a homeomorphism that preserves cell structure, implying that Y w is a regular CW complex homeomorphic to a ball. To this end, Lemma 6.33 uses the exchange axiom for Coxeter groups in order to verify the attaching map injectivity requirement of Theorem 1.3, allowing the proof of the Fomin-Shapiro Conjecture to be completed in Theorem 6.34.

Collapsing a simplex to obtain
In this section, we collapse those faces of R d ≥0 ∩ S d−1 1 whose words are commutation equivalent to stuttering words, denoting the resulting identifications by ∼ C . We prove that (R d ≥0 ∩ S d−1 1 )/∼ C is a regular CW complex homeomorphic to a ball by proving that regularity and homeomorphism type are preserved under each in a series of collapses of the type introduced in Sect. 4. A separate proof for ∼ C is given before turning to the general case for two reasons: (1) it illustrates the general strategy in a much simpler setting, and (2) this result will be used in the proofs of Lemmas 6.20 and 6.24, two key ingredients to the general case.  and {x i l , x i r } is an omittable pair in x(F ) with l < r. Use linear order on the index r, then break ties with linear order on r − l, breaking further ties by reverse linear order on dim F , and breaking any remaining ties arbitrarily.
) comes earlier than both of these.
We obtain from this our sequence of face collapses by repeatedly choosing for the next collapse the earliest triple (x(F ), {x i l , x i r }) whose face F has not yet been collapsed. Denote by (x(F m ), {x i lm , x i rm }) the triple chosen for the m-th collapse, and let g m be the collapsing map accomplishing this, based on the level curves from Definition 6.6. Our main task in this section will be to prove that these are parallel-like curves and that g m meets the requirements of Theorem 4.21.
Remark 6.5 It often will happen that the step collapsing a cell F m will also collapse some additional cells. However, each collapsing step will have one cell among those being collapsed at that step such that all others being collapsed at that step are in its closure. To keep track combinatorially of which faces are identified by the collapses giving rise to ∼ C , define a slide-move, or simply a slide, to be the replacement of S = {j 1 , . . . , j s } by S = {k 1 , . . . , k s } for j 1 < · · · < j s and k 1 < · · · < k s with j i = k i for i = r for some fixed r and i j r = i k r . An example in type A for (i 1 , . . . , i d ) = (1, 2, 3, 1, 2) is S = {1, 5} and S = {4, 5}. An exchange is the replacement of one letter by another letter than can be accomplished by a series of slide-moves and commutation moves. Now we use combinatorics to verify that the hypotheses needed for topological collapses introduced in Sect. 4 are indeed met. Condition 1 of Definition 4.7 follows immediately from our set-up. The next two lemmas check conditions 2 and 3, respectively, by checking the distinct endpoints condition (DE) and distinct initial points condition (DIP).

Lemma 6.9 The collapses inducing ∼ C satisfy Condition 4.11 (DE).
Proof What we must prove is that the two endpoints of any nontrivial level curve across which a cell F i is collapsed live in distinct cells just prior to the collapse. Suppose G 1 ⊆ F i with t l i > 0 and t r i = 0 had been identified already with the face G 2 ⊆ F i instead having t r i > 0 and t l i = 0. This would have required a series of earlier slides, including one of the form r i → r for some r < r i . Our collapsing order implies r i − r < r i − l i . By our dimension maximizing assumption in our collapsing order, the last of these slide moves shifting the right element of our deletion pair to the left would have also collapsed F i , by virtue of identifying it with a face already collapsed, a contradiction. Lemma 6.10 Suppose a cell H 1 ⊆ G 1 is collapsed prior to the collapse of F j , where H 1 is identified with H 2 ⊆ G 2 in the collapsing step given by (F j , {x i r , x i s }) by an exchange of x i r ∈ H 1 ⊆ G 1 for x i s ∈ H 2 ⊆ G 2 with r < s. Then the least upper bound H 1 ∨ H 2 will have also been collapsed prior to the collapse of F j , and in such a way that any two level curves in H 1 ∨ H 2 having the same endpoint in H 1 are identified prior to the collapse (F j , {x i r , x i s }) with coinciding parametrizations.
Proof The fact that H 1 is collapsed before F j means that x(H 1 )| x i 1 ···x is contains an omittable pair. However, contains an omittable pair based upon which H 1 is collapsed. By our prioritization of higher dimensional faces in our collapsing order, the face H 1 ∨ {x i s } = H 1 ∨ H 2 will have been collapsed in the same way, yielding the desired result.
Next we verify (LUB), after first giving an example showing the idea.

Example 6.11
The cell F with x(F ) = x 1 x 1 x 1 is collapsed based on the deletion pair comprised of its leftmost two x 1 's, identifying x 1 · 1 · x 1 with 1 · x 1 · x 1 and in the process also identifying x 1 · 1 · 1 with 1 · x 1 · 1. The region with expression 1 · x 1 · x 1 is collapsed based on its pair of x 1 's, identifying 1 · x 1 · 1 with 1 · 1 · x 1 . Composing face identifications based on these two steps causes x 1 · 1 · 1 to be identified with 1 · 1 · x 1 , potentially causing the attaching map for the face given by x 1 · 1 · x 1 no longer to be injective; however, this face will itself have been collapsed by this time, by virtue of having already been identified with the face 1 · x i · x i which was already collapsed.

Lemma 6.12 The collapses inducing ∼ C satisfy condition 4.19 (LUB).
Proof Suppose that G 1 and G 2 are identified during the collapse of F via deletion pair {x i l j , x i r j }, for x i l j ∈ x(G 1 ), x i r j ∈ x(G 2 ), and F is any face that is a least upper bound for G 1 and G 2 in the closure poset just prior to the collapse of F . We must show that F is also collapsed by the end of the step collapsing F or is identified with F prior to this collapse. By virtue of our set-up, x(F ) must have subexpressions x(G 1 ) and x(G 2 ) with G 1 ∼ j G 1 and G 2 ∼ j G 2 . Consider x(F ) and its earliest subexpressions (in our collapsing ordering on triples) which are x-expressions for some such G 1 ∼ j G 1 and Suppose x i r j / ∈ x(F ). This implies that x i r j must have been exchanged with a letter x i r to its left during an earlier identification step. Then x(F ) will have an omittable pair {x i l , x i r } for some r < r j , causing F to have been collapsed strictly before the collapse of F . Now consider the case x i r j ∈ x(F ). F will again be collapsed during or prior to the collapse of F unless x i r j is the right letter in the leftmost deletion pair of F and x i l j has been exchanged for a letter x i l ∈ x(F ) to its left appearing instead in F . But then by the fact that our collapsing order maximizes dimension among faces with the same omittable pair, this exchange x i l j → x i l (or each such exchange in a series) would extend to a face including x i r j , thereby identifying faces including x i l and x i r j with ones instead including x i l j and x i r j . In particular, this identifies F with F prior to the collapse of F .
Combining the above results will yield: Proof We will use Theorem 4.21 to prove that each collapse on R d ≥0 ∩ S d−1 1 may be accomplished in turn by a map that preserves homeomorphism type and regularity, provided that all earlier collapses also met the requirements of Theorem 4.21. This will imply that the series of collapses producing (R d ≥0 ∩ S d−1 1 )/ ∼ C yields a regular CW complex homeomorphic to a ball. The parallel-like curves that we will use for the (i + 1)-st collapsing step will be of the form given in Definition 6.6; they are the images under g i • · · · • g 1 of parallel line segments covering a closed cell of R d ≥0 ∩ S d−1 1 . To see that g i • · · · • g 1 acts on each level curve either homeomorphically or by sending it to a point, notice that by definition the interior of any nontrivial level curve lives entirely in some open cell F ⊆ F i , hence a cell upon which all earlier collapses act homeomorphically. Lemmas 6.9, 6.10, and 6.12 confirm the distinct endpoints condition (DE), distinct initial points condition (DIP), and least upper bound condition (LUB), respectively, i.e. the requirements of Theorem 6.13.

Proposition 6.14 Suppose x(R S ) and x(R T ) are not commutation equivalent to stuttering expressions. Then R S ∼ C R T iff S and T differ from each other by a series of commutation moves and slide moves.
Proof Let S = {j 1 , . . . , j s } and T = {k 1 , . . . k s }. We begin with pairs of words x(R S ), x(R T ) differing by a single slide, so S ∩ T = S \ {j r } = T \ {k r } for some r with i j r = i k r . But then x(R S∪T ) is stuttering, implying R S∪T was collapsed by ∼ C . The fact that x(R S ), x(R T ) are not commutation equivalent to stuttering expressions implies R S∪T could have only been collapsed by identifying R S with R T . By transitivity of ∼ C , S and T differing by a series of slide moves likewise give rise to R S , R T with R S ∼ C R T . Applying commutation moves to x(R S ) as well to produce σ (x(R σ (S) )) which is slide equivalent to x(R T ) ensures x(R S∪T ) also admits the same commutation moves leading to a stuttering word, and again x(R S∪T ) does not admit any other stuttering pairs, so again R S ∼ C R T . (i 1 , . . . , i d ) = (1, 2, 1 If (i 1 , . . . , i d ) = (1, 3, 1), then R {1,2} is identified with R {2,3} during the collapse of R {1,2,3} .

Collapsing a simplex to obtain
Now we turn to the identifications ∼ induced by a series of collapses which collapse all faces whose words are nonreduced, i.e. starting afresh so as now to incorporate those collapses requiring long braid moves.

Definition 6.16 Given a deletion pair {x
be the smallest number of long braid moves needed in a series of braid moves applied to x i r · · · x i s−1 yielding an expression whose last letter comprises a stutter with x i s .
Lemma 5.5 combined with Theorem 2.18 guarantees existence and finiteness of c({x i r , x i s }; x(F )).

Example 6.17
In type A, we have c({x i 1 , x i 4 }; x 1 x 2 x 1 x 2 ) = 1, because we may apply the relation x 1 x 2 x 1 → x 2 x 1 x 2 to obtain x 2 x 1 x 2 x 2 . Now let us order triples (x(F ), {x i l , x i r }) where {x i l , x i r } is a deletion pair of x(F ) in preparation for our choice of a collapsing order on nonreduced faces. By convention, say l < r. Letting the statistics listed earliest take highest priority, with later statistics used to break ties, order the triples (x(F ), {x i l , x i r }) by: (1) linear order on r, (2) linear order on r − l, (3) linear order on c({x i l , x i r }; x(F )), and (4) reverse linear order on dim F . We may break any remaining ties arbitrarily.
We repeatedly choose the earliest triple (x(F ), {x i l , x i r }) among those for faces F not yet collapsed. Denote the k-th such triple chosen by (x(F k ), {x i l k , x i r k }). We will use Theorem 4.21 to accomplish the collapse of F k by a collapsing map g k applied to (R d ≥0 ∩ S d−1 1 )/ ∼ k , letting ∼ k be the equivalence relation comprised of the identifications that result from the first k − 1 collapsing steps, described shortly. First we will need some results regarding change of coordinate maps.
Denote by ∼ s the set of all possible identifications (t 1 , . . . , t d ) ...,i s ) (t 1 , . . . , t s ) = f (i 1 ,...,i s ) (t 1 , . . . , t s ) and t j = t j for all j > s. That is, ∼ s consists of all possible identifications based on the leftmost s letters. By our inductive hypothesis based on length, we will be able to assume ∼ s is exactly the identifications accomplished by collapses based on deletion pairs involving only the leftmost s letters. The way our collapsing order was chosen implies then that for each s there will be some k such that ∼ s =∼ k , meaning that ∼ s is the equivalence relation resulting from the first k − 1 collapses. For this same pair k and s, let us also introduce the notation g s for the composition of maps g s = g k−1 • · · · • g 1 . Let us also establish the notation g s (i 1 ,...,i d ) as the map g s given by the reduced word (i 1 , . . . , i d ). Let  ∼ (i 1 ,...,i d ) denote the equivalence relation given by reduced word (i 1 , . . . , i d ) after all possible collapses, and let ∼ s (i 1 ,...,i d ) denote the equivalence relation ∼ s consisting of identifications based on the leftmost s letters again with respect to initial choice of reduced word (i 1 , . . . , i d ). We will eventually prove that these level-curves are parallel-like, in the sense of Definition 4.7.

Example 6.19
Applying braid moves to x 1 x 2 x 1 x 3 x 2 x 3 yields the expression . Collapsing based on the resulting stuttering pair will cause the proper face 1 · x 2 x 1 x 3 x 2 x 3 to be identified with the face x 1 x 2 x 1 x 3 x 2 · 1. The proper face x 1 x 2 · 1 · 1 · 1 · x 3 is neither collapsed nor identified with another face in the process since the first and last letters do not form a deletion pair. On th e other hand, the face x 1 x 2 · 1 · x 3 x 2 x 3 would have already been collapsed at an earlier step, hence need not be considered in the next lemma as part of the boundary of the cell indexed by )/∼ C given by (j, i, . . . ).
Proof We may use the fact that f (i,j,... ) and f (j,i,... ) act homeomorphically on the interior of the big cell for and , respectively. Each point x ∈ not in the interior of the big cell must instead belong to a region R {i j 1 ,...,i j k } whose associated Coxeter group element w(x i j 1 · · · x i j k ) has a unique reduced expression, namely one with the appropriate alternation of s i 's and s j 's. Thus, x must be sent to a point in having this same reduced expression, so that by Proposition 6.14 the only choices to be made are equivalent to each other under ∼ C . This map from to is therefore a composition of two homeomorphisms, namely f (i,j,... ) and f −1 (j,i,... ) , and hence is itself a homeomorphism.

Example 6.21
The type A relation s i s i+1 s i = s i+1 s i s i+1 gives rise to the map The above proposition shows that this map extends to the boundary, i.e. extends to a map from . Then extend continuously to the family of subspaces with t d +1 = · · · = t d = k for 0 ≤ k ≤ 1 d−d +1 , using that each of these for and that the slice given by k = 1 d−d +1 is a 1-point space. Geometrically, we are adding a cone point and extending the collapse to the coned complex. Continuity follows from the fact that the level curves we collapse across each hold the values t d +1 , . . . , t d constant, hence the collapses apply to all (nontrivial) cross-sectional slices in the same way.

Lemma 6.23
Suppose that the k-th collapsing step uses deletion pair {x i l k , x i r k } for l k < r k . Then ∼ r k −1 =∼ m where m is the largest possible positive integer such that the triple (x(F m ), {x i lm , x i rm }) has r m < r k .
Proof Consider the map f (i 1 ,...,i r k −1 ) on just the leftmost r k − 1 positions in our reduced word. By induction on wordlength, specifically our assumption of all results in the paper for all d < d, we may use Theorem 6.34 to deduce that f (i 1 ,...,i r k −1 ) is a homeomorphism from (R r k −1 ≥0 ∩ S r k −2

1
)/ ∼ to Y s i 1 ···s i r k −1 . By Lemma 6.22, this means in particular that the collapses based on deletion pairs using only positions 1, . . . , r k − 1 are enough to accomplish all the desired identifications in ∼ r k −1 .

. , i d ) by braid moves involving only the leftmost s letters in
Proof The case of short braid moves is obvious, since we just switch the order of the parameters. Now by induction on d, we may assume the main results of the paper for all s < d in our proof of all these results for our given d, provided we check the base case of the induction. In particular, this inductive usage of Theorem 6.34 for s < d together with Lemma 6.22 and the present lemma for s < d gives that the two complexes under consideration, namely

Remark 6.26
The proof of Lemma 6.24 immediately implies for each face F with associated word (i 1 , . . . , i d ) that is a subword of (i 1 , . . . , i d ) and for any word (j 1 , . . . , j d ) = ch(i 1 , . . . , i d ) obtained by braiding the leftmost s letters in (i 1 , . . . , i d ) for s ≤ min(d − 1, d ) using the same braid moves as above that g s Next we check a condition that will be helpful for verifying our various requirements for performing collapses, i.e. for checking the hypotheses of Corollary 4.24, assuming that all earlier collapses were performed successfully. Note that in the Lemma 6.27 we do not require F to be the maximal face that is collapsed in this step.

Lemma 6.27 If a cell F is collapsed across level curves each having one endpoint in H 1 and the other endpoint in
Proof Let {x i r , x i s } be the deletion pair inducing the collapse of F , with x i r ∈ x(H 1 ) and x i s ∈ x(H 2 ). Then x(H 1 )| x i 1 ···x is must be reduced, since otherwise H 1 and likewise F would have been collapsed earlier. This implies x(H 2 )| x i 1 ···x is must also be reduced. Thus, neither H 1 nor H 2 will have been collapsed earlier, from which the result follows by comparing wordlengths. Now we check the various hypotheses of Theorem 4.21 (as extended in Corollary 4.24), using our collapses and parallel-like curves from Definition 6.18 and from the discussion just after Example 6.17 as applied to our framework. To check these conditions for the k-th collapse, we assume by induction that all earlier collapses were performed successfully. In particular, this means that we assume that we had a regular CW complex after each earlier collapsing step and hence that (LUB) held after each earlier collapsing step. However, we do not need to check (DIP) or (DE) for the curves used in the k-th collapse at each earlier step. Rather, it suffices to check these conditions just before the k-th collapse for the curves used to accomplish the k-th collapse.
The fact that the level curves to be used in our collapses, defined in Definition 6.18, satisfy the first requirement for parallel-like curves is immediate from our set-up. Now let us confirm that the level curves used for the k-th collapse also satisfy the third requirement of parallel-like curves, the (DIP) condition, just prior to the k-th collapsing step, using that earlier collapses were all performed successfully.
When a collapse identifies cells A and A via a deletion pair

Lemma 6.28
If a cell H 1 ⊆ G 1 is collapsed prior to the collapse of F j , where H 1 is to be identified with H 2 in the collapsing step given by (F j , {x i r , x i s }) by an exchange of x i r ∈ H 1 for x i s ∈ H 2 for r < s, then H 1 ∨ H 2 is also collapsed prior to F j , and in such a way that any two level curves with the same endpoint in H 1 will have already been identified with each other in a manner that preserves the parametrization.
Proof Given the two x-expressions x(H 2 )| x i 1 ···x is = x i j 1 · · ·x i r · · · x i s and x(H 1 )| x i 1 ···x is = x i j 1 · · · x i r · · ·x i s , the fact that H 1 has already been collapsed means x i j 1 · · · x i r · · ·x i s is not reduced, implying that x i j 1 · · · x i r · · · x i s = x(H 1 ∨ H 2 ) also is not reduced. Moreover, H 1 will have been collapsed based on a deletion pair strictly to the left of x i s , which implies the same for H 1 ∨ H 2 . Our collapsing order ensures that H 1 ∨ H 2 will also have been collapsed prior to the collapse of F j , using the same deletion pair and the same series of braid moves as in H 1 , hence the same parametrization for each curve in H 1 as in the curves with which it is identified in H 1 ∨ H 2 .
Next we verify that the second requirement for parallel-like curves, Condition (DE), holds just prior to the k-th collapse for the curves used to accomplish the k-th collapse. Lemma 6.29 Condition 4.11 (DE) holds at the k-th collapsing step, provided that the earlier collapses were performed successfully.
Proof Suppose F is collapsed during the k-th collapsing step via deletion pair {x l k , x r k } having parameters {t l k , t r k }. We are not assuming F is necessarily the maximal face F k among those faces which are collapsed at this step. Let {u r k −1 , u r k } be the new parameters for the stuttering pair obtained from the deletion pair {x l k , x r k } by a suitable coordinate change as in Lemma 6.24. Let G 1 and G 2 be the closed faces containing opposite endpoints of the curves across which F is collapsed, i.e. the curves introduced in Definition 6.18. Thus, G 1 has t r k = 0 and G 2 has t l k = 0, with x(G 1 ), x(G 2 ) and x(F ) agreeing at all other positions. In the new coordinates, G 1 has u r k = 0 while G 2 instead has u r k −1 = 0.
What we must prove is that G 1 and G 2 are not identified in an earlier collapse. Suppose otherwise. By induction, we may assume that the complex is regular immediately after each earlier collapsing step. This precludes G 1 and G 2 from being incomparable in the closure poset just prior to their identification, unless there is a face G having G 1 , G 2 ⊆ G which is also identified with both of them at that same earlier step by collapsing G across parallellike curves each having one endpoint in G 1 and the other endpoint in G 2 . But then we may use (LUB) for that earlier collapse to deduce that all least upper bounds for G 1 and G 2 must have been collapsed at this earlier step, which would necessarily include a face in F other than F itself. But this implies that G 1 and G 2 both have dimension at least two less than F , contradicting what we just proved in Lemma 6.27. Suppose on the other hand we have G 1 ⊆ G 2 or G 2 ⊆ G 1 just prior to their identification. But this implies dim(G 1 ) = dim(G 2 ), again contradicting our result from Lemma 6.27 that dim(G 1 ) = dim(G 2 ) = dim(F ) − 1.
In the proof of the next lemma, we often speak of a cell A ∈ (R d ≥0 ∩ S d−1 1 )/ ∼ k , whereby we mean the equivalence class under ∼ k that contains . Referring in this manner to particular equivalence class representatives has the advantage that there is a unique associated x-expression x(A) for that representative and also allows us to make sense of A ∨ B as being the equivalence class under ∼ k that includes the join of the representatives A and B where join is taken in the original simplex is the x-expression comprised of the union of the x-expressions for A and B. In particular, x(F k ) denotes the x-expression for the ∼ k -equivalence class representative with respect to which F k is collapsed, namely one yielding optimal x-expression in terms of our collapsing order. Proof Suppose that the collapsing step given by a triple (F k , {x i l k , x i r k }) causes a pair of cells A and B to be identified where neither cell has been collapsed yet and neither is in the closure of the other (the latter of which would make the result trivial). By virtue of our collapsing process, this implies that we may choose x(A) and x(B) to be subexpressions of x(F k ) which coincide except in that x(A) includes the letter x i r k whereas x(B) instead includes the letter x i l k . In other words, there must exist ∼ k equivalence class representatives with this property. Let F be the cell such that We note that F might equal F k , or F might be a lower-dimensional cell contained in the closure F k . By definition, F has dimension exactly one more than A and B. Our collapsing order ensures that F could not have been collapsed prior to our current step collapsing F k unless it were done through the earlier identification of F with another cell F designated for collapse earlier than F , where F is obtained from F by replacing x i r k with some x i l with l k < l < r k ; however, such a step would have also identified A with B earlier, a contradiction. Thus, we are assured of the existence of such an F which is not collapsed prior to step k and which satisfies By virtue of our collapsing process, the collapse of F k will induce at the same time the collapse of F across curves as defined in Definition 6.18 (which we will eventually prove are parallel-like) with each curve having one endpoint in A and the other endpoint in B. Lemma 6.23 allows us to assume that all possible identifications present in ∼ r k −1 have already been accomplished before the k-th collapse. Let x(F ) be an x-expression for any other cell besides F that is a least upper bound for A and B just prior to the k-th collapse. If there is such an F distinct from F , then there must be cells A u , B v ⊆ F having x(A u ) and x(B v ) as subexpressions of x(F ) with Our plan now is to obtain from this a contradiction so as to deduce that no such F exists, thereby proving (LUB). To this end, we will prove either (1) that F was already identified with F at an earlier step, (2) that F is not a least upper bound for A and B just prior to the k-th collapse due to the presence of an upper bound strictly contained in it, or (3) The fact that we have only done identifications based on deletion pairs whose right endpoint is at or to the left of x i r k prior to the k-th collapsing step implies that A, A u , B, and B v all must coincide with each other to the right of x i r k . We also know that w( . But now we may use Lemma 6.23 to conclude that A u must get identified with B v under one of the steps leading to ∼ r k −1 and hence prior to step k . But by Lemma 6.22, this implies A u ∼ k B v , completing this case.
The remainder of the proof deals with the case . First suppose that both x(A u ) and x(B v ) include the letter x i r k . Notice that x(A u )| x i 1 ···x i r k −1 and x(B v )| x i 1 ···x i r k −1 must both be reduced, since neither of these cells has been collapsed yet. We also have Hence, if x i r k is nonredundant in both A u and B v , then this together implies w(A u | x i 1 ···x i r k −1 ) = w(B v | x i 1 ···x i r k −1 ). These two words x(A u ) and x(B v ) also coincide on the subexpression consisting of x i r k and all letters to its right, implying A u ∼ r k −1 B v and hence A u ∼ k B v , a contradiction. Next suppose that x i r k is present but redundant in x(B v ), that is, which means that it suffices to show that A u ∨ B v is collapsed by the end of the k-th collapsing step so as to deduce that A u ∨ B v is also collapsed by the end of the k-th collapsing step. Our remaining arguments will cover the case of such A u ∨ B v .
Henceforth, we assume x i r k ∈ x(A u ) and x i r k / ∈ x(B v ). Notice that x(A u ) ∨ x(B v )| x i 1 ···x i r k −1 must be reduced, since otherwise A u ∨ B v would have already been collapsed by the series of collapses yielding ∼ r k −1 , by virtue of our collapsing order and our use of induction on length. Thus, we have two cases left to consider, depending whether (a) (x(A u ∨ B v ))| x i 1 ···x ir k is also reduced, or (b) x i r k forms a deletion pair with a letter to its left in x(A u ∨ B v ). Now to (a), namely the case where must in this case be strictly less than w((A u ∨ B v )| x i 1 ···x ir k ) in Bruhat order. It follows from this that reading x(A u ∨ B v )| x i 1 ···x ir k from left to right, we must encounter a leftmost letter x i j whose associated reflection is not one of the associated reflections for x(A u )| x i 1 ···x ir k and likewise for x(B v )| x i 1 ···x ir k , hence a letter x i j which may be deleted to obtain a new x-expression x(A u ∨ B v )| x i 1 ···x ir k \ x i j where just the letter x i j has been deleted; this expression will have the property that its associated Coxeter group element is again greater than or equal to both w(x(A u )| x i 1 ···x ir k ) and w(x(B v )| x i 1 ···x ir k ) in Bruhat order. Choose the leftmost such letter x i j If j = r k , we must therefore have , by virtue of Lemma 6.23 together with the definition of Bruhat order as an order based on taking subwords. Similarly, there must exist B with x(B ) also a subexpres- is reduced, we cannot delete from it one letter to obtain x(A u )| x i 1 ···x ir k and a different individual letter to obtain x(B v )| x i 1 ···x ir k , since that would imply w(x(A u )| x i 1 ···x ir k ) = w(x(B v )| x i 1 ···x ir k ) by the exchange axiom for Coxeter groups, a contradiction. This completes our proof in case (a). Now to case (b), i.e. the case where , so this implies that w(x(A ∨ B)| x i 1 ···x ir k ) must be strictly less than w(x(A u ∨ B v )| x i 1 ···x i r k −1 ) in Bruhat order. But this means there is a letter x i j we may delete from x(A u ∨ B v )| x i 1 ···x i r k −1 to obtain a word whose associated Coxeter group element is still greater than or equal to w(x(B v )| x i 1 ···x i r k −1 ) in Bruhat order, and hence is also greater than or equal But then deleting this x i j from x(A u ∨ B v ) yields an upper bound for A u and B v just prior to the k-th collapse whose x-expression is strictly contained in x(A u ∨ B v ) with distinct associated Coxeter group elements, i.e. with w( . Thus, we get a cell that is an upper bound for A u and B v that is strictly contained in A u ∨ B v , contradicting A u ∨ B v being a least upper bound. This completes case (b).
Next, we give a projection map π v u from any closed cell σ v in (R d ≥0 ∩ S d−1 1 )/ ∼ onto an open cell σ u in its boundary, choosing our notation to reflect that σ v is mapped by To be more precise, π v u applies to the union of open cells contained in σ v that have σ u in their closure. Once equipped with this projection map, we may define the links of cells using the notion of link provided in Definition 4.25 which is based on ideas from stratified Morse theory (cf. [14]). It is most natural to define this projection map using all of R d ≥0 at once and its quotient spaces R ≥0 /∼ as well as R ≥0 /∼ k induced by the collapsing process that we have developed over the course of this section. This is the approach that we take.

Definition 6.31
Consider any x = (t 1 , . . . , t d ) in the aforementioned domain of π v u , choosing the representative for the equivalence class of x under ∼ whose only nonzero parameters appear in the positions of letters in the rightmost reduced word for v appearing as a subword of (i 1 , . . . , i d ).
Let (i j 1 , . . . , i j r ) be this subword. The projection map given by u ⊆ v, denoted π v u , sets to 0 each t i not appearing in either the rightmost subword of (i j 1 , . . . , i j r ) that is a reduced word for u or obtained by reading our word from right to left, including additionally just those letters which are redundant (in the sense of not increasing the 0-Hecke algebra theoretic length) when appended to the word comprised of those letters to its right that have already been chosen. We now prove the main theorem of this section, which is largely a matter of pulling together the various lemmas we have proven already. This will require some further notation. Let (i 1 , . . . , i d ) be the subword of (i 1 , . . . , i d ) associated to the maximal cell F k to be collapsed at the k-th collapsing step, so d is the wordlength of x(F k ). Let (j 1 , . . . , j d ) be the word obtained from (i 1 , . . . , i d ) by applying the series of braid moves giving rise to the change of coordinates homeomorphism ch, i.e. the chosen series of (long and short) braid moves applied to (i 1 , . . . , i d ) yielding a stutter between positions r − 1 and r to be used to induce our collapse of F k . Note that there must be some r such that (i r , . . . , i d ) = (i r k , . . . , i d ) = (j r , . . . , j d ) . We perform on K 0 a series of collapses, using Theorem 4.21 and its generalization described in Corollary 4.24 to justify that each of these collapses preserves homeomorphism type as well as the property of having a regular CW complex. These collapses use the families of curves introduced in Definition 6.18. We assume inductively that all earlier collapses were performed successfully in order to justify that the k-th collapse preserves homeomorphism type, regularity, and all the requisite properties for our inductive step. We also assume inductively all results in the paper for all strictly smaller d.
We use the cell collapsing order given just after Example 6.17. The k-th collapsing step is specified by a deletion pair {x i l k , x i r k } in an xexpression x(F k ), with the cell F k / ∼ k ∈ (R d ≥0 ∩ S d−1 1 )/ ∼ k collapsed across curves each having one endpoint in the closed cell G 1 / ∼ k which consists of the points of F k / ∼ k with t l k = 0 and the other endpoint in the closed cell G 2 / ∼ k instead having t r k = 0. The series of lemmas we have just proven will allow us to verify all the requirements for our curves to be a parallel-like family of curves (in the extended sense of Corollary 4.24) and to check all of the hypotheses of Theorem 4.21 (again as extended in Corollary 4.24), once we show how to incorporate the requisite change of coordinates homeomorphisms ch into the picture. This change of coordinates which will help us accomplish the k-th collapse will be done on (R d ≥0 ∩ S d−1 1 )/ ∼ r k −1 to create a stutter, so in particular will be done prior to the k-th collapse.
The fact that i r k = i r is the leftmost right endpoint of a deletion pair in x(F k ) implies that (i 1 , . . . , i r−1 ) is reduced and hence that (j 1 , . . . , j r−1 ) is also reduced with w(i 1 , . . . , i r−1 ) = w(j 1 , . . . , j r−1 ) and hence w(i 1 , . . . , i d ) = w(j 1 , . . . , j d ). Let us also now choose a reduced word (j 1 , . . . , j d ) such that j i = j i for all i ≤ d . . In particular, ch −1 also thereby will induce a transfer of a parametrization function to each nontrivial curve in the closed cell F k / ∼ r k −1 (i 1 ,...,i d ) in (R d ≥0 ∩ S d−1 1 )/ ∼ r k −1 (i 1 ,...,i d ) which is a continuous function to [0, 1] on the union of these nontrivial curves. Moreover, condition (DE) together with the fact that collapses subsequent to those producing ∼ r k −1 and leading to ∼ k restrict to homeomorphisms on each closed cell that they do not collapse will imply that these collapses will also carry forward these curve parametrizations for all curves that stay nontrivial under the intermediate collapses to the quotient complex (R d ≥0 ∩ S d−1 1 )/ ∼ k from the quotient complex (R d ≥0 ∩ S d−1 1 )/ ∼ r k −1 . Thus, our parallel-like curves for F k / ∼ k will be the images under ch −1 of these parallel-like curves from (R d ≥0 ∩ S d−1 1 )/ ∼ r−1 (j 1 ,...,j d ) , pushed forward by the collapses yielding ∼ k from ∼ r k −1 (i 1 ,...,i d ) . Now let us carefully define the change of coordinates map ch (and thereby ch −1 ). This map ch is most naturally defined on the closed cell F k / ∼ r k −1 (i 1 ,...,i d ) . Lemma 6.24 (as explained in Remark 6.26) proves ch is a cell structure preserving homeomorphism from F k / ∼ r− given by the word (j 1 , . . . , j d ). It will be a necessity for our upcoming approach to collapsing F k / ∼ k via transfer of parallel-like curves carried out by the map ch −1 that f (i 1 ,...,i d ) (x) = f (j 1 ,...,j d ) (ch(x)) for each x ∈ F k / ∼ r k −1 (i 1 ,...,i d ) ; however, this relationship between x and ch(x) will not be needed for the extension of ch −1 to points x outside of F k / ∼ k , because the collapsing map we will use to collapse F k will restrict to an injection outside of F k / ∼ k . Thus, we may simply extend ch −1 to a neighborhood N of F k / ∼ k by thickening the boundary of F k / ∼ k to ∂(F k )/ ∼ k ×[0, ) and letting ch −1 (x, t) = (ch −1 (x), t) for each t ∈ [0, ). This thickening is possible since the closed complement of F k within the boundary of a cell of dimension one higher is a topological manifold with boundary, by Lemma 4.21 applied to the earlier collapse, hence has a collar by Theorem 2.8.
It is worth emphasizing that the transfer of curve parametrizations resulting from ch −1 will not in any way actually modify the collapsing procedure that we already indicated we would use and which has been described and analyzed in detail earlier in this section of the paper. Rather, the map ch −1 on F k is used to justify that we indeed have parallel-like curves in a suitable sense (i.e. as in Corollary 4.24) to enable the collapse of F k even when long braid moves are needed to create a stutter in x(F k ); we do this by giving an alternate way that we could have obtained the closed cell F k / ∼ r−1 (i 1 ,...,i d ) . This in turn gives an alternate way we could have obtained the closed cell F k / ∼ k by performing exactly the collapses on (R d ≥0 ∩ S d−1 1 )/ ∼ r k −1 (i 1 ,...,i d ) (and in the process also on F k / ∼ r−1 (i 1 ,...,i d ) that we had planned for word (i 1 , . . . , i d ) to get from the equivalence relation ∼ r k −1 to the equivalence relation ∼ k , but having incorporated the transfer map ch −1 at the step where we had equivalence relation ∼ r k −1 . In other words, we regard (R d ≥0 ∩ S d−1 1 )/ ∼ r k −1 (i 1 ,...,i d ) as our starting point complex K 0 for purpose of justifying the collapse of F k / ∼ k .
Having now realized our curves from Definition 6.18 as the images of parallel line segments in a suitable sense, i.e. with a transfer from one complex to another complex potentially involved, we now turn to the remaining requirements for parallel-like curves. Lemmas 6.29, 6.30 and 4.19 confirm that the requirements (DIP), (DE) (as defined in Conditions 4.9 and 4.11, respectively) and condition (LUB) hold for the family of curves to be collapsed in the k-th collapse just prior to this collapse, assuming all earlier collapses were done successfully. Thus, all of the requirements of Theorem 4.21 (or at least their relaxations as in Corollary 4.24) are met, enabling us to repeatedly collapse cells until all cells given by non-reduced subwords of (i 1 , . . . , i d ) have been eliminated, preserving homeomorphism type and regularity at each step. Thus, the end result is a regular CW complex homeomorphic to a ball. Regularity and homeomorphism type for links, as defined in Definition 4.25, follow from Lemma 6.27, since it allows us to invoke Lemma 4.26, noting that the transversality requirements follow easily from the definition of our series of projection maps.

Regularity and homeomorphism type of Y w
We now finally turn to studying the topological structure of Y w itself. We will use the fact that (R d ≥0 ∩ S d−1 1 )/ ∼ is a regular CW complex homeomorphic to a ball to prove now that Y w is as well. First we must verify Condition 4 of Theorem 1.3 for the characteristic maps f (i 1 ,...,i d ) : (R d ≥0 ∩ S d−1 1 )/ ∼→ Y w and their restrictions to the closed cells of (R d ≥0 ∩ S d−1 1 )/ ∼. This is done in Lemma 6.33 below, which will only require the following properties of ∼, which are immediate from the definition of ∼: (1) Each p ∈ ∂(R d ≥0 ∩ S d−1 1 ) whose x-expression is not reduced is identified by ∼ with a point having more parameters set to 0 (2) p ∼ q implies w(f (i 1 ,...,i d ) (p)) = w(f (i 1 ,...,i d ) (q)).
The points in a cell boundary, i.e. the preimage of one of the attaching maps, are obtained by setting some positive parameters to 0. Proof Notice first that f (i 1 ,...,i d ) | F = f (i 1 ,...,i d ) . By Lemma 2.16, this means that w(x i 1 · · ·x i r · · · x i d ) = w(x i 1 · · ·x i r · · · x i d ) for r = r , provided that both expressions are reduced, since that implies that the map w just replaces each x i by simple reflection s i . Consequently, boundary points obtained by sending distinct single parameters to 0 to obtain reduced expressions of length one shorter must belong to distinct cells, hence have distinct images under f (i 1 ,...,i d ) . On the other hand, varying values of the nonzero parameters while keeping fixed which parameters are 0 and which are nonzero with the subexpression of nonzero parameters a reduced expression must also yield points with distinct images under f (i 1 ,...,i d ) , since Lusztig proved that f (i 1 ,...,i d ) acts homeomorphically on R s >0 for (i 1 , . . . , i d ) reduced. Combining yields that f (i 1 ,...,i d ) is injective upon restriction to the codimension one cells, as desired. Now to our main result, Theorem 6.34. It is phrased in a somewhat technical way so as to enable proof by induction on the length d, and also to overcome the challenge that it was not known previously even that f (i 1 ,...,i d ) ((R d ≥0 ∩ S d−1 1 )/ ∼) was a CW complex. Theorem 6.34 is immediately followed by corollaries with more natural statements.
To use Theorem 1.3 in proving Theorem 6.34, we will need the preimages of the various characteristic maps to be closed cells in (R d ≥0 ∩ S d−1 1 )/ ∼, since this will give condition 5 of our regularity criterion. )/∼ for σ itself directly; we overcome this issue by allowing flexibility in the choice of ∼ in the statement of the next theorem, in particular allowing the collapsing maps for the closure of a cell which is not top-dimensional to be induced from the collapsing maps on the entire complex. Proof The proof is by induction on d, with the case d = 1 being trivial. Therefore, we may assume the result for all finite Coxeter group elements of length strictly less than d. Remark 2.5 enables us to deduce continuity of f (i 1 ,...,i d ) from continuity of f (i 1 ,...,i d ) . Notice that f (i 1 ,...,i d ) restricts to any region obtained by setting some t i 's to 0 since x i (0) is the identity matrix. Whenever the resulting subword is reduced, results in [20] guarantee that f (i 1 ,...,i d ) acts homeomorphically on this open cell. The requirements of Corollary 3.9 regarding closures of cells in the (d − 1)-skeleton follow from our inductive hypothesis, along with the fact that any series of face collapses will restrict to one on the closure of any cell. Thus, we may apply Corollary 3.9 to deduce that f (i 1 ,...,i d ) ( (see [20], Sect. 4]), as well as the fact that our collapsing maps are identification maps, it follows that f (i 1 ,...,i d ) is also continuous on K. In particular, K meets all the requirements of Theorem 6.34. (t 1 , . . . , t d ), (t 1 , . . . , t d ) ∈ R d ≥0 and (i 1 , . . . , i d ) any reduced word,

Corollary 6.36 For
Finally we consider lk(u, w). Theorem 6.32 proved regularity and determined homeomorphism type for the links of the cells in (R d ≥0 ∩ S d−1 1 )/ ∼, using the natural projection map in that context (cf. Definition 6.31). This immediately transfers to yield analogous results for links in Y w via our cellpreserving homeomorphism f (i 1 ,...,i d ) .

Corollary 6.37
For each u < w in Bruhat order, the subcomplex lk(u, w) of Y w obtained as the image under the cell-preserving homeomorphism f (i 1 ,...,i d ) of the corresponding link within R d ≥0 / ∼ is a regular CW complex homeomorphic to a ball having the Bruhat interval (u, w] as its poset of closure relations. We expect that this notion of link should coincide, at least up to homeomorphism, with the notion of link given by Fomin and Shapiro for Y w in [11] by virtue of Thom's first isotopy lemma (cf. [14]).
It would be interesting to understand better how lk(u, w) relates both to subword complexes (cf. [17][18][19]) and also to the synthetic CW complexes for Bruhat intervals studied by Reading in [27].