Finite CAT(0) Cube Complex

• Finite CAT(0) cube complexes are finite cell complexes assembled from Euclidean cubes that satisfy Gromov’s flag condition for nonpositive curvature.
• They are complete geodesic spaces under various ℓp metrics and feature combinatorial structures defined by hyperplanes and crossing complexes.
• Their rich structure supports applications in geometric group theory, combinatorial topology, and metric geometry through group actions and enumeration methods.

A finite CAT(0) cube complex is a finite cell complex obtained by gluing Euclidean unit cubes $[0,1]^n$ along isometric faces, such that the resulting space is simply-connected and the link of every vertex forms a flag simplicial complex. These complexes possess rich combinatorial, metric, and topological properties that have been extensively studied, serving as central objects in geometric group theory, combinatorial topology, and metric geometry.

1. Definitions and Fundamental Properties

A finite cube complex $X$ consists of a finite set of vertices $V$ and a collection $\mathcal{C}$ of nonempty subsets of $V$ called faces, with the property that the faces behave combinatorially as cubes: for each $\sigma \in \mathcal{C}$, the set of faces contained in $\sigma$ is isomorphic to the nonempty faces of an $i$-cube for some $i$ (Rowlands, 2020). The dimension of $X$ is the maximal dimension among its cubes.

The CAT(0) property for cube complexes is characterized by Gromov's link condition: $X$ is CAT(0) if and only if it is simply connected and the link $\operatorname{link}_X(v)$ of every vertex $v$ is a flag simplicial complex (Wright, 2010, Rowlands, 2020). This is equivalently described by the absence of “missing simplices,” ensuring local nonpositive curvature.

2. Metric Structures and Geodesicity

Finite CAT(0) cube complexes can be endowed with various standard metrics:

• $\ell_p$-norm metrics: Each cube $C \cong [0,1]^n$ carries the norm $\|x-y\|_p = (\sum_{i=1}^n |x_i-y_i|^p)^{1/p}$ for $1 \leq p < \infty$, or the supremum norm $\|x-y\|_\infty = \max_i |x_i - y_i|$ (Miesch, 2014).
• Induced path metric: The metric $d_p(x, y) = \inf \sum d^{C_i}_p(x_{i-1}, x_i)$ is defined as the infimum over all finite chains connecting $x$ and $y$ via cubes.

A foundational result is that finite-dimensional cube complexes with any $\ell_p$ metric are complete geodesic spaces: for any pair of points, there exists a length-minimizing geodesic composed of finitely many straight segments within cubes (a generalization of Bridson’s theorem to arbitrary $p$) (Miesch, 2014).

3. Combinatorics: Hyperplanes, Crossing Complexes, and PIPs

Each mid-cube within a cube complex separates $X$ into two half-spaces and is termed a hyperplane. Hyperplanes cross if they meet within a common cube (Wright, 2010). The set of hyperplanes encodes much of the combinatorial structure:

• The crossing complex $\Delta(X)$ is a flag simplicial complex whose vertices correspond to hyperplanes and whose simplices correspond to collections of pairwise intersecting hyperplanes (Rowlands, 2020).
• Via the theory of posets with inconsistent pairs (PIP), every rooted finite CAT(0) cube complex is uniquely represented by a finite PIP, yielding a bijective correspondence between such cube complexes and flag simplicial complexes (Rowlands, 2020).

The $f$-vectors of finite CAT(0) cubical complexes and flag simplicial complexes are related through an invertible linear transformation, enabling direct transfer of face enumeration results and combinatorial constraints between these domains.

4. Finiteness Criteria and Group Theoretical Constructions

Finite CAT(0) cube complexes arise naturally from actions of discrete groups on wallspaces. Sageev's construction produces a dual CAT(0) cube complex from any wallspace, with higher finiteness properties controlled by the group action:

• If the group action has finitely many wall orbits and transverse pairs (and wall stabilizers have bounded packing), the resulting dual complex is finite-dimensional and locally finite (Hruska et al., 2012).
• In the setting of relatively hyperbolic groups with abelian peripheral subgroups, truncation of cusps yields a finite CAT(0) cube complex admitting a properly discontinuous and cocompact group action, providing K(G,1) spaces for such groups.

A cube complex’s dimension equals the maximal number of pairwise-crossing hyperplanes (equivalently, the maximal dimension of an embedded cube) (Wright, 2010).

5. Injectivity, Regular Collapsibility, and Metric Characterizations

Finite CAT(0) cube complexes with finite width and finitely colorable hyperplanes are regularly collapsible, implying they admit injective $d_\infty$ metrics (Miesch, 2014). Specifically:

• Injective metric space: A metric space $(X, d)$ is injective if every 1-Lipschitz map from a subspace can be extended to the whole space. Equivalently, $X$ is hyperconvex.
• Criterion: A cube complex $\mathcal{C}$ is regularly collapsible if and only if $(|\mathcal{C}|, d_2)$ is CAT(0), $\mathcal{C}$ has finite width, and its hyperplanes are finitely colorable; in this case, $(|\mathcal{C}|, d_\infty)$ is injective (Miesch, 2014).
• The injectivity criterion aligns CAT(0) and injective properties under these finiteness conditions.

Geodesicity is robust: every finite-dimensional CAT(0) cube complex is complete and geodesic for any $\ell_p$-metric (Miesch, 2014).

6. Asymptotic Dimension and Controlled Colorings

The asymptotic dimension of a finite-dimensional CAT(0) cube complex $X$ of dimension $D$ satisfies $\operatorname{asdim}(X) \leq D$ (Wright, 2010). Key tools include:

• Controlled coloring of hyperplanes: A coloring $c: H \to \{0,1\}$ is $l$-controlled if no inward monochromatic geodesic exceeds length $l$; such controlled colorings can be constructed with $l$ depending only on $D$.
• Projection theorem: Every CAT(0) cube complex is a contractive retraction of an infinite-dimensional cube.

A plausible implication is that these results generalize small cancellation groups’ asymptotic dimension bounds via their cubulated model complexes.

7. Boundary Rigidity and Median Graphs

Finite CAT(0) cube complexes are boundary rigid: the combinatorial structure is uniquely determined (up to isomorphism) by the pairwise distances between boundary vertices in the 1-skeleton graph (Chalopin et al., 2023). This is the discrete analogue of Riemannian boundary rigidity.

A graph is median if, for every triple of vertices, there exists a unique median vertex. Median graphs are precisely the 1-skeleta of CAT(0) cube complexes. The entire complex can be reconstructed from its boundary distance matrix using the corner-peeling process, leveraging the quadrangle condition and cube gating properties. The reconstruction algorithm modifies the boundary set inductively, expanding subgraphs via combinatorial isomorphism steps until the full 1-skeleton is determined (Chalopin et al., 2023).

8. Illustrative Applications and Examples

Finite CAT(0) cube complexes model rich structures in geometric group theory (e.g., Davis complexes, duals to wallspaces), combinatorial enumeration (face vector transforms), and applied contexts such as robotics and phylogenetic tree spaces. The correspondence between cubical complexes and flag simplicial complexes via crossing complexes facilitates enumeration and balancedness property transfers (Rowlands, 2020). The contractibility and finite asymptotic dimension underscore their utility as geometric models for groups with desirable finiteness properties.

A plausible implication is that the transferability of combinatorial invariants between cubical and flag simplicial complexes opens enumeration strategies in both domains. The robustness of boundary rigidity further supports applications in discrete metric geometry and topological data analysis.