nLab
crossed n-cube

Idea

  • A crossed module is the ‘algebraic core’ of a cat 1-group, in as much as within a cat 1-group we can find a crossed module in a simple way from which the whole of the cat 1-group in all its glory can be reconstructed.

  • A crossed square is similarly the ‘algebraic core’ of a cat 2group.

  • A crossed n-cube should be the ‘algebraic core’ of a cat n-group.

A crossed square in the Guin-Valery Loday specification has quite a few axioms, many more than those for a crossed module. Does that mean that crossed n-cubes will be defined with a very large number of axioms (perhaps dependent on n)? No (unless you think that 11 is large!)

Finally a particular example of a [[crossed square] is given by a group with two normal subgroups, and their intersection together with the commutator map. It would be appropriate if a group together with n normal subgroups, all the intersections and all the commutator maps, formed an example of a crossed n-cube. It does. The axioms below govern the h-maps, by using analogues of the relationships between commutator maps in such a n-cube of inclusions of intersections.

The result (definition due to Graham Ellis and Richard Steiner, reference below) is a set of 11 axioms. That is all, and these objects model all homotopy (n+1)-types.

Definition

We denote by n the set {1,2,,n}.

A crossed n-cube, M, is a family of groups, {M A:An}, together with homomorphisms, μ i:M AM A{i}, for in,An, and functions, h:M A×M BM AB, for A,Bn, such that if ab denotes h(a,b)b for aM A and bM B with AB, then for a,a M A,b,b M B,cM C and i,jn, the following axioms hold:

  1. μ ia=a if aA
  2. μ iμ ja=μ jμ ia
  3. μ ih(a,b)=h(μ ia,μ ib)
  4. h(a,b)=h(μ ia,b)=h(a,μ ib) if iAB
  5. h(a,a )=[a,a ]
  6. h(a,b)=h(b,a) 1
  7. h(a,b)=1 if a=1 or b=1
  8. h(aa ,b)= ah(a ,b)h(a,b)
  9. h(a,bb )=h(a,b) bh(a,b )
  10. ah(h(a 1,b),c) ch(h(c 1,a),b) bh(h(b 1,c),a)=1
  11. ah(b,c)=h( ab, ac) if ABC.

A morphism of crossed n-cubes

f:{M A}{M A }f :\{M_{A}\} \rightarrow \{M^{\prime}_{A}\}

is a family of homomorphisms, {f A:M AM A An}, which commute with the maps, μ i, and the functions, h.

This gives us a category, Crs n, equivalent to that of cat n-groups.

Homotopical example

The fundamental crossed n-cube of groups functor Π is defined from n-cubes of pointed spaces to crossed n-cubes of groups: ΠX * is simply the crossed n-cube of groups equivalent to the catn-group ΠX *. It is easier to identify Π in classical terms in the case X * is the n-cube of spaces arising from a pointed (n+1)-ad 𝒳=(X;X 1,,X n). That is, let X n=X and for A properly contained in n let X A= i¬AX i. Then M=Π𝒳 is given as follows (Ellis and Steiner, 1987): M =π 1(X ); if A=i 1,,i r, in the right order, then M is the homotopy (r+1)-ad group π r+1(X A;X AX i 1,,X AX i r); the maps μ are given by the usual boundary maps; the h-functions are given by generalised Whitehead products. Note that whereas these separate elements of structure had all been considered previously, the aim of this theory is to consider the whole structure, despite its apparent complications. The equivalence of categories is a convincing reason for supposing that the axioms for a crossed n-cube of groups are a complete axiomatisation of this homotopical structure, as was not previously known.

Algebraic example

Let us put a bit of flesh on the example given in the introduction. Suppose that G is a group and N 1,N 2,..,N n are n-normal subgroups of G (there may be repeats).

Now define for An, M A={N iiA}, and for AM A, bM B, h(a,b)=[a,b], the commutator of a and b in G. The result is a crossed n-cube (sometimes called the inclusion crossed n-cube determined by the normal n-ad of subgroups.

Simplicial example

If instead of a space you start with a simplicial group G, as model for a connected homotopy type, then there is a crossed n-cube generalising the crossed square given in terms of the Moore complex.

References

  • G. J. Ellis and R. Steiner, Higher dimensional crossed modules and the homotopy groups of (n + 1)-ads, J. Pure Appl. Alg., 46, (1987), 117–136.
Revised on October 26, 2012 10:45:55 by Tim Porter (95.147.237.0)