Helly meets Garside and Artin

A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin groups are Helly, that is, they act geometrically on Helly graphs. In particular, such groups act geometrically on spaces with convex geodesic bicombing, equipping them with a nonpositive-curvature-like structure. That structure has many properties of a CAT(0) structure and, additionally, it has a combinatorial flavor implying biautomaticity. As immediate consequences we obtain new results for FC-type Artin groups (in particular braid groups and spherical Artin groups) and weak Garside groups, including e.g.\ fundamental groups of the complements of complexified finite simplicial arrangements of hyperplanes, braid groups of well-generated complex reflection groups, and one-relator groups with non-trivial center. Among the results are: biautomaticity, existence of EZ and Tits boundaries, the Farrell-Jones conjecture, the coarse Baum-Connes conjecture, and a description of higher order homological and homotopical Dehn functions. As a mean of proving the Helly property we introduce and use the notion of a (generalized) cell Helly complex.


Artin groups and
In this article we design geometric models for Artin groups and Garside groups, which are two generalizations of braid groups. Among the vast literature on these two classes of groups, we are particularly inspired by the results concerning the Garside structure, rooted in [Gar69,Del72,BS72], and the small cancellation structure for certain Artin groups, exhibited in [AS83,App84,Pri86]. These two aspects actually have interesting interactions, yielding connections with injective metric spaces and Helly graphs.
For geodesic metric spaces, being injective (or, in other words, hyperconvex or having the binary intersection property) can be characterized as follows: any collection of pairwise intersecting closed metric balls has a nonempty intersection. The graph-theoretic analogues of injective metric spaces are called Helly graphs (Definition 3.1). Groups acting on injective metric spaces were studied in [Lan13,DL16], leading to a number of results parallel to the CAT(0) setting [DL15,Des16,Mie17]. The article [CCG + ] initiates the studies of Helly groups, that is, groups acting properly and cocompactly by graph automorphisms (i.e., geometrically) on Helly graphs.
Main Theorem. Weak Garside groups of finite type and Artin groups of type FC are Helly.
The Main Theorem should be seen as providing geometric models for groups in question with nonpositive-curvature-like structure. Consequences of this theorem are explained in Section 1.2.
See Section 4.1 and Section 2.2 for the definitions of weak Garside groups and Artin groups. Examples of (weak) Garside groups of finite type include: (1) fundamental groups of the complements of complexified finite simplicial arrangements of hyperplanes [Del72]; (2) spherical Artin groups [Del72,BS72]; (3) braid groups of well-generated complex reflection groups [Bes15]; (4) structure groups of non-degenerate, involutive and braided set-theoretical solutions of the quantum Yang-Baxter equation [Cho10]; (5) one-relator groups with non-trivial center and, more generally, tree products of cyclic groups [Pic13]. It is known that Garside groups are biautomatic [Cha92,Deh02]. This suggests the non-positively curved (NPC) geometry of these groups. However, it is natural to ask for other notions of NPC for Garside groups in order to understand problems of coarse or continuous nature and to provide more convexity than the Garside normal form does.
A few classes of Artin groups are known to be CAT(0) [CD95a, BM00, Bra00, BC02, Bel05, BM10, HKS16,Hae19]. This leads to the speculation that all Artin groups should be NPC. However, due to the difficulty of verifying the CAT(0) condition in higher dimensional situations, it is not even known whether all braid groups are CAT(0), though some evidences are presented in [DMW18]. In particular, it is widely open whether Artin groups of type FC are CAT(0).
The Main Theorem applies to a large class of Artin groups and all finite type weak Garside groups (in particular all braid groups). Though the formulation is combinatorial, it has a continuous counterpart which is very similar to CAT(0). All Helly groups act geometrically on injective metric spaces [CCG + ], which in particular have convex geodesic bicombings. The convexity one obtains here is much stronger than biautomaticity and is weaker than CAT(0). See Subsection 1.2 for details.
On the other hand the Main Theorem equips the groups with a robust combinatorial structure -the one of Helly graphs. By a result from [CCG + ] it implies e.g. biautomaticity -an important algorithmic property not implied by CAT(0) (see [LM19]). While allowing to deduce 'CAT(0)-like' behavior as in the previous paragraph, the property of being Helly can be checked by local combinatorial conditions via a local-to-global characterization from [CCHO], see Theorem 3.2 below.
The Main Theorem also provides a higher dimensional generalization of an old result of Pride [Pri86] saying that 2-dimensional Artin groups of type FC are C(4)-T(4). The notion of cell Helly introduced in Section 3 serves as a higher dimensional counterpart of the C(4)-T(4) small cancellation condition in the sense of Lemma 3.8. We prove that the universal covers of the Salvetti complexes of higher dimensional Artin groups of type FC are cell Helly.
1.2. Consequences of the Main Theorem. In the Corollary below we list immediate consequences of being Helly, for groups as in the Main Theorem. In [CCG + ] it is shown that the class of Helly groups is closed under operations of free products with amalgamations over finite subgroups, graph products (in particular, direct products), quotients by finite normal subgroups, and (as an immediate consequence of the definition) taking finite index subgroups. Moreover, it is shown there that e.g. (Gromov) hyperbolic groups, CAT(0) cubical groups, uniform lattices in buildings of type C n , and graphical C(4)-T(4) small cancellation groups are all Helly. Therefore, the results listed below in the Corollary apply to various combinations of all those classes of groups.
Except item (6) below (biautomaticity) all other results (1)-(5) are rather direct consequences of well known facts concerning injective metric spacessee explanations in Subsection 1.3 below, and [CCG + ] for more details. Biautomaticity of Helly groups is one of the main results of the paper [CCG + ].
Corollary. Suppose that a group G is either a weak Garside group of finite type or an Artin group of type FC. Then the following hold.
(1) G acts geometrically on an injective metric space X G , and hence on a metric space with a convex geodesic bicombing. Moreover, X G is a piecewise ∞ -polyhedron complex.
(2) G admits an EZ-boundary and a Tits boundary.
(3) The Farrell-Jones conjecture with finite wreath products holds for G.
(4) The coarse Baum-Connes conjecture holds for G. The recent work of Kleiner and Lang [KL18] provides many new insights into the asymptotic geometry of injective metric spaces. Together with (1) of the above corollary, it opens up the possibility of studying Gromov's program of quasi-isometric classification and rigidity for higher dimensional Artin groups which are not right-angled. This actually serves as one of our motivations to look for good geometric models for such groups. Previous works in this direction concern mainly the right-angled or the 2-dimensional case [BN08,BJN10,Hua17,Hua16,HO17b,Mar18].
We also present an alternative proof of the fact that the Salvetti complex for Artin groups of type FC is aspherical (see Theorem 5.8), which implies the K(π, 1)-conjecture for such groups. This has been previously established by Charney and Davis [CD95b] by showing contractibility of the associated Deligne complex. Our proof does not rely on the Deligne complex.

Details and comments on items in Corollary.
(1) Injective metric spaces also known as hyperconvex metric spaces or absolute retracts (in the category of metric spaces with 1-Lipschitz maps) form an important class of metric spaces rediscovered several times in history [AP56,Isb64,Dre84] and studied thoroughly. One important feature of injective metric spaces of finite dimension is that they admit a unique convex, consistent, reversible geodesic bicombing [DL15, Theorems 1.1&1.2]. Recall that a geodesic bicombing on a metric space (X, d) is a map such that for every pair (x, y) ∈ X × X the function σ xy := σ(x, y, ·) is a constant speed geodesic from x to y. We call σ convex if the function t → d(σ xy (t), σ x y (t)) is convex for all x, y, x , y ∈ X. The bicombing σ is consistent if σ pq (λ) = σ xy ((1 − λ)s + λt), for all x, y ∈ X, 0 ≤ s ≤ t ≤ 1, p := σ xy (s), q := σ xy (t), and λ ∈ [0, 1]. It is called reversible if σ xy (t) = σ yx (1 − t) for all x, y ∈ X and t ∈ [0, 1].
It is shown in [CCG + ] that if a group G acts geometrically on a Helly graph Γ then it acts geometrically on an injective hull of V (Γ) (set of vertices of Γ equipped with a path metric) -the smallest injective metric space containing isometrically V (Γ). The proof is a straightforward consequence of the fact that the injective hull can be defined as a space of real-valued functions, the so-called metric forms [Isb64,Dre84,Lan13], and similarly the smallest Helly graph containing isometrically a given graphthe Helly hull -can be defined analogously using integer metric forms (see e.g. [JPM86, Section II.3]). It follows that G acts on a space with convex geodesic bicombing. Another example of a space with convex geodesic bicombing is a CAT(0) space with a combing consisting of all (unit speed) geodesics. As noted in Subsection 1.1 only in very particular cases it is possible to construct a CAT(0) space acted upon geometrically by an Artin group. We establish the existence of a slightly weaker structure in much greater generality.
Holt [Hol10] proves falsification by fellow traveller for Garside groups. It follows then from [Lan13] that such groups act properly (not necessarily cocompactly) on injective metric spaces. Garside groups have Garside normal forms, which can be thought as a combinatorial combing (not in the sense above). However, even coarsely this combing is not convex -see some further discussion in (4) below.
The properties considered in (2)-(5) below are immediate consequences of acting geometrically on a space with convex geodesic bicombing.
(2) Similarly to a CAT(0) space, an injective metric space (or, more generally, a space with convex geodesic bicombing) has a boundary at infinity, with two different topologies: the cone topology and the Tits topology [DL15,KL18]. The former gives rise to an EZ-boundary (cf. [Bes99,FL05]) of G [DL15]. The topology of an EZ-boundary reflects some algebraic properties of the group, and its existence implies e.g. the Novikov conjecture. The Tits topology is finer and provides subtle quasi-isometric invariants of G [KL18]. It is observed in [CCG + ] that Helly groups admit EZ-boundaries.
(3) For a discrete group G the Farrell-Jones conjecture asserts that the K-theoretic (or L-theoretic) assembly map, that is a homomorphism from a homology group of the classifying space E VCY (G) to a K-group (or L-group) of a group ring, is an isomorphism (see e.g. [FR00,BL12,KR17,Rou18] for details). We say that G satisfies the Farrell-Jones conjecture with finite wreath products if for any finite group F the wreath product G F satisfies the Farrell-Jones conjecture. It is proved in [KR17] that groups acting on spaces with convex geodesic bicombing satisfy the Farrell-Jones conjecture with finite wreath products.
The Farrell-Jones conjecture implies, for example, the Novikov Conjecture, and the Borel Conjecture in high dimensions. Farrell-Roushon [FR00] established the Farrell-Jones conjecture for braid groups, Bartels-Lück [BL12] and Wegner [Weg12] proved it for CAT(0) groups (see Subsection 1.1 for examples of CAT(0) Artin groups). Recently, Roushon [Rou18] established the Farrell-Jones conjecture for some (but not all) spherical and Euclidean Artin groups. His proof relies on observing that some Artin groups fit into appropriate exact sequences. After completion of the first version of the current paper Brck-Kielak-Wu [BKW19] presented another proof of the Farrell-Jones conjecture with finite wreath products for a subclass of the class of FC type Artin groups -for even Artin groups of type FC.
(4) For a metric space X the coarse assembly map is a homomorphism from the coarse K-homology of X to the K-theory of the Roe-algebra of X. The space X satisfies the coarse Baum-Connes conjecture if the coarse assembly map is an isomorphism. A finitely generated group Γ satisfies the coarse Baum-Connes conjecture if the conjecture holds for Γ seen as a metric space with the word metric given by a finite generating set. Equivalently, the conjecture holds for Γ if a metric space (equivalently: every metric space) acted geometrically upon by Γ satisfies the conjecture. As observed in [CCG + ], it follows from the work of Fukaya-Oguni [FO18] that Helly groups satisfy the coarse Baum-Connes conjecture.
For CAT(0) groups the coarse Baum-Connes conjecture holds by [HR95]. Groups with finite asymptotic dimension satisfy the coarse Baum-Connes conjecture. It is shown in [BF08] that braid groups as well as spherical Artin groups A n , C n , and Artin groups of affine type A n , C n have finite asymptotic dimension.
For proving the coarse Baum-Connes conjecture in [FO18] a coarse version of a convex bicombing is used. Essential there is that two geodesics in the combing with common endpoints 'converge' at least linearly. This is not true for the usual combing in Garside groups. For example, such a combing for Z 2 between points (n, n) and (0, 0) follows roughly the diagonal. Similarly the combing line between (n + k, n) and (0, 0) follows roughly a diagonal for n k. Hence, for large n, the two lines stay at roughly constant distance for a long time -this behavior is different from what is required.
(6) Biautomaticity is an important algorithmic property of a group. It implies, among others, that the Dehn function is at most quadratic, and that the Word Problem and the Conjugacy Problem are solvable; see e.g.
Biautomaticity of all FC-type Artin groups is new (and so is the solution of the Conjugacy Problem and bounding the Dehn function for these Artin groups). Altobelli [Alt98] showed that FC-type Artin groups are asynchronously automatic, and hence have solvable Word Problem. Biautomaticity for few classes of Artin groups was shown before by: Pride together with Gersten-Short (triangle-free Artin groups) [Pri86,GS90], Charney [Cha92] (spherical), Peifer [Pei96] (extra-large type), Brady-McCammond [BM00] (three-generator large-type Artin groups and some generalizations), Huang-Osajda [HO17a] (almost large-type). Weak Garside groups of finite type are biautomatic by [Cha92,Deh02].
1.4. Sketch of the proof of the main result. Here we only discuss the special case of braid groups. Each braid group is the fundamental group of its Salvetti complex X. The universal cover X admits a natural cellulation by Coxeter cells. The key point is that the combinatorics of how these Coxeter cells in X intersect each other follows a special pattern which is a reminiscent of CAT (0) cube complexes (but much more general). We formulate such pattern as the definition of cell Helly complex, see Definition 3.5 and Remark 3.7. By the local-to-global characterization of Helly graphs established in [CCHO], the proof of the main theorem reduces to showing that X is cell Helly, and showing that the cell Hellyiness can be further reduced to a calculation using Garside theory.
1.5. Organization of the paper. In Section 2, we provide some background on Coxeter groups and Artin groups. In Section 3, we discuss Helly graphs, introduce the notion of cell Helly complex, and present some natural examples. In Section 4, we prove the Garside case of the Main Theorem and in Section 5 we deal with the Artin group case.
1.6. Acknowledgements. J.H. thanks the Max-Planck Institute of Mathematics (Bonn), where part of this work was done, for its hospitality. J.H. also thanks R. Charney for helpful discussions on Garside groups. We would like to thank V. Chepoi, T. Fukaya, and U. Lang for comments on earlier versions of the paper. Part of the work on the paper was carried out while D.O. was visiting McGill University. We would like to thank the Department of Mathematics and Statistics of McGill University for its hospitality during that stay. D.O. was partially supported by (Polish) Narodowe Centrum Nauki, UMO-2017/25/B/ST1/01335. We thank the organizers of the conference "Nonpositively Curved Groups in the Mediterranean", Nahsholim 2017, for inviting us. A part of the work on the paper was carried out there.

Preliminaries
All graphs in this article are simplicial, that is, they do not contain loops or multiple edges. For a connected graph we equip the set of its vertices with a path metric: the distance of two vertices is the length (the number of edges) of the shortest edge-path between those vertices. A full subgraph of a graph Γ is a subgraph Γ such that two vertices are adjacent in Γ if and only if they are adjacent in Γ.
2.1. Lattices. A standard reference for the lattice theory is [Bir67]. Let (P, ≤) be a partially ordered set (poset), and let L be an arbitrary subset.
A poset (P, ≤) is a lattice if each two-element subset {a, b} ⊂ P has a least upper bound -join, denoted by a ∨ b -and a greatest lower bound -meet, denoted by a ∧ b.

2.2.
Artin groups and Coxeter groups. Let Γ be a finite simple graph with each of its edges labeled by an integer ≥ 2. Let V Γ be the vertex set of Γ. The Artin group with defining graph Γ, denoted A Γ , is given by the following presentation: for each s i and s j spanning an edge labeled by m ij }.
The Artin monoid with defining graph Γ, denoted A + Γ is the monoid with the same presentation. The natural map A + Γ → A Γ is injective [Par02]. The Coxeter group with defining graph Γ, denoted W Γ , is given by the following presentation: for each s i and s j spanning an edge labeled by m ij }. Note that there is a quotient map A Γ → W Γ whose kernel is normally generated by the squares of generators of A Γ .
Theorem 2.2. Let Γ 1 and Γ 2 be full subgraphs of Γ with the induced edge labelings. Then (1) the natural homomorphisms The Coxeter case of this theorem is standard, see e.g. [Bou02] or [Dav08], the Artin case of this theorem is proved in [vdL83].
A standard parabolic subgroup of an Artin group or a Coxeter group is a subgroup generated by a subset of its generating set.
Theorem 2.3. [CP14] Let Γ ⊂ Γ be a full subgraph. Let X → X be the embedding from the Cayley graph of A Γ (with respect to the standard presentation) to the Cayley graph of A Γ induced by the monomorphism A Γ → A Γ . Then X is convex in X, i.e. any geodesic of X between two vertices of X is contained in X .
Given x, y ∈ A Γ , we define x y (resp. y x) if y = xz (resp. y = zx) for some z in the Artin monoid A + Γ . By considering the length homomorphism A Γ → Z which sends each generator of A Γ to 1, one deduces that and are both partial orders on A Γ . They are called the prefix order and the suffix order, respectively. The prefix order is invariant under left action of A Γ on itself.
Now we recall the weak order on a Coxeter group W Γ . Each element w ∈ W Γ can be expressed as a word in the free monoid on the generating set of W Γ . One shortest such expression (with respect to the word norm) is called a reduced expression of w. Given x, y ∈ W Γ , define x y (resp. y x), if some reduced expression of y has its prefix (resp. suffix) being a reduced expression of x. Note that and give two partial orders on W Γ , called the right weak order and the left weak order, respectively.
The defining graph Γ is spherical if W Γ is a finite group, in this case, we also say the Artin group A Γ is spherical. An Artin group is of type FC if any complete subgraph Γ ⊂ Γ is spherical.

Davis complexes and oriented Coxeter cells.
By a cell, we always mean a closed cell unless otherwise specified.
Definition 2.5 (Davis complex). Given a Coxeter group W Γ , let P be the poset of left cosets of spherical standard parabolic subgroups in W Γ (with respect to inclusion) and let ∆ Γ be the geometric realization of this poset (i.e. ∆ Γ is a simplicial complex whose simplices correspond to chains in P). Now we modify the cell structure on ∆ Γ to define a new complex D Γ , called the Davis complex. The cells in D Γ are full subcomplexes of ∆ Γ spanned by a given vertex v and all other vertices which are ≤ v (note that vertices of ∆ Γ correspond to elements in P, hence inherit the partial order).
Suppose W Γ is finite with n generators. Then there is a canonical faithful orthogonal action of W Γ on the Euclidean space E n . Then the convex hull of the orbit of a nonzero point under the W Γ action (with its natural cell structure) is isomorphic to D Γ . In such case, we call D Γ a Coxeter cell.
In general, the 1-skeleton of D Γ is the unoriented Cayley graph of W Γ (i.e. we start with the usual Cayley graph and identify those double edges arising from s 2 i as single edges), and D Γ can be constructed from the unoriented Cayley graph by filling Coxeter cells in a natural way. Each edge of D Γ is labeled by a generator of W Γ . We endow D (1) Γ with the path metric. We can identify the unoriented Cayley graph of W Γ with the Hasse diagram of W Γ with respect to right weak order. Thus we can orient each edge of D Γ from its smaller vertex to its larger vertex. When W Γ is finite, D Γ with such edge orientation is called an oriented Coxeter cell. Note that there is a unique source vertex (resp. sink vertex ) of D Γ corresponding to the identity element (resp. longest element) of W Γ , where each edge containing this vertex is oriented away from (resp. oriented towards) this vertex. The source and sink vertices are called tips of D Γ .
The following fact is standard, see e.g. [Bou02].
Theorem 2.6. Let R be a left coset of a standard parabolic subgroup, and let v ∈ W Γ be an arbitrary element. Then the following hold.
(1) R is convex in the sense that for two vertices v 1 , v 2 ∈ R, the vertex set of any geodesic in D (1) Theorem 2.6 implies that the face of an oriented Coxeter cell C, with its edge labeling and orientation from C, can be identified with a lower dimensional Coxeter cell in a way which preserves edge labeling and orientation.
The following lemma is well-known. For example, it follows from [BC13, Lemma 3.4.9 and Corollary 5.5.16]. From another perspective, Theorem 2.6 (2)&(3) says that left cosets are the so-called gated subgraphs of D (1) Γ . It is a well-known fact (see e.g. [vdV93, Proposition I.5.12(2)]) that any family of gated subgraphs has the finite Helly property. In fact, the proof provided below for the convenience of the reader, is the proof of this feature of families of gated subgraphs.
We first look at the case n = 3. Pick x ∈ R 2 ∩R 3 . Let y be the unique point in R 1 closest to x (Theorem 2.6 (2)). For i = 2, 3, let y i be the unique point in R 1 ∩R i closest to x. By Theorem 2.6 (3), d(x, y 2 ) = d(x, y)+d(y, y 2 ). Thus y ∈ R 2 by the convexity of R 2 (Theorem 2.6 (1)). Thus y = y 2 . Similarly, y = y 3 . Hence y ∈ ∩ 3 i=1 R i . For n > 3, we induct on n. For 2 ≤ i ≤ n, let τ i = R 1 ∩ R i . Then each τ i is a left coset of a standard subgroup by Theorem 2.2. Moreover, {τ i } n i=2 pairwise intersect by the n = 3 case. Thus ∩ n i=2 τ i = ∅ by induction, and the lemma follows.

Salvetti complexes.
Definition 2.8 (Salvetti complex). Given an Artin group S Γ , we define a cell complex, called the Salvetti complex and denoted by S Γ , as follows. The 1-skeleton of S Γ is a wedge sum of circles, one circle for each generator. We label each circle by its associated generators and choose an orientation for each circle. Suppose the (n−1)-skeleton of S Γ has been defined. Now for each spherical subgraph Γ ⊂ Γ with n vertices, we attach an oriented Coxeter cell D Γ with the attaching map being a cellular map whose restriction to each face of the boundary of D Γ coincides with the attaching map of a lower dimensional oriented Coxeter cell (when n = 2, we require the attaching map preserves the orientation and the labeling of edges).
The 2-skeleton of S Γ is the presentation complex of A Γ . Hence π 1 (S Γ ) = A Γ . Let X Γ be the universal cover of S Γ . The 1-skeleton of X Γ is the Cayley graph of A Γ , and it is endowed with the path metric. We pull back labeling and orientation of edges in S Γ to X Γ . A positive path in X (1) Γ from a vertex x ∈ X Γ to another vertex y is an edge path such that one reads of a word in the Artin monoid by following this path. By considering the length homormophism A Γ → Z, we know each positive path is geodesic.
We identify X Γ inherits the prefix order and the suffix order . Then x y if and only if there is a positive path in X Γ which preserves labeling of edges. Take a cell of S Γ represented by its attaching map q : D Γ → S Γ with D Γ being an oriented Coxeter cell. Let q : D Γ → X Γ be a lift of q. Note thatq respects orientation and labeling of edges. It follows from definition that D (1) Γ is an embedding. By induction on dimension, we know q is an embedding. Hence each cell in X Γ is embedded. Given a vertex x ∈ X Γ , there is a one to one correspondence between cells of X Γ whose source vertex is x and spherical subgraphs of Γ. Then X (1) Γ extends naturally to a cellular map π : X Γ → D Γ which is a homeomorphism on each closed cell.
Lemma 2.9. Let q : C → X Γ be the attaching map from an oriented Coxeter cell C to X Γ . Let a and b be the source vertex and the sink vertex of C. Let C be the right weak order on C (0) . Then the following hold (we use d to denote the path metric on the 1-skeleton).
(1) the map (C (1) , d) → (X (1) Γ , d) is an isometric embedding; (2) for any two vertices x, y ∈ C, x C y if and only if q(x) q(y), moreover, [q(x), q(y)] = q([a, b] C ) where [q(x), q(y)] denotes the interval between two elements with respect to the order ; (3) for two cells C 1 and C 2 in X Γ , if C Proof. Assertion (1) follows from that the map X (1) Γ is 1-Lipschitz. Now we prove (2). The only if direction follows from that q preserves orientation of edges. Now assume q(x) q(y). Since q(a) q(x) q(y) q(b), there is a positive path ω from q(a) to q(b) passing through q(x) and q(y). LetC (1) ,ω,ā andb be the images of q(C (1) ), ω, q(a) and q(b) under X (1) Then d(a, b) = d(ā,b), which also equals to the length of ω (recall each positive path is geodesic). Thus length(ω) = length(ω). By Theorem 2.6,ω ⊂C (1) . Thenω (hence ω) corresponds to the longest word in the finite Coxeter group associated C. Thus ω ⊂ q(C). It follows that x y. The proof of the moreover statement in (2) is similar.
For (3), there is a positive path ω from the source of C 1 to the sink of C 1 corresponding to the longest word of some finite Coxeter group. The proof of (2) implies that ω ⊂ C 2 . Then ω determines C 3 ⊂ C 2 as required.
Lemma 2.10. Let C 1 and C 2 be two cells of X Γ . Then the following are equivalent: (1) C 1 = C 2 ; (2) C (1) Γ , we know C 1 and C 2 have the same label. On the other hand, Theorem 2.2 (1) implies that map from circle associated with a generator in S Γ to S Γ is π 1 -injective. Thus C 1 = C 2 . Now we look at the general case. By Lemma 2.9 (3), two vertices are adjacent in C 1 if and only if they are adjacent in C 2 . Then (2) ⇒ (3) follows from the 1-dimensional case by considering the orientation of edges on the cells.
A full subcomplex K ⊂ X Γ is a subcomplex such that if a cell of X Γ has vertex set contained in K, then the cell is contained in K. It is clear that intersection of two full subcomplexes is also a full subcomplex. The following is a consequence of Lemma 2.9 (2) and Lemma 2.10.
Lemma 2.11. Any cell in X Γ is a full subcomplex.
Take a full subgraph Γ ⊂ Γ, then there is an embedding S Γ → S Γ which is π 1 -injective (Theorem 2.2 (1)). A standard subcomplex of type Γ of X Γ is a connected component of the inverse image of S Γ under the covering map X Γ → S Γ . Each such standard subcomplex can be naturally identified with the universal cover X Γ of S Γ . A standard subcomplex is spherical if its type is spherical. We define the type of a cell in X Γ to be the type of the smallest standard subcomplex that contains this cell.
Lemma 2.12. Any standard subcomplex of X Γ is a full subcomplex.
Proof. Let X ⊂ X Γ be a standard subcomplex of type Γ . Let C ⊂ X Γ be a cell such that C (0) ⊂ X. By considering the map X (1) Γ , we know each edge of C is labeled by a vertex of Γ . Thus C is of type Γ for Γ ⊂ Γ . Hence C is mapped to S Γ under X Γ → S Γ . Since C ∪ X is connected, C ⊂ X. Then the lemma follows.
1 , the interval between a and b with respect to (X 2 . Then (1) follows from Lemma 2.12. Now we prove (2). Let X 1 be the standard subcomplex of type Γ 1 containing C. Then C ∩ X 2 is contained in X 1 ∩ X 2 , which is a standard subcomplex of type Γ 1 ∩ Γ 2 . This together with Lemma 2.12 imply that C ∩ X 2 is a disjoint union of faces of C of type Γ 1 ∩ Γ 2 . It remains to show C ∩ X 2 is connected. Suppose the contrary holds. Pick a shortest geodesic edge path ω ⊂ C (with respect to the path metric on C (1) ) traveling from a vertex in one component of C ∩ X 2 to another component. Then ω is also a geodesic path in X (1) Γ by Lemma 2.9. Since two end points of ω are in X 2 , we have ω ⊂ X 2 by Theorem 2.3, which yields a contradiction. Assertion (3) and (4) follow from Theorem 2.3.

Helly graphs
See the beginning of Section 2 for our convention on graphs. A clique of a graph is a complete subgraph. A maximal clique is a clique not properly contained in another clique. Each graph is endowed with the path metric such that each edge has length 1. A ball centered at x with radius r in a graph Γ is the full subgraph spanned by all vertices with distance ≤ r from x. As for Helly graphs we follow usually the notation from [CCHO, CCG + ].
Definition 3.1. A family F of subsets of a set satisfies the (finite) Helly property if for any (finite) subfamily F ⊆ F of pairwise intersecting subsets the intersection F is nonempty.
A graph is (finitely) clique Helly if the family of all maximal cliques, as subsets of the vertex sets of the graph, satisfies the (finite) Helly property.
A graph is (finitely) Helly if the family of all balls, as subsets of the vertex sets of the graph, satisfies the (finite) Helly property.
The notion of clique Helly is local and the notion of Helly is global. Our main tool for proving Hellyiness of some graphs is the following local-toglobal characterization.
The clique complex of a graph Γ is the flag completion of Γ. The triangle complex of Γ is the 2-skeleton of the clique complex, that is, the 2-dimensional simplicial complex obtained by spanning 2-simplices (that is, triangles) on all 3-cycles (that is, 3-cliques) of Γ.
Theorem 3.2. (i) ([CCHO, Theorem 3.5]) Let Γ be a simplicial graph. Suppose that Γ is finitely clique Helly, and that the clique complex of Γ is simply-connected. Then Γ is finitely Helly.
Parallel to this theorem, a local-to-global result for injective metric spaces is obtained in [Mie17].
Lemma 3.3. Let X be a set and let {X i } i∈I be a family of subsets of X. Define a simplicial graph Y whose vertex set is X, and two points are adjacent if there exists i such that they are contained in X i . Suppose that (1) there are no infinite cliques in Y ; (2) {X i } i∈I has finite Helly property, i.e. any finite family of pairwise intersecting elements in {X i } i∈I has nonempty intersection; (3) for any triple X i 1 , X i 2 , X i 3 of pairwise intersecting subsets in {X i } i∈I , there exists i 0 ∈ I such that Then Y is finitely clique Helly.
Proof. Let S ⊂ X be a subset. We claim if S is the vertex set of a clique in Y , then there exists i ∈ I such that S ⊂ X i . We prove it by induction on |S|. Note that |S| < ∞ by assumption (1), and the case |S| = 2 is trivial. Suppose |S| = n ≥ 3. Let {x 1 , x 2 , x 3 } be three pairwise distinct vertices in S and let S i = S \ {x i }. It follows from induction assumption that there exists X i such that S i ⊂ X i . Note that {X i 1 , X i 2 , X i 3 } pairwise intersect. Thus by assumption (3), there exists Hence the claim follows. The claim implies that if S is the vertex set of a maximal clique in Y , then S = X i for some i ∈ I. Now the lemma follows from assumption (2).
The lemma above justifies the following definition that will be our main tool for showing that some groups act nicely on Helly graphs. A subcomplex of X is finite it has only finitely many cells. (1) each intersection X i 1 ∩X i 2 ∩· · ·∩X i k is either empty or connected and simply connected (in particular, all members of {X i } are connected and simply connected); (2) the family {X i } i∈I has finite Helly property, i.e. any finite family of pairwise intersecting elements in {X i } i∈I has nonempty intersection; (3) for any triple X i 1 , X i 2 , X i 3 of pairwise intersecting subcomplexes in {X i } i∈I , there exists i 0 ∈ I such that The subcomplexes X i are called generalized cells of X.
In this article we will only deal with the following special case of generalized cell Helly complex.
Definition 3.5. Suppose X is a combinatorial complex such that each of its closed cell is embedded and each closed cell is a full subcomplex of X. Let {X i } i∈I be the collection of all closed cells in X. We say X is cell Helly if (X, {X i }) satisfies Definition 3.4.
A natural class of cell Helly complexes is described in the lemma below, whose proof is left to the reader.
Lemma 3.6. Suppose X is a simply-connected cube complex such that each cube in X is embedded and any intersection of two cubes of X is a sub-cube. Then X is cell Helly if and only if X is a CAT (0) cube complex.
Remark 3.7. It can be seen here that the condition (3) from Definition 3.4 plays a role of Gromov's flagness condition. Intuitively, it tells that all the corners (of possible positive curvature) are "filled" (and hence curvature around them is nonpositive).
Pride [Pri86] showed that 2-dimensional Artin groups of type FC are C(4)-T(4) small cancellation groups. The following lemma together with Theorem 5.8 can be seen as an extension of Pride's result to higher dimensions. We refer to [Pri86,Hod17] for the definition of C(4)-T(4) small cancellation conditions. Here, we assume that cells are determined by their attaching maps (this corresponds to the usual small cancellation theory, for groups without torsion). In particular, by [Hod17, Proposition 3.5] it means that the intersection of two cells is either empty or a vertex or an interval.
Lemma 3.8. Suppose X is a 2-dimensional simply-connected combinatorial complex such that each closed cell is embedded. Then X is cell Helly if and only if X satisfies the C(4)-T(4) small cancellation conditions.
Now suppose X is cell Helly. Since nonempty intersections of cells are connected and simply connected, such intersections must be vertices or intervals.
We check the C(4) condition. First suppose there is a cell C with the boundary covered by two intervals C ∩ C 0 and C ∩ C 1 being intersections with cells C 0 , C 1 . Since, by Definition 3.4(1), the intersection C 0 ∩ C 1 has to be a nontrivial interval. But then the union (C ∩ C 0 ) ∪ (C 0 ∩ C 1 ) ∪ (C 1 ∩ C) is a graph being a union of three intervals along their endpoints, contradicting Definition 3.4(3). Now, suppose there are cells C, C 0 , C 1 , C 2 such that C ∩ C i = ∅ and C i ∩ C i+1(mod 3) = ∅. It follows that there is a common intersection C ∩ C 0 ∩ C 1 ∩ C 2 . This brings us to the previous case.
For the T(4) condition let suppose there are cells C 0 , C 1 , C 2 with C i ∩ C i+1(mod 3) being a nontrivial interval containing a vertex v, for all i. Then (C 0 ∩ C 1 ) ∪ (C 1 ∩ C 2 ) ∪ (C 2 ∩ C 0 ) cannot be contained in a single cell, contradicting Definition 3.4(3).
Definition 3.4 generalizes Definition 3.5 in the same way as the graphical small cancellation theory generalizes the classical small cancellation theory, another example to consider is X being a C(4)-T(4) graphical small cancellation complex. Defining {X i } as the family of simplicial cones over relators, we obtain a generalized cell Helly complex (proved in [CCG + ]).
Later we will see more examples of cell Helly complexes whose cells are zonotopes (Corollary 4.11) or Coxeter cells (Theorem 5.8).
For a pair (X, {X i } i∈I ) as above, we define its thickening Y to be the following simplicial complex. The 0-skeleton of Y is X (0) , and two vertices of Y (0) are adjacent if they are contained in the same generalized cell of X. Then Y is defined to be the flag complex of Y (1) . We call (X, {X i } i∈I ) locally bounded if there does not exist an infinite strictly increasing sequence of vertex sets A 1 A 2 A 3 · · · such that for every j there exists i j with A j ⊆ X i j .
Theorem 3.9. The thickening of a locally bounded generalized cell Helly complex is clique Helly. The thickening of a simply connected locally bounded generalized cell Helly complex is Helly.
Proof. Let (X, {X i } i∈I ) be a locally bounded generalized cell Helly complex and let Y be its thickening. It follows from the proof of Lemma 3.3 that the vertex set of each finite clique of Y is contained in some X i j (this does not use assumption (1) of Lemma 3.3). This together with local boundedness imply that there are no infinite cliques in Y . The first statement follows from Lemma 3.3. By the Nerve Theorem [Bjö03, Theorem 6] applied to the covering of X by generalized cells {X i }, and the covering of Y by simplices corresponding to generalized cells we get that X and Y are have the same connectivity and isomorphic fundamental groups. If X is simply connected then so is Y and hence, by Theorem 3.2, the thickening is Helly.
We say that a group G acts on a generalized cell Helly complex (X, {X i } i∈I ) if it acts by automorphisms on X and preserves the family {X i } i∈I . For such an action clearly G acts by automorphisms on the thickening of (X, {X i } i∈I ). Moreover, we have the following.
Proposition 3.10. If a group G acts geometrically on a simply connected locally bounded generalized cell Helly complex (X, {X i } i∈I ) then G acts geometrically on the Helly graph being the 1-skeleton Y (1) of the thickening Y . In particular, G is Helly.
Proof. We first show that each vertex v in Y (1) is adjacent to finitely many other vertices. Suppose v is adjacent to infinitely many different vertices . Take X i which contains both v and v i . As X is uniformly locally finite, we can assume lim i→∞ d X (1) (v, v i ) = ∞ where d X (1) denotes the path metric on X (1) . Let P i be a shortest edge path in X i connecting v and v i . Then P i subconverges to an infinite path as i → ∞, which contradicts the local boundedness assumption.
Since the G-action on X is cocompact, the quotient Y (0) /G of the vertex set is finite. Since (X, {X i }) is locally bounded there are no infinite cliques (see the proof of Theorem 3.9) and hence the quotient Y (1) /G is finite.
To prove properness it remains to show that, for the G-action on Y (1) , stabilizers of cliques are finite. Such stabilizers correspond to stabilizers of finite vertex sets for the G-action on X, which are finite by the properness of the G-action on X.
We close the section with a simple but useful observation, that will allow us to reprove contractibility of the universal cover of the Salvetti complex of an FC-type Artin group in Section 5.
Proposition 3.11. Let (X, {X i } i∈I ) be a simply connected locally bounded generalized cell Helly complex such that the intersection of any collection of generalized cells is either empty or contractible. Then X is contractible.
Proof. By Borsuk's Nerve Theorem [Bor48] applied to the covering of X by generalized cells {X i }, and the covering of Y by simplices corresponding to generalized cells, we have that X is homotopically equivalent to its thickening. The latter is contractible as a Helly complex by Theorem 3.9.

Weak Garside groups act on Helly graphs
4.1. Basic properties of Garside categories. We follow the treatment of Garside categories in [Bes06,Kra08].
Let C be a small category. One may think C as an oriented graph, whose vertices are objects in C and oriented edges are morphisms of C. Arrows in C compose like paths: For objects x, y ∈ C, let C x→ denotes the collections of morphisms whose source object is x. Similarly we define C →y and C x→y .
For two morphisms x and y, we define x y if there exists a morphisms z such that y = xz. Define y x if there exists a morphisms z such that y = zx. Then (C x→ , ) and (C →y , ) are posets. A nontrivial morphism f which cannot be factorized into two nontrivial factors is an atom.
The category C is cancellative if, whenever a relation af b = agb holds between composed morphisms, it implies f = g. C is homogeneous if there exists a length function l from the set of C-morphisms to Z ≥0 such that l(f g) = l(f ) + l(g) and (l(f ) = 0) ⇔ (f is a unit).
We consider the triple (C, C φ → C, 1 C ∆ ⇒ φ) where φ is an automorphism of C and ∆ is a natural transformation from the identity function to φ. For an object x ∈ C, ∆ gives morphisms x −→ x, we denote the first morphism by ∆ x and the second morphism by ∆ Definition 4.1. A homogeneous categorical Garside structure is a triple (1) φ is an automorphism of C and ∆ is a natural transformation from the identity function to φ; (2) C is homogeneous and cancellative; (3) all atoms of C are simple; (4) for any object x, C x→ and C →x are lattices.
It has finite type if the collections of simple morphisms of C is finite.
Definition 4.2. A Garside category is a category C that can be equipped with φ and ∆ to obtain a homogeneous categorical Garside structure. A Garside groupoid is the enveloping groupoid of a Garside category. See [DDG + 15, Section 3.1] for a detailed definition of enveloping groupoid. Informally speaking, it is a groupoid obtained by adding formal inverses to all morphisms in a Garside category.
Let x be an object in a groupoid G. The isotropy group G x at x is the group of morphisms from x to itself. A weak Garside group is a group isomorphic to the isotropy group of an object in a Garside groupoid. A weak Garside group has finite type if its associated Garside category has finite type.
A Garside monoid is a Garside category with a single object and a Garside group is a Garside groupoid with a single object.
It follows from [DDG + 15, Proposition 3.11] that if G is a Garside groupoid, then the natural functor C → G is injective. Moreover, by [DDG + 15, lemma 3.13], the triple (C, C φ → C, 1 C ∆ ⇒ φ) naturally extends to (G, G φ → G, 1 G ∆ ⇒ φ) (denote the extensions of φ and ∆ by themselves). Define G x→ and G →x in a similar way to C x→ and C →x . For two morphisms x and y of G, define x y if there exists a morphisms z of C such that y = xz. Define y x analogously. The following Lemma 4.3 is well-known for inclusion from a Garside monoid to its associated Garside group. The more general case concerning Garside category can be proved similarly.
Lemma 4.3. For each object x of G, G x→ and G →x are lattices. Moreover, the natural inclusions C x→ → G x→ and C →x → G →x are homomorphisms between lattices.
For morphisms f 1 , f 2 ∈ G x→ (resp. G →x ), we use f 1 ∧ p f 2 (resp. f 1 ∧ s f 2 ) to denote the greatest lower bound of f 1 and f 2 with respect to (resp. ), where p (resp. s) standards for prefix (resp. suffix) order. Similarly we define f 1 ∨ p f 2 and f 1 ∨ s f 2 .
Lemma 4.4. Let G be a Garside groupoid and let f : x → y be a morphism of G. Then (1) the map (G y→ , ) → (G x→ , ) by sending h ∈ G y to gh is a lattice monomorphism; a −1 n = (a 1 ∧ s a 2 ∧ s · · ·∧ s a n ) −1 and a −1 1 ∧ p a −1 2 ∧ p · · ·∧ p a −1 n = (a 1 ∨ s a 2 ∨ s · · ·∨ s a n ) −1 . Proof. Assertion (1) follows from definition. To see (2), note that if h 1 h 2 , then there exists a morphism k of C such that h 2 = h 1 k. Thus h −1 The other direction is similar.
(3) follows from (2). Lemma 4.5. Let G be a Garside groupoid. Let {a i } n i=1 and c be morphisms in G. Let {b i } n i=1 be morphisms in C.
(1) Suppose a i b i = c for 1 ≤ i ≤ n. Let a = a 1 ∨ p a 2 ∨ p · · · ∨ p a n and b = b 1 ∧ s b 2 ∧ s · · · ∧ s b n . Then ab = c.
Proof. For (1), note that all the a i 's have the same source object and all the b i 's have the same target object. Thus a and b are well-defined. It follows from Lemma 4.4 (1) that Thus (1) follows. Assertion (2) can be proved similarly.
For a morphism f of G, denote the source object and the target object of f by s(f ) and t(f ). Proof. If f ∆ s(f ) , then ∆ s(f ) = f g for g in C. Let h be the unique morphism such that g = φ(h). By the definition of φ, we know h is in C. Moreover, h fits into the following commuting diagram: Thus h∆ s(f ) = ∆ t(f ) g, which implies that h(f g) = ∆ t(f ) g. Hence hf = ∆ t(f ) and ∆ t(f ) f . The other direction is similar.
Lemma 4.7. Let x be an object of G. Let Φ 1 be the collection of simple morphisms of G with target object x and let Φ 2 be the collection of simple morphisms with source object x. For a ∈ Φ 1 , we define a * be the morphism such that aa * = ∆ s(a) . Then (1) the map a → a * gives a bijection Φ 1 → Φ 2 ; (2) for a, b ∈ Φ 1 , we have b a if and only if b * a * ; Proof. For (1), since ∆ t(a * ) = ∆ s(a) a * , we have a * ∆ s(a * ) by Lemma 4.6. Thus a * ∈ Φ 2 . The map is clearly injective and surjectivity follows from Lemma 4.6. For (2), b a implies b = ka for a morphism k of C. From ∆ s(b) = bb * = kab * , we know ∆ t(b * ) = ∆ s(b) ab * , hence ab * ∆ s(a) . Then there is a morphism h of C such that ab * h = ∆ s(a) = aa * , hence b * h = a * and b * a * . The other direction is similar. For (3), note that elements in Φ 1 (resp. Φ 2 ) are closed under ∧ s and ∨ s (resp. ∧ p and ∨ p ), so φ 1 and Φ 2 are lattices. Now Assertion (3) follows from (2)  Lemma 4.8. Let C 1 , C 2 and C 3 be pairwise intersecting cells in G x . Then there is a cell C ⊂ G x such that D = ( Then each C ij is also an interval (Lemma 2.1 (1)). We write .1 (2)). Since f i h g i , there are morphisms w i and w * i in C such that h = f i w i and g i = hw * i . Note that w i w * i = ∆ s(f i ) . Moreover, by Lemma 4.5 (1) and (3), we have (1) f ij · (w i ∧ s w j ) = h and h · (w * i ∧ p w * j ) = g ij . Let f (resp. g) be the greatest lower bound (resp. least upper bound) over all elements in D with respect to the prefix order . Since D is a union of three intervals, we know f = f 12 ∧ p f 23 ∧ p f 31 and g = g 12 ∨ p g 23 ∨ p g 31 . Define a = (w 1 ∧ s w 2 ) ∨ s (w 2 ∧ s w 3 ) ∨ s (w 3 ∧ s w 1 ) and b = (w * 1 ∧ p w * 2 ) ∨ p (w * 2 ∧ p w * 3 ) ∨ p (w * 3 ∧ p w * 1 ). Then by equation (1) above and Lemma 4.5 (2) and (4), we have f a = h and hb = g.
We claim ab ∆ s(a) . This claim implies that the cell [f, f ∆ s(a) ] contains the interval [f, g], hence contains D. Thus the lemma follows from the claim. Now we prove the claim. Since w i ∆ s(w i ) for 1 ≤ i ≤ 3, by Lemma 4.6, ∆ t(w i ) w i . Then ∆ t(w i ) a. By Lemma 4.6 again, a ∆ s(a) . Let a * be a morphism in C such that aa * = ∆ s(a) . It suffices to show b a * . By repeatedly applying Lemma 4.7 (3), we have a . Note that b is the least upper bound of three terms, however, each of these terms is every term of a * , so each of these terms is a * , hence b a * .
Theorem 4.9. Let G be a weak Garside group of finite type associated with a Garside groupoid G. Then G acts geometrically on a Helly graph.
Proof. Let x be an object of G. Suppose G = G x . Let Y be a simplicial graph whose vertex set is G x→ and two vertices are adjacent if they are in the same cell of G x→ . The left action G x G x→ preserve the collection of cells, hence induces an action G x Y . Note that Y is uniformly locally finite. Indeed, given f ∈ G x→ , g is adjacent to f if and only if g = f a −1 b for some simple morphisms a and b of C. Since the collection of simple morphisms is finite, there are finitely many possibilities of such g. Thus Y satisfies assumption (1) of Lemma 3.3 with {X i } i∈I being cells of G x→ . Assumption (2) of Lemma 3.3 follows from Lemma 2.1 (2), as each cell is an interval in the lattice G x→ . Assumption (3) of Lemma 3.3 follows from Lemma 4.8. Thus Y is finitely clique Helly by Lemma 3.3. By Thereom 3.2, it remains to show that the flag complex F (Y ) of Y is simply connected.
Let Z be the cover graph of the poset (G x→ , ), i.e. two vertices f and h are adjacent if f = hk or h = f k for some atom k. Since all atoms are simple, Z is a subgraph of Y . As every morphism in C can be decomposed into a product of finitely many atoms by Definition 4.1 (2), each edge of Y is homotopic rel its ends points in F (Y ) to an edge path in Z. Let ω ⊂ Y be an edge loop. We assume ω ⊂ Z up to homotopy in F (Y ). Let f ∈ G x→ be a common lower bound for the collection of vertices of ω. We denote consecutive vertices of ω by {f f i } n i=1 where each f i is a morphism of C. We define the complexity τ (ω) of ω to be max 1≤i≤n {l(f i )}, where l is the length function in Section 4.1. Suppose l(f i 0 ) = τ (ω). Then by definition of l, we have l( Moreover, since f i 0 (a 1 ∨ s a 2 ) = f i 0 (Lemma 4.5) and a 1 ∨ s a 2 is simple, by Lemma 4.6 Thus ω and ω are homotopic in F (Y ). By repeating this process, we can homotop ω to a constant path, which finishes the proof.
Remark 4.10. The simple connectedness of F (Y ) above be can alternatively deduced from [Bes06, Corollary 7.6], where Bessis considers a graph Γ on G x→ such that two vertices are adjacent if they differ by a simple morphism in C. It is proved that the flag complex F (Γ) is contractible. As Γ is a proper subgraph of Y , it is not hard to deduce the simply-connectedness of F (Y ). The definition of Γ goes back to work of Bestvina [Bes99] in the case of spherical Artin groups, and Charney-Meier-Whittlesey [CMW04] in the case of Garside group.
For a braid group G, Theorem 4.9 products many different Helly graphs (hence injective metric spaces) where G acts geometrically. One can choose different Garside structures on G: either we use the interval [1, ∆ k ] as a cell, or we use the dual Garside structure [BKL98,Bes03]. One can also apply some combinatorial operations to a Helly graph -e.g. taking the Rips complex or the face complex -in order to obtain a new Helly graph (see [CCG + ]). Γ is endowed with the prefix order . For a cell C ∈ X Γ , we use C to denote the right weak order on C (0) (we view C as an oriented Coxeter cell). And for a standard subcomplex X 1 ⊂ X Γ of type Γ 1 , we use Γ 1 to denote the prefix order on X (0) 1 coming from A Γ 1 . Lemma 5.1. Let C 1 , C 2 ⊂ X Γ be two cells with non-empty intersection. Then the vertex set of C 1 ∩ C 2 is an interval in (X Proof. For i = 1, 2, suppose C i is type Γ i and let X i be the standard subcomplex of type Γ i containing C i . Let X 0 = X 1 ∩X 2 , which is a standard subcomplex of type Γ 0 = Γ 1 ∩Γ 2 . Let D i = C i ∩X 0 . Then D i is a cell by Lemma 2.13. Moreover, D Lemma 5.2. Let C be an oriented Coxeter cell. Let K be the full subcomplex of C spanned by vertices in an interval of C (0) . Then K is contractible.
Proof. Let [x, y] be an interval of C (0) . By [BB05, Proposition 3.1.6], we can assume x is the source of C. Let : C (0) → Z be the function measuring the combinatorial distance from x to a given point in C (0) . We extend to C → R such that is affine when restricted to each cell. Note that is non-constant on each cell with dimension > 0. Lemma 5.3. Suppose Γ is spherical. Let C 1 and C 2 be two cells in X Γ , and let X 0 be a standard subcomplex of X Γ of type Γ 0 . Suppose the triple {C 1 , C 2 , X 0 } pairwise intersect. Then their triple intersection is nonempty.
Proof. For i = 1, 2, let v i be a vertex of C i ∩ X 0 . Since (X (0) , Γ 0 ) is a lattice by Theorem 2.4, we can find a, b ∈ X (0) such that a Γ 0 v i Γ 0 b for i = 1, 2. Let I be the interval between a and b with respect to the prefix order on X (0) Γ . Then I ⊂ X 0 by Lemma 2.13 (3). Note that C 1 , C 2 and I pairwise intersect by intersection. Since C (0) i is an interval in (X (0) Γ , ) for i = 1, 2 (Lemma 2.9 (2)), and (X (0) Γ , ) is a lattice (recall that Γ is spherical), we have C 1 ∩ C 2 ∩ I = ∅ by Lemma 2.1 (2). Since I ⊂ X 0 , the lemma follows.
Proof. Let Γ i be the type of C i and let X i be the standard subcomplex of is an interval in (X (0) 1 , Γ 1 ) (Lemma 2.9) and (X (0) 1 , Γ 1 ) is a lattice (Theorem 2.4), the lemma follows from Lemma 2.1.
Case 2: only two of the Γ i are equal. We suppose without loss of generality that Γ 1 = Γ 2 = Γ 3 . Let C 3 = C 3 ∩ X 1 . Then C 3 is a cell by Lemma 2.13. Moreover, C 1 , C 2 and C 3 pairwise intersect. As the previous case, we know C 1 ∩ C 2 ∩ C 3 = ∅, hence the lemma follows.
For i = 1, 2, 3, let τ i = C i,i+1 ∩ C i,i+2 (indices are taken mod 3). By the previous paragraph, each τ i is a cell of type Γ 0 . Let X 0 = ∩ 3 i=1 X i . Then τ i ⊂ X 0 for 1 ≤ i ≤ 3. In particular X 0 is nonempty, hence is a standard subcomplex of type Γ 0 by Lemma 2.13 (1). Now we claim ∩ 3 i=1 τ i = ∅. Note that the lemma follows from this claim since τ i ⊂ C i for 1 ≤ i ≤ 3.
Proposition 5.5. Let {C i } n i=1 be a finite collection of cells in X Γ . Suppose they pairwise intersect. Then ∩ n i=1 C i is a nonempty contractible subcomplex of X Γ .
Proof. For 2 ≤ i ≤ n, let τ i = C 1 ∩ C i . Then τ by Lemma 2.1, hence ∩ n i=1 C i = ∅. Since each C i is a full subcomplex of X Γ (Lemma 2.11), {C i } n i=1 is full in X Γ (hence is full in C 1 ). Now the contractibility of ∩ n i=1 C i follows from Lemma 5.2. 5.2. Artin groups of type FC act on Helly graphs.
Proof. It suffices to consider the special case when each C i is a maximal cell of X Γ . Consider the cell C of type Γ in X Γ with the source vertex being the identity. Let ∆ be the sink vertex of C. Then by [BS72,Del72], A Γ is a Garside group with A + Γ being its Garside monoid and ∆ being its Garside element (the φ in Definition 4.1 corresponds to conjugating by ∆), moreover, cells in the sense of Lemma 4.8 correspond to vertices of maximal cells of X Γ . Thus the lemma follows from Lemma 4.8 and Lemma 2.11.
Proposition 5.7. Suppose that Γ is of type FC. Let C 1 , C 2 and C 3 be maximal pairwise intersecting cells in X Γ . Then there is a maximal cell C ⊂ X Γ such that D = (C 1 ∩ C 2 ) ∪ (C 2 ∩ C 3 ) ∪ (C 3 ∩ C 1 ) ⊆ C.
Proof. For 1 ≤ i ≤ 3, suppose C i is of type Γ i and let X i be the standard spherical subcomplex of type Γ i . If X 1 = X 2 = X 3 , then the proposition follows from Lemma 5.6.
Suppose two of the X i are the same. We assume without loss of generality that X 1 = X 2 = X 3 . Let C 3 = C 3 ∩ X 1 . Then C i ∩ C 3 = C i ∩ C 3 for i = 1, 2. Hence D ⊂ (C 1 ∩ C 2 ) ∪ (C 2 ∩ C 3 ) ∪ (C 3 ∩ C 1 ). By Lemma 2.13 (2), C 3 is a cell in X 1 . Then we are done by Lemma 5.6.
It remains to consider the case {X i } 3 i=1 are mutually distinct. By Proposition 5.5, there is a vertex p in ∩ 3 i=1 C i . Let C ij = C i ∩ C j and X ij = X i ∩ X j . Then X ij is a spherical standard subcomplex of type Γ ij = Γ i ∩ Γ j by Lemma 2.13 (1) (but C ij ⊂ X ij might not be a cell in general). Since Γ is of type FC, there is a spherical full subgraph Γ 0 ⊂ Γ such that Γ 0 contains Γ 12 ∪ Γ 23 ∪ Γ 31 . Let X 0 be the spherical standard subcomplex of X Γ of type Γ 0 that contains p. Then for 1 ≤ i = j ≤ 3, p ∈ C i ∩ C j ⊂ X ij ⊂ X 0 . It follows that D ⊂ (C 1 ∩ C 2 ) ∪ (C 2 ∩ C 3 ) ∪ (C 3 ∩ C 1 ) where C i = C i ∩ X 0 . Since each C i is a cell (Lemma 2.13 (2)) and X 0 is spherical, the proposition follows from Lemma 5.6.
Theorem 5.8. Suppose Γ is of type FC. Then (X Γ , {C i }) is a locally bounded cell Helly complex and, consequently, A Γ acts geometrically on a Helly graph being the 1-skeleton of the thickening of (X Γ , {C i }). Moreover, X(Γ) is contractible.
Proof. The conditions (1) and (2) of Definition 3.4 are satisfied by Proposition 5.5. The condition (3) holds by Proposition 5.7. Since X Γ is simply connected, the theorem holds by Theorem 3.9 and Proposition 3.10. Contractibility follows from Proposition 5.5 and Proposition 3.11.