Abstract
We study the interplay between the discrete geometry of Bruhat poset intervals and subword complexes of finite Coxeter systems. We establish connections between the cones generated by cover labels for Bruhat intervals and of root configurations for subword complexes, culminating in the notion of brick polyhedra for general subword complexes.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
This paper develops the relationship between Bruhat intervals in finite Coxeter groups and subword complexes by describing the interplay between Bruhat interval cones and root configurations. Based on this newly developed relationship, properties of brick polytopes for spherical root-independent subword complexes are extended towards general subword complexes by introducing brick polyhedra.
Bruhat interval cones were introduced and studied by Dyer in the study of positivity properties of Kazhdan-Lusztig and Stanley polynomials [4]. Subword complexes are simplicial complexes that have been introduced by Knutson and Miller in the context of Gröbner geometry of Schubert varieties [6, 7]. Based on the notion of root configurations from [3], this paper reconsiders the combinatorial and discrete-geometric understanding of subword complexes by closely tightening them to Dyer’s Bruhat interval cones.
Brick polytopes for spherical root-independent subword complexes were introduced and studied by Pilaud and Stump [10]. These generalized brick polytopes for sorting networks by Pilaud and Santos [8]. As shown by Ceballos, Labbé and Stump in [3], cluster complexes of finite type cluster algebras can be realized as spherical root-independent subword complexes and one main motivation for studying brick polytopes in [10] was to show that generalized associahedra for cluster algebras previously constructed by Chapoton, Fomin and Zelevinsky [2] and by Hohlweg, Lange and Thomas [5] can be realized as brick polytopes.
Motivated by the conjecture that important properties of brick polytopes for spherical root-independent subword complexes hold for all spherical subword complexes [10, Conjecture 7.1] (and which is known to hold in type A as shown in [8]), this paper introduces and studies brick polyhedra for general (spherical and non-spherical) subword complexes of finite type. It turns out that subtle properties of Bruhat interval cones are at the core of their understanding.
Subword complexes have a canonical recursive decomposition into smaller subword complexes. Previous considerations in [3, 10] were mainly developed for spherical subword complexes which are not closed under this recursive structure. The presented constructions still rely on elementary properties of the two fundamental notions root and weight functions for subword complexes. Otherwise, all constructions are based on newly developed properties of Bruhat interval cones that are then applied to general subword complexes.
This newly presented approach allows inductive arguments using the recursive structure as done in the proof of Proposition 3.14. This is then used to deduce the uniqueness properties of certain facets constructed in Algorithm 3.16 that in turn are the central ingredient in the structural understanding of the construction of brick polyhedra. After recalling standard notions and properties of finite type Coxeter groups, their root systems and their subword complexes in Sect. 2, we start the discussion of the interplay between Bruhat intervals and subword complexes in Sect. 3. The main results of this interplay are the following, we refer below for proper definitions. Let \((W,\mathcal {S})\) be a finite Coxeter system and let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a subword complex associated to a word \(\textrm{Q}\) in the simple reflections \(\mathcal {S}\) with Demazure product \({{\text {Dem}}}(\textrm{Q})\) and an element \(w \in W\) in the Coxeter group.
-
Theorem 3.1 yields that the Bruhat interval cone of the Bruhat interval \([w,{{\text {Dem}}}(\textrm{Q})]\) equals the intersection of all cones over root configurations of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\).
-
Theorem 3.4 and Corollaries 3.5 and 3.6 exhibits containment properties of Bruhat interval cones that are fundamental for all further considerations.
-
Proposition 3.9 shows that the Bruhat interval cone describes the non-flippable vertices in facets.
-
Algorithm 3.16 provides an algorithm to compute f-antigreedy facets for linear functionals f that are non-negative on the Bruhat interval cone.
-
Based on this algorithm, Corollary 3.24 proves [10, Conjeture 7.1] for general subword complexes.
Section 4 then introduces and studies brick polyhedra of subword complexes.
-
Definition 4.1 defines the brick polyhedron of a finite type subword complex.
-
Theorem 4.4 shows that the local cone of the brick polyhedron at a brick vector coincides with the cone over the root configuration.
-
Theorem 4.17 shows how to glue together chambers in the Coxeter fan to obtain the normal fan of the brick polyhedron.
-
Theorem 4.21 shows that all brick polyhedra for a fixed word are contained in each other in a natural way.
2 Background on Coxeter systems and subword complexes
This section recalls standard notions for finite Coxeter systems. These are mostly following the notions from [3, 10]. We also refer to [1] for further background material. Ongoing examples are collected in Sect. 2.5.
Let \({(W,\mathcal {S})}\) be a finite type Coxeter system of rank \(n = |\mathcal {S}|\) acting on a Euclidean vector space \(V \cong \mathbb {R}^n\) with inner form \(\langle \cdot , \cdot \rangle \). Let \(\Delta \subseteq \Phi ^+\subseteq \Phi \subseteq V\) be a root system for \({(W,\mathcal {S})}\) with simple roots \(\Delta = \left\{ \alpha _s \;|\; s \in \mathcal {S} \right\} \), positive roots \(\Phi ^+\), and negative roots \(\Phi ^-= -\Phi ^+\). For \(\beta \in \Phi \) we write \(|\beta | \in \Phi ^+\) for the positive root in \(\{ \pm \beta \}\). The reflections in W are \(\mathcal {R}= \left\{ s_\beta \;|\; \beta \in \Phi ^+ \right\} \) where \(s_\beta \) denotes the reflection sending \(\beta \) to its negative while fixing pointwise its orthogonal complement \(\beta ^\perp = \left\{ v \in V \;|\; \langle \beta , v \rangle = 0 \right\} \).
The corresponding Cartan matrix \((a_{st})_{s,t \in \mathcal {S}}\) is given by \(s(\alpha _t) = \alpha _t - a_{st} \alpha _s\). The fundamental weights \(\nabla = \left\{ \omega _s \;|\; s \in \mathcal {S} \right\} \subseteq V\) are then determined by \(\alpha _s = \sum _{t \in \mathcal {S}} a_{ts} \omega _t\) and W acts on the fundamental weights by \(s(\omega _t) = \omega _t - \delta _{s=t} \alpha _s\) for \(s,t \in \mathcal {S}\).
2.1 Reduced words and weak order
The length \(\ell (w)\) of an element \(w \in W\) is the smallest length of a word \(\textrm{s}_1 \dots \textrm{s}_{\ell (w)}\) such that its product is an expression \(w = s_1\cdots s_{\ell (w)}\) for w. Words (and also expressions) of smallest length are called reduced. Here and below, we mildly distinguish between words in \(\mathcal {S}\) and the corresponding expressions for elements in W by writing \(\textrm{s}_1 \dots \textrm{s}_\ell \in \mathcal {S}^*\) for the word and \(s_1\cdots s_\ell \in W\) for the expression. It is well-known that for \(w \in W, s \in \mathcal {S}\) we have
This in particular means that a word \(\textrm{s}_1 \dots \textrm{s}_\ell \) is reduced if and only if for all \(1 < i \le \ell \) we have \(s_1\cdots s_{i-1}(\alpha _{s_i}) \in \Phi ^+\). The (right) weak order \(\le _\textsf{R}\) on W is the partial order defined by the cover relations \(w \prec _\textsf{R}ws\) for \(w \in W, s \in \mathcal {S}\) with \(\ell (ws) = \ell (w)+1\). The inversion set of an element \(w \in W\) with reduced expression \(w = s_1 \cdots s_\ell \) is given by
This is independent of the chosen reduced word and it is not hard to see that \({\text {Inv}}(w) = \Phi ^+\, \cap \, w(\Phi ^-)\) see, for example, [1, Section 1.4]. In particular, \(\ell (w) = |{\text {Inv}}(w)|\) and \(x \le _\textsf{R}y \Leftrightarrow {\text {Inv}}(x) \subseteq {\text {Inv}}(y)\). The longest element \({w_\circ }\in W\) is the unique element of longest length \(|\Phi ^+|\) which is equivalently described as the unique element with \({\text {Inv}}({w_\circ }) = \Phi ^+\). For any \(w \in W\), we have a decomposition
and a subset \(X \subseteq \Phi ^+\) is the inversion set of an element if and only if X and \(\Phi ^+{\setminus } X\) are separated by a hyperplane, i.e., there is a linear functional \(f: V \rightarrow \mathbb {R}\) such that for all \(\beta \in \Phi ^+\), we have
We record the following well-known lemma.
Lemma 2.1
([1, Lemma 1.4.4]) Let \(w \in W\) with reduced expression \(w = s_1 \cdots s_\ell \) and let \(s_\beta \in \mathcal {R}\). Then the following properties are equivalent:
-
(a)
\(\ell (s_\beta w) < \ell (w)\),
-
(b)
\(s_\beta w = s_1 \cdots \widehat{s}_k \cdots s_\ell \) for some index k,
-
(c)
\(\beta = s_1 \cdots s_{k-1}(\alpha _{s_k})\) for some index k.
Moreover, the index k is unique in both cases.
Since (c) is the defining property for \(\beta \) to be an inversion of w, we obtain from this lemma that
2.2 Bruhat order
The Bruhat order \(\le \) on W is the partial order defined by the cover relations \(w \prec rw\) for \(w \in W, r \in \mathcal {R}\) with \(\ell (rw) = \ell (w)+1\). Observe that \(w \prec _\textsf{R}ws \Rightarrow w \prec ws\) because \(ws = (wsw^{-1})w\) for \(wsw^{-1} \in \mathcal {R}\). For the positive root \(\beta \in \Phi ^+\) with \(r = s_\beta \), we say that the cover relation \(w \prec rw\) is labelled by \(\beta \). In particular, the cover \(w \prec ws\) is labelled by \(w(\alpha _s)\) which is a positive root by (2.1). A Bruhat interval [x, y] is defined for \(x \le y\) in Bruhat order by
The following properties of the Bruhat order are needed in subsequent sections.
Lemma 2.2
([1, Proposition 2.2.7]) Let \(x,y \in W\) and \(s \in \mathcal {S}\) such that \(x \le y\), \(x \prec sx\) and \(sy \prec y\). Then \(x \le sy\) and \(sx \le y\).
This lemma immediately yields the following known lifting property for Bruhat intervals.
Corollary 2.3
Let \(x,y \in W\) and \(s \in \mathcal {S}\) such that \(x \le y\), \(x \prec sx\), \(sy \prec y\) and \(sx \not \le sy\). Then \([x,sy] \cong [sx,y]\) and the isomorphism is given by \(w \mapsto sw\).
Lemma 2.4
([1, Corollary 2.2.8]) Let \(w \in W\), \(s \in \mathcal {S}\) and \(r \in \mathcal {R}\) such that \(s \ne r\) and \(w \prec sw, rw\). Then \(sw, rw \prec srw\).
Putting these properties together, we obtain the following proposition.
Proposition 2.5
Let \(x,y \in W\), \(s \in \mathcal {S}\) and \(r \in \mathcal {R}\) such that \(s \ne r\) and \(x \prec sx, rx \le y\). If moreover \(srx \not \le y\) then \(y \prec sy\), \(srx \le sy\) and \([rx,y] \cong [srx,sy]\).
Proof
Lemma 2.4 yields \(x \prec sx, rx \prec srx\). Assuming \(sy \prec y\) and applying Lemma 2.2 to \(rx \prec srx\) and to \(sy \prec y\) would imply \(srx \le y\), a contradiction. Hence \(y \prec sy\). Again by Lemma 2.2 applied to \(rx \prec srx\) and to \(y \prec sy\) we obtain \(srx \le sy\) and by Corollary 2.3 we get \([rx,y] \cong [srx,sy]\). \(\square \)
For later reference, we further recollect the following property.
Lemma 2.6
([1, Lemma 2.2.10]) Let \(x,y \in W\) and \(r \in \mathcal {R}\). If both, \(x \le xr\) and \(y \le ry\), then \(xy \le xry\).
2.3 The Demazure product
For a (not necessarily reduced) word \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\) in \(\mathcal {S}\) and a subset \(X \subseteq \{1,\dots ,m\}\), we write \(\textrm{Q}_X\) to be the subword of \(\textrm{Q}\) of the letters \(\textrm{s}_i\) with \(i \in X\). The Demazure product \({{\text {Dem}}}(\textrm{Q}) \in W\) may be defined in terms of the weak order recursively by
with initial condition \({{\text {Dem}}}({\varepsilon }) = {e}\in W\) for the empty word \({\varepsilon }\). By (2.1), these conditions say that the Demazure product of \(\textrm{Q}\) is obtained by scanning through \(\textrm{Q}\) from left to right, starting at the identity and going upwards in weak order whenever possible. One may equivalently define the Demazure product in terms of the Bruhat order as the unique maximal element in Bruhat order among all expressions obtained from the word \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\) by removing letters,
see [6, Lemma 3.4(1)]. Here and below, \(\Pi {\textrm{Q}}_{X} \in W\) denotes the product of the simple reflections \(s_i\) with \(i \in X\) in the given order.
2.4 Subword complexes for Coxeter systems
For \(w \in W\) and \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\), the subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is the simplicial complex of sets of (positions of) letters in \(\textrm{Q}\) whose complements contain reduced words for w. Knutson and Miller introduced subword complexes in the context of Gröbner geometry of Schubert varieties [6, 7]. By (2.6), \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is non-empty if and only if \(w \le {{\text {Dem}}}(\textrm{Q})\). Facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) are subwords of \(\textrm{Q}\) whose complements are reduced words for w. As shown in [6, Theorem 3.7, Corollary 3.8] the non-empty complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is a topological sphere if and only if \(w = {{\text {Dem}}}(\textrm{Q})\) and a topological ball otherwise. In these cases we call \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) spherical and non-spherical, respectively.
For two facets \(I \ne J\) of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) we say I and J are adjacent if there are \(i \in I\) and \(j \in J\) such that \(I \setminus \{i\} = J \setminus \{j\}\). We call the transition from I to J the flip of i in I and furthermore say that the flip is increasing if \(i < j\) and decreasing otherwise. The root function \({{\textsf {r}}}(I,\cdot ): [m] \rightarrow \Phi = W(\Delta ) \subseteq V\) is defined by
As above, \(\Pi {\textrm{Q}}_{X}\) denotes the product of the simple reflections \(s_i\), for \(i \in X\) in the given order. Observe here that the root \({{\textsf {r}}}(I,k)\) only depends on \(I \cap \{1,\dots ,k-1\}\) and not on the complete facet I. The ordered multisetFootnote 1\({{\textsf {R}}}(I) = \left\{ \!\!\left\{ {{\textsf {r}}}(I,i) \;|\; i \in I \right\} \!\!\right\} \) is called root configuration of the facet I.
The following lemma recalls several properties of flips in subword complexes in terms of root configurations. These can be found in [9, Proposition 2].
Lemma 2.7
Let I be a facet of the non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\).
-
(a)
The map \({{\textsf {r}}}(I,\cdot ): k \mapsto {{\textsf {r}}}(I,k)\) is a bijection between the complement of I and \({\text {Inv}}(w)\).
-
(b)
For \(i \in I\), there exists a facet J and an index \(j \in J\) such that \(I {\setminus } \{i\} = J {\setminus } \{j\}\) if and only if \(|{{\textsf {r}}}(I,i)| \in {\text {Inv}}(w)\). In this case, the index j is the unique position in the complement of I for which \({{\textsf {r}}}(I,j) = |{{\textsf {r}}}(I,i)|\) and the sign is determined by
$$\begin{aligned} {{\textsf {r}}}(I,j) = {\left\{ \begin{array}{ll} {{\textsf {r}}}(I,i) &{}\text {if } i < j, \\ -{{\textsf {r}}}(I,i) &{}\text {if } i > j. \end{array}\right. } \end{aligned}$$ -
(c)
In the situation of (b), the map \({{\textsf {r}}}(J,\cdot )\) is obtained from \({{\textsf {r}}}(I,\cdot )\) by
$$\begin{aligned} {{\textsf {r}}}(J,k) = {\left\{ \begin{array}{ll} s_{{{\textsf {r}}}(I,i)} \big ({{\textsf {r}}}(I,k)\big ) &{} \text {if } \min (i,j) < k \le \max (i,j), \\ {{\textsf {r}}}(I,k) &{} \text {otherwise. } \end{array}\right. } \end{aligned}$$
Non-empty subword complexes come with two extremal facets. Considering facets as ordered sets\(^{1}\), the greedy facet \(I_{{\text {g}}}\) is the lexicographically first facet and the antigreedy facet \(I_{{\text {ag}}}\) is the lexicographically last facet. Using Lemma 2.7, one can describe these greedy facets by their root configurations. We also refer to [9, Section 4.2] for a discussion of greedy facets.
Lemma 2.8
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex. Its greedy facet \(I_{{\text {g}}}\) is the unique facet with \({{\textsf {R}}}(I_{{\text {g}}}) \subseteq \Phi ^+\) and its antigreedy facet \(I_{{\text {ag}}}\) is the unique facet with \({{\textsf {R}}}(I_{{\text {ag}}}) \subseteq w(\Phi ^+)\).
Proof
As shown in [9, Proposition 6], the greedy facet is the unique facet for which all flips are increasing, and the antigreedy facet is the unique facet for which all flips are decreasing. These properties are equivalent to the respective descriptions in terms of root configurations: For the greedy facet, this immediately follows from Lemma 2.7(b), while it follows for the antigreedy facet from this lemma together with the computation
where the first inclusion is the describing property that all flips are decreasing and the others are elementary reformulations. \(\square \)
2.5 Ongoing examples
Throughout this paper we present examples in Coxeter systems of types \(A_2\), \(B_2\) and \(B_3\). We generally write \(\mathcal {S}= \{s_1,\dots ,s_n\}\) for concrete generators \(s_i\) and also \(\Delta = \{\alpha _1,\dots ,\alpha _n\}\) for simple roots with \(\alpha _i = \alpha _{s_i}\). To keep examples compact, we write shorthand \(\textrm{Q}= 123212 = \textrm{s}_1\textrm{s}_2\textrm{s}_3\textrm{s}_2\textrm{s}_1\textrm{s}_2\) for words in \(\mathcal {S}\) and also for elements \(w = 1231 = s_1s_2s_3s_1 \in W\) as reduced words, and we abbreviate \({{213}_{\Delta }} = 2\alpha _1+\alpha _2+3\alpha _3\) and \({\overline{213}_\Delta } = -{{213}_{\Delta }}\) for vectors written in the basis of simple roots.
Example 2.9
(Type \(A_2\)) We have \(\mathcal {S}= \{ s_1,s_2 \}\), the simple and positive roots \(\Delta \subset \Phi ^+\) given by \( \{ {{10}_{\Delta }}, {{01}_{\Delta }} \}\subset \{ {{10}_{\Delta }},{{01}_{\Delta }},{{11}_{\Delta }} \} \) and
The fundamental weights are \( \nabla = \{ \omega _1 = \tfrac{1}{3}({{21}_{\Delta }}), \omega _2 = \tfrac{1}{3}({{12}_{\Delta }}) \}. \)
Example 2.10
(Type \(B_2\)) We have \(\mathcal {S}= \{ s_1,s_2 \}\), the simple and positive roots \(\Delta \subset \Phi ^+\) given by \( \{ {{10}_{\Delta }}, {{01}_{\Delta }} \}\subset \{ {{10}_{\Delta }}, {{01}_{\Delta }}, {{11}_{\Delta }}, {{12}_{\Delta }} \} \) and
The fundamental weights are \( \nabla = \{ \omega _1 = {{11}_{\Delta }}, \omega _2 = \tfrac{1}{2}({{12}_{\Delta }}) \}. \)
Example 2.11
(Type \(B_3\)) We have \(\mathcal {S}= \{ s_1,s_2,s_3 \}\), the simple and positive roots \(\Delta \subset \Phi ^+\) given by \( \{ {{100}_{\Delta }}, {{010}_{\Delta }}, {{001}_{\Delta }} \}\subset \{ {{100}_{\Delta }},{{010}_{\Delta }},{{001}_{\Delta }},{{110}_{\Delta }},{{011}_{\Delta }},{{111}_{\Delta }},{{012}_{\Delta }},{{112}_{\Delta }},{{122}_{\Delta }} \} \) and
The fundamental weights are \( \nabla = \{ \omega _1 = ({{111}_{\Delta }}), \omega _2 = ({{110}_{\Delta }}), \omega _3 = \tfrac{1}{2}({{112}_{\Delta }}) \}. \)
3 The interplay between Bruhat intervals and subword complexes
This section studies the interplay between Bruhat intervals and subword complexes via root configurations. To this end, we recall the (closed) cone over a finite set \(X \subseteq V\) to be
The following notions of Bruhat cones were studied by Dyer in the context of Kazhdan-Lusztig polynomials [4]. For a Bruhat interval [x, y], the upper Bruhat cone \({\mathcal {C}^+(x,y)}\) and the lower Bruhat cone \({\mathcal {C}^-(x,y)}\) are defined by \({\mathcal {C}^+(x,y)} = {{\,\textrm{cone}\,}}{\mathcal {E}^+(x,y)}\) and \({\mathcal {C}^-(x,y)} = {{\,\textrm{cone}\,}}{\mathcal {E}^-(x,y)}\) for
where \(x \prec s_\beta x\) and \(s_\beta y\prec y\) are cover relations. In other words, the upper Bruhat cone is the cone spanned by the labels of the atoms in the Bruhat interval [x, y] and the lower Bruhat cone is the cone spanned by the labels of the coatoms. Since we mainly discuss upper Bruhat cones, we simply call these Bruhat cones.
The goal of this section is to develop tools connecting Bruhat cones and root configurations, culminating in the following theorem.
Theorem 3.1
Let \(\textrm{Q}\) be a word in \(\mathcal {S}\) and let \(w \in W\) with \(w \le {{\text {Dem}}}(\textrm{Q})\). Then
where the intersection is taken over all facets I of the subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\).
3.1 Properties of Bruhat cones
We first recall several properties of Bruhat cones from [4] and then exhibit further recursive properties of these.
Lemma 3.2
[4, Proposition 1.4, Proposition 3.6] Let [x, y] be a Bruhat interval and let \(w \in W\). Then
-
(a)
\({\mathcal {C}^-(e,w)} \cap {\mathcal {C}^+(w,{w_\circ })} = \{0\}\) and \(\Phi ^+\subseteq {\mathcal {C}^-({e},w)} \cup {\mathcal {C}^+(w,{w_\circ })}\).
-
(b)
\({\mathcal {E}^+(x,y)}\) are the rays of \({\mathcal {C}^+(x,y)}\) and \({\mathcal {E}^-(x,y)}\) are the rays of \({\mathcal {C}^-(x,y)}\).
-
(c)
For \(\beta \in {\mathcal {E}^+(x,y)}\) we have \({\mathcal {C}^+(x,y)} \subseteq {\mathcal {C}^+(s_\beta x,y)} + \mathbb {R}(\beta )\), and similar for \({\mathcal {C}^-(x,y)}\).
-
(d)
For \(\beta \in \Phi ^+\) with \(x \le s_\beta x \le y\) we have \(\beta \in {\mathcal {C}^+(x,y)}\), and similar for \({\mathcal {C}^-(x,y)}\).
This lemma has the following consequence, which is interesting in itself while not used in our further considerations. It can also be directly deduced from (2.4) and (2.5).
Corollary 3.3
Let \(w \in W\). Then \({\mathcal {E}^-({e},w)}\) are the extremal rays of \({{\,\textrm{cone}\,}}{\text {Inv}}(w)\) and \({\mathcal {E}^+(w,{w_\circ })} = {\mathcal {E}^-({e},w\cdot {w_\circ })}\) are the extremal rays of \({{\,\textrm{cone}\,}}{\text {Inv}}(w\cdot {w_\circ })\). In particular,
Proof
It is immediate from (2.5) that \({\mathcal {E}^-({e},w)} \subseteq {\text {Inv}}(w)\), and thus \({\mathcal {E}^+(w,{w_\circ })} = {\mathcal {E}^-({e},w\cdot {w_\circ })} \subseteq {\text {Inv}}(w\cdot {w_\circ })\). The statements then follow with (2.4) and (2.3) from Lemma 3.2(b) and (a). \(\square \)
We provide the following additional properties needed in subsequent considerations.
Theorem 3.4
Let \(x,y \in W\) and \(s \in \mathcal {S}\) such that \(x \le y \prec sy\). Then
Corollary 3.5
Let \(x,y \in W\) and \(s \in \mathcal {S}\) such that \(sx \prec x \le y\). Let furthermore \(\tau \in \{ sy, y \}\) be the Bruhat smaller element. Then
We also need this corollary for the weak order, so we also provide that version individually.
Corollary 3.6
Let \(x,y \in W\) and \(s \in \mathcal {S}\) such that \(xs \prec x \le y\). Let furthermore \(\tau \in \{ ys, y \}\) be the Bruhat smaller element. Then
The first step in the proof is to strengthen Lemma 3.2(c) for simple roots in \({\mathcal {E}^+(x,y)}\) as follows.
Proposition 3.7
Let \(x,y \in W\), \(s\in \mathcal {S}\) and \(r = s_\beta \in \mathcal {R}\) such that \(s \ne r\) and \(x \prec sx, rx \le y\). Then
Proof
By Lemma 2.4 we have \(x \prec sx, rx \prec srx\) with \(srx = s_{s(\beta )} sx\).
If \(srx \le y\) then \( s(\beta ) \in {\mathcal {C}^+(sx,y)} \subseteq {\mathcal {C}^+(sx,y)} + \mathbb {R}_+(\alpha _s) \) by definition, so we have to consider the situation \(srx \not \le y\). In this case \(s( \beta ) \not \in {\mathcal {C}^+(sx,y)}\), and the situation with their cover labels is
We may thus apply Proposition 2.5 and obtain \(y \prec sy\), \(srx \le sy\) and \([rx,y] \cong [srx,sy]\) given by \(w \mapsto sw\), and get
By Lemma 3.2(a) we have \(\beta \not \in {\mathcal {C}^+(rx,sy)}\), and by Lemma 3.2(b) we have \(\alpha _s \in {\mathcal {C}^+(rx,sy)}\) is a ray, implying in particular \(\alpha _s \not \in {\mathcal {C}^+(rx,y)}\). Because \(\alpha _s \in \Delta \) is simple and because \({\mathcal {C}^+(rx,y)} \subseteq {\mathcal {C}^+(rx,sy)}\) we obtain
where the situation is considered inside the two-dimensional plane \(P = \langle \alpha _s, \beta \rangle _\mathbb {R}\). This situation is sketched as
Together with (*), this implies
By the assumption \(x \prec rx \le y\), we know \(\beta \in {\mathcal {C}^+(x,y)}\). Together with Lemma 3.2(c), this implies
The cone \({\mathcal {C}^+(sx,y)}\) therefore intersects the plane P non-trivially, \({\mathcal {C}^+(sx,y)} \cap P \ne \{0\}\). We have \({\mathcal {C}^+(sx,y)} \subseteq {\mathcal {C}^+(sx,sy)}\) by definition and we have \({\mathcal {C}^+(sx,sy)} \subseteq {\mathcal {C}^+(srx,sy)} + \mathbb {R}( s(\beta ) )\) by Lemma 3.2(c). So we obtain \({\mathcal {C}^+(sx,y)} \subseteq {\mathcal {C}^+(srx,sy)} + \mathbb {R}( s(\beta ) )\), sketched as
Since \({\mathcal {C}^+(sx,y)}\) is spanned by positive roots, (**) and (***) finally yield
\(\square \)
The following example details the situation in the proof of Proposition 3.7.
Example 3.8
(Type \(B_3\)) Let \(x = 13231\) and \(r = s_{{{122}_{\Delta }}}\). Then
and we have \(x \prec s_2x,rx \prec s_2rx\) in accordance with Lemma 2.4. Let \(y = 32312321\) so that \(s_2x, rx \le y\) while \(s_2rx \not \le y\). We draw the interval \([x, s_2y]\) where crucial cover relations and elements are drawn in black while others are drawn in light grey for better readability.
We see \([rx, y] \cong [s_2rx, s_2y]\) realized by \(w \mapsto s_2w\) as predicted by Proposition 2.5 and furthermore
The plane \({P = \langle {{010}_{\Delta }}, {{122}_{\Delta }}\rangle _\mathbb {R}}\) contains the sub root system of type \(A_2\) with simple roots \(\Delta _P = \{ {{010}_{\Delta }}, {{112}_{\Delta }} \}\) and we have \(\Phi ^+\cap P = \{{{010}_{\Delta }}, {{122}_{\Delta }}, {{112}_{\Delta }}\}\)
and see \( s_2( {{122}_{\Delta }} ) = {{112}_{\Delta }} \in {\mathcal {C}^+(s_2 x,y)} + {{\,\textrm{cone}\,}}\{ {{010}_{\Delta }} \} \) as predicted by Proposition 3.7.
Proof of Theorem 3.4
Let \(r \in \mathcal {R}\) with \(x \prec rx \le sy\). If \(rx \le y\) or \(r = s\) the statement is trivial, so let \(rx \not \le y\) and \(r \ne s\).
As \(rx \le sy\) while \(rx \not \le y\), we have \(y \prec sy\). Hence there is a reduced word for sy that starts with the letter \(\textrm{s}\) and from which we may delete letters to obtain a reduced word for rx. Observe that we must not delete the initial letter \(\textrm{s}\) in this process, so we obtain a reduced word for rx with initial letter \(\textrm{s}\). Now by deleting this initial \(\textrm{s}\), we get \(srx \prec rx\) and \(srx \le y\).
As \(r \ne s\) we have \(x \ne srx\) and \(x, srx \prec rx\). We thus obtain
and conclude with Proposition 3.7. \(\square \)
Proof of Corollary 3.5
If \(x = y\) we have \({\mathcal {C}^+(x,y)} = \{0\}\) and the statement is trivial, hence let \(x < y\). We first prove for any \(\beta \in {\mathcal {E}^+(x,y)}\), that
We have \(\ell (s_\beta x) = \ell (sx) + 2\), hence
and therefore by Lemma 3.2(d), \(s(\beta ) \in {\mathcal {C}^+(sx,s s_\beta x)}\). If \(s s_\beta x \prec s_\beta x\) then
If otherwise \(s_\beta x \prec s s_\beta x\) we apply Theorem 3.4 to obtain
But as \(sx \prec x \prec s_\beta x\) we have \({\mathcal {C}^+(sx,s_\beta x)} + \mathbb {R}_+( \alpha _s ) = {\mathcal {C}^+(sx,s_\beta x)}\) and thus \(s(\beta ) \in {\mathcal {C}^+(sx,s_\beta x)}\). This concludes the proof of (*).
If \(\tau = y\) we clearly have \({\mathcal {C}^+(sx,s_\beta x)} \subseteq {\mathcal {C}^+(sx,y)}\) for every \(\beta \in {\mathcal {E}^+(x,y)}\), hence by (*) we get
If \(\tau = sy\) we consider the following cases.
Case 1: If \(x \not \le sy\) we apply Corollary 2.3 to \(sx \prec x\) and \(sy \prec y\) and obtain \([sx, sy] \cong [x,y]\), hence \(s( {\mathcal {C}^+(x,y)} ) = {\mathcal {C}^+(sx,\tau )}\).
Case 2: If \(x \le sy\) but \(s_\beta x \not \le sy\) take a reduced word for y that starts with \(\textrm{s}\), say \( \textrm{s}~ \textrm{s}_1 \dots \textrm{s}_m, \) so that \(\textrm{s}_1 \dots \textrm{s}_m\) is a reduced word for \(sy = \tau \). A reduced word for \(s_\beta x\) can be obtained by deleting letters different from the initial letter \(\textrm{s}\). Therefore s is a descent of \(s_\beta x\) and furthermore \(s s_\beta x \le \tau \). Thus \( s( \beta ) \in {\mathcal {C}^+(sx,s s_\beta x)} \subseteq {\mathcal {C}^+(sx,\tau )}\).
Case 3: If \(s_\beta x \le sy\) we apply (*) to obtain \(\textrm{s}(\beta ) \in {\mathcal {C}^+(sx,s_\beta x)} \subseteq {\mathcal {C}^+(sx,\tau )}\) for every \(\beta \in {\mathcal {E}^+(x,y)}\). \(\square \)
Proof of Corollary 3.6
We first show the identity
If \(x=y\) the statement is trivial, hence let \(x<y\) and take \(\beta \in {\mathcal {E}^+(x,y)}\). We then have \(x \prec s_\beta x\le y\) or, equivalently,
This implies \(x^{-1}(\beta ) \in {\mathcal {E}^+(x^{-1},y^{-1})}\) and we obtain (*).
Again the main statement is trivial for \(x=y\), hence let \(x<y\) and take \(\beta \in {\mathcal {E}^+(x,y)}\). We then have similar as above
By Corollary 3.5 we get
Applying (*) we finally conclude with
\(\square \)
3.2 Bruhat cones and non-flipable vertices in subword complexes
For a non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\), we connect in this section the cone \({\mathcal {C}^+(w,{{\text {Dem}}}(\textrm{Q}))}\) to the non-flippable vertices in facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\). We then use this description to show in Proposition 3.14 the first containment for Theorem 3.1,
by showing that all cover labels of atoms in the Bruhat interval \([w, {{\text {Dem}}}(\textrm{Q})]\) are contained in all cones over root configurations.
Proposition 3.9
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex. Then
Moreover, if \(i \in I\) is a flippable index in a facet I of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) then \({{\textsf {r}}}(I,i) \notin {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\).
First observe that
So the interesting case is if these conditions are satisfied: For a given \(\beta \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\), i.e., \(w \prec s_\beta w \le {{\text {Dem}}}(\textrm{Q})\), consider the map
from facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) to facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) given by \(J \mapsto J \cup \{k\}\) where k is the unique index in the complement of J such that \(\textrm{Q}_{\{1,\dots ,m\} \setminus (J \cup \{k\})}\) is a reduced word for w. This unique index is well-defined by Lemma 2.1 saying that for any reduced word \(\textrm{s}_1\dots \textrm{s}_\ell \) for \(s_\beta w\) there is a unique index k such that \(\textrm{s}_1\dots \widehat{\textrm{s}}_k \dots \textrm{s}_\ell \) is a word of w and this word is reduced because \(w \prec s_\beta w\) implies \(\ell (w) = \ell (s_\beta w) - 1\).
This discussion shows that every facet of \(\mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) is also a face of \(\mathcal{S}\mathcal{C}(\textrm{Q}, w)\), and this face is of codimension 1. It is in particular not surprising that the map \(\iota \) is not injective in general as seen in the following example.
Example 3.10
(Type \(A_1 \times A_1\)) We write this example in type \(B_3\) to use the above example scheme. Let \(\textrm{Q}= 131\) and \(w = 13 = 31\). The complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) then contains the two facets
If we consider the lower cover \(s_3 \prec w\) we obtain
Lemma 3.11
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex, let \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a facet and let \(i \in I\) non-flippable. Then \(I \setminus \{i\}\) is a facet of \(\mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) for \(\beta = {{\textsf {r}}}(I,i)\). In particular, the complement of \(I \setminus \{i\}\) is a reduced word and \(\beta \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\).
Proof
For \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\) the complement of the facet \(\textrm{Q}_{\{1,\dots ,m\} \setminus I}\) is a reduced word for w. We split this word into its prefix \(\textrm{w}_1 = \textrm{Q}_{\{1,\dots ,i\} \setminus I}\) and its suffix \(\textrm{w}_2 = \textrm{Q}_{\{i+1,\dots ,m\} \setminus I}\). We then have for the corresponding elements
Now \(i \in I\) is not flippable, hence by Lemma 2.7(b) we have \(\beta = w_1( \alpha _{s_i} ) \in \Phi ^+\) and therefore \(w_1 \prec w_1\cdot s_i\). For \(\textrm{Q}_{rev} = \textrm{s}_m \dots \textrm{s}_1\), we have the obvious isomorphism \(\mathcal{S}\mathcal{C}(\textrm{Q},w) \cong \mathcal{S}\mathcal{C}(\textrm{Q}_{rev},w^{-1})\) given by \(i \mapsto m+1-i\). The position \(m+1-i\) is thus not flippable in \(\mathcal{S}\mathcal{C}(\textrm{Q}_{rev},w^{-1})\) and we obtain by the same argument that \(w_2 \prec s_i\cdot w_2\). Applying now Lemma 2.6 we obtain
Hence \(\ell (s_\beta w) = \ell (w) + 1\) and we conclude the statement. \(\square \)
Lemma 3.12
Let \(w \prec s_\beta w \le {{\text {Dem}}}(\textrm{Q})\). Then:
-
(a)
There is a facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) and a non-flippable index \(i \in I\) with \({{\textsf {r}}}(I,i) = \beta \).
-
(b)
A facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) is in the image of \(\iota \) if and only if \(\beta \in {{\textsf {R}}}(I)\).
Proof
For (a), take any facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) and let \(i_k\) be defined as above with \(\iota (I) = I \cup \{i_k\}\). We then obtain the subword \(\textrm{s}_{i_1}\dots \textrm{s}_{i_\ell } = \textrm{Q}_{\{1,\dots ,m\} \setminus I}\) of \(\textrm{Q}\) with
being reduced expressions for \(s_\beta w\) and for w, respectively. This shows that
Clearly \(i_k\) is not flippable in the facet \(I \cup \{i_k\}\) of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\), as otherwise the given reduced expression of \(s_\beta w\) would contain two different reduced expressions for w, and this is not the case by the uniqueness property in Lemma 2.1.
For (b), we have already seen in the proof of (a) that \(\beta = {{\textsf {r}}}(I\cup \{i_k\},i_k)\) if \(I\cup \{i_k\} = \iota (I)\) is in the image of \(\iota \). Conversely, let I be a facet of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) such that \(\beta = {{\textsf {r}}}(I,i_k)\) for some \(i_k \in I\). As \(w \prec s_\beta w\) especially \(\beta \not \in {\text {Inv}}(w)\), hence \(i_k\) is not flippable in I. Therefore by Lemma 3.11 we have \(I \setminus \{i_k\}\) is a facet in \(\mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) and furthermore \(I = \iota ( I {\setminus } \{i_k\} )\) is in the image of \(\iota \), which concludes the proof. \(\square \)
Proof of Proposition 3.9
If \(\beta \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\) by Lemma 3.12(a) there is a facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) and a non-flippable index \(i \in I\) with \({{\textsf {r}}}(I,i) = \beta \) and thus
The other inclusion follows immediately with Lemma 3.11. \(\square \)
Example 3.13
(Type \(B_3\)) Take \(\textrm{Q}= 123123123\) to be a reduced word for the longest element \({w_\circ }\). For the simple generator \(s_1\) we have
corresponding to covers \(s_{{{010}_{\Delta }}} s_1 = s_2s_1,~ s_{{{001}_{\Delta }}} s_1 = s_3s_1\) and \(s_{{{110}_{\Delta }}} s_1 = s_1s_2\). The facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},s_1)\) and their root configurations are
with flippable positions in bold red.
For the values of the root function on non-flippable vertices this translates to the following result on root configurations.
Proposition 3.14
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex. Then
for every facet \(F \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\).
Proof
We prove this statement by induction on the length of \(\textrm{Q}= \textrm{s}_1\dots \textrm{s}_m\). The statement is trivially true for \(m=1\), so we may assume \(m \ge 2\). Let \(\textrm{Q}' = \textrm{s}_2 \dots \textrm{s}_m\) be obtained from \(\textrm{Q}\) by deleting the initial letter \(\textrm{s}_1\). Set moreover \(\sigma = {{\text {Dem}}}(\textrm{Q})\) and \(\tau = {{\text {Dem}}}(\textrm{Q}')\). One has the decomposition
where \(\mathcal{S}\mathcal{C}(\textrm{Q}',\textrm{s}_1 w)\) is only taken into account if \(s_1 w \prec w\), compare the proof of [6, Theorem 2.5]. For a facet \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\), one either has \(1 \in I\) and then \(I_1 = I \setminus \{1\} \in \mathcal{S}\mathcal{C}(\textrm{Q}',w)\) is a facet with \({{\textsf {R}}}(I) = {{\textsf {R}}}(I_1) \cup \{ \alpha _{s_1} \}\), or \(1 \notin I\) and then \(I_2 = I \in \mathcal{S}\mathcal{C}(\textrm{Q}',s_1 w)\) is a facet with \({{\textsf {R}}}(I) = s_1({{\textsf {R}}}(I_2))\). We aim to show that \({\mathcal {E}^+(w,\sigma )} \subseteq {{\,\textrm{cone}\,}}( {{\textsf {R}}}(I) )\).
Case 1: \(1 \in I\): We may assume by induction that
If \(\tau = \sigma \), we obtain
If \(\tau \prec \sigma = s_1 \tau \), we apply Theorem 3.4 to the situation \(w \le \tau \prec \sigma = s_1 \tau \) and obtain
Case 2: \(1 \notin I\): We may assume by induction that
Since \(1 \notin I\), there is a reduced word for w that starts with \(\textrm{s}_1\) and hence \(s_1 w \prec w \le \sigma \). By Corollary 3.5 we obtain
and thus
\(\square \)
The following describes a non-trivial example for the situation in Proposition 3.14. In particular, it shows that it is not enough to take the root configuration itself in the conclusion of the proposition.
Example 3.15
(Type \(A_2\)) Take \(\textrm{Q}= 1212\) with \({{\text {Dem}}}(\textrm{Q}) = 121 = 212\) and let \(w = 12\). We then have \( {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))} = \{ {{01}_{\Delta }} \}, \) the facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) and their root configurations are given by
While \({{01}_{\Delta }} \notin {{\textsf {R}}}(\{2,3\})\) is not in the root configuration, we see \({{01}_{\Delta }} = {{11}_{\Delta }} + {{{\overline{1}}0}_{\Delta }} \in {{\,\textrm{cone}\,}}{{\textsf {R}}}(\{2,3\})\) is in its cone, as proposed.
3.3 Constructing antigreedy facets inside certain half-spaces
We call a linear functional \(f: V \rightarrow \mathbb {R}\) non-negative for the Bruhat interval [x, y] if \(f(\beta ) \ge 0\) for all \(\beta \in {\mathcal {E}^+(x,y)}\). In this section, we provide an algorithm to construct an antigreedy facet \(I_f\) of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) relative to a given linear functional \(f: V \longrightarrow \mathbb {R}\) that is non-negative for the Bruhat interval \([w,{{\text {Dem}}}(\textrm{Q})]\). We show in Theorem 3.17 that the facet \(I_f\) is well-defined and that the linear functional f is non-negative on its root configuration, \(f(\beta ) \ge 0\) for all \(\beta \in {{\textsf {R}}}(I_f)\). For any vector \(v \notin {\mathcal {C}^+(w,{{\text {Dem}}}(\textrm{Q}))}\), one may thus choose a linear functional that is non-negative for \([w,{{\text {Dem}}}(\textrm{Q})]\) while \(f(v) < 0\). We then obtain \(v \notin {{\,\textrm{cone}\,}}({{\textsf {R}}}(I))\). This implies the remaining inclusion
and thus concludes the proof of Theorem 3.1.
Algorithm 3.16
Computing the f-antigreedy facet \(I_f\) of the subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\)
We aim to prove t5he following properties of the output set \(I_f \subseteq \{1,\dots ,m\}\) of Algorithm 3.16.
Theorem 3.17
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex and let \(f: V \rightarrow \mathbb {R}\) with \(f(\beta ) \ge 0\) for \(\beta \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\). The output set \(I_f \subseteq \{1,\dots ,m\}\) of Algorithm 3.16 has the following properties:
-
(a)
\(I_f\) is a facet of the subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\), i.e., the word \(\textrm{Q}_{\{1,\dots ,m\} {\setminus } I_f}\) is a reduced word for w.
-
(b)
For \(i \in I_f\), we have \(f({{\textsf {r}}}(I_f,i)) \ge 0\).
-
(c)
For \(i \in I_f\) with \(f({{\textsf {r}}}(I_f,i)) = 0\) and \({{\textsf {r}}}(I_f,i) \not \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\), we have \({{\textsf {r}}}(I_f,i) \in \Phi ^-\).
Remark 3.18
Applying this algorithm for \(w \le {{\text {Dem}}}(\textrm{Q})\) and a linear functional \(f: V \rightarrow \mathbb {R}\) which is positive on
-
the basis \(\Delta \) of V, i.e., \(f(\alpha _s) > 0\) for all \(s \in \mathcal {S}\), yields the greedy facet \(I_{{\text {g}}}\),
-
the basis \(w(\Delta )\) of V, i.e., \(f(w(\alpha _s)) > 0\) for all \(s \in \mathcal {S}\), yields the antigreedy facet \(I_{{\text {ag}}}\),
of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) as seen in Lemma 2.8.
In the k-th step of Algorithm 3.16 we have to choose whether to extend the output set \(I_f\) or to apply the simple reflection \(s_k\) to the element \(w_{k-1}\). In the former, we aim to ensure that a reduced word for w still can be obtained after this step. The following lemma formalizes this condition using Bruhat order.
Lemma 3.19
Let \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\) and \(w \le {{\text {Dem}}}(\textrm{Q})\) be an element in W. Furthermore let
for some subset \(X \subseteq \{1,\dots ,i\}\) such that \(\textrm{Q}_{\{1,\dots ,i\} {\setminus } X}\) is a reduced word for v. Then \(\textrm{Q}_{\{1,\dots ,i\} \setminus X}\) can be extended to a reduced word for w by a subword of \(\textrm{Q}_{\{i+1,\dots ,m\}}\) if and only if
Proof
This is a direct consequence of the definition of the Demazure product in terms of Bruhat order as given in (2.6). \(\square \)
The crucial step in the proof of Theorem 3.17 is the following property of the algorithm.
Proposition 3.20
At the end of the k-th iteration of the for loop, the word \(\textrm{Q}_{\{1,\dots ,k\}\setminus I_k}\) is a reduced word for \(w_k\) and can be extended to a reduced word for w by a subword of \(\textrm{Q}_{\{k+1\,\dots ,m\}}\).
Proof
Let \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\). Lemma 3.19 implies that if \(\textrm{Q}_{ \{1,\dots ,k\} \setminus I_k}\) is a reduced word for \(w_k\), then it can be extended to a reduced word for w by a subword of \(\textrm{Q}_{\{k+1,\dots ,m\}}\) if and only if
We prove in parallel by induction on the loop index k that the word \(\textrm{Q}_{\{1,\dots ,k\}\setminus I_k}\) is reduced and that property (*) holds. This is, we show that if these two properties are satisfied for all indices \(t < k\), than these are also satisfied for the index k. Since the two properties are satisfied before the first loop starts (this is, for \(k=0\)), the statement then follows.
For step \(k\ge 1\) we assume by induction that \(\textrm{Q}_{\{1,\dots ,k-1\} {\setminus } I_{k-1}}\) is a reduced word for \(w_{k-1}\) and that \((w_{k-1})^{-1} w \le {{\text {Dem}}}(\textrm{Q}_{\{k,\dots ,m\}})\).
We first show that the word \(\textrm{Q}_{\{1,\dots ,k\} \setminus I_{k}}\) is reduced. In the case of conditions (1), (2) and (3), we have \(\textrm{Q}_{\{1,\dots ,k\} {\setminus } I_{k}} = \textrm{Q}_{\{1,\dots ,k-1\} {\setminus } I_{k-1}}\) is reduced. In the case of conditions (5) and (6), we have \(w_{k-1}( \alpha _{s_k} ) = \beta _k \in \Phi ^+\) hence \(w_k = w_{k-1}\cdot s_k\) is reduced. It remains to show the case of condition (4), i.e., \(f(\beta _k) < 0\), where we need to show \(\beta _k \in \Phi ^+\).
By contraposition, we may assume \(\beta _k \in \Phi ^-\) and have to show that \(f(\beta _k) \ge 0\). As \(w_{k-1}\) is reduced and \(\beta _k = w_{k-1}(\alpha _{s_k})\) we have \(-\beta _k \in {\text {Inv}}(w_{k-1})\). Therefore there is an index \(t<k\) such that
and at step t we were in either of the cases of conditions (4), (5) or (6). If we were in the cases of conditions (4) or (5), then \(f(\beta _t) \le 0\) and hence \(f(\beta _k) \ge 0\) as desired.
We conclude that proof of reducedness by showing that it was impossible to be in the case of condition (6) at step t. By induction, the reduced word \(\textrm{Q}_{\{1,\dots ,k-1\} \setminus I_{k-1}}\) for \(w_{k-1}\) can be extended in \(\textrm{Q}_{\{k,\dots ,m\}}\) to a reduced word for w. Since \(\beta _k \in \Phi ^-\), this extended reduced word cannot use the letter \(\textrm{s}_k\). Thus there exists a facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) such that
But as \(-\beta _k \in {\text {Inv}}(w_{k-1}) \subseteq {\text {Inv}}(w)\), Lemma 2.7 implies that the index \(k \in I\) is flippable to t in this facet. In other words, the flip of k in I gives the facet \((I \setminus \{k\}) \cup \{t\}\). Now this in particular implies that \(\textrm{Q}_{\{t+1,\dots ,m\}}\) contains a reduced word for \(w_{t-1}^{-1} w\), hence
and we were not in the case of condition (6).
We conclude with showing that also (*) holds for the index k. If we are in one of the cases of conditions (4), (5) or (6), then (*) holds by (2.6). If we are in the case of condition (3), we have \(w_k = w_{k-1}\) and (*) is part of the condition.
If we are in the case of condition (2), we have \(\beta _k = w_{k-1}(\alpha _{s_k}) \in \Phi ^-\). But as we have the decomposition
we have \(\alpha _{s_k} \not \in {\text {Inv}}(w_{k-1}^{-1} w)\), hence no reduced word for \(w_{k-1}^{-1} w\) starts with \(\textrm{s}_k\). Therefore \(w_k^{-1} w = w_{k-1}^{-1} w \le {{\text {Dem}}}(\textrm{Q}_{\{k+1,\dots ,m\}})\).
If we are in the case of condition (1), we have \(w_{k-1} s_k \not \le _\textsf{R}w\), hence \(\beta _k \not \in {\text {Inv}}(w)\). Thus again by (**) we get \(\alpha _{s_k} \not \in {\text {Inv}}(w_{k-1}^{-1} w)\), hence no reduced word for \(w_{k-1}^{-1} w\) starts with \(\textrm{s}_k\) and the same argument applies. \(\square \)
Proof of Theorem 3.17
Applying Proposition 3.20 for \(k=m\), this is at the end of the last iteration of the for loop, the word \(\textrm{Q}\setminus I_m\) is a reduced word for \(w = w_m\). This implies (a).
For (b) it is immediate from the definition that the root configuration of the facet \(I_f\) is
The algorithm only adds an index k to the facet if and only if one of the conditions (1), (2) or (3) is fulfilled. Since these conditions all contain the condition \(f(\beta _k) \ge 0\), we conclude (b).
For (c) we show that if \(f(\beta _k) = 0\) and \(\beta _k \in \Phi ^+\) for some \(k \in I_f\), then \(\beta _k \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\). This means that adding k to \(I_f\) was done in the case of condition (1). We thus have \(w_{k-1} s_k \not \le _\textsf{R}w\). As seen before this implies \(\beta _k \not \in {\text {Inv}}(w)\), which means that the index k is not flippable in \(I_f\). We conclude the proof by invoking Proposition 3.9. \(\square \)
Example 3.21
(Type \(B_2\)) Let \(\textrm{Q}= 21122112\) with \({{\text {Dem}}}(\textrm{Q}) = 1212 = 2121 = {w_\circ }\) and let \(w = 12\). Let furthermore \(f: V \rightarrow \mathbb {R}\) be the linear functional sending \({{10}_{\Delta }}\) to \(-2\) and \({{01}_{\Delta }}\) to 1. We check that this linear functional is non-negative on
The steps in Algorithm 3.16 are then shown in the following table:
The algorithm finally returns \(I_f = I_8 = \{1,3,5,6,7,8\}\) with root configuration
and Theorem 3.17(b) and (c) are both satisfied, as expected.
We prove in the following section, see Theorem 3.22, that the facet \(I_f\) is uniquely determined by the two conditions given in Theorems 3.17(b) and (c).
3.4 Uniqueness of f-antigreedy facets
We show in this section that the f-antigreedy facet \(I_f\) in Algorithm 3.16 is unique in the following sense.
Theorem 3.22
Let I be a facet of the non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) and let \(f: V \rightarrow \mathbb {R}\) be a linear functional that is non-negative for the Bruhat interval \([w,{{\text {Dem}}}(\textrm{Q})]\). If the facet I satisfies the conclusions in Theorem 3.17(b) and (c), then \(I = I_f\) is the facet produced by Algorithm 3.16.
Before proving this theorem, we also provide one important corollary and recast the two properties Theorem 3.17(b) and (c) into subword complex terms as follows. For a facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) and \(i \in I\) flippable we call the flip of \(i \in I\) f-preserving if \(f({{\textsf {r}}}(I,i)) = 0\), and denote by
the set of facets whose root configuration is contained in the closed positive halfspace defined by f. For such a facet I of \(\mathcal {F}_f(\textrm{Q},w)\) denote moreover by
those positions in I for which the root function is f-positive. A facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) then satisfies Theorem 3.17(b) if and only if \(I \in \mathcal {F}_f(\textrm{Q},w)\) and it satisfies Theorem 3.17(c) if and only if
Proposition 3.23
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex and let \(f: V \rightarrow \mathbb {R}\) be a linear functional. Then
Proof
If f is non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\) then the facet \(I_f\) generated by Algorithm 3.16 is in \(\mathcal {F}_f(\textrm{Q},w)\) by Theorem 3.17. Otherwise if f is not non-negative, Proposition 3.14 ensures that every facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) contains at least one position \(i \in I\) for that \(f( {{\textsf {r}}}(I,i) ) < 0\) and thus \(\mathcal {F}_f(\textrm{Q},w)\) is empty. \(\square \)
The following crucial corollary of Theorem 3.22 generalizes [10, Conjecture 7.1].
Corollary 3.24
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex and let \(f: V \rightarrow \mathbb {R}\) be a linear functional which is non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\). Then \(\mathcal {F}_f(\textrm{Q},w)\) forms a connected component of the graph of f-preserving flips in \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) and moreover,
for any facet \(I \in \mathcal {F}_f(\textrm{Q},w)\).
In the remainder of this section, we prove Theorem 3.22 and Corollary 3.24, and start with collecting several technical lemmas.
Lemma 3.25
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex with \(\textrm{Q}= \textrm{s}\ \textrm{s}_2\dots \textrm{s}_m\). The following are equivalent:
-
There exist facets \(I,J \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(1 \in I\) and \(1 \not \in J\).
-
There exists a facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\) with \(\alpha _{s} \in {{\textsf {R}}}(K)\), and \(s w \prec w\).
Proof
Let \(\textrm{Q}' = \textrm{s}_2\dots \textrm{s}_m\), and observe that there exists a facet I with \(1 \in I\) if and only if \(\mathcal{S}\mathcal{C}(\textrm{Q}',w)\) is not empty, and there exists a facet J with \(1 \notin J\) if and only if \(sw \prec w\).
Assuming first that these two properties hold, the existence of a facet K of \(\mathcal{S}\mathcal{C}(\textrm{Q}',sw)\) with \(\alpha _{s} \in {{\textsf {R}}}(K)\) is ensured by Proposition 3.9 as \(\alpha _s \in {\text {Inv}}(w)\).
Let now be \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}', s w)\) with \(\alpha _{s} \in {{\textsf {R}}}(K)\), and let \(sw \prec w\). Again by Proposition 3.9, we obtain that the word \(\textrm{Q}'\) contains a reduced word for \(w = ssw\). Since this is equivalent to \(\mathcal{S}\mathcal{C}(\textrm{Q}',w)\) being not empty, it concludes the proof. \(\square \)
Lemma 3.26
Let \(\textrm{Q}= \textrm{s}\ \textrm{s}_2 \dots \textrm{s}_m\) and \(w \le {{\text {Dem}}}(\textrm{Q})\). The following are equivalent:
-
For every linear functional f with \(f( \alpha _{s} ) > 0\), the complex \(\mathcal {F}_{f \circ s}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\) is empty.
-
For every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\) we have \(\alpha _{s} \in {{\,\textrm{cone}\,}}{{\textsf {R}}}(K)\).
Proof
The first item says that for any functional \(f: V \rightarrow \mathbb {R}\) with \(f( \alpha _{s} ) > 0\) and every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, sw)\), there is a \(\beta \in {{\textsf {R}}}(K)\) such that \((f \circ s) ( \beta ) < 0\). By replacing f with \((f \circ s)\) this says for any functional \(f: V \rightarrow \mathbb {R}\) with \(f( \alpha _{s} ) < 0\) and every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\), there is a \(\beta \in {{\textsf {R}}}(K)\) such that \(f ( \beta ) < 0\). Now by duality of cones and functionals, this says that \(\alpha _{s} \in {{\,\textrm{cone}\,}}( {{\textsf {R}}}( K ) )\) for every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\). \(\square \)
Corollary 3.27
Let \(\textrm{Q}= \textrm{s}\ \textrm{s}_2 \dots \textrm{s}_m\), \(w \le {{\text {Dem}}}(\textrm{Q})\) and \(f: V \rightarrow \mathbb {R}\) be a linear functional with \(f( \alpha _s ) > 0\). Let furthermore \(I,J \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) be two facets with \(1 \in I\) and \(1 \not \in J\). Then
-
For every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, sw)\) we have \(\alpha _s \in {{\,\textrm{cone}\,}}( {{\textsf {R}}}(K) )\), and
-
the complex \(\mathcal {F}_{f \circ s}(\textrm{Q}_{\{2,\dots ,m\}}, sw)\) is empty.
Proof
First by Lemma 3.25 we have \(s w \prec w\). Applying Proposition 3.14 we get \(\alpha _{s} \in {{\,\textrm{cone}\,}}( {{\textsf {R}}}(K) )\) for every facet \(K \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, sw)\) and by Lemma 3.26 we then get \(\mathcal {F}_{f \circ s}(\textrm{Q}_{\{2,\dots ,m\}}, s w)\) is empty. \(\square \)
We remark that in the situations of Lemma 3.26 and Corollary 3.27 we have \(sw \prec w\). Thus the functional \(f \circ s\) is not non-negative for the Bruhat interval \([sw, {{\text {Dem}}}(\textrm{Q})]\). Thus, the conclusion
is in agreement with Corollary 3.24.
Proof of Theorem 3.22
Let \(I_f\) be the facet of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) produced by Algorithm 3.16 and let \(I \ne I_f\) be another facet. Let k be the smallest index for which I differs from \(I_f\), i.e., the smallest index such that either \(k \in I \setminus I_f\) or \(k \in I_f {\setminus } I\).
If the algorithm was violated at step k in condition (4), the facet I violates Theorem 3.17(b), and if the algorithm was violated in condition (5), the facet I violates Theorem 3.17(c).
If the algorithm was violated in step k in either of the conditions (1), (2) and (6), the partially constructed set could not be extended to a facet of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) which cannot happen since I is chosen to be such a facet.
For the remaining case, i.e., that the algorithm was violated at step k in condition (3), we assume without loss of generality that \(k=1\). Hence, we have \(f(\beta _1) = f(\alpha _{s}) > 0\), \(s w \prec w\) and \(w \le {{\text {Dem}}}(\textrm{Q}_{\{2,\dots ,m\}})\). By the latter there is a facet \(J \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(1 \in J\), but as \(sw \prec w\) we have \(\alpha _s \in {\text {Inv}}(w)\), hence \(1 \in J\) is flippable. Let \(I'\) be the adjacent facet, such that \(I' {\setminus } \{i\} = J {\setminus } \{1\}\). Then by Corollary 3.27 we have \(\mathcal {F}_{f \circ s}(\textrm{Q}_{\{2,\dots ,m\}}, sw) = \emptyset \). Now facets \( K' \in \mathcal{S}\mathcal{C}(\textrm{Q}_{\{2,\dots ,m\}}, sw)\) are in one-to-one correspondence with facets \(K' = K \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(1 \not \in K\). Furthermore we have \({{\textsf {R}}}(K) = s {{\textsf {R}}}(K')\) for every such facet, hence if we violated Algorithm 3.16 at step k in condition (3) by not adding 1 to \(I_{k-1}\), we obtain \(I \not \in \mathcal {F}_f(\textrm{Q},w)\) and conclude the statement. \(\square \)
Proof of Corollary 3.24
Let \(I,J \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) be two adjacent facets with \(I {\setminus } \{i\} = J {\setminus } \{j\}\) and \(f( {{\textsf {r}}}(I,i) ) = 0 = f( {{\textsf {r}}}(J,j) )\), i.e., the flip from I to J is f-preserving. By Lemma 2.7 we have for all \(k \in [m]\) that \({{\textsf {r}}}(J,k) - {{\textsf {r}}}(I,k) \in \mathbb {R}\cdot {{\textsf {r}}}(I,i)\) and thus \(f( {{\textsf {r}}}(I,k) ) = f( {{\textsf {r}}}(J,k) )\). Therefore \(\mathcal {F}_f(\textrm{Q},w)\) is closed under f-preserving flips, and also the set of f-positive indices is preserved, \({{\text {Pos}}_{f}(I)} = {{\text {Pos}}_{f}(J)}\). By performing f-preserving flips we can reach a facet \(K \in \mathcal {F}_f(\textrm{Q},w)\) with \({{\text {Pos}}_{f}(K)} = {{\text {Pos}}_{f}(I)}\) and \((K {\setminus } {{\text {Pos}}_{f}(K)}) {\setminus } {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))} \subseteq \Phi ^-\). By Theorem 3.22 this facet is unique, hence \(\mathcal {F}_f(\textrm{Q},w)\) is connected via f-preserving flips.
For the second part, recall that we proved in the first part that \({{\text {Pos}}_{f}(I)}\) is independent of the facet \(I \in \mathcal {F}_{f}(\textrm{Q},w)\). By inserting the positions \({{\text {Pos}}_{f}(I)}\) into \(\textrm{Q}_{\{1,\dots ,m\} {\setminus } {{\text {Pos}}_{f}(I)}}\), we obtain a natural isomorphism
In particular, \(\mathcal {F}_{f}(\textrm{Q},w)\) is a subset of the right hand side. Now let \(J \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) be any facet with \({{\text {Pos}}_{f}(I)} \subseteq J\). By the above isomorphism, the facets J and I are connected by a sequence of flips not containing positions in \({{\text {Pos}}_{f}(I)}\). Thus, the sequence of flips from I to J not containing positions in \({{\text {Pos}}_{f}(I)}\) is f-preserving and we obtain \(J \in \mathcal {F}_{f}(\textrm{Q},w)\). \(\square \)
4 Brick polyhedra for subword complexes
Based on Corollary 3.24, we extend in this section brick polytopes that were developed in [10] for root-independent spherical subword complexes towards brick polyhedra for general subword complexes.
We first recall some elementary notions for polyhedra in the vector space V. A subset \(P \subseteq V\) is called polyhedron if there are finitely many linear functionals \(f_1,\dots ,f_k: V \rightarrow \mathbb {R}\) and scalars \(b_1,\dots ,b_k \in \mathbb {R}\) such that
A bounded polyhedron is furthermore called polytopal. A face of a polyhedron P is a subset \(F \subseteq P\) such that there exists a linear functional \(f: V \rightarrow \mathbb {R}\) and a scalar \(b \in \mathbb {R}\) with \(f + b\) is non-negative on P and such that \(F = \left\{ v \in P \;|\; f(v) + b = 0 \right\} \). The linear functional f is called defining functional for the face F and the pair (f, b) is called defining hyperplane. The local cone of a polyhedron P at a point \(q \in P\) is the cone over P seen from the point q,
Moreover, the (inner) normal cone \({{\text {C}}^{\diamond }(F)}\) of a face \(F \subseteq P\) is the cone of defining functionals of F and the (inner) normal fan \({\mathcal {N}(P)}\) is the collection of normal cones of faces of P,
Finally, the Minskowski sum \(P+Q\) of two polyhedra P and Q is given by pointwise vector addition. Observe that every d-dimensional face of \(P+Q\) is given by the Minskowski sum of an i-dimensional face of P and a j-dimensional face of Q with \(i+j = d\).
We now define the brick polyhedron of a non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(\textrm{Q}=\textrm{s}_1 \dots \textrm{s}_m\). Following [10, Definition 4.1], the weight function \({{\textsf {w}}}(I,\cdot ): [m] \rightarrow W(\nabla ) \subseteq V\) of a facet I of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is defined by \( {{\textsf {w}}}(I,k) = \Pi {\textrm{Q}}_{\{1,\dots ,k-1\} {\setminus } I}(\omega _{s_k}). \) and the brick vectorFootnote 2 of I is then
The following definition generalizes the definition of brick polytopes for spherical subword complexes.
Definition 4.1
The brick polyhedron of a non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is the Minskowski sum of the convex hull of all brick vectors and the Bruhat cone \({\mathcal {C}^+(w,{{\text {Dem}}}(\textrm{Q}))}\),
This definition immediately implies that every brick vector is contained in the brick polyhedron and that every vertex of the brick polyhedron is a brick vector. We moreover record that brick polyhedra indeed generalize the previously known notion of brick polytopes up to a switch in the sign of brick vectors.
Proposition 4.2
The brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) of a non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is polytopal if and only if \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is spherical. In this case, the brick polyhedron is the convex hull of all brick vectors.
Proof
This follows from the observation made in Sect. 2.4 that the subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) is spherical if and only if \({{\text {Dem}}}(\textrm{Q}) = w\) if and only if \({\mathcal {C}^+(w,{{\text {Dem}}}(\textrm{Q}))} = \{0\}\). \(\square \)
Example 4.3
(Type \(A_2\)) Let \(\textrm{Q}= 11212\) and \(w = 12\). We then have the facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) and the brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) given by
with arrows pointing towards the respective root configurations
4.1 Local cones of brick polyhedra at brick vectors
The definition of brick polyhedra is justified by the following generalization of [10, Proposition 4.7].
Theorem 4.4
The local cone of the brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) at the brick vector \({\textsf{b}({I})}\) coincides with the cone generated by the root configuration of the facet I of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\). In symbols,
In particular, the brick vector \({\textsf{b}({I})}\) is a vertex of \(\mathcal {B}(\textrm{Q},w)\) if and only if \({{\textsf {R}}}(I)\) is pointed.
Based on Theorem 3.1, we obtain the following equivalent description of brick polyhedra.
Corollary 4.5
We have
A linear functional \(f: V \rightarrow \mathbb {R}\) is a defining functional for the non-empty brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) if and only if it is non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\). For such a defining functional f with corresponding defining hyperplane (f, b), denote by \(B_f = \left\{ v \in P \;|\; f(v) + b = 0 \right\} \) the corresponding face of \(\mathcal {B}(\textrm{Q},w)\). Recall also the facet \(I_f\) produced by Algorithm 3.16 in Sect. 3.3 and from Sect. 3.4 that \(\mathcal {F}_f(\textrm{Q},w)\) is the set of facets I of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(f({{\textsf {r}}}(I,i)) \ge 0\) for all \(i \in I\).
The following statement then generalizes [10, Lemma 4.6].
Proposition 4.6
Let \(f: V \rightarrow \mathbb {R}\) be a linear functional which is non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\). For a facet \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\), we have
For the proof we first recall the following two lemmas from [10, Section 4] that were stated for root-independent spherical subword complexes. These remain valid in the present context with the same proofs as given.
Lemma 4.7
[10, Lemma 4.4] Let \(\textrm{Q}= \textrm{s}_1 \dots \textrm{s}_m\) and let I be a facet of the non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\).
-
(a)
If \(\textrm{s}_k = \textrm{s}_{k+1}\) we have \({{\textsf {w}}}(I,k+1) = {\left\{ \begin{array}{ll} {{\textsf {w}}}(I,k) &{} \text { if } k \in I, \\ {{\textsf {w}}}(I,k) - {{\textsf {r}}}(I,k) &{} \text { if } k \notin I. \end{array}\right. }\)
-
(b)
If J is an adjacent facet with \(I \setminus \{i\} = J \setminus \{j\}\), then \({{\textsf {w}}}(J,\cdot )\) is obtained from \({{\textsf {w}}}(I,\cdot )\) by:
$$\begin{aligned} {{\textsf {w}}}(J,k) = {\left\{ \begin{array}{ll} s_{{{\textsf {r}}}(I,i)}( {{\textsf {w}}}(I,k) ) &{} \text { if } \min (i,j) < k \le \max (i,j), \\ {{\textsf {w}}}(I,k) &{} \text { otherwise}. \end{array}\right. } \end{aligned}$$ -
(c)
For \(j \notin I\), we have \(\langle {{\textsf {r}}}(I,j), {{\textsf {w}}}(I,k) \rangle \) is non-negative if \(j \ge k\), and non-positive if \(j < k\).
The following lemma is a consequence of Lemma 4.7. Due to our sign-switch in the definition of the brick vector and in comparison to the original statement we also have a switch of the direction here.
Lemma 4.8
[10, Lemma 4.5] If I and J are two facets in \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) with \(I {\setminus } \{i\} = J {\setminus } \{j\}\), then the difference of the brick vectors \({\textsf{b}({J})} - {\textsf{b}({I})}\) is a positive multiple of \({{\textsf {r}}}(I,i)\).
Proof of Proposition 4.6
Assume first that \({\textsf{b}({I})} \in B_f\). For every index \(i \in I\) we then either have \({{\textsf {r}}}(I,i) \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\) or the index i is flippable. In the former case we have \(f({{\textsf {r}}}(I,i)) \ge 0\) as f is non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\). In the latter case, let J be the adjacent facet with \(I \setminus \{i\} = J \setminus \{j\}\). Then \({\textsf{b}({J})} - {\textsf{b}({I})}\) is a positive multiple of \({{\textsf {r}}}(I,i)\) by Lemma 4.8 and thus \(f({{\textsf {r}}}(I,i)) \ge 0\). We thus obtain \(I \in \mathcal {F}_{f}(\textrm{Q},w)\).
Assume now that \(I \in \mathcal {F}_{f}(\textrm{Q},w)\). Let K be any facet such that \({\textsf{b}({K})} \in B_f\). It follows from the first part of the proof that \(K \in \mathcal {F}_{f}(\textrm{Q},w)\), and then from Corollary 3.24 that K and I are connected via f-preserving flips. Again by Lemma 4.8, we obtain \(f({\textsf{b}({I})}) = f({\textsf{b}({K})})\) and thus \({\textsf{b}({I})} \in B_f\).
Before proving Theorem 4.4, we collect the following consequence of Proposition 4.6.
Corollary 4.9
Any two facets I and J of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) whose brick vectors \({\textsf{b}({I})}, {\textsf{b}({J})}\) are contained in an edge \(E \subseteq \mathcal {B}(\textrm{Q},w)\) are connected by a flip.
Proof
Let f be a defining functional for the edge \(E = B_f\). Proposition 4.6 then implies that the facets I, J are contained in \(\mathcal {F}_{f}(\textrm{Q},w)\). By the isomorphism in Corollary 3.24, this complex corresponds to a Coxeter system \(W'\) of rank 1 where any two facets are connected by a flip. \(\square \)
The following example shows that there are also flips between facets with pointed root configurations that are not edges of the brick polyhedron.
Example 4.10
(Type \(A_2\)) The spherical subword complex \(\mathcal{S}\mathcal{C}(211221,121)\) has the eight facets
After a shift by \(3(\omega _1 + \omega _2)\), we have the polytopal brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) with flip graph
The facets \(I_3\) and \(I_7\) have pointed root configurations and are connected by a flip which does not correspond to an edge of the brick polyhedron.
Proof of Theorem 4.4
Fix a facet I of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\). Denote by \(C_B(I)\) the local cone of the brick polyhedron at the brick vector \({\textsf{b}({I})}\). We first show \({{\textsf {R}}}(I) \subseteq C_B(I)\). Let \(i \in I\) and \(\beta = {{\textsf {r}}}(I,i)\). If \(\beta \in {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\) we have
Otherwise i is flippable to some facet J, i.e., there is a facet J and an index \(j \in J\) such that \(I {\setminus } \{i\} = J {\setminus } \{j\}\). We then have \({\textsf{b}({J})} - {\textsf{b}({I})}\) is a positive multiple of \(\beta \) by Lemma 4.8. As \({\textsf{b}({J})} \in \mathcal {B}(\textrm{Q},w)\) we conclude \(\beta \in C_B(I)\).
The other inclusion \(C_B(I) \subseteq {{\,\textrm{cone}\,}}{{\textsf {R}}}(I)\) is obvious if \({{\,\textrm{cone}\,}}{{\textsf {R}}}(I) = V\). So assume otherwise, let \(v \in V {\setminus } {{\,\textrm{cone}\,}}{{\textsf {R}}}(I)\) and let f be a linear functional which is negative on v and non-negative on \({{\textsf {R}}}(I)\). It follows from Theorem 3.1 that f is then also non-negative on \([w,{{\text {Dem}}}(\textrm{Q})]\). By definition, \(I \in \mathcal {F}_f(\textrm{Q},w)\) and Proposition 4.6 ensures that \({\textsf{b}({I})} \in B_f\). This yields that f is non-negative on \(C_B(I)\) and we conclude that \(v \notin C_B(I)\). \(\square \)
Remark 4.11
We have seen in Proposition 4.6 that brick vectors contained in a face \(B_f\) of the brick polyhedron \(\mathcal {B}(\textrm{Q},w)\) are in one-to-one correspondence with facets in \(\mathcal {F}_f(\textrm{Q},w)\). We furthermore have by Corollary 3.24 the identification
and Theorem 4.4 ensures that \(B_f\) and \(\mathcal {B}(\textrm{Q}_{\{1,\dots ,m\} \setminus {{\text {Pos}}_{f}(I_f)}}, w)\) have the same local structure:
-
The direction of flips between brick vectors is preserved,
-
Local cones in \(\mathcal {B}(\textrm{Q}_{\{1,\dots ,m\} {\setminus } {{\text {Pos}}_{f}(I_f)}}, w)\) agree with those inside the face \(B_f\) of \(\mathcal {B}(\textrm{Q}, w)\),
-
The normal fans of \(B_f\) and of \(\mathcal {B}(\textrm{Q}_{\{1,\dots ,m\} \setminus {{\text {Pos}}_{f}(I_f)}}, w)\) coincide, and
-
\(B_f\) is polytopal if and only if \(\mathcal{S}\mathcal{C}(\textrm{Q}_{\{1,\dots ,m\} \setminus {{\text {Pos}}_{f}(I_f)}}, w)\) is spherical.
Nevertheless, one may check that \(B_f\) and \(\mathcal {B}(\textrm{Q}_{\{1,\dots ,m\} \setminus {{\text {Pos}}_{f}(I_f)}}, w)\) do not necessarily coincide. Take the edge connecting \({\textsf{b}({I_1})}\) and \({\textsf{b}({I_5})}\) in Example 4.10. The defining functional f is zero on \({{01}_{\Delta }}\) and positive on \({{10}_{\Delta }}\) and \({{11}_{\Delta }}\) and we obtain
The reduced subword complex then is \(\mathcal {F}_f(\textrm{Q},w) \cong \mathcal{S}\mathcal{C}(2121,121)\) with facets
and brick vectors \({\textsf{b}({J_1})} = {{{\overline{12}}}_{\Delta }}\) and \({\textsf{b}({J_2})} = {{{\overline{10}}}_{\Delta }}\). We thus see
hence this edge has different lengths in the two brick polytopes.
4.2 Normal fans of brick polyhedra from Coxeter fans
Theorem 4.4 makes it possible to generalize further properties developed for brick polytopes in [10] to brick polyhedra for general subword complexes. Several proofs in this section are similar to those given in [10]. Define the Coxeter fan of W as
with fundamental chamber \(\mathcal {C} = {{\,\textrm{cone}\,}}(\nabla )\) being the cone generated by the fundamental weights. The aim of this section is to describe how to glue together and delete chambers in the Coxeter fan to obtain the normal fan of the brick polyhedron. To this end, associate to a Bruhat interval [x, y] a (lower) order ideal in the weak order by
This is indeed a lower order ideal as for \(w \in {{\text {Id}}_{\textsf{R}}(x,y)}\) and \(z \le _\textsf{R}w\) we have \({\text {Inv}}(z) \subseteq {\text {Inv}}(w)\) and thus \(z \in {{\text {Id}}_{\textsf{R}}(x,y)}\).
Proposition 4.12
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a non-empty subword complex and let \(z \in W\). Then there exists a facet I such that \({{\textsf {R}}}(I) \subseteq z(\Phi ^+)\) if and only if \(z \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\). In this case, the facet I is uniquely given by the facet \(I_f\) produced by Algorithm 3.16 for any linear functional f which is positive on \(z(\Phi ^+)\) and negative on \(z(\Phi ^-)\).
Proof
It follows from Theorem 3.1 that for \(z \notin {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) there does not exist a facet I such that \({{\textsf {R}}}(I) \subseteq z(\Phi ^+)\). Now let \(z \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) and let f be a linear functional as in the statement. Then \({\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))} \subseteq z(\Phi ^+)\) ensures that f is positive for the Bruhat interval \([w,{{\text {Dem}}}(\textrm{Q})]\). Theorem 3.22 then gives that the facet \(I_f\) is the unique facet with f-positive root configuration. In other words, \(I_f\) is the unique facet for which \({{\textsf {R}}}(I) \subseteq z(\Phi ^+)\). \(\square \)
For a non-empty subword complex \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\), this proposition allows to define a map
by sending \(z \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) to the unique facet \(I_f\) with \({{\textsf {R}}}(I) \subseteq z(\Phi ^+)\) where f and \(I_f\) are given as in the proposition.
Lemma 4.13
Let \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) be non-empty and \(x,y \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\). If \(\kappa (x) = \kappa (y)\) then
Proof
Let \(\kappa (x) = I = \kappa (y)\) and consider \(w \in [x,y]_{\textsf{R}}\). Recall that for any \(z \in W\), we have
With \(\kappa (x) = I = \kappa (y)\) and \({\text {Inv}}(x) \subseteq {\text {Inv}}(w) \subseteq {\text {Inv}}(y)\), we obtain
The statement follows. \(\square \)
Example 4.14
(Type \(A_2\)) We continue Example 4.3 with \(\textrm{Q}= 11212\) and \(w = 12\). We then have \({\mathcal {E}^+(12,121)} = \{{{01}_{\Delta }}\}\) and \({{\text {Id}}_{\textsf{R}}(12,121)} = \{ e, 1, 12 \}\). The brick polyhedron with normal fan is
In particular we see that
and the union \(2(\mathcal {C}) \cup 21(\mathcal {C}) \cup 212(\mathcal {C})\) is the set of linear functionals that are non-negative on the Bruhat cone \({\mathcal {C}^+(12,121)} = {{\,\textrm{cone}\,}}\{ \alpha _2\}\).
Example 4.15
(Type \(B_2\)) Let \(\textrm{Q}= 2221\) and \(w = 2\). Then \({{\text {Dem}}}(\textrm{Q}) = 21\) and \({\mathcal {E}^+(2,21)} = \{ {{12}_{\Delta }} \}\). Furthermore we have that \({{\text {Id}}_{\textsf{R}}(2,21)} = \{ e, 1, 12, 2 \}\) is an order ideal that is not an interval. In \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) we have the three facets with brick vectors
that form an edge. The brick polyhedron is thus
We furthermore have
as shown in the weak order of type \(B_2\):
Proposition 4.16
The map \(\kappa \) maps surjectively onto the facets of \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) with pointed root configurations.
Proof
Since \({{\textsf {R}}}(\kappa (z)) \subseteq z(\Phi ^+)\), the facet \(\kappa (z)\) has a pointed root configuration by construction. For a facet I with pointed root configuration, let f be any linear functional that is positive on \({{\textsf {R}}}(I)\) and non-zero on all roots. Then there is a unique element \(z \in W\) with \(z(\Phi ^+) = \left\{ \beta \in \Phi \;|\; f(\beta ) > 0 \right\} \) and conclude that \(\kappa (z) = I\). \(\square \)
The main theorem of this section is the following generalization of [10, Proposition 5.4].
Theorem 4.17
Let \({\textsf{b}({I})}\) be a vertex of \(\mathcal {B}(\textrm{Q},w)\), i.e., \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) is a facet with pointed root configuration. The (closure of the) inner normal cone \({{\text {C}}^{\diamond }({\textsf{b}({I})})}\) is the union of the chambers \(z( \mathcal {C} )\) of \({\mathcal{C}\mathcal{F}_{W}}\) given by the elements \(z \in W\) with \(\kappa (z) = I\).
We also get the following generalization of [10, Corollary 5.5].
Corollary 4.18
The inner normal fan \({\mathcal {N}(\mathcal {B}(\textrm{Q},w))}\) is obtained from the Coxeter fan by glueing together the chambers corresponding to fibers of the map \(\kappa \), and deleting the chambers corresponding to elements in W not in \({{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\).
The crucial parts of the proof of Theorem 4.17 is extracted into the following two lemmas. The first generalizes [10, Lemma 5.3].
Lemma 4.19
Let \(z \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) and \(s \in \mathcal {S}\) such that \(z s \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\). Then \(\kappa (zs)\) is obtained from \(\kappa (z)\) as follows:
-
If \(z(\alpha _s) \in {{\textsf {R}}}(\kappa (z))\), then \(\kappa (zs)\) is obtained from \(\kappa (z)\) by flipping the unique index \(i \in \kappa (z)\) such that \({{\textsf {r}}}(I,i) = z(\alpha _s)\) and the obtained facet has again a pointed root configuration.
-
If \(z(\alpha _s) \notin {{\textsf {R}}}(\kappa (z))\), then \(\kappa (zs) = \kappa (z)\).
Proof
Set \(\alpha = \alpha _s\) and \(I = \kappa (z)\), and observe that the root \(z(\alpha )\) generates a ray of \(z({{\,\textrm{cone}\,}}(\Phi ^+))\). Either \(z(\alpha ) \in \Phi ^-\) or \(z(\alpha ) \in {\text {Inv}}(zs)\). Since \(zs \in {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) we obtain \(z(\alpha ) \notin {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\).
Let \(z(\alpha ) \notin {{\textsf {R}}}(I)\). Then \({{\textsf {R}}}(I) \subseteq z(\Phi ^+) \cap zs(\Phi ^+)\) and we obtain \(\kappa (sz) = I\).
Let \(z(\alpha ) \in {{\textsf {R}}}(I)\). Since \({{\textsf {R}}}(I) \subseteq z(\Phi ^+)\), \(z(\alpha )\) generates a ray of the (pointed) cone over \({{\textsf {R}}}(I)\). Therefore, there exists a linear functional f with \(f(z(\alpha )) = 0\) and f positive on \(z(\Phi ^+) {\setminus } \{ z(\alpha ) \}\) (and in particular on \({{\textsf {R}}}(I)\)). Since \(z(\alpha ) \notin {\mathcal {E}^+(w,{{\text {Dem}}}(\textrm{Q}))}\), the face \(B_f \subseteq \mathcal {B}(\textrm{Q},w)\) is a polytopal edge. Theorem 4.4 and Proposition 4.6 ensure that \({\textsf{b}({I})}\) is a vertex of \(B_f\). Let J be the facet for which \({\textsf{b}({J})}\) is the other vertex of the edge \(B_f\). Corollary 4.9 then shows that I and J are connected by a flip. If \(z(\alpha ) \in \Phi ^+\), then J is obtained from I by flipping the smallest index \(i \in I\) for which \({{\textsf {r}}}(I,i) = z(\alpha )\), and if \(z(\alpha ) \in \Phi ^-\), then J is obtained from I by flipping the largest index \(i \in I\) for which \({{\textsf {r}}}(I,i) = z(\alpha )\). \(\square \)
Lemma 4.20
Let \({\textsf{b}({I})}\) be a vertex of \(\mathcal {B}(\textrm{Q},w)\). Then
Proof
The definition of the map \(\kappa \) immediately implies
For the other inclusion let \(\beta \in \Phi \) be a root that generates a ray of \(\cap _{z \in \kappa ^{-1}(I)} z( {{\,\textrm{cone}\,}}(\Phi ^+) )\). Then \(\beta \) is also ray of \(u({{\,\textrm{cone}\,}}(\Phi ^+))\) for some particular \(u \in \kappa ^{-1}(I)\). Thus \(\beta = u(\alpha )\) for some \(\alpha \in \Delta \).
If \(us_\alpha \notin {{\text {Id}}_{\textsf{R}}(w,{{\text {Dem}}}(\textrm{Q}))}\) then
Otherwise \(\kappa (u) \ne \kappa (us_\alpha )\) and therefore by Lemma 4.19 we have \(u(\alpha )\) is the direction of the flip from \(\kappa (u)\) to \(\kappa (us_\alpha )\), hence \(u(\alpha ) \in {{\textsf {R}}}(I)\). This concludes the statement. \(\square \)
We can now proof Theorem 4.17 and Corollary 4.18.
Proof of Theorem 4.17
Let \(I \in \mathcal{S}\mathcal{C}(\textrm{Q},w)\) be a facet with pointed root configuration. We write in the following \({{\text {C}}^{\diamond }(\mathcal {X})}\) for a pointed cone \(\mathcal X\) to denote the normal cone at its apex. Theorem 4.4 yields
It is well-known that the (closure of the) normal cone of the fundamental chamber \(\mathcal C\) is generated by the simple roots \({{\text {C}}^{\diamond }(\mathcal {C})} = {{\,\textrm{cone}\,}}(\Delta ) = {{\,\textrm{cone}\,}}(\Phi ^+)\). Lemma 4.20 then gives
where the latter two equalities are elementary transformations. \(\square \)
Proof of Corollary 4.18
It follows from Theorem 4.17 that the maximal cones of \({\mathcal {N}(\mathcal {B}(\textrm{Q},w))}\) are given as in the corollary. \(\square \)
4.3 Containment properties of brick polyhedra for a fixed word
The considerations of brick polyhedra also for non-spherical subword complexes makes it possible to discuss how the various brick polyhedra for a fixed word \(\textrm{Q}\) are related. In this section, we use the map \(\iota : \mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w) \rightarrow \mathcal{S}\mathcal{C}(\textrm{Q}, w)\) from (3.1), to show how brick vectors change between the subword complexes \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) and \(\mathcal{S}\mathcal{C}(\textrm{Q},s_\beta w)\) for a cover \(w \prec s_\beta w \le {{\text {Dem}}}(\textrm{Q})\) in Bruhat order. Using Corollary 3.6, we then obtain the following containment statement of brick polyhedra.
Theorem 4.21
Let \(w \in W\) and \(s \in \mathcal {S}\) such that \(w \prec ws \le {{\text {Dem}}}(\textrm{Q})\). Then \(\mathcal {B}(\textrm{Q},ws) \subseteq \mathcal {B}(\textrm{Q},w)\).
We first show the following result for brick vectors and extract the key ingredient into a lemma.
Proposition 4.22
Let \(w \prec s_\beta w \le {{\text {Dem}}}(\textrm{Q})\) and \(I \in \mathcal{S}\mathcal{C}(\textrm{Q}, s_\beta w)\) be a facet. Then \({\textsf{b}({I})} \in \mathcal {B}(\textrm{Q},w)\).
Lemma 4.23
In the situation of the proposition, we have \({\textsf{b}({I})} \in {\textsf{b}({ \iota (I) })} + \mathbb {R}_+(\beta )\).
Proof
The facet \(\iota (I)\) is the set \(I \cup \{j\}\) where j is the unique position in the complement of I, such that \({{\textsf {r}}}(I,j) = \beta \) in \(\mathcal{S}\mathcal{C}(\textrm{Q}, s_\beta w)\). Similar to Lemma 4.7(b), the weight function \({{\textsf {w}}}(\iota (I),\cdot )\) is obtained from the weight function \({{\textsf {w}}}(I,\cdot )\) by
Let \(k > j\). Since \(\beta = {{\textsf {r}}}(I,j)\) and \(j \notin I\), Lemma 4.7(c) yields that \(\langle \beta , {{\textsf {w}}}(I,k) \rangle \) is non-positive. Therefore, \(s_\beta ( {{\textsf {w}}}(I,k) ) \in {{\textsf {w}}}(I,k) + \mathbb {R}_+(\beta )\), and we obtain \({\textsf{b}({I})} \in {\textsf{b}({\iota (I)})} + \mathbb {R}_+(\beta )\). \(\square \)
Proof of Proposition 4.22
The previous lemma shows that \({\textsf{b}({I})} \in {\textsf{b}({ \iota (I) })} + \mathbb {R}_+(\beta )\). Since \(\beta \in {\mathcal {C}^+(w,{{\text {Dem}}}(\textrm{Q}))}\), the statement follows. \(\square \)
Proof of Theorem 4.21
This follows from Proposition 4.22 together with the containment of Bruhat cones described in Corollary 3.6. \(\square \)
The following example shows the nested situation of brick polyhedra for the permutahedron in type \(A_2\).
Example 4.24
(Type \(A_2\)) Let \(\textrm{Q}= 112211\). We show all brick polyhedra where brick vectors of different polyhedra that have the same coordinates are drawn close to each other. The brick polyhedra \(\mathcal{S}\mathcal{C}(\textrm{Q},w)\) are in black for \(w = 121\), in red for \(w = 12\), in blue for \(w = 21\), in orange for \(w = 1\), in lightblue for \(w = 2\) and in grey for \(w = e\).
Notes
We think of facets of subword complexes as being ordered sets (sorted lists of indices written in set notation) and we think of root configurations of facets as ordered multisets (lists of roots written in multiset notation with ordering inherited from the order of the facet).
In comparision with the original definition of brick polytopes in [10], we introduce a minus sign here. This is done in order to simplify notations in later statements.
References
Björner, A., Brenti, F.: Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol. 231. Springer, New York (2005)
Chapoton, F., Fomin, S., Zelevinsky, A.: Polytopal realizations of generalized associahedra. Can. Math. Bull. 45(4), 537–566 (2002)
Ceballos, C., Labbé, J.-P., Stump, C.: Subword complexes, cluster complexes, and generalized multi-associahedra. J. Algebra. Combin. 39(1), 17–51 (2014)
Dyer, M.J.: Bruhat intervals, polyhedral cones and Kazhdan–Lusztig–Stanley polynomials. Math. Z. 215(2), 223–236 (1994)
Hohlweg, C., Lange, C., Thomas, H.: Permutahedra and generalized associahedra. Adv. Math. 226, 206–240 (2011)
Knutson, A., Miller, E.: Subword complexes in Coxeter groups. Adv. Math. 184(1), 161–176 (2004)
Knutson, A., Miller, E.: Gröbner geometry of Schubert polynomials. Ann. Math. 161(3), 1245–1318 (2005)
Pilaud, V., Santos, F.: The brick polytope of a sorting network. Eur. J. Combin. 33(4), 632–662 (2012)
Pilaud, V., Stump, C.: EL-labelings and canonical spanning trees for subword complexes. In: Discrete geometry and optimization, volume 69 of Fields Inst. Commun. pages 213–248. Springer, New York (2013)
Pilaud, V., Stump, C.: Brick polytopes of spherical subword complexes and generalized associahedra. Adv. Math. 276, 1–61 (2015)
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The authors are supported by the DFG Heisenberg grant STU 563/4-1 “Noncrossing phenomena in Algebra and Geometry”.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Jahn, D., Stump, C. Bruhat intervals, subword complexes and brick polyhedra for finite Coxeter groups. Math. Z. 304, 24 (2023). https://doi.org/10.1007/s00209-023-03267-w
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00209-023-03267-w