This paper proves local finiteness of twisted strong Bruhat orders on affine Weyl groups and explores their properties, including infinite antichains and applications to oriented matroids.
Contribution
It establishes the local finiteness of twisted strong Bruhat orders on affine Weyl groups, extending previous results, and investigates their structural properties and applications.
Findings
01
Twisted strong Bruhat order on affine Weyl groups is locally finite.
02
Existence of infinite antichains in twisted Bruhat orders for certain sets.
03
Application of twisted weak Bruhat order to oriented matroids.
Abstract
In this paper, we investigate various properties of strong and weak twisted Bruhat orders on a Coxeter group. In particular, we prove that any twisted strong Bruhat order on an affine Weyl group is locally finite, strengthening a result of Dyer in J. Algebra, 163, 861--879 (1994). We also show that for a non-finite and non-cofinite biclosed set B in the positive system of an affine root system with rank greater than 2, the set of elements having a fixed B-twisted length is infinite. This implies that the twisted strong and weak Bruhat orders have an infinite antichain in those cases. Finally, we show that twisted weak Bruhat order can be applied to the study of the tope poset of an infinite oriented matroid arising from an affine root system.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
In this paper we investigate various properties of strong and weak twisted Bruhat orders on a Coxeter group. In particular we prove that any twisted strong Bruhat order on an affine Weyl group is locally finite, strengthening a result of Dyer in J. Algebra, 163, 861–879 (1994). We also show that for a non-finite and non-cofinite biclosed set B in the positive system of an affine root system with rank greater than 2, the set of elements having a fixed B-twisted length is infinite. This implies that the twisted strong and weak Bruhat orders have an infinite antichain in those cases. Finally we show that twisted weak Bruhat order can be applied to the study of the tope poset of an infinite oriented matroid arising from an affine root system.
1. Introduction
Twisted strong and weak Bruhat orders on a Coxeter group were introduced by Dyer and the author respectively.
These generalizations of the ordinary strong and weak Bruhat orders have found connections with problems related to reflection orders,
representation theory and combinatorics of infinite reduced words.
In [10] it is shown that Kazhdan-Lusztig type polynomials can be defined for certain intervals of the twisted strong
Bruhat orders and these polynomials are used to formulate a conjecture regarding the representation of Kac-Moody Lie algebras.
In [16], twisted strong Bruhat order is studied for the twisted filtration of the Soergel bimodules.
In [6], twisted strong Bruhat order is related to the poset of B×B-orbits on the wonderful compactification of algebraic groups.
In [23], the semilattice property of twisted weak Bruhat order is shown to characterize the biclosed sets arising from the infinite reduced words in affine cases.
In this paper, we prove several properties regarding the structure of twisted Bruhat orders which are not previously known. First we study the finite intervals of twisted strong Bruhat orders. Finite intervals are of particular importance as the Kazhdan-Lusztig type polynomials in [10] can only be defined for finite intervals with other favorable properties. It is not previously known whether for any infinite biclosed set B, the B-twisted strong Bruhat order on an affine Weyl group is locally finite, i.e. any interval of this poset is finite. In [9], Dyer gives a partial answer to the question, providing a technical condition guaranteeing the local finiteness. In section 3 we solve the problem in the positive, showing that such a poset is always locally finite. Indeed we prove a stronger fact for affine Weyl groups: the set {y∣y≤Bx,lB(x)−lB(y)=n} is finite for any x and biclosed set B. The proof exploits the explicit description of biclosed sets in the affine root system first given in [11].
In Section 4, we consider the question whether for some biclosed set B, the strong B-twisted Bruhat order on a nonaffine Coxeter group is not locally finite. We propose a procedure to obtain an infinite interval for certain B.
In Section 5, we show that while a twisted strong Bruhat order on an affine Weyl group is locally finite, the set of elements with a fixed twisted length is always infinite provided the twisting biclosed set is neither finite nor cofinite and the rank of the affine Weyl group is greater than 2. This result implies that the twisted strong and weak Bruhat order has an infinite antichain in those cases. The proof makes use of the properties of twisted weak Bruhat order and an explicit description of the biclosed sets in the affine root system.
In Section 6, we present the structure of a twisted strong Bruhat order on the affine Weyl group W of type A2. Such a description of the structure of a twisted Bruhat order (which is not isomorphic to ordinary Bruhat order or its opposite) was only known for A1 previously.
In Section 7, we study the tope poset of the infinite oriented matroid from an affine root system. We first describe all hemispaces (topes) of such an oriented matroid and then show that twisted weak Bruhat orders show up in the tope poset. These results allow us to prove that certain finite intervals in the tope poset are lattices.
2. Preliminaries
Let B be a set. Denote by ∣B∣ the cardinality of B. We denote the disjoint union of sets by ⊎.
We refer the reader to [1] and [20] for the basic notions of Coxeter groups and their root systems. We call a Coxeter system without braid relations a universal Coxeter system.
2.1. Biclosed Sets of Coxeter Groups
Let (W,S) be a Coxeter system. Denote by T the set of reflections. Given a root α, denote by sα the corresponding reflection. Let t∈T be a reflection. Denote by αt the corresponding positive root.
For w∈W, the inversion set of w−1 is defined to be {α∈Φ+∣w−1(α)∈Φ−} and is denoted by N(w).
For a general Coxeter system (W,S), Φ,Φ+,Φ− denote the set of roots, positive roots and negative roots respectively. We denote by l(w) the (usual) length of w∈W.
A set Γ⊂Φ is 2 clousre closed if for any α,β∈Γ and k1α+k2β∈Φ,k1,k2∈R≥0 one has that k1α+k2β∈Γ. A set B⊂Γ such that both B and Γ\B are closed is called a biclosed set in Γ. Finite biclosed sets in Φ+ are precisely inversion sets N(x) for some x∈W ([13] Lemma 4.1(d)). If s1s2⋯sk is a reduced expression of x, then N(x)={αs1,s1(αs2),⋯,s1s2⋯,sk−1(αsk)}.
Denote by N(x)={t∈T∣αt∈N(x)}.
We say a positive root β dominates another positive root α if β∈N(w) for some w∈W implies α∈N(w).
Suppose that W is infinite. An infinite sequence s1s2s3⋯,si∈S is called an infinite reduced word of W provided that s1s2⋯sj is reduced for any j≥1. For an infinite reduced word x=s1s2⋯, define the inversion set N(x)=∪i=1∞N(s1s2⋯si). Two infinite reduced words x,y are considered equal if N(x)=N(y). The inversion set of an infinite reduced word is biclosed in Φ+. A (finite) prefix of an infinite reduced word w is an element u in the Coxeter group W such that N(u)⊂N(w). The set of infinite reduced words of (W,S) is denoted by Wl. For an inversion set N(w) we denote by N(w)′ the complement of N(w) in Φ+. An element w∈W is said to be straight if l(wn)=∣nl(w)∣. It is shown that in [7] that if W is infinite any Coxeter element is straight. Choose a reduced expression w of a straight element w, then www⋯ well defines an infinite reduced word indepenent of the choice of w and we denote it by w∞.
There exists a W-action on the set of all biclosed sets in Φ+ given by w⋅B:=(N(w)\w(−B))∪(w(B)\(−N(w))). In particular u⋅N(v)=N(uv) for u∈W,v∈W∪Wl.
We shall call a set B in Φ+ cofinite if Φ+\B is finite.
2.2. Twisted Bruhat Order and Twisted Weak Bruhat Order
Let B be a biclosed set in Φ+. The left (resp. right) (B-)twisted length of an element of w∈W is defined as l(w)−2∣N(w−1)∩B∣ (resp. l(w)−2∣N(w)∩B∣) and is denoted by lB(w) (resp. lB′(w)). Clearly lB(w)=lB′(w−1) and l∅(w)=l∅′(w)=l(w).
Fix a biclosed set B in Φ+, the left (resp. right) (B-)twisted strong Bruhat order ≤B on W is defined as follow: x≤By if and only if y=tktk−1⋯t1x with lB(ti⋯t1x)=lB(ti−1⋯t1x)+1,ti∈T,1≤i≤k (resp. lB′(xt1⋯ti)=lB′(xt1⋯ti−1)+1,ti∈T,1≤i≤k).
One easily sees that the left twisted strong Bruhat order is isomorphic to the right twisted strong Bruhat order under the map w↦w−1. The left (resp. right) ∅−twisted strong Bruhat order is the ordinary Bruhat order. For x∈W it is known that the left (resp. right) N(x)−twisted strong Bruhat order is isomorphic to the ordinary Bruhat order. Following the convention in the literature, we consider the left twisted strong Bruhat orders instead of the right ones and often refer to left twisted strong Bruhat order as twisted Bruhat orders. Left B−twisted strong Bruhat order can also be characterized equivalently as the unique partial order on W with the following property:
for t∈T,w∈W, if αt∈w⋅B, tw≤Bw and if αt∈w⋅B then tw≥Bw.
A closed interval [x,y] in a twisted (strong) Bruhat order is said to be spherical if any length 2 subinterval of it contains 4 elements. It is known that for a closed spherical interval [x,y], the order complex of the corresponding open interval (x,y) is a sphere.
The left (resp. right) (B-)twisted weak Bruhat order ≤B′ on W is defined as follow: x≤B′y if and only if N(x−1)\N(y−1)⊂B and N(y−1)\N(x−1)⊂Φ+\B (resp. N(x)\N(y)⊂B and N(y)\N(x)⊂Φ+\B). The left B-twisted weak Bruhat order is isomorphic to the right B-twisted weak Bruhat order under the map w↦w−1. For x∈W it is known that the left (resp. right) N(x)−twisted weak Bruhat order is isomorphic to the ordinary left (resp. right) weak order.
If x≤B′y (under the left (resp. right) B-twisted weak Bruhat order), one has that x≤By (under the left (resp. right) B-twisted strong Bruhat order).
The left (resp. right) ∅−twisted weak Bruhat order is the ordinary left (resp. right) weak Bruhat order. Following the convention in the literature, we consider the right twisted weak Bruhat orders instead of the left ones and often refer to right twisted weak Bruhat orders as twisted weak orders.
The (left) twisted (strong) Bruhat order (resp. (right) twisted weak (Bruhat) order) is graded by the left twisted length function (resp. right twisted length function). Suppose that u≤B′v (under the right B-twisted weak order). It is shown in [23] that one has a chain:
[TABLE]
such that uis=ui+1 for some s∈S and lB′(ui)+1=lB′(ui+1). We will refer to this property as the chain property of the twisted weak order and write ui⊲ui+1.
Let B be an inversion set of an element in W. Then (W,≤B′) is isomorphic to (W,≤∅′). It is known that (W,≤∅′) is a complete meet semilattice (Chapter 3 of [1]). Let B be the inversion set of an infinite reduced word.
It is shown in [23] that (W,≤B′) is a non-complete meet semilattice
and for an affine Weyl group W, (W,≤B′) is a non-complete meet semilattice only if B is the inversion set of an infinite reduced word.
2.3. Construction of Affine Weyl Groups and Their Root Systems
Let W be an irreducible Weyl group with the crystallographic root system Φ contained in the Euclidean space V. For these notions, see Chapter 1 of [20]. The root system of an (irreducible) affine Weyl group W (corresponding to W) can be constructed as the “loop extension” of Φ.
We describe such a construction. Let Φ+ be the chosen standard positive system of Φ and let Δ be the simple system of Φ+.
Define a R−vector space V′=V⊕Rδ where δ is an indeterminate. Extend
the inner product on V to V′ by requiring (δ,v)=0 for any v∈V′.
If
α∈Φ+, define
{α}∧={α+nδ∣n∈Z≥0}⊂V′. If α∈Φ−, define
{α}∧={α+(n+1)δ∣n∈Z≥0}⊂V′.
For a set Λ⊂Φ, define
Λ∧=⋃α∈Λ{α}∧⊂V′. The set of roots of the affine Weyl group W, denoted by Φ, is Φ∧⊎−Φ∧.
The set of positive roots and the set of negative roots are Φ∧ and −Φ∧ respectively. The set of simple roots is {α∣α∈Δ}∪{δ−ρ} where ρ is the highest root in Φ+. Let α∈Φ be a root. The reflection in α, denoted by sα, is an R−linear map V′→V′ defined by
v↦v−2(α,α)(v,α)α.
The (irreducible) affine Weyl group W is generated by
sα,α∈Φ. The simple reflections are the reflections in the simple roots of Φ∧. For v∈V, define the R−linear map tv which acts on V′ by tv(u)=u+(u,v)δ. For α∈Φ, define the coroot α∨=2α/(α,α). Note that sα+nδ=sαt−nα∨. Let T be the free Abelian group generated by {tγ∨∣γ∈Δ}. Then it is known that W=W⋉T. Let π be the canonical projection from W to W.
If α∈Φ+, let (α)0=α∈Φ∧. If α∈Φ−, let (α)0=α+δ∈Φ∧. We also introduce the following compact notation: αab:={α+kδ∣a≤k≤b} for a,b∈Z∪{±∞}. We also denote ∪i=1t(αi)aibi by (α1)a1b1(α2)a2b2⋯(αt)atbt.
2.4. Biclosed Sets of an Affine Weyl Group
Let Φ be a finite irreducible crystallographic root system with Φ+ the standard positive system and Δ the simple system. Suppose that Δ′⊂Φ. Denote by ΦΔ′ the root subsystem generated by Δ′. It is shown in [19] that the biclosed sets in Φ are those (Ψ+\ΦΔ1)∪ΦΔ2 where Ψ+ is a positive system of Φ and Δ1,Δ2 are two orthogonal subsets (i.e. (α,β)=0 for any α∈Δ1,β∈Δ2) of the simple system of Ψ+. For simplicity we denote the set (Ψ+\ΦΔ1)∪ΦΔ2 by P(Ψ+,Δ1,Δ2).
The biclosed sets in Φ∧ is determined in [11].
Let W′ be the reflection subgroup of W generated by (Δ1∪Δ2)∧. Then any biclosed set in Φ+(=Φ∧) is of the form w⋅P(Ψ+,Δ1,Δ2)∧ for some Ψ+,Δ1,Δ2 and w∈W.
In particular a biclosed set w⋅P(Ψ+,Δ1,Δ2)∧ where w∈W′ differs from P(Ψ+,Δ1,Δ2)∧ by finite many roots.
Suppose that B is a biclosed set in Φ+=Φ∧.
Let IB={α∈Φ∣{α}∧∩B is infinite} and
AB={α∈Φ∣∣{α}∧∩B=∅}. It is known that IB is biclosed in Φ. Those biclosed sets B such that IB=P(Ψ+,Δ1,Δ2) are precisely the biclosed sets of the form w⋅P(Ψ+,Δ1,Δ2)∧ where w∈W′. It is shown in [24] that if B is an inversion set of an element of the affine Weyl group W or an infinite reduced word in Wl, then AB∩−AB=∅.
For an affine Weyl group, the biclosed sets which are inversion sets of infinite reduced words are precisely those of the form w⋅P(Ψ+,Δ1,∅)∧,w∈W,Δ1⊊Δ.
3. Twisted Bruhat Orders on an Affine Weyl Group Are Locally Finite
Throughout this paper unless otherwise specified, W is a finite irreducible Weyl group and W is the corresponding irreducible affine Weyl group. Denote by Φ the crystallographic root system of W and denote by Φ+ a chosen standard positive system. Let α∈Φ. A finite δ-chain through α is a set {α+dδ∣p≤d≤q} where p≤q are two integers.
Lemma 3.1**.**
(1) Suppose that α∈Φ and k∈Z≥0. Then in Φ+, α0+kδ dominates the roots α0,α0+δ,⋯,α0+(k−1)δ.
(2) Let w∈W. Then w carries a finite δ-chain through α∈Φ to another finite δ-chain through some β∈Φ. In particular β=π(w)(α)
Proof.
(1) is well known. See for example Lemma 4.1 in [24]. (2) follows from the formula
[TABLE]
and the fact π(sα+pδ)=π(sαt−pα∨)=sα.
∎
Lemma 3.2**.**
(1) N(sα+nδ) has the following structure:
(i) Suppose that β∈Φ+,sα(β)∈Φ+. Then for 0≤k<(α,α)2(α,β)n, β+kδ∈N(sα+nδ).
(ii) Suppose that β∈Φ+,sα(β)∈Φ−. Then for
0≤k≤(α,α)2(α,β)n,
β+kδ∈N(sα+nδ).
(iii) Suppose that β∈Φ−,sα(β)∈Φ+. Then for
0<k<(α,α)2(α,β)n, β+kδ∈N(sα+nδ).
(iv) Suppose that β∈Φ−,sα(β)∈Φ−. Then for
0<k≤(α,α)2(α,β)n, β+kδ∈N(sα+nδ).
(2) If there exists a δ-chain through β beginning from β0 in N(sα+nδ) then there also exists a δ-chain through −sα(β) beginning from (−sα(β))0 in N(sα+nδ). In addition, these two chains are of equal length.
Proof.
(1) follows from Equation (3.1.1). To see (2), one notes that (−sα(β),α)=(sα(β),−α)=(sα(β),sα(α))=(β,α) and then uses (1).
∎
Lemma 3.3**.**
When n is sufficiently large,
the inversion set N(wsα+nδ) consists of some finite δ-chains (through roots in Φ) whose lengths are independent of n and the following δ-chains:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
where βi∈Φ,1≤i≤t and one can pair each βi with some βj,j=i such that pβi+pβj=π(w)(α),p>0. Furthermore when n is changed to n+1, the increment of the length of the δ-chain through βi and that of the δ-chain through βj coincides.
By Lemma 3.1 (1) N(w) consists some finite δ-chains through certain roots in Φ. Therefore we conclude that (N(w)\(−wN(sα+nδ))) consists of some finite δ-chains (through roots in Φ) whose lengths are independent of n (when n is sufficiently large).
By Lemma 3.2 (1) and Lemma 3.1 (2), one sees that wN(sα+nδ)∩Φ+=wN(sα+nδ)\(−N(w)) consists of δ-chains through certain roots in Φ and that when n grows the upper bound of the coefficient of δ in each of these chains grows accordingly.
Again Lemma 3.1 (1) forces that any δ-chain through a root β must start from β0 in N(wsα+nδ).
Therefore we have shown that N(wsα+nδ) consists of roots in the form as listed in the lemma.
We still need to show the existence of the pairing described in the Lemma.
Now suppose βi=π(w)(β). Then the root βj=π(w)(−sα(β)) satisfies the condition in this lemma thanks to Lemma 3.2 (2). Note that the positivity of p follows from the fact (β,α)>0 (note that (β,α)>0 because otherwise the δ-chain through β will not appear in the inversion set of sα+nδ by Lemma 3.2 (1)).
∎
Lemma 3.4**.**
[TABLE]
for any B biclosed in Φ+, w∈W,α∈Φ.
Proof.
We examine the set N(wsα+nδ) for sufficiently large n.
By Lemma 3.2 besides some finite δ-chain which will stay stationary when n grows, this set consists some finite δ-chain through roots in Φ which will grow when n grows, i.e.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Also one can pair those βi’s, for each βi one can find βj,j=i such that pβi+pβj=π(w)(α),p>0.
Furthermore when n is changed to n+1 the increment of the length of the δ-chain through βi and that of the δ-chain through βj coincides.
Now we consider the set IB={α∈Φ∣{α}∧∩B is infinite}. Then IB is a biclosed set in Φ.
Also by Lemma 5.10 in [11] for any α∈IB, there exists Nα∈Z>0 such that α+nδ∈B for all n>Nα.
Suppose that π(w)(α)∈IB. Then for a pair of βi,βj either one of them is in IB and one of them is in Φ\IB or both of them are in IB since otherwise pβi+pβj=π(w)(α) has to be in Φ\IB by coclosedness of IB.
So when n is changed to n+1 more added roots in the inversion set N(wsα+nδ) are in B than in Φ\B, making the twisted length decreasing.
Similarly if π(w)(α)∈IB one can deduce that when n is changed to n+1 more added roots in the inversion set N(wsα+nδ) are in Φ\B than in B, making the length increasing. Therefore we see that the twisted length tends to infinity as n→∞.
∎
Proposition 3.5**.**
For any x∈W, n∈N and a biclosed set B in Φ+, the set
[TABLE]
is finite.
Proof.
We prove this by induction. Let n=1 and α∈Φ. The set {k∣lB(sα+kδx)=lB(x)−1} is finite by Lemma 3.4. Note that Φ is finite and therefore the proposition holds when n=1. Now let n=k. Then
[TABLE]
[TABLE]
since twisted Bruhat order is graded by twisted length function.
Now the proposition follows from induction.
∎
Theorem 3.6**.**
For any biclosed set B in Φ+ and any x,y∈W such that x<By, the interval [x,y] in the poset (W,≤B) is finite.
Proof.
If lB(y)−lB(x)=1 then the assertion is trivial (as [x,y]={x,y}). Now suppose that the assertion holds for all pairs of x,y with the properties x<By and lB(y)−lB(x)≤k−1. Take x,y∈W,x<By and lB(y)−lB(x)=k.
By Proposition 3.5, the set {z∣x<Bz<By,lB(y)−lB(z)=1} is finite. For any z such that x<Bz<By,lB(y)−lB(z)=1 the interval [x,z] is finite by induction assumption. Then [x,y] is also finite since the twisted Bruhat order is graded by the left twisted length function.
∎
4. Construction of infinite interval in a non-affine Coxeter system
It is natural to ask that given a non-affine infinite Coxeter group W whether infinite intervals always show up in (W,≤B) for some biclosed set B⊂Φ+. In [10] subsection 1.10, it is shown that this is true for a universal Coxeter group of rank >2 as follow.
Let (W,S) be a universal Coxeter system of rank 3 with S={s1,s2,s3}. Let B=N((s1s2s3)∞). Then the closed interval [1,s1s2s3] is infinite in (W,≤B).
By [15], every irreducible infinite non-affine Coxeter group W has a reflection subgroup W′ which is universal of rank 3. Therefore by above for certain biclosed set B⊂ΦW′+ (the set of positive roots of W′) the left B−twisted strong Bruhat order on such a reflection subgroup (denoted ≤W′,B) has an infinite interval (with bottom element e) which we denote by [e,w].
Suppose that there exists a biclosed set A⊂Φ+ such that A∩ΦW′+=B. Then by Proposition 1.4 in [10] (or see subsection 1.12 of [9]) we have a poset injection ([e,w],≤W′,B)→([e,w],≤A).
Therefore the closed interval [e,w] is also infinite in (W,≤A).
Now we illustrate this process through a concrete example.
Let (W,S) be of (2,3,∞) type, i.e. W={s1,s2,s3∣s12=s22=s32=(s1s2)3=(s1s3)2=e} and S={s1,s2,s3}. Denote αsi by αi. For a reflection subgroup W′ of W, denote T∩W′ by TW′. The root system of W′ is ΦW′={α∈Φ∣sα∈W′}.
Consider the reflection subgroup W′ generated by S′:={s1,s2s3s2,s3s2s3s2s3}. Write r1=s1,r2=s2s3s2,r3=s3s2s3s2s3. Note that (αri,αrj)=−1 for i,j∈{1,2,3},i=j.
Also we note that
[TABLE]
[TABLE]
[TABLE]
One easily checks that ri and rj,i=j,i,j∈{1,2,3} generate an infinite dihedral subgroup with ri and rj being the canonical simple generators.
Then apply Proposition 3.5 of [12] we see that N(s1)∩TW′={s1},N(s2s3s2)∩TW′={s2s3s2},N(s3s2s3s2s3)∩TW′={s3s2s3s2s3}.
Therefore (W′,S′) is indeed a rank 3 universal Coxeter system.
Since the only braid moves that can be applied to (s1(s2s3s2)(s3s2s3s2s3))k are short braid moves between s1 and s3, the element s1(s2s3s2)(s3s2s3s2s3) is straight. One can also check that N(s1(s2s3s2)(s3s2s3s2s3))∩TW′={r1,r1r2r1,r1r2r3r2r1}. Consequently N((s1(s2s3s2)(s3s2s3s2s3))∞)∩TW′={r1,r1r2r1,r1r2r3r2r1,r1r2r3r1r3r2r1,r1r2r3r1r2r1r3r2r1⋯}. Based on the above discussion, one concludes that the interval [1,s1(s2s3s2)(s3s2s3s2s3)] in (W,≤A) is infinite where A=N((s1(s2s3s2)(s3s2s3s2s3))∞).
5. Set of elements of a given twisted length
In this section we consider the set {w∈W∣lB′(w)=n}. In contrast to the situation for the ordinary Bruhat order, we will show that such a set is infinite in most cases. Since lB(w−1)=lB′(w), our result also shows that the set {w∈W∣lB(w)=n} is infinite.
It is convenient to investigate this question in the context of (right) B-twisted weak Bruhat order <B′. In the following two lemmas (W,S) is a general finite rank infinite Coxeter system and Φ,Φ+ are its root system and its set of positive roots.
Lemma 5.1**.**
Let w∈Wl (the set of infinite reduced words), then (W,≤N(w)′) (resp. (W,≤Φ+\N(w)′)) has no maximal element or minimal element.
Proof.
Suppose to the contrary that u is a maximal element of (W,≤N(w)′) (i.e. for any element p∈W either u and p are not comparable or u≥N(w)′p). Let S={s1,s2,⋯,sn} be the set of simple reflections. Then usi⊲u for all si∈S. Let Ui=N(usi)\N(u). These sets are contained in N(w) by definition. Therefore there exists a (finite) prefix v of w such that Ui⊂N(v) for all i. Also note that N(u)\N(usi)⊂Φ+\N(w)⊂Φ+\N(v). Hence under the twisted weak order (W,≤N(v)′), one has usi⊲u for all i. Therefore u is a maximal element in (W,≤N(v)′) since if there exists some u′≥u then by the chain property of the twisted weak order there must be some si such that usi⊳u. But ≤N(v)′ is isomorphic to the standard right weak order which has no maximal element when W is infinite. A contradiction. Therefore we have shown that (W,≤N(w)′) has no maximal elements.
Now we claim that it cannot happen that there exists u∈W such that u≤N(w)′x,∀x∈W. Since N(u) is finite, there exists α∈Φ+ such that α∈N(w)\N(u). Then N(sα)\N(u)⊂(Φ+\N(w)). So u≰N(w)′sα and we establish the claim. Now for any u∈W we take x∈W such that u≤N(w)′x, and then consider the meet of u and x (it exists since (W,≤N(w)′) is a meet semilattice). Such a meet is clearly not equal to u as u≤N(w)′x. Therefore (W,≤N(w)′) has no minimal element.
The dual assertion about (W,≤Φ+\N(w)′) can be proved in the same fashion and thus is omitted.
∎
Lemma 5.2**.**
Let B be a biclosed set in Φ+ and w∈W. Then as posets (W,≤B′)≃(W,≤w⋅B′) under the map u↦wu.
Proof.
Suppose that u≤B′v. We show that N(wu)\N(wv) is contained in w⋅B=(N(w)\−w(B))⊎(w(B)\−N(w)).
Note that N(wu)\N(wv)=((N(w)\−wN(u))\(N(w)\−wN(v)))⊎((wN(u)\−N(w)\(w(N(v))\−N(w)))).
Take α∈(N(w)\−wN(u))\(N(w)\−wN(v)). This implies that α∈N(w) and −w−1(α)∈N(v)\N(u). Since N(v)⊂N(u)⊂Φ+\B, α∈−w(B).
So α∈N(w)\−w(B).
Take α∈(wN(u)\−N(w)\(w(N(v))\−N(w))). This implies that α∈−N(w) and α∈w(N(u)\N(v)). Therefore α∈w(B)\−N(w).
Therefore we see that N(wu)\N(wv)⊂w⋅B.
Next we show that N(wv)\N(wu)⊂Φ+\w⋅B. Since v≤Φ+\B′u, the above argument shows that
N(wv)\N(wu)⊂w⋅(Φ+\B). It follows from the formula w⋅B:=(N(w)\w(−B))∪(w(B)\(−N(w))) that w⋅(Φ+\B)=Φ+\w⋅B.
Therefore we conclude that wu≤w⋅B′wv.
The above arguments also prove that the inverse map u↦w−1u preserves the order since w−1⋅(w⋅B)=B and hence the lemma is proved.
∎
Now let Φ,Ψ+ and Δ be a finite crystallographic root system, a positive system of it and the corresponding simple system respectively. Suppose that Δ1⊂Δ. Let ΦΔ1=RΔ1∩Φ be the root subsystem generated by Δ1. Then R≥0Δ1∩Φ=ΦΔ1+ is a positive system of ΦΔ1.
Let W be the finite Weyl group with the root system Φ and W be the corresponding affine Weyl group. A subset Γ of Φ is said to be Z-closed if for α,β∈Γ such that α+β∈Φ one has α+β∈Γ.
Lemma 5.3**.**
Let Γ+ be another positive system of ΦΔ1. Then (Ψ+\ΦΔ1+)∪Γ+ is a positive system of Φ. If Δ2⊂Δ such that (Δ1,Δ2)=0, Δ2 is also a subset of the simple system of (Ψ+\ΦΔ1+)∪Γ+.
Proof.
Find the element w in the parabolic subgroup generated by sα,α∈Δ1 such that wΦΔ1+=Γ+. Act w on Ψ+ and we get (Ψ+\ΦΔ1+)∪Γ+. Note that we have w(Δ2)=Δ2.
∎
Let B be a biclosed set in Φ+.
Lemma 5.4**.**
If B and Φ+\B are both infinite, then (W,≤B′) has no maximal element or minimal element.
Proof.
By the characterization of the biclosed sets in Φ, IB=P(Ψ+,Δ1,Δ2) for some positive system Ψ+ and some orthogonal subsets Δ1,Δ2 of its simple system.
By Lemma 5.1 and Theorem 2.5, it suffices to treat the case where IB=P(Ψ+,Δ1,Δ2) where Δ1 and Δ2 are both nonempty. Further it suffices to check the case where B=P(Ψ+,Δ1,Δ2)∧ as all (W,≤B′) with IB=P(Ψ+,Δ1,Δ2) are isomorphic by Lemma 5.2. We suppose to the contrary that there exists u∈W such that usi⊳u for all si simple reflection of W (so u is minimal by the chain property of the twisted weak order).
We write A for AN(u). It is Z−closed in Φ by Lemma 3.13 in [24]. We also have A∩−A=∅ by subsection 2.4. Then we deduce that A′:=ΦΔ2∩A is Z-closed in ΦΔ2
and that A′∩−A′=∅. Then by [5] Chapter IV, §1, Proposition 22, A′ is contained in a positive system Γ+ in ΦΔ2. Let R≥0Δ2∩Φ=ΦΔ2+.
Then A′ is contained in (Ψ+\ΦΔ2+∪Γ+)\ΦΔ1 where Ψ+\ΦΔ2+∪Γ+ is a positive system in Φ by Lemma 5.3. We denote this positive system by Ξ+. Also by Lemma 5.3Δ1 is a subset of Ξ+’s simple system.
Since AN(u)\N(usi)∩ΦΔ2⊂AN(u)∩ΦΔ2(=A′), so
[TABLE]
Because N(u)\N(usi)⊂B, AN(u)\N(usi)⊂P(Ψ+,Δ1,Δ2)=(Ψ+\ΦΔ1)∪ΦΔ2. Hence
[TABLE]
Hence by equation 5.4.1 and 5.4.2 we conclude that AN(u)\N(usi)⊂Ξ+\ΦΔ1. Consequently N(u)\N(usi)⊂(Ξ+\ΦΔ1)∧ for all i. The right hand side is the inversion set of an infinite reduced word w by Theorem 2.5.
On the other hand, one has the inclusion N(usi)\N(u)⊂Φ+\P(Ψ+,Δ1,Δ2)∧⊂Φ+\(Ξ+\ΦΔ1)∧. Thus we conclude u is minimal under (W,≤N(w)′). This contradicts Lemma 5.1.
Similarly one can also prove that the poset has no maximal element.
∎
Theorem 5.5**.**
Suppose that W is irreducible and of rank ≥3. Let k∈Z and let B be an infinite biclosed set in Φ+ such that Φ+\B is also infinite. The set {w∈W∣lB′(w)=k} is infinite.
Proof.
Suppose that to the contrary there exists k∈Z, the set {w∈W∣lB′(w)=k} is finite. Suppose that this set is {w1,w2,⋯,wt}. We show that under the right B-twisted weak order ≤B′ any element is either greater than one of wi or less than one of wi (depending whether its twisted length is ≥ or ≤k).
Let u be an element in W and assume without loss of generality that lB′(u)>k. By Lemma 5.4u is not minimal. So one can find s∈S such that us<B′u and lB′(us)=lB′(u)−1. Proceed this way one sees that u must be greater than some element with twisted length k.
Now by Lemma 5.2 we only need to consider the case where B=P(Ψ+,Δ1,Δ2)∧. If Δ1=Δ, B is empty. Let α∈Δ\Δ1 and ρ be the highest root in Ψ+. Since ∪iN(wi) is finite, there must exist some positive roots α+pδ∈∪iN(wi) and −ρ+qδ∈∪iN(wi). We claim that there exists some v such that N(v) contains −ρ+qδ,α+pδ.
Proof of the claim. Since the rank of Φ is at least two, α=ρ. So −ρ,α∈Ω+:=Ψ−\{−α}∪{α}, which is another positive system. So −ρ+qδ,α+pδ are contained in (Ω+)∧, which is the inversion set of an infinite reduced word. Consequently they are contained in the inversion set of a finite prefix v of this infinite reduced word.
Note that Δ2=Δ since that will cause B=Φ+=Φ∧ and then B is cofinite. Therefore −ρ+qδ∈B.
However α+pδ∈B.
Therefore v is not comparable to any of wi under the right B-twisted weak order. Contradiction.
∎
Corollary 5.6**.**
Suppose that W is irreducible and of rank ≥3. Let B be an infinite biclosed set in Φ+ such that Φ+\B is also infinite. Then the B-twisted weak Bruhat order (W,≤B′) (resp. the B-twisted strong Bruhat order (W,≤B)) has an infinite antichain.
Proof.
Note that if u⪇B′v (resp. u⪇Bv) then lB′(v)>lB′(u) (resp. lB(v)>lB(u)). Therefore the set {w∈W∣lB′(w)=k} (resp. {w∈W∣lB(w)=k}) forms an infinite antichain by Theorem 5.5.
∎
We remark that in [17] it is proved that if B is finite or cofinite, the B-twisted weak order (and consequently the B-twisted strong Bruhat order) on an affine Weyl group does not have an infinite antichain.
6. An example: alcove order of A2
In this section we provide a clear picture of a specific twisted (strong) Bruhat order.
Let W and Φ be of type A2. The two simple roots are denoted by α,β.
We consider the B-twisted (strong) Bruhat order (W,≤B) where B={α,α+β,β}∧. Such an order is also called alcove order in [9]. We describe all of its spherical intervals.
In the following lemma we characterize all covering relations in (W,≤B).
Lemma 6.1**.**
For (W,≤B) one has the following results:
(1) Suppose that w∈T.
Then lB(sα+kδw)=lB(w)−2k−1,lB(sβ+kδw)=lB(w)−2k−1,lB(sα+β+kδw)=lB(w)−4k−3.
(2) Suppose that w∈sαsβT.
Then lB(sα+kδw)=lB(w)+4k+1,lB(sβ+kδw)=lB(w)−2k−1,lB(sα+β+kδw)=lB(w)+2k+1.
(3) Suppose that w∈sβsαT.
Then lB(sα+kδw)=lB(w)−2k−1,lB(sα+β+kδw)=lB(w)+2k+1,lB(sβ+kδw)=lB(w)+4k+1.
(4) Suppose that w∈sβsαsβT.
Then lB(sα+kδw)=lB(w)+2k+1,lB(sβ+kδw)=lB(w)+2k+1,lB(sα+β+kδw)=lB(w)+4k+3.
(5) Suppose that w∈sβT.
Then lB(sα+kδw)=lB(w)−4k−1,lB(sβ+kδw)=lB(w)+2k+1,lB(sα+β+kδw)=lB(w)−2k−1.
(6) Suppose that w∈sαT.
Then lB(sα+kδw)=lB(w)+2k+1,lB(sα+β+kδw)=lB(w)−2k−1,lB(sβ+kδw)=lB(w)−4k−1.
Proof.
It follows from the fact W=W⋉T that every element is in one of the six subsets and these six subsets are pairwise disjoint.
One can verify by induction easily that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Now by using the identity N(wu)=(N(w)\w(−N(u)))∪(wN(u)\(−N(w))), we compute
The map τ:sα↦sβ,sβ↦sα,sδ−α−β↦sδ−α−β induces an automorphism of W.
From this and the above calculation, one sees that
lB(tk1α+k2β)−2k−1=lB(tk1α+k2βsβ+kδ).
We compute
[TABLE]
[TABLE]
[TABLE]
lB(sα+β+kδtk1α+k2β)=−k−1−k1+2k2−k−1+2k1−k2−2k−1−2k1+k2=−4k−k1−k2−3.
Hence lB(sα+β+kδtk1α+k2β)=lB(tk1α+k2β)−4k−3. So we have proved (1).
We compute
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So lB(sα+kδsαtk1α+k2β)=2k−k1+2k2−k+2k1−k2+k−2k1+k2=2k−k1−k2.
lB(sαtk1α+k2β)=−k1+2k2−1+2k1−k2−2k1−2k2=−k1−k2−1.
Therefore
lB(sα+kδsαtk1α+k2β)=lB(sαtk1α+k2β)+2k+1.
[TABLE]
[TABLE]
[TABLE]
So lB(sβ+kδsαtk1α+k2β)=−k−1−k1+2k2−k+2k1−k2−2k−1−2k1+k2=−4k−2−k1−k2=lB(sαtk1α+k2β)−4k−1.
[TABLE]
[TABLE]
[TABLE]
So lB(sα+β+kδsαtk1α+k2β)=k−k1+2k2−2k−1+2k1−k2−k−1−2k1+k2=−2k−k1−k2−2=lB(sαtk1α+k2β)−2k−1.
So we have proved (6).
Using the map τ and the calculation for the case (6), one sees (5).
Now we prove (3). We compute
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So lB(sα+kδsβsαtk1α+k2β)=k−1−k1+2k2−2k−1+2k1−k2−k−1−2k1+k2=−2k−k1−k2−3.lB(sβsαtk1α+k2β)=−k1+2k2−1+2k1−k2−2k1−2k2−1=−k1−k2−2. Therefore
lB(sα+kδsβsαtk1α+k2β)=lB(sβsαtk1α+k2β)−2k−1.
We compute
[TABLE]
[TABLE]
[TABLE]
So lB(sβ+kδsβsαtk1α+k2β)=k−1−k1+2k2+k+2k1−k2+2k−2k1+k2=4k−k1−k2−1.
Therefore lB(sβ+kδsβsαtk1α+k2β)=lB(sβsαtk1α+k2β)+4k+1.
We compute
[TABLE]
[TABLE]
[TABLE]
So lB(sα+β+kδsβsαtk1α+k2β)=2k−k1+2k2−k−1+2k1−k2+k−2k1+k2=2k−k1−k2−1.
Therefore lB(sα+β+kδsβsαtk1α+k2β)=lB(sβsαtk1α+k2β)+2k+1.
Using the map τ and the calculation for the sβsαT case, one sees (2).
Now we prove (4). We compute
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
So lB(sα+kδsαsβsαtk1α+k2β)=−k−1−k1+2k2+2k+2k1−k2+k−1−2k1+k2=2k−2−k1−k2.lB(sαsβsαtk1α+k2β)=−k1+2k2−1+2k1−k2−1−2k1−2k2−1=−k1−k2−3.
Therefore lB(sα+kδsαsβsαtk1α+k2β)=lB(sαsβsαtk1α+k2β)+2k+1.
Using the map τ and the above calculation, one sees that lB(sβ+kδsαsβsαtk1α+k2β)=lB(sαsβsαtk1α+k2β)+2k+1.
We compute
[TABLE]
[TABLE]
[TABLE]
So lB(sα+β+kδsαsβsαtk1α+k2β)=k−k1+2k2+k+2k1−k2+2k−2k1+k2=4k−k1−k2.
Therefore lB(sα+β+kδsαsβsαtk1α+k2β)=lB(sαsβsαtk1α+k2β)+4k+3.
∎
We draw below part of the Hasse diagram of the poset (W,≤B). The numeric sequence a1a2⋯at,ai∈{1,2,3} stands for the reduced expression sa1sa2⋯sat where s1:=sα,s2:=sβ and s3:=sδ−α−β. The black edge corresponds to a covering relation in the corresponding B-twisted left weak Bruhat order. The blue edge corresponds to the additional covering relation in B-twisted strong Bruhat order.
We collect in the following proposition some properties and the symmetry of this poset.
Proposition 6.2**.**
(1) The sphericity of the intervals is characterized as follow.
(a) The length 2 intervals of (W,≤B) are either of the form [x,s1s2x] where s1=s2,s1,s2∈{sα,sβ,sδ−α−β} or of the form [x,sδ−γsγx] where γ∈{α,β,α+β,δ−α,δ−β,δ−α−β}. The former is spherical and the latter is non-spherical.
(b) The length 3 intervals of (W,≤B) are all non-spherical except those of the following types:
[x,sαsβsαx] where x∈sαsβsαT; [x,sδ−α−βsβsδ−α−βx] where x∈sβT; [x,sαsδ−α−βsαx] where x∈sαT.
(c) All intervals of (W,≤B) of length greater than 3 are non-spherical.
(2) Let x=(sβsδ−α−βsα)∞ and y=(sαsδ−α−βsβ)∞ be two infinite reduced words. For i≥0, denote x(i) and x(−i) the unique length i prefixes of x and y respectively.
Let U be the (infinite dihedral) reflection subgroup of W generated by v:=sδ−α−β and u:=sαsβsα. For x∈W, y is the unique minimal element of the left coset xU if and only if y=w(i)−1 for some i∈Z. Consequently every element w∈W can be written in the form w(i)−1u for some u∈U and i∈Z.
Furthermore for every w∈W, lB(w) is determined as follow:
(a) lB(w(i)−1u(vu)k)=−4k−3 if i is even and lB(w(i)−1u(vu)k)=−4k−2 if i is odd.
(b) lB(w(i)−1(vu)k)=−4k if i is even and lB(w(i)−1(vu)k)=−4k−1 if i is odd.
(c) lB(w(i)−1v(uv)k)=4k+1 if i is even and lB(w(i)−1v(uv)k)=4k+2 if i is odd.
(d) lB(w(i)−1(uv)k)=4k if i is even and lB(w(i)−1(uv)k)=4k−1 if i is odd.
(3) Suppose that x,y∈W such that lB(x) and lB(y) are of the same parity. Then there exists a poset automorphism γ:(W,≤B)→(W,≤B) such that γ(x)=y.
Proof.
(1) This can be verified routinely by using the covering relations in Lemma 6.1.
(2) By [12] y is an element that satisfies N(y−1)∩ΦU+=∅. Hence N(y−1)⊂{α,−β}∧⊎{−α,β}∧. Note that {α,−β}∧=(sβsδ−α−βsα)∞ and {−α,β}∧=(sαsδ−α−βsβ)∞.
Assume that N(y−1)⊂N(sβsδ−α−βsα)∞) and N(y−1)⊂N((sαsδ−α−βsβ)∞). Without loss of generality assume that α∈N(y−1).
Then {−α}∧∩N(y−1)=∅. This forces some β+kδ∈N(y−1). Then α+β+kδ∈N(y−1), contradicting N(y−1)∩ΦU+=∅. Hence either N(y−1)⊂N(sβsδ−α−βsα)∞) or N(y−1)⊂N((sαsδ−α−βsβ)∞).
Hence given w∈W, then w(i)−1=wu for some i∈Z and u∈U.
Now we check the results on twisted length. We prove (a) and (b)-(d) can be verified similarly. One computes that
(i) N((uv)kuw(i))=α0k−⌈2i⌉β0k+⌊2i⌋(α+β)02k. Then lB((uv)kuw(i))=−4k−3+⌈2i⌉−⌊2i⌋. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(ii) N((uv)kuw(i))=α0k−⌈2i⌉(α+β)02k(−β)1⌈−2i⌉−k−1. Then lB((uv)kuw(i))=−4k−3+⌈2i⌉+⌈−2i⌉. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(iii) N((uv)kuw(i))=β0k+⌊2i⌋(α+β)02k(−α)1⌈2i⌉−k−1. Then lB((uv)kuw(i))=−4k−3+⌈2i⌉−⌊2i⌋. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(iv) N((uv)kuw(i))=(α+β)02k(−α)1⌈2i⌉−k−1(−β)1⌈−2i⌉−k−1.
Then lB((uv)kuw(i))=−4k−3+⌈2i⌉+⌈−2i⌉. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(v) If k−⌈2i⌉=−1, N((uv)kuw(i))=β0k+⌊2i⌋(α+β)02k. Then lB((uv)kuw(i))=−3k−2−⌊2i⌋=−4k−3+⌈2i⌉−⌊2i⌋. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(vi) If k+⌊2i⌋=−1, N((uv)kuw(i))=α0k−⌈2i⌉(α+β)02k. Then lB((uv)kuw(i))=−3k−2+⌈2i⌉=−4k−3+⌈2i⌉−⌊2i⌋. If i is even the twisted length is −4k−3. If i is odd, the twisted length is −4k−2.
(3) Let σ be the group automorphism of W induced by the map sδ−α−β↦sα,sβ↦sδ−α−β,sα↦sβ.
Note that σ(tα∨)=σ(sαsβsδ−α−βsβ)=sβsδ−α−βsαsδ−α−β=tβ∨ and σ(tβ∨)=σ(sβsαsδ−α−βsα)=sδ−α−βsβsαsβ=t−(α+β)∨. So we conclude σ(T)=T.
We show that there exists a poset automorphism η of (W,≤B) given by w↦σ(w)sαsβ and a poset automorphism η′ of (W,≤B) given by w↦σ−1(w)sβsα.
Using the fact that T is a normal subgroup one obtains that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By above and the covering relations given in Lemma 6.1 one can easily checks that η preserves covering relations. Similarly one verifies that η′ also preserves covering relations. Let ρ=η(η′)−1 be the poset automorphism of (W,≤B).
For k∈Z,ρk(w)=σ2k(w)(x(2k))−1.
For any z∈U (as in (2)) we have
[TABLE]
By (2) if lB(x)=lB(y), x=w(j)−1z and y=w(k)−1z where j and k are of the same parity and z∈U. Then for some t, ρt(x)=y.
Now assume lB(x)=lB(y) but they are of the same parity. Let v,u be as in (2).
We compute
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence for any z∈W.lB(η(z))=lB(z)−2.
Therefore for some t,lB(x)=lB(ηt(y)).
∎
Remark 6.3*.*
One of the classical theme in the study of Coxeter group (or more generally combinatorics) is the enumeration problem.
Given the local finiteness of the twisted Bruhat order on affine Weyl groups, one can
define the Poincaré series associated to the twisted Bruhat order ≤B and an element w to be Fw,B(t)=∑u≤Bwtl(w)−l(u). This generalizes the usual Poincaré polynomial associated to the ordinary Bruhat order.
For type A2 and the above biclosed set B, we have the following result.
If l(w) is even, Fw,B(t)=t4−2t2+1t3+2t2+2t+1. If l(w) is odd, Fw,B(t)=t4−2t2+12t2+3t+1.
To see this, one can apply the Principle of Inculsion-Exclusion and Proposition 6.2 (3) to obtain
[TABLE]
[TABLE]
where F1(t)=Fw,B(t) for w even and F2(t)=Fw,B(t) for w odd.
Solve for F1(t) and F2(t) one obtains the closed formlae.
7. Tope Poset of the affine root system and a Björner-Edelman-Ziegler type theorem
The root system of a Coxeter group can be naturally regarded as an oriented matroid. The affine root systems provide interesting and accessible examples of infinite oriented matroids in the sense of [4].
In this section we will use twisted weak order as a tool to investigate the tope poset of the oriented matroid arising from an affine root system.
An (possibly infinite) oriented matroid is a triple (E,∗,cx) where E is a set with an involution map ∗:E→E (i.e. x∗∗=x,x=x∗) and cx a closure operator on E such that
(i) if x∈cx(X) there exists a finite set Y⊆X such that x∈cx(Y),
(ii) cx(X)∗=cx(X∗),
(iii) if x∈cx(X∪{x∗}) then x∈cx(X),
(iv) if x∈cx(X∪{y∗}) and x∈cx(X) then y∈cx(X\{y}∪{x∗}).
Given a root system Φ, (Φ,−,coneΦ) is an oriented matroid where coneΦ=cone(Γ)∩Φ and cone(Γ)={∑i∈Ikivi∣vi∈Γ∪{0},ki∈R≥0,∣I∣<∞}.
A cx-closed set in E is said to be convex.
A convex set H⊂E is called a hemispace or a tope if H∩H∗=∅,H∪H∗=E.
Suppose that Φ is the root system of a finite Coxeter system. Then every positive system is a hemispace of the oriented matroid (Φ,−,coneΦ) and vice versa. We denote the set of hemispaces by H(E).
For a finite oriented matroid (E,∗,cx)
and a hemispace H, there exists a unique minimal subset of H whose cx−closure is H. We denote such a set by ex(H) and call it the set of extreme elements of H.
A hemispace is said to be simplicial if ∣ex(H)∣ equals the rank of the underlying (unoriented) matroid of (E,∗,cx). A finite oriented matroid is said to be simplicial if all of its hemispaces are simplicial.
Denote by Δ the set symmetric difference. Fix a hemispace H of (E,∗,cx) and one can define a poset structure on the set of hemispaces by F≤G⟺FΔH⊂GΔH,F,G∈H(E). We call such a poset the tope poset based at H. In a tope poset P of an infinite oriented matroid, we say two hemisapces H1,H2 are in the same block of P if their symmetric difference is finite.
In [2], Björner, Edelman and Ziegler proved the following
Theorem 7.1**.**
For a finite simplicial oriented matroid, the tope poset for any choice of base hemispace is a lattice.
It is well known that for the root system of a finite Coxeter system, the corresponding oriented matroid is simplicial. In fact all tope posets are isomorphic to the ordinary right weak order of the Coxeter group (which is a lattice). In this section we prove the following analogous theorem for irreducible affine root systems.
Theorem 7.2**.**
Let Φ be a finite irreducible crystallographic root system and let H be any hemispace of the oriented matroid (Φ,−,cx) where cx:=coneΦ. Let H1,H2 be two hemispaces in a same block and H1≤H2 in the tope poset based at H. Then [H1,H2] is a lattice.
We will first classify all hemispaces of (Φ,−,cx).
Let Γ be a subset of a real vector space V. A subset A of Γ is called biconvex in Γ if A and Γ\A are both convex in the oriented matroid (Γ,−,coneΓ).
For the next lemma, let Φ be a finite irreducible crystallographic root system and let Ψ+ be a positive system of Φ.
Lemma 7.3**.**
Let P(Ψ+,Δ1,Δ2) be a 2 closure biclosed set in Φ. Then RΔ1∩cone(P(Ψ+,Δ1,Δ2))=0 and the 2 closure biclosed set P(Ψ+,Δ1,Δ2) is biconvex in Φ.
Proof.
Take a linear function f:RΦ→R such that f is positive on Δ\(Δ1∪Δ2) and zero on Δ1∪Δ2. Then f is non-negative on P(Ψ+,Δ1,Δ2).
If γ1,⋯,γk∈P(Ψ+,Δ1,Δ2),c1,⋯,ck∈R>0 and γ=∑i=1kciγi∈RΔ1, then apply f on both sides we see all γi are in R(Δ1∪Δ2) as f(γ)=0. Then they are in either RΔ1 or RΔ2 as Δ1⊥Δ2. But since they are in P(Ψ+,Δ1,Δ2), they have to be in RΔ2. Then this forces γ=0.
To prove the second assertion, again let γ1,⋯,γk∈P(Ψ+,Δ1,Δ2),c1,⋯,ck∈R>0 and γ=∑i=1kciγi. Note that Φ\P(Ψ+,Δ1,Δ2)=RΔ1⊎−P(Ψ+,Δ1∪Δ2,∅). Suppose γ∈−P(Ψ+,Δ1∪Δ2,∅), apply f on γ one gets a negative number, which is a contradiction. Therefore combining this with the first assertion, one sees P(Ψ+,Δ1,Δ2) is convex.
Note Φ\P(Ψ+,Δ1,Δ2)=P(Ψ−,−Δ1,−Δ2) and therefore is convex as well. Hence we see that P(Ψ+,Δ1,Δ2) is biconvex in Φ.
∎
Similarly one can define the notion of a 2 closure hemispace in a root system Φ. A 2 closure hemispace in Φ is a 2 closure closed set H such that H⊎−H=Φ. A hemispace of the oriented matroid (Φ,−,cx) is necessarily a 2 closure hemispace of Φ but not vice versa.
There exists a bijection between the set of 2 closure biclosed sets in Φ+ and the set of 2 closure hemispaces under the map B↦B⊎−(Φ+\B) for B a 2 closure biclosed set in Φ+. Since the 2 closure biclosed sets in Φ+ are classified, the corresponding 2 closure hemispaces are therefore known via the bijection. We will next examine which of these 2 closure hemispaces are indeed hemispaces of the oriented matroid (Φ,−,cx).
Lemma 7.4**.**
For any Coxeter system (W,S) and w∈W,
(1) the 2-closure hemispace N(w)⊎−(Φ+\N(w)) is convex,
(2) the 2-closure hemispace N(w)′⊎−(Φ+\N(w)′) is convex.
Proof.
(1) follows from the fact that N(w)⊎−(Φ+\N(w))=−wΦ+ and that Φ+ is convex.
(2) follows from the fact that N(w)′⊎−(Φ+\N(w)′)=wΦ+ and that Φ+ is convex.
∎
Now let P(Ψ+,Δ1,Δ2) be a 2 closure biclosed set (also biconvex by Lemma 7.3) in Φ. Any 2 closure biclosed set in (Φ)∧ is of the form (P(Ψ+,Δ1,Δ2)∧\B2)∪B1
where B1 (resp. B2) be a finite 2 closure biclosed set in (Φ1)∧ (resp. (Φ2)∧) and Φi=RΔi∩Φ.
Then we can associate to it a 2 closure hemispace H:=B⊎−((Φ)∧\B). We investigate when this 2 closure hemispace is a cone closure (i.e. oriented matroidal) hemispace.
Proposition 7.5**.**
(1) H is convex if Δ2 is empty or Δ1 is empty.
(2) If both Δ1 and Δ2 are non-empty, H is not convex.
Proof.
(1) Assume Δ2=∅.
Suppose {±α1,±α2,⋯,±αm}=RΔ1∩Φ=Φ1.
Let {γ1,γ2,⋯,γp}=Ψ+\Φ1.
By the construction H contains (γ1)−∞∞,(γ2)−∞∞,⋯,(γp)−∞∞.
Suppose αi1+k1δ,αi2+k2δ,⋯,αit+ktδ,γj1+l1δ,γj2+l2δ,⋯,γjs+lsδ∈H where
αip∈Φ1,1≤p≤t. Take a1,a2,⋯,at,b1,b2,⋯,bs∈R>0. Assume that
[TABLE]
where α′∈Φ1 and α′+qδ∈H. Then one has
[TABLE]
By Lemma 7.3 both sides have to be [math]. This forces all bv=0 (as all γi are in a positive system). So we have
[TABLE]
On the other hand, note that H∩Φ1 is a hemispace in (Φ1,−,coneΦ1). Indeed it is B1∪−((Φ1)∧\B1).
Since B1 is finite and biclosed in (Φ1)∧, it is of the form Φw where w is an element of the reflection subgroup generated by the reflections corresponding to the roots in (Φ1)∧. So Lemma 7.4 (1) ensures the above equation 7.5.1 is not possible.
Now assume that
[TABLE]
Then one has
[TABLE]
Again by Lemma 7.3 both sides have to be [math]. But all γv are in a positive system of Φ. So the equation 7.5.2 is not possible.
Hence H is indeed convex.
Now assume Δ1=∅. Then same type of reasoning as above (using Lemma 7.4 (2)) shows H is convex.
(2) Now we assume that both Δ1 and Δ2 are non-empty.
Again suppose that {±α1,±α2,⋯,±αm}=RΔ1∩Φ=Φ1 and assume that α1,α2,⋯,αm∈Φ+.
Suppose that {±β1,±β2,⋯,±βl}=RΔ2∩Φ=Φ2 and assume that β1,β2,⋯,βl∈Φ+.
By Lemma 4.1 of [24], ({βi+tδ∣t∈Z}∪{−βi+tδ∣t∈Z})∩(P(Ψ+,Δ1,Δ2)∧\B2)∪B1
has four possibilities:
(i) (βi)p∞∪(−βi)1∞,p≥0,
(ii) (βi)p∞∪(−βi)0∞,p≥1,
(iii) (−βi)p∞∪(βi)1∞,p≥0,
(iv) (−βi)p∞∪(βi)0∞,p≥1.
Correspondingly ({βi+tδ∣t∈Z}∪{−βi+tδ∣t∈Z})∩H can be one of the following four possibilities:
(i) (βi)p∞∪(−βi)1−p∞,p≥0,
(ii) (βi)p∞∪(−βi)1−p∞,p≥1,
(iii) (−βi)p∞∪(βi)1−p∞,p≥0,
(iv) (−βi)p∞∪(βi)1−p∞,p≥1.
We note in each of these four cases for sufficiently large s,t∈Z>0,βi+sδ and −βi+tδ∈H. It follows that δ∈cone(H).
Similarly by Lemma 4.1 of [24], ({αi+tδ∣t∈Z}∪{−αi+tδ∣t∈Z})∩(P(Ψ+,Δ1,Δ2)∧\B2)∪B1
has four possibilities:
(i) (αi)0p,p≥0,
(ii) (−αi)0p,p≥0,
(iii) (αi)1p,p≥1,
(iv) (−αi)1p,p≥1.
Correspondingly ({αi+tδ∣t∈Z}∪{−αi+tδ∣t∈Z})∩H can be one of the following four possibilities:
(i) (αi)−∞p∪(−αi)−∞−p−1,p≥0,
(ii) (−αi)−∞p∪(αi)−∞−p−1,p≥0,
(iii) (αi)−∞p∪(−αi)−∞−p−1,p≥1,
(iv) (−αi)−∞p∪(αi)−∞−p−1,p≥1.
We note in each of these four cases it follows that there exist s,t∈Z<0,βi+sδ and −βi+tδ∈H. Hence −δ∈cone(H).
Thus we see that ({βi+tδ∣t∈Z}∪{−βi+tδ∣t∈Z}) (resp. ({αi+tδ∣t∈Z}∪{−αi+tδ∣t∈Z})) is completely contained in cone(H). Therefore H is not convex.
∎
For an irreducible affine Weyl group W, any hemispace of the oriented matroid (Φ,−,coneΦ) is of the form N(w)⊎−(Φ∧\N(w)) or −N(w)⊎(Φ∧\N(w)) where w∈W or is an infinite reduced word.
Remark 7.7*.*
Let (W,S) be a rank 3 universal Coxeter system. The three simple roots are denoted by α1,α2,α3. Then B:={α∈Φ+∣α=k1α1+k2α2} is a biclosed set in Φ+. One easily sees that H=B⊎−(Φ+\B)={α∈Φ+∣α=k1α1+k2α2}⊎{α∈Φ−∣α=k1α1+k2α2+k3α3,k3<0} is a matroidal hemispace of the oriented matroid (Φ,−,coneΦ). However in this case neither B nor Φ+\B is an inversion set.
Lemma 7.8**.**
Let B=P(Ψ+,Δ1,∅)∧ be a biclosed set in (Φ)∧.
Let H=B⊎−((Φ)∧\B) be a hemispace of the oriented matroid (Φ,−,cx) and G is an arbitrary hemispace of (Φ,−,cx).
Then the block containing H of the tope poset based at G is isomorphic to the twisted weak order (W′,G∩Φ1) where W′ is the reflection subgroup generated by Φ1 and Φ1=±(RΔ1)∧.
Proof.
First note that since G is a hemispace in the oriented matroid, it is biclosed in Φ. Therefore G∩Φ1 is indeed a biclosed set in Φ1.
Let H1=B1⊎−(Φ∧\B1) be another hemispace. If H and H1 are in the same block, then clearly the symmetric difference of B and B1 is finite.
By Proposition 5.11 and Corollary 5.12 of [11] (See also Theorem 1.3 of [24]), B1=w⋅B for some unique w∈W′. Then H1=w⋅B⊎−(Φ∧\w⋅B)=wH by [14] 3.2(e).
Now define the map from the block containing H of the tope poset based at G to (W′,G∩Φ1) by wH↦w.
We must show that such a map and its inverse preserve the orders.
Take w1H,w2H such that w1H<w2H in the block containing H of the tope poset based at G.
Note that wiH=wi⋅P(Ψ+,Δ1,∅)∧⊎−((Φ)∧\wi⋅P(Ψ+,Δ1,∅)∧),i=1,2. by [14] 3.2(e).
Further one has that wi⋅P(Ψ+,Δ1,∅)∧=P(Ψ+,Δ1,∅)∧⊎(N(wi)∩Φ1) by Proposition 5.11 of [11].
Hence wiH=H⊎(N(wi)∩Φ1)\−((N(wi)∩Φ1)). Then w1HΔG⊂w2HΔG if and if the following two containments hold:
[TABLE]
[TABLE]
One sees that these two containments are equivalent to the conditions (N(w1)∩Φ1)\(N(w2)∩Φ1)⊂G and (N(w2)∩Φ1)\(N(w1)∩Φ1)⊂−G, i.e. w1≤G∩Φ1w2.
∎
Corollary 7.9**.**
Let P be a block of a tope poset of (Φ,−,cx). Then P is isomorphic to the twisted weak order on some Coxeter group W′.
Proof.
By Corollary 7.6, there are two possible types of the base tope (hemisapce).
Case I: The base hemispace is of the form N(w)⊎−(Φ\N(w)) where w∈W or w∈Wl. Then by Theorem 2.5, N(w)=u⋅P(Ψ+,Δ1,∅)∧ where u∈W. (Note if w∈W, then Δ1=Δ and P(Ψ+,Δ1,∅)∧=∅.) Suppose that u=e, the assertion follows from Lemma 7.8.
Now assume that u=e. Note that the map H↦uH is a bijection from the set of hemispaces to itself. One easily sees that the tope poset based at H is isomorphic to the tope poset based at wH by noting G1ΔH⊂G2ΔH⇔uG1ΔuH⊂uG2ΔuH. Therefore the assertion also holds in this situation.
Case II. The base hemispace is of the form −N(w)⊎(Φ\N(w)) where w∈W or w∈Wl. One easily sees that such a tope poset is the opposite poset of the tope poset based at N(w)⊎−(Φ\N(w)). Since the opposite poset of the twisted weak order (W,≤B′) is isomorphic to (W,≤Φ+\B′), the assertion also holds in this case.
∎
Proof of Theorem 7.2. By Corollary 7.9, [H1,H2] is isomorphic to a closed interval of the twisted weak order of some Coxeter group W′. By Corollary 4.2 of [23], it is also isomorphic to a closed interval of the ordinary weak order of W′. Since the ordinary weak order (W′,≤∅′) is a complete meet semilattice, such an interval is a lattice.
Remark 7.10*.*
Note that the example in Section 4 of [24] shows that in general the tope poset of the oriented matroid coming from an affine root system is not a lattice.
To end this section, we sketch (part of) the Hasse diagram of a specific tope poset of Φ of type A2 with the base hemispace Φ+. This particular tope poset is isomorphic to the poset of 2 closure biclosed sets in Φ+ (but in general there is no such isomorphism by our results above) and thus is a lattice by [24]. The two simple roots in Φ+ are denoted by α,β.
The author acknowledges the support from Guangdong Natural Science Foundation Project 2018A030313581. A small part of Section 7 is based on a chapter of the author’s dissertation. The author thanks Matthew Dyer for suggesting the problems in Section 3 and 5 and useful discussions.
Bibliography24
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Björner and F. Brenti. Combinatorics of Coxeter Groups, volume 231 of Graduate Texts in Mathematics . Springer, 2005.
2[2] Anders Björner, Paul H. Edelman, and Günter M. Ziegler. Hyperplane arrangements with a lattice of regions. Discrete Comput. Geom. , 5(3):263–288, 1990.
3[3] A. Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and G. M. Ziegler. Oriented Matroids,volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1999.
4[4] J. Richard Buchi and William E. Fenton. Large convex sets in oriented matroids. Journal of Combinatorial Theory, Series B , 45:293–304, 1988.
5[5] N. Bourbaki, Elements of Mathematics, Lie Groups and Lie Algebras, Chapter 4-6 . Springer, 2002.
6[6] Yu Chen, Matthew Dyer. On the combinatorics of B × B 𝐵 𝐵 B\times B -orbits on group compactifications, Journal of Algebra, 263:278-293, 2003
7[7] David S. Speyer. Powers of Coxeter elements in infinite groups are reduced, Proceedings of the American Mathematical Society, 137(4), 2009, 1295-1302
8[8] M. J. Dyer, Hecke algebras and shellings of Bruhat intervals. Compositio Math. , 89(1):91-115, 1993.