[Nottingham Internship] Brunerie Type Theory, or how to concisely sum up the mess about 𝜔-groupoids

4 minute read

Now that you realize to what extent weak 𝜔-groupoids are a mess, let’s have a look at a type theoretic and very concise way to define them, which is due to Guillaume Brunerie.

Brunerie Type Theory comes in

Brunerie type theory 𝔹:

The Brunerie type theory 𝔹 is given by these typing rules:

𝔹(Base type)Γx,y:AΓxy(Equality rule)isContrΓΓAΓcohAΓ:A(Coherence rule)

where isContr (which stands for “is contractible”) is inductively defined as follows:

a context Γ is contractible iff:
  • Γ=.
  • or: ΓΔ.(y:A).(p:yx) where Δ is contractible and x is a term of type A in the context Δ

In other words:

isContr(.)isContrΔΔx:AisContrΔ.(y:A).(p:xy)

The intuition behind is that

  • the elements of the base type correspond to the elements of the set G0 of the underlying globular set of the weak ω-groupoid.
  • if x,y: the elements of xy are the 1-arrows of G1(x,y)
  • if x,y: and f,g:xy, the elements of fg are those of G1(f,g)
  • and so on…

Now, with this analogy in mind, a context Γ.(xy:).(fg:xy).(α:fg) will be depicted as

xfgyα

A context is contractible if it can be “reduced to a point”, by contracting along the arrows.

For instance:

  • the context Γ.(xyzt:).(f:xy).(g:yz).(h:yt) is contractible

    zxfyght

    Indeed, you can contract z and y along g:

    xfy,zht

    then t and y,z along h:

    xfy,z,t

    and finally x and y,z,t along f:

    x,y,z,t
  • but the context Γ.(xyzt:).(f:xy).(g:yz).(hi:yt) is not contractible

    zxfyghit

    because there is a hole between y and t (thus, we can’t contract y and t).

    But if the hole is filled by a 2-arrow, like in Γ.(xyzt:).(f:xy).(g:yz).(hi:yt).(αhi)

    zxfyghitα

    then it becomes contractible (i and h can be contracted, following which we procceed similarly to the previous example).


What about the laws (that become part of the structure, in ω-groupoids), such as the unit/associativity/interchange/coherence laws? They’re taken care of by Brunerie’s coherence rule, thanks to this notion of contractible contexts!

Let’s illustrate this with an example: for instance, the associativity law (along the 1-arrows, to make things more simple (but the general case is quite similar)).

Let x,y,z,t:,f:xy,g:yz,h:zt and Γx,y,z,t.(xyzt:).(f:xy).(g:yz).(h:zt)

xfygzht

First, how to define composition along the 1-arrows?

As

  • the context Γx,y,z,t is contractible

  • and Γx,y,z,txz (since Γx,y,z,tx,z:)

f11g:xz can be defined in Γx,y,z,t as cohxzΓx,y,z,t

Similarly, (f11g)11h can be defined as cohxtΓx,y,z,t, and we proceed analogously for g11h and f11(g11h).

From now on, our aim is to show that there exists a term

𝛼1(f,g,h):(f11g)11hf11(g11h)

in Γx,y,z,t.

I think you’re beginning to get it: we use the contractibility of Γx,y,z,t again (and the fact that Γx,y,z,t(f11g)11hf11(g11h))!

NB: Hence, Brunerie’s coherence rule is very practical when it comes to expressing the unit/associativity/interchange/coherence laws!

But there’s a catch (kind of): therewith comes a whole bunch of redundant terms, such as: coh.,cohcoh.x.(x:),


Right, so now we’re beginning to get the feeling as to why Brunerie’s type theory might be able to cover the notion of weak ω-groupoids.

Leave a comment