6.7 Hubs and spokes
In topology, one usually speaks of building CW complexes by attaching -dimensional discs along their -dimensional boundary spheres.However, another way to express this is by gluing in the cone on an -dimensional sphere.That is, we regard a disc as consisting of a cone point (or “hub”), with meridians(or “spokes”) connecting that point to every point on the boundary, continuously, as shown in Figure 6.3 (http://planetmath.org/67hubsandspokes#S0.F3).
HoTT_fig_6.7.1.png
We can use this idea to express higher inductive types containing -dimensional path-constructors for in terms of ones containing only 1-dimensional path-constructors.The point is that we can obtain an -dimensional path as a continuous family of 1-dimensional paths parametrized by an -dimensional object.The simplest -dimensional object to use is the -sphere, although in some cases a different one may be preferable.(Recall that we were able to define the spheres in §6.5 (http://planetmath.org/65suspensions) inductively using suspensions
, which involve only 1-dimensional path constructors.Indeed, suspension can also be regarded as an instance of this idea, since it involves a family of 1-dimensional paths parametrized by the type being suspended.)
For instance, the torus from the previous section could be defined instead to be generated by:
- •
a point ,
- •
a path ,
- •
another path ,
- •
a point , and
- •
for each , a path , where is defined by and .
The induction principle for this version of the torus says that given , for a section we require
- •
a point ,
- •
a path ,
- •
a path ,
- •
a point , and
- •
for each , a path , where is defined by and .
Note that there is no need for dependent 2-paths or .We leave it to the reader to write out the computation rules.
Remark 6.7.1.
One might question the need for introducing the hub point ; why couldn’t we instead simply add paths continuously relating the boundary of the disc to a point on that boundary, as shown in Figure 6.4 (http://planetmath.org/67hubsandspokes#S0.F5)?This does work, but not as well.For if, given some , we give a path constructor connecting each to , then what we end up with is more like the picture in Figure 6.5 (http://planetmath.org/67hubsandspokes#S0.F5) of a cone whose vertex is twisted around and glued to some point on its base.The problem is that the specified path from to itself may not be reflexivity.We could add a 2-dimensional path constructor ensuring this, but using a separate hub avoids the need for any path constructors of dimension
above .
HoTT_fig_6.7.2a.png
HoTT_fig_6.7.2b.png
Remark 6.7.2.
Note also that this “translation” of higher paths into 1-paths does not preserve judgmental computation rules for these paths, though it does preserve propositional ones.