03.12.57 · modern-geometry / homotopy

Cubical -groupoid

shipped3 tiersLean: none

Anchor (Master): Brown-Higgins-Sivera Part III §13-§14 (cubical $\omega$-groupoids with connections and the equivalence $\gamma$); Brown-Higgins 1981 *On the algebra of cubes* (J. Pure Appl. Algebra 21); Brown-Higgins 1981 *The equivalence of $\infty$-groupoids and crossed complexes* (Cahiers Top. Géom. Diff. 22)

Intuition Beginner

A square is a more cooperative shape than a disk or a triangle. Two squares that share an edge fit together into a longer rectangle, and you can keep gluing left to right, or top to bottom, building a whole grid of squares like floor tiles. The boundary of a square has four flat sides, and each side is itself a smaller cube — an edge. This self-similar, grid-friendly shape is the reason the cubical picture of a space is easier to compute with than the loop-and-disk picture.

The cubical record of a filtered space collects all the ways of mapping a cube of each dimension into the space, respecting the floors of the filtration: vertices land on the bottom floor, edges on the next, faces above that, and so on. A square's four edges must sit one floor down. After we glue and slide these cubes around — counting two cubes as the same when one can be deformed into the other through the floors — we get a single algebraic object that knows how every dimension of the space fits together.

Two features make this object more than a pile of cubes. First, in an -dimensional cube there are independent directions, so there are separate ways to glue: along direction one, direction two, and so on. Second, there are special filler cubes called connections that let you "turn a corner" — fold one direction onto another. Connections are degenerate cubes that are not merely constant; they bend. Together the directional gluings and the connections give the grid enough flexibility to model the full homotopy content of the space.

Visual Beginner

Picture a flat grid of square tiles. Each tile is a map of a square into the space. Two tiles in the same row share a vertical edge and glue side by side; two tiles in the same column share a horizontal edge and glue top to bottom. The grid shows the two independent gluing directions of squares. Off to the side, draw one special tile bent like a folded napkin: that is a connection, a filler that turns the horizontal direction into the vertical one.

The two things to keep in view are the two gluing directions in the grid and the bent connection tile. The grid gives the compositions; the connection gives the folding that an ordinary constant filler cannot. Both are needed before the grid of cubes becomes a faithful model of the space.

Worked example Beginner

Compose two squares of paths along a shared edge, in the simplest filtered space: a space filtered so that the bottom floor is a single point and everything else is free.

Step 1. Take a square whose four edges are paths, with its right edge equal to a path . Take a second square whose left edge is the same path .

Step 2. Because the right edge of matches the left edge of , the two squares share that edge exactly. Glue them along it. The result is a wider rectangle, which we reparametrise back to a single square. Call it , the composite in direction one (the horizontal direction).

Step 3. Read off the edges of the composite. Its top edge is the top of followed by the top of . Its bottom edge is the bottom of followed by the bottom of . Its left edge is the left edge of . Its right edge is the right edge of . The shared path has disappeared into the interior.

Step 4. Check the bookkeeping in the other direction. If instead and had matched along a horizontal edge — bottom of one equal to top of the other — we would glue vertically and write . The two gluings and are independent operations on squares.

What this tells us: squares carry two separate compositions, one per direction, and each is just edge-matching plus regluing. There is no need to choose a basepoint or to break the symmetry between the directions. This even-handed, grid-like algebra is exactly what makes the cubical model easier to subdivide and reassemble than the loop picture.

Check your understanding Beginner

Formal definition Intermediate+

Let and let be the -cube with its skeletal filtration : is the union of all faces of dimension , so is the set of vertices, the 1-skeleton, and so on. A filtered space is as in 03.12.54: a nested sequence with .

The cubical singular complex. The cubical singular complex has, in degree , the set $$ R_n(X_*) = \mathrm{FTop}\big(I^n_*, X_*\big) $$ of filtered maps , that is, continuous maps with for all [Brown-Higgins-Sivera Part III]. For each and there are face maps , (with read as or ), and degeneracy maps , , dropping the -th coordinate. These satisfy the standard cubical identities.

also carries connections for , induced by precomposition with the connection maps , $$ \gamma_i^+(t_1, \dots, t_n) = (t_1, \dots, t_{i-1}, \max(t_i, t_{i+1}), t_{i+2}, \dots, t_n), $$ and similarly with in place of . Thus . A connection is a degeneracy that folds the and directions together by a maximum or minimum; it is not the constant-extension degeneracy , and it is the extra cubical operation that has no simplicial analogue.

The fundamental cubical -groupoid. Define to be the quotient $$ \rho_n(X_*) = R_n(X_*) / \simeq, $$ where means and are filtered-homotopic rel vertices: there is a filtered homotopy through filtered maps, constant on the vertices [Brown-Higgins-Sivera Part III]. Write for the class of . The faces, degeneracies, and connections descend to .

On there are partial compositions (): for with (the relevant faces agree on the nose, which can always be arranged within a class), the composite is the cube obtained by juxtaposing and in the -direction and reparametrising : $$ (a +i b)(t_1, \dots, t_n) = \begin{cases} a(t_1, \dots, 2 t_i, \dots, t_n) & t_i \le \tfrac12, \ b(t_1, \dots, 2 t_i - 1, \dots, t_n) & t_i \ge \tfrac12. \end{cases} $$ These compositions, together with the faces, degeneracies, and connections, make $\rho(X*)\omega+_i\varepsilon_i-_ii$, and the interchange law $$ (a +_i b) +_j (c +_i d) = (a +_j c) +_i (b +j d) $$ holds whenever both sides are defined (). The connections satisfy the transport laws coupling with the compositions, e.g. $\Gamma_i^+(a +{i} b)$ and the connection of an identity is an identity. The axioms in full are CG1-CG6 of [Brown-Higgins 1981 cubes].

Counterexamples to common slips

  • A connection is not the degeneracy . The degeneracy is constant in the -direction; the connection varies, folding two directions by or . Dropping the connections leaves a cubical -groupoid that is not equivalent to crossed complexes — the connections are exactly what supply the "second degeneracy" the equivalence needs.
  • The compositions are partial, not total: is defined only when . Writing for non-matching faces is meaningless, just as composing arrows requires matching endpoints in an ordinary groupoid.
  • Filtered homotopy is rel vertices and through filtered maps: a homotopy that leaves the filtration is not allowed, or the quotient would collapse the filtration data and lose the higher homotopy groups.

Key theorem with proof Intermediate+

Theorem (interchange holds in ). Let $X_1 \le i < j \le n\langle a \rangle, \langle b \rangle, \langle c \rangle, \langle d \rangle \in \rho_n(X_*)$ such that all four faces match so that both sides below are defined, the interchange law* $$ (a +_i b) +_j (c +_i d) = (a +_j c) +_i (b +j d) $$ *holds in $\rho_n(X)\simeq+_i$ is well-defined on classes.

The construction follows Brown-Higgins [Brown-Higgins 1981 cubes] and the Part III treatment of [Brown-Higgins-Sivera Part III].

Proof. First, the congruence claim. Suppose and with and . Let and be filtered homotopies rel vertices. Because the homotopies are rel vertices, in particular they agree on the shared face throughout (the matching -cube has its own vertices fixed), so and can be juxtaposed in the -direction at every time to give a filtered homotopy , again rel vertices. Hence depends only on and , so is well-defined on .

Now interchange. Consider the four cubes arranged in a block in the - and -directions: at position , at in the -direction, at in the -direction, at . The matching hypotheses are $$ \partial_i^+ a = \partial_i^- b, \quad \partial_i^+ c = \partial_i^- d, \quad \partial_j^+ a = \partial_j^- c, \quad \partial_j^+ b = \partial_j^- d, $$ and at the centre the four agree on the corner -cube . Subdivide the cube in the - and -coordinates at , producing four sub-blocks . Define a single map by setting it equal to (a reparametrised) on , on , on , on .

This is well-defined and continuous: on the internal wall between and (where ) the two pieces restrict to and , which agree; on the wall between and (where ) they restrict to and , which agree; the remaining two internal walls match by the other two hypotheses; and at the central edge all four agree by the corner condition. By the pasting lemma is a continuous filtered map. Now reparametrised by first cutting in the -direction then the -direction is exactly , while cutting first in the -direction then the -direction is . These two reparametrisations of differ only by an order-preserving self-homeomorphism of fixing the vertices, namely the one that linearly identifies the two ways of cutting into four equal sub-squares. Such a self-homeomorphism is a filtered homotopy rel vertices from one reparametrisation to the other (slide the cut lines continuously). Hence the two iterated composites are filtered-homotopic rel vertices, so equal in .

Bridge. The interchange law is the foundational reason the cubical compositions assemble into a coherent algebra rather than unrelated monoid structures: it is exactly the statement that the two ways of reading a grid — rows-then-columns or columns-then-rows — give the same answer, which is what a faithful model of a filtered homotopy type must satisfy. The pasting argument is dual to the way a double groupoid composes squares, and it generalises the Eckmann-Hilton interchange that forces to be abelian for : here the interchange is kept with its directional information rather than collapsed, which is why remembers more than homology. Putting these together, the cubical -groupoid builds toward the equivalence with crossed complexes, where the rows-and-columns algebra of is matched against the boundary algebra of , and the same subdivision-and-paste mechanism appears again in the proof of the higher homotopy van Kampen theorem, where small cubes are composed and then deformed into the gluing subspaces.

Exercises Intermediate+

Advanced results Master

The cubical -groupoid and the crossed complex of 03.12.55 are two presentations of one homotopical object, and the theorem that binds them is the Brown-Higgins equivalence of categories. Let denote the category of cubical -groupoids with connections, and the category of crossed complexes.

The equivalence . There is an equivalence of categories $$ \gamma \colon \omega\text{-Gpd} \xrightarrow{\ \sim\ } \mathsf{Crs}, \qquad \lambda \colon \mathsf{Crs} \xrightarrow{\ \sim\ } \omega\text{-Gpd}, $$ with and mutually inverse up to natural isomorphism [Brown-Higgins 1981 equivalence]. The functor extracts from a cubical -groupoid its crossed complex of homotopy-addition data: is the subset of of cubes all of whose faces except one are degenerate (the cubes that look like an -cell with a single non-degenerate boundary face), and the boundary is the homotopy-addition map reading the one remaining face. The action of and the crossed-module structure at come from the compositions and connections of . The inverse rebuilds all the cubes of from the crossed complex by a cubical analogue of the Dold-Kan correspondence, using the connections to manufacture the higher degeneracies that an ordinary cubical set lacks. Connections are essential here: without them could not produce the folding cubes, and the equivalence fails [Brown-Higgins 1981 cubes].

Compatibility with the geometry. Applied to a filtered space, the two functors agree: $$ \gamma,\rho(X_*) \cong \Pi X_* $$ naturally in [Brown-Higgins-Sivera Part III]. The crossed complex of a filtered space is the -image of its cubical -groupoid; equivalently . This is the precise sense in which the cube and the globe record the same data.

Why the cube proves the van Kampen theorem. The decisive use of is the proof of the higher homotopy van Kampen theorem 03.12.59. Suppose is covered by filtered subspaces whose interiors cover , with connected filtered intersections. To show is the colimit (pushout) of the of the pieces, one argues in . A cube is subdivided finely enough — by the Lebesgue covering lemma — that each small subcube lands in one of the covering subspaces. The small subcubes are elements of of the pieces, and the original cube is their multiple composition under the partial compositions . The interchange law guarantees this multiple composition is unambiguous regardless of the order of assembly. A class in is thus represented by a composite of classes coming from the pieces, which is exactly a colimit cocone; and filtered homotopies between such composites are again subdividable, giving the universal property. The colimit and subdivision steps are short and geometric on the cubical side. Transporting the conclusion across yields the colimit statement for in , where the invariant is computable. This division of labour — easy colimits in , computation in — is the engineering reason both models are kept [Brown-Higgins-Sivera Part III].

Monoidal structure and the classifying space. The category carries a tensor product matching the crossed-complex tensor of 03.12.55 under , so is monoidal, and on CW filtrations. The cubical model makes the tensor especially transparent, since the product of cubes is a cube: , so the geometric origin of the exponential law is the identity rather than a formal construction. This is the cubical reason the homotopy classification of maps into a crossed complex, packaged by the internal hom , has a clean cubical description as well.

Synthesis. The cubical -groupoid is the foundational reason the higher homotopy van Kampen theorem is provable at all: the central insight is that subdivision of a cube and reassembly by the partial compositions turns the colimit statement into a geometric fact about small cubes filling a covered space, and the interchange law is exactly what makes that reassembly well-defined independent of order. This is dual to the crossed-complex side, where the same homotopy type is computable but the colimit is hard to see directly; the equivalence is the bridge that lets each model do what it does best, and putting these together gives both the proof and the computation in one package.

The connections are the technical device that makes an equivalence rather than a mere comparison — they supply the extra degeneracies that the inverse needs, and they generalise the single degeneracy of an ordinary cubical set to the folding operations a strict higher groupoid requires. The exponential law is the cubical face of the monoidal closed structure on , and it appears again in the classifying-space functor that realises a crossed complex as a space; the bridge is the elementary identity , which is exactly why cubes, not simplices or disks, are the right shapes for this theory. The cubical -groupoid is therefore not an alternative bookkeeping but the engine room: the model in which the theorems are proved before being read off in crossed-complex language.

Full proof set Master

Proposition (filtered homotopy is a congruence for every ). For each the partial composition on $R(X_)\rho(X_*) = R(X_*)/\simeq\simeq$ is filtered homotopy rel vertices.*

Proof. Fix and suppose , with the face-matching conditions and holding so both composites are defined. Let be a filtered homotopy rel vertices from to , and from to . For each time , the slices and are filtered maps. Track the matching face against : at these are , and at they are ; in between, because and are rel vertices and the shared face is an -cube whose own vertices are fixed, the homotopies restricted to that face are filtered homotopies of and that we may assume coincide after composing with the invertible vertex-fixing homotopy realigning its left face to 's right face.

Granting this alignment, define , the -juxtaposition performed slice by slice. is continuous because and are, and the juxtaposition formula is continuous in all variables; it is filtered because each slice is a filtered map and the filtration is checked pointwise in ; and it is rel vertices because the vertices of come from vertices of and , all fixed by and . Thus is a filtered homotopy rel vertices, so in . The composition is therefore well-defined on classes.

Proposition (associativity of in ). For each , is associative on $\rho(X_)(a +_i b) +_i c = a +_i (b +_i c)$ whenever the faces match.*

Proof. On the nose in the two triple composites are different reparametrisations of the same juxtaposition of along the -direction: cuts into in the -coordinate, while cuts it into . The map from one subdivision to the other is the unique piecewise-linear order-preserving self-homeomorphism fixing and and carrying the first cut points to the second. Applying only in the -coordinate is a vertex-fixing self-homeomorphism , and is filtered (it preserves each skeleton, being a product of the identity with ). Sliding the interior cut points linearly from the first triple to the second along gives a filtered homotopy rel vertices from to . Hence the two are equal in .

Proposition (the equivalence is compatible with the geometry). There is a natural isomorphism $\gamma,\rho(X_) \cong \Pi X_*X_*$.*

Stated with proof-sketch; full proof in [Brown-Higgins-Sivera Part III] and [Brown-Higgins 1981 equivalence]. The crossed complex has in degree the classes of cubes in all of whose faces are degenerate except . Such a cube is, up to filtered homotopy rel vertices, a map of the pair that collapses all but one face into — precisely a representative of a relative homotopy element . This assignment is a bijection on each degree (the cubical and the relative-homotopy descriptions of an -cell agree), it carries the homotopy-addition boundary of to the relative-homotopy boundary of , and it intertwines the -action with the -action because both are basepoint transport. The crossed-module law at matches on both sides because the connection-and-composition derivation of the Peiffer identity in is the cubical form of the Whitehead boundary. Naturality in holds because every constituent map (faces, compositions, connections, the relative-homotopy boundary) is natural for filtered maps. Hence as functors .

Stated without proof — see Brown-Higgins-Sivera Part III §14 [Brown-Higgins-Sivera Part III]. The functors and are mutually inverse equivalences of categories, both monoidal for the respective tensor products, and the unit and counit are natural isomorphisms; is constructed by a cubical Dold-Kan procedure that uses the connections to generate the higher degeneracies.

Connections Master

  • The crossed complex of a filtered space 03.12.55 is the -image of the cubical -groupoid built here: naturally, and the equivalence identifies the two models of one filtered homotopy type. The tensor product and exponential law developed in that unit's Advanced results are matched by the cubical tensor , whose geometric origin is the identity . The crossed complex supplies the computability that the cube supplies the proofs for.

  • The filtered space 03.12.54 is the geometric input on which both and are constructed: the cubical singular complex is the set of filtered maps , and the connectivity condition established there is exactly what makes model the filtered homotopy type faithfully and makes the subdivision argument of the van Kampen proof valid. The skeletal filtration of the cube is itself an object of .

  • The 2-group / internal-category picture 03.12.56 is the bottom-degree truncation of the same data: truncating to dimensions one and two gives a double groupoid with connections, which under the Brown-Spencer correspondence is the strict 2-group / crossed module . The cubical interchange law proved here is the double-groupoid interchange that defines that structure, and the connections are what upgrade a double category to a double groupoid with the folding operations.

  • The higher homotopy van Kampen theorem for crossed complexes 03.12.59 is proved by the cubical subdivision-and-multiple-composition argument summarised in the Advanced results: the colimit statement is established in , where small cubes filling a covered space compose under with interchange ensuring well-definedness, and then transported across to the computable crossed-complex statement. The cubical -groupoid is the object on which that theorem's proof actually runs.

Historical & philosophical context Master

The cubical -groupoid emerged from a sustained search by Ronald Brown for a higher-dimensional version of the fundamental group that would satisfy a van Kampen theorem. The decisive technical step was the recognition that cubes, unlike simplices, carry commuting partial compositions and that an extra family of degeneracies — the connections — is needed to make a cubical set into a faithful algebraic model. The connections and the algebra of multiple compositions were set out by Ronald Brown and Philip J. Higgins in On the algebra of cubes (J. Pure Appl. Algebra 21, 1981, 233-260) [Brown-Higgins 1981 cubes], which isolated the axioms CG of a cubical -groupoid with connections and proved that the partial compositions satisfy the interchange laws.

In the companion paper The equivalence of -groupoids and crossed complexes (Cahiers de Topologie et Géométrie Différentielle 22, 1981, 371-386) [Brown-Higgins 1981 equivalence], Brown and Higgins constructed the equivalence of categories between cubical -groupoids with connections and crossed complexes, with inverse built by a cubical Dold-Kan procedure. The connections are exactly the ingredient that makes well-defined; their earlier double-groupoid work with C.B. Spencer had shown the same phenomenon in dimension two. The systematic account, including the fundamental cubical -groupoid of a filtered space, the natural isomorphism , and the cubical proof of the higher homotopy van Kampen theorem, was consolidated in the 2011 monograph of Brown, Higgins, and Sivera, Nonabelian Algebraic Topology (EMS Tracts in Mathematics 15) [Brown-Higgins-Sivera Part III], whose Part III develops the cubical theory. This places the cubical -groupoid in the strict-higher-groupoid lineage as the computational engine of the Brown-Higgins programme, the model in which colimit and subdivision arguments are geometric before being transported to the crossed-complex side for calculation.

Bibliography Master

@book{BrownHigginsSivera2011NAT,
  author    = {Brown, Ronald and Higgins, Philip J. and Sivera, Rafael},
  title     = {Nonabelian Algebraic Topology: Filtered Spaces, Crossed Complexes, Cubical Homotopy Groupoids},
  series    = {EMS Tracts in Mathematics},
  volume    = {15},
  publisher = {European Mathematical Society},
  year      = {2011}
}

@article{BrownHiggins1981Cubes,
  author  = {Brown, Ronald and Higgins, Philip J.},
  title   = {On the algebra of cubes},
  journal = {J. Pure Appl. Algebra},
  volume  = {21},
  year    = {1981},
  pages   = {233--260}
}

@article{BrownHiggins1981Equivalence,
  author  = {Brown, Ronald and Higgins, Philip J.},
  title   = {The equivalence of {$\infty$}-groupoids and crossed complexes},
  journal = {Cahiers de Topologie et G\'eom\'etrie Diff\'erentielle},
  volume  = {22},
  year    = {1981},
  pages   = {371--386}
}

@article{BrownHiggins1981Colimit,
  author  = {Brown, Ronald and Higgins, Philip J.},
  title   = {Colimit theorems for relative homotopy groups},
  journal = {J. Pure Appl. Algebra},
  volume  = {22},
  year    = {1981},
  pages   = {11--41}
}