Cubical complex explained

In mathematics, a cubical complex (also called cubical set and Cartesian complex[1]) is a set composed of points, line segments, squares, cubes, and their n-dimensional counterparts. They are used analogously to simplicial complexes and CW complexes in the computation of the homology of topological spaces. Non-positively curved and CAT(0) cube complexes appear with increasing significance in geometric group theory.

Definitions

With regular cubes

A unit cube (often just called a cube) of dimension

n\ge0

is the metric space obtained as the finite (

l2

) cartesian product

Cn=In

of

n

copies of the unit interval

I=[0,1]

.

A face of a unit cube is a subset

F\subset{Cn}

of the form

F=

n
\prod
i=1

Ji

, where for all

1\lei\len

,

Ji

is either

\{0\}

,

\{1\}

, or

[0,1]

. The dimension of the face

F

is the number of indices

i

such that

Ji=[0,1]

; a face of dimension

k

, or

k

-face, is itself naturally a unit elementary cube of dimension

k

, and is sometimes called a subcube of

F

.

A cubed complex is a metric polyhedral complex all of whose cells are unit cubes, i.e. it is the quotient of a disjoint union of copies of unit cubes under an equivalence relation generated by a set of isometric identifications of faces. One often reserves the term cubical complex, or cube complex, for such cubed complexes where no two faces of a same cube are identified, i.e. where the boundary of each cube is embedded.

A cube complex is said to be finite-dimensional if the dimension of the cubical cells is bounded. It is locally finite if every cube is contained in only finitely many cubes.

With irregular cubes

An elementary interval is a subset

I\subsetneqR

of the form

I=[l,l+1]orI=[l,l]

for some

l\inZ

. An elementary cube

Q

is the finite product of elementary intervals, i.e.

Q=I1 x I2 x … x Id\subsetneqRd

where

I1,I2,\ldots,Id

are elementary intervals. Equivalently, an elementary cube is any translate of a unit cube

[0,1]n

embedded in Euclidean space

Rd

(for some

n,d\inN\cup\{0\}

with

n\leqd

).[2] A set

X\subseteqRd

is a cubical complex (or cubical set) if it can be written as a union of elementary cubes (or possibly, is homeomorphic to such a set).[3]

Related terminology

Elementary intervals of length 0 (containing a single point) are called degenerate, while those of length 1 are nondegenerate. The dimension of a cube is the number of nondegenerate intervals in

Q

, denoted

\dimQ

. The dimension of a cubical complex

X

is the largest dimension of any cube in

X

.

If

Q

and

P

are elementary cubes and

Q\subseteqP

, then

Q

is a face of

P

. If

Q

is a face of

P

and

QP

, then

Q

is a proper face of

P

. If

Q

is a face of

P

and

\dimQ=\dimP-1

, then

Q

is a facet or primary face of

P

.

In algebraic topology

In algebraic topology, cubical complexes are often useful for concrete calculations. In particular, there is a definition of homology for cubical complexes that coincides with the singular homology, but is computable.

In geometric group theory

Groups acting geometrically by isometries on CAT(0) cube complexes provide a wide class of examples of CAT(0) groups.

The Sageev construction can be understood as a higher-dimensional generalization of Bass-Serre theory, where the trees are replaced by CAT(0) cube complexes.[4] Work by Daniel Wise has provided foundational examples of cubulated groups.[5] Agol's theorem that cubulated hyperbolic groups are virtually special has settled the hyperbolic virtually Haken conjecture, which was the only case left of this conjecture after Thurston's geometrization conjecture was proved by Perelman.[6]

CAT(0) cube complexes

See also: Median graph.

Results

See also

Notes and References

  1. Web site: Introduction to Digital Topology Lecture Notes . Kovalevsky . Vladimir . https://web.archive.org/web/20200223170824/http://www.kovalevsky.de/Topology/Introduction_e.htm#a6 . November 30, 2021. 2020-02-23 .
  2. Werman. Michael. Wright. Matthew L.. 2016-07-01. Intrinsic Volumes of Random Cubical Complexes. Discrete & Computational Geometry. en. 56. 1. 93–113. 10.1007/s00454-016-9789-z. free. 0179-5376. 1402.5367.
  3. Book: Computational Homology. Kaczynski. Tomasz. 2004. Springer. Mischaikow. Konstantin. Mrozek. Marian. 9780387215976. New York. 55897585.
  4. Sageev . Michah . 1995 . Ends of Group Pairs and Non-Positively Curved Cube Complexes . Proceedings of the London Mathematical Society . en . s3-71 . 3 . 585–617 . 10.1112/plms/s3-71.3.585.
  5. Daniel T. Wise, The structure of groups with a quasiconvex hierarchy, https://docs.google.com/file/d/0B45cNx80t5-2NTU0ZTdhMmItZTIxOS00ZGUyLWE0YzItNTEyYWFiMjczZmIz/edit?pli=1
  6. Agol . Ian . 2013 . With an appendix by Ian Agol, Daniel Groves, and Jason Manning . The virtual Haken Conjecture . Doc. Math. . 18 . 1045–1087 . 10.4171/dm/421 . 3104553 . 255586740 . free.