Lectures onType Theory
Chapter 152
Chapter 152Core route

Groupoid and Path-Object Models of Intensional Type Theory

In the set model every identity fibre is a subsingleton (proposition 151.14), so uniqueness of identity proofs is interpreted by an inhabited type (proposition 151.21). That model therefore cannot decide whether the rule Γp:IdA(a,b)Γq:IdA(a,b)Γuip(p,q):IdIdA(a,b)(p,q)IdUIP is derivable from J. Deciding it requires a model in which some identity fibre has two distinct elements and the eliminator J is still interpreted. These two demands pull in opposite directions: J says that every identity proof may be treated as though it were refl, and a second element of a fibre is precisely something that is not refl.

The tension is resolved by looking at what J actually requires. Its premise supplies a value at the reflexivity proof only; to extend that value to an arbitrary proof s one needs a canonical way of moving from the reflexivity data to the data at s. In a structure where identity proofs are arrows, s is itself such a way. This chapter builds that structure.

Groupoids before they are types

Definition 152.1 — Groupoid

A groupoid is a category in which every arrow is invertible. It is small when its objects and arrows are elements of Vω (convention 151.2). A morphism of groupoids is a functor; Gpd denotes the resulting category of small groupoids. For a groupoid Γ we write γΓ for “γ is an object”, homΓ(γ,γ) for the set of arrows, and p1 for the inverse of p.

Three constructions supply every groupoid used below.

Example 152.2 — Discrete groupoids

For a set X let Δ(X) have objects X and only identity arrows. Then homΔ(X)(x,y) is a singleton when x=y and empty otherwise. A functor Δ(X)Δ(Y) is exactly a function XY, so Δ is a full embedding of sets into groupoids. Δ({}) is terminal; we write it 1.

Example 152.3 — A group as a groupoid

For a group G let BG have one object and homBG(,)=G, with composition the group operation. Every arrow is invertible because every group element is. A functor BGBH is exactly a group homomorphism. For G=Z/2Z={id,g} the groupoid BG has one object and two arrows, and this two-element hom-set is the entire source of the independence result below.

Example 152.4 — Action groupoids

Let a group G act on a set X. The groupoid X//G has objects X and arrows xy the elements hG with hx=y, composed by multiplication in G. Taking X a single point recovers example 152.3; taking G trivial recovers example 152.2. For G=Z/2Z acting on X={0,1} by addition, X//G has two objects, and each of the four hom-sets is a singleton.

Lemma 152.5 — Gpd is cartesian closed

Products of groupoids are computed objectwise and arrowwise, and for groupoids Γ,Δ the functor groupoid ΔΓ — objects the functors ΓΔ, arrows the natural transformations — is again a groupoid and satisfies the exponential adjunction homGpd(Θ×Γ,Δ)homGpd(Θ,ΔΓ).

Proof of Lemma 152.5 — Gpd is cartesian closed

Proof. The product of two categories is a category, and an arrow (p,q) is invertible as soon as both components are, with inverse (p1,q1). For the exponential, a natural transformation α between functors into a groupoid is invertible: each component αγ has an inverse in Δ, and the family (αγ1) is natural because inverting the naturality square of α at p gives the naturality square of α1 at p. The adjunction is the usual currying of functors, which restricts to groupoids because every construction involved preserves invertibility. ◻

Families of groupoids and the groupoid CwF

Type dependency needs a notion of family indexed by a groupoid. The choice is forced by what identity types must become: the hom-sets of A must themselves form a family over A×A, so a family must at least act on arrows.

Definition 152.6 — Families and dependent objects

A family over a groupoid Γ is a functor A:ΓGpd. For p:γγ we write p for the functor A(p):A(γ)A(γ); functoriality makes each A(p) an isomorphism, with inverse A(p1). Write Ty(Γ) for the collection of families.

A dependent object M of A assigns to each γΓ an object M(γ)A(γ) and to each p:γγ an arrow M(p):pM(γ)M(γ)in A(γ), subject to M(idγ)=idM(γ) and M(pp)=M(p)(pM(p)). Write Tm(Γ,A) for the collection of dependent objects. Reindexing along F:ΔΓ is composition: A[F]:=AF and M[F](δ):=M(Fδ), M[F](q):=M(Fq).

The adjustment pM(p) in the second equation is not decoration: the arrow M(p) lives in A(γ), and composing it with M(p), which lives in A(γ), requires transporting it first.

Lemma 152.7 — Reindexing is strictly functorial

A[id]=A, A[FG]=A[F][G], and the same two equations for dependent objects.

Proof of Lemma 152.7 — Reindexing is strictly functorial

Proof. Composition of functors is strictly associative and unital, and both clauses of definition 152.6 are defined by composition on objects and on arrows. The two equations for M hold because they are the corresponding equations for the underlying assignments, and the functoriality conditions are preserved: if M(pp)=M(p)(pM(p)) holds in Γ, applying F to arrows gives the same equation in Δ. ◻

Construction 152.8 — Context extension

For ATy(Γ) let Γ.A be the groupoid with objects the pairs (γ,a) with aA(γ), and arrows (γ,a)(γ,a) the pairs (p,q) with p:γγ in Γ and q:paa in A(γ). Composition is (p,q)(p,q):=(pp, q(pq)), the identity at (γ,a) is (idγ,ida), and (p,q)1:=(p1, p1q1). The projection pA(γ,a):=γ, pA(p,q):=p is a functor, and qA(γ,a):=a, qA(p,q):=q is a dependent object of A[pA].

Lemma 152.9 — The extension is a groupoid and _A is a dependent object

The data of construction 152.8 satisfy the category laws, every arrow is invertible, and qATm(Γ.A,A[pA]).

Proof of Lemma 152.9 — The extension is a groupoid and _A is a dependent object

Proof. Associativity: both bracketings of (p,q)(p,q)(p,q) have first component ppp and second component q(pq)(ppq), using functoriality of A to identify p(pq) with (pp)q. Units are immediate from A(id)=id. Inverses: composing (p,q) with the displayed inverse gives first component idγ and second component (p1q1)(p1q)=p1(q1q)=id, and symmetrically on the other side. For qA: its arrow component at (p,q) must be an arrow (p,q)qA(γ,a)qA(γ,a) in A[pA](γ,a)=A(γ), that is paa, and q is such an arrow. The two dependent-object equations are the identity and composition clauses just verified. ◻

Proposition 152.10 — The groupoid CwF

With C:=Gpd, the assignments Ty, Tm of definition 152.6 and the comprehension of construction 152.8 form a category with families G, whose terminal context is 1. For F:ΔΓ and MTm(Δ,A[F]) the mediating functor is F,M(δ):=(Fδ,M(δ)),F,M(q):=(Fq,M(q)), and it is the unique functor with pAF,M=F and qA[F,M]=M.

Proof of Proposition 152.10 — The groupoid CwF

Proof. Functoriality of F,M is the pair of the functoriality of F and the two dependent-object equations of M: for composable q,q in Δ, F,M(qq)=(F(qq), M(qq))=(FqFq, M(q)(FqM(q)))=F,M(q)F,M(q). The two equations hold by construction. Uniqueness: an object of Γ.A is a pair and an arrow is a pair, so a functor H into it is determined by pAH and by qA[H], which are exactly the two components. The category laws for Gpd and strict functoriality of reindexing are lemma 152.7. ◻

Proposition 152.10 is the detailed form of the model recorded compactly as definition 54.33; the Π- and Σ-structure stated there is used below without change. What has not yet been done is the identity type, and that is where the chapter’s result lives.

Identity types are hom-sets

Definition 152.11 — The identity family

For ATy(Γ) let ΓA denote Γ.A.A[pA], whose objects are triples (γ,a1,a2) with aiA(γ). Define IATy(ΓA) by IA(γ,a1,a2):=Δ(homA(γ)(a1,a2)),IA(p,q1,q2)(s):=q2(ps)q11, where (p,q1,q2):(γ,a1,a2)(γ,a1,a2), so qi:paiai. Reflexivity is the dependent object rA(γ,a):=ida over the diagonal.

Lemma 152.12 — I_A is a family and r_A a dependent object

The clauses of definition 152.11 define a functor ΓAGpd whose values are discrete groupoids, and rA is a dependent object of IA[diag], where diag(γ,a):=(γ,a,a).

Proof of Lemma 152.12 — I_A is a family and r_A a dependent object

Proof. Well-typedness: for s:a1a2 in A(γ) the composite q2(ps)q11 goes a1pa1pa2a2, an arrow of A(γ). Identity: at (id,id,id) the formula returns s. Composition: applying (p,q1,q2) after (p,q1,q2) gives q2(p(q2(ps)q11))q11=(q2(pq2))((pp)s)(q1(pq1))1, which is the formula for the composite arrow of ΓA computed in construction 152.8. Since the values are discrete, a dependent object of IA[diag] is an assignment of an arrow aa for each (γ,a) subject to the equation IA(p,q,q)(rA(γ,a))=rA(γ,a); and indeed q(pida)q1=ida. ◻

The eliminator is now forced by one observation, which is the technical heart of the model.

Lemma 152.13 — Every identity datum receives an arrow from a reflexivity datum

Let (γ,a1,a2,s) be an object of ΓA.IA, so s:a1a2 in A(γ). Then f(γ,a1,a2,s):=(idγ,ida1,s,) : (γ,a1,a1,ida1)  (γ,a1,a2,s) is an arrow of ΓA.IA, and f(γ,a,a,ida)=id.

Proof of Lemma 152.13 — Every identity datum receives an arrow from a reflexivity datum

Proof. An arrow of ΓA.IA over (p,q1,q2) is a pair whose second component is an arrow in the discrete groupoid IA(γ,a1,a2), hence exists exactly when IA(p,q1,q2)(s)=s. With p=id, q1=ida1, q2=s and source datum ida1 the condition reads sida1ida11=s, which holds. At s=ida the arrow is (id,id,id,), the identity. ◻

Theorem 152.14 — Identity elimination in G

Let ATy(Γ), let CTy(ΓA.IA) and let dTm(Γ.A,C[refl]), where refl(γ,a):=(γ,a,a,ida). Then J(C,d)(γ,a1,a2,s):=f(γ,a1,a2,s)d(γ,a1),J(C,d)(h):=f(u)d(p,q1) for h=(p,q1,q2,):uu, defines a dependent object of C satisfying J(C,d)[refl]=d on the nose.

Proof of Theorem 152.14 — Identity elimination in G

Proof. The object part is well typed by lemma 152.13: the element d(γ,a1) lies in C(γ,a1,a1,ida1), and transporting it along f(u) lands in C(u).

For the arrow part write u=(γ,a1,a2,s) and u=(γ,a1,a2,s), so that qi:paiai and, because the second components of arrows of ΓA.IA exist only when the discrete condition holds, q2(ps)=sq1. Since d is a dependent object and (p,q1):(γ,a1)(γ,a1) is an arrow of Γ.A, d(p,q1) : (p,q1,q1,)d(γ,a1)  d(γ,a1). Applying f(u) and using functoriality of C gives an arrow (f(u)(p,q1,q1,))d(γ,a1)  f(u)d(γ,a1)=J(C,d)(u). It remains to identify the source. Composing in ΓA.IA, f(u)(p,q1,q1,)=(id,ida1,s,)(p,q1,q1,)=(p, q1, sq1, ), while hf(u)=(p,q1,q2,)(id,ida1,s,)=(p, q1, q2(ps), ). By (152.1) the two agree, so the source is (hf(u))d(γ,a1)=hJ(C,d)(u), which is what a dependent object requires. The two functoriality equations for J(C,d) follow from those of d and of C by the same computation.

Computation: at u=(γ,a,a,ida) the arrow f(u) is the identity by lemma 152.13, so J(C,d)(u)=d(γ,a); and at an arrow (p,q,q,) the same lemma gives J(C,d)(p,q,q,)=f(γ,a,a,id)d(p,q)=d(p,q). Hence J(C,d)[refl]=d as dependent objects. ◻

Remark 152.15

The definition of J used the arrow component of C, that is the way C transports along arrows of ΓA.IA. Two families with the same objectwise values but different transports give different eliminators, so J in G is not determined by a universal property of IA; it is determined by the chosen splitting. This is the model-side counterpart of the syntactic fact that identity types are specified by rules rather than by an adjunction.

Transport along a nontrivial arrow

Example 152.16 — Transport that is not the identity

Let G:=Z/2Z={id,g} and Γ:=BG from example 152.3. Define ATy(Γ) by A():=Δ({0,1}),A(g):=the swap 01. This is a functor because gg=id and the swap is its own inverse. By construction 152.8 the extension Γ.A has two objects (,0), (,1) and exactly one arrow between any two of them, namely (g,id) from (,0) to (,1).

Now let BTy(Γ.A) be the family B(,i):=Δ({ui,vi}) with B(g,id) the bijection u0v1, u1v0. Then transporting u0 along the arrow (g,id) yields v1, not u1: in the notation of definition 152.6, (g,id)u0=v1. Every step is forced: A(g) had to be a nonidentity automorphism for the arrow to exist, and B was free to permute the fibre over it. In the set model of chapter 55 no such phenomenon is available, because there the only arrows in a fibre are equalities.

Exercise 152.1

★☆☆ Continue example 152.16. Compute (g,id)1 using the formula of construction 152.8, verify that transporting v1 back along it returns u0, and state which clause of definition 152.6 guarantees this in general.

Exercise 152.2

★★☆ Continue example 152.16 with Γ=1 and A=BG regarded as a closed type. Take C(a1,a2,s):=Δ({}) constant and d the unique dependent object. Compute J(C,d) on the datum (,,g) using theorem 152.14, and then redo the computation with C(a1,a2,s):=IA(a1,a2,s) and d=rA, obtaining an explicit formula for the resulting dependent object.

Uniqueness of identity proofs fails, and where

The model is now complete enough to answer the question that opened the chapter. The answer does not need a universe: a single closed type suffices.

Theorem 152.17 — Independence of uniqueness of identity proofs

Let A0:=B(Z/2Z), a closed type of G, and let UIP(A0):=x:A0y:A0p:IdA0(x,y)q:IdA0(x,y)IdIdA0(x,y)(p,q). Then Tm(1,[[UIP(A0)]]) is empty. Consequently there is no derivation of u:UIP(A0) in the fragment interpreted by G — in particular none in the fragment without universes.

Proof of Theorem 152.17 — Independence of uniqueness of identity proofs

Proof. By definition 152.11 the fibre IA0(,) is the discrete groupoid on homA0(,)={id,g}, a two-element set. A dependent object u of the displayed Π-type would in particular supply, at the objects x=y=, p=g, q=id, an object of IIA0(,,g,id)=Δ(homIA0(,)(g,id)). The groupoid IA0(,) is discrete and gid, so that hom-set is empty and the required object does not exist. Underivability follows from soundness of the interpretation (theorem 54.28 applied to G): a derivation would produce such a dependent object. ◻

Theorem 152.17 strengthens the universe-quantified statement proposition 54.35 in two ways: the counterexample is a single closed type, and no universe former is used, so the conclusion applies to the universe-free fragment as well. The next two results locate the failure precisely; each says that a specific proposed rule has no interpretation, which is more informative than saying that a type is uninhabited.

Proposition 152.18 — The eliminator has no interpretation

Let A0 be as above and let Θ:=A0.IA0d where IA0d(a):=IA0(a,a) is the loop family. Define CTy(Θ) by C(a,p):=Δ({p=ida}),C(q,):=id. Then C is a family, the dependent object d(a):= of C[refl] exists, and Tm(Θ,C) is empty. Hence there is no operation satisfying the rules of K in G.

Proof of Proposition 152.18 — The eliminator has no interpretation

Proof. C is a family: an arrow (q,):(a,p)(a,p) of Θ exists exactly when qpq1=p, and in a groupoid this forces p=ida if and only if p=ida; so the two fibres are simultaneously empty or singletons and the identity assignment is functorial. The object d exists because C(a,ida) is a singleton. Finally C(,g) is empty, since gid, so no dependent object of C exists.

For the last claim, suppose G carried an operation K sending C and d as above to an element of Tm(Θ,C); the previous paragraph shows that set is empty. ◻

Remark 152.19 — Why the interpretation of does not adapt

The construction of theorem 152.14 rested on lemma 152.13: an arrow from the reflexivity datum to an arbitrary datum. For K the corresponding demand is an arrow (a,ida)(a,p) in Θ, that is an arrow q:aa with qidaq1=p, hence p=ida. For pida no such arrow exists. The difference is that J may move the right endpoint, while K must keep both endpoints fixed.

Proposition 152.20 — Congruence of the second projection fails

Let ATy(1) and BTy(A). For aA and b,bB(a), IΣ(A,B)((a,b),(a,b))=Δ({(p,q)p:aa, q:pbb}),IB(a)(b,b)=Δ(homB(a)(b,b)). There are A, B, a, b, b for which the first is inhabited and the second is empty. Hence the rule concluding IdB(a)(b,b) from IdΣ(A,B)((a,b),(a,b)) has no interpretation in G.

Proof of Proposition 152.20 — Congruence of the second projection fails

Proof. The displayed descriptions are definition 152.11 applied to the Σ-structure of definition 54.33 and to the fibre. Take A:=B(Z/2Z) with a=, and B the family with B():=Δ({b,b}) and B(g) the swap. Then (g,idb) is an element of the first set, because gb=b. The second set is the hom-set from b to b in a discrete groupoid with bb, which is empty. ◻

Exercise 152.3

★★☆ Show that for every set X the type UIP(Δ(X)) is inhabited in G, and conclude that the counterexample of theorem 152.17 cannot be replaced by a discrete type. Then explain in one sentence why this does not contradict theorem 152.17.

Exercise 152.4

★★☆ Call a closed type A of G rigid when homA(a,a) has at most one element for all a,a. Prove that UIP(A) is inhabited for every rigid A, and identify which groupoids among example 152.2, example 152.3, example 152.4 are rigid.

Universes, and which principles the model settles

Definition 152.21 — The groupoid universe

Let V:=Vi be one of the stages of convention 151.2. Write Gpd(V) for the groupoid whose objects are the groupoids with object and arrow sets in V and whose arrows are the isomorphisms of groupoids, and GpdΔ(V) for the full subgroupoid of discrete ones. As a closed type, U:=Gpd(V), with El(c):=c on objects and El(φ):=φ on arrows.

Proposition 152.22 — Identity on the universe is isomorphism

For X,YU, IU(X,Y)=Δ({φφ:XY an isomorphism of groupoids}). Consequently G validates the principle that an identification of two elements of U is exactly an isomorphism of the decoded types, and refutes uniqueness of such identifications whenever some decoded type has a nonidentity automorphism.

Proof of Proposition 152.22 — Identity on the universe is isomorphism

Proof. Immediate from definition 152.11: the identity family of a type is its family of hom-sets, and the hom-sets of Gpd(V) are by definition 152.21 the sets of isomorphisms. For the refutation take X=Y=Δ({0,1}). Its isomorphisms are the two bijections of a two-element set, so IU(X,X) is the discrete groupoid on a set with two elements; the argument of theorem 152.17, applied to the identity and the swap in place of id and g, shows that UIP(U) has no dependent object. ◻

Proposition 152.23 — Function extensionality holds

For ATy(Γ), BTy(Γ.A) and f,fTm(Γ,Π(A,B)), the fibre IΠ(A,B)(γ,f,f) is the discrete groupoid on the vertical natural transformations from f(γ) to f(γ), hence nonempty exactly when there is a pointwise family of arrows f(γ)(a)f(γ)(a) natural in a. Therefore G validates function extensionality in the form: a pointwise identification of two functions yields an identification of the functions.

Proof of Proposition 152.23 — Function extensionality holds

Proof. The Π-structure of definition 54.33 takes Π(A,B)(γ) to be the groupoid of sections of the restricted family with vertical natural transformations as arrows. Applying definition 152.11 to that groupoid gives the stated fibre. A term of a:AIdB(fa,fa) is precisely a family of arrows f(γ)(a)f(γ)(a) whose dependent-object equation is the naturality condition, so it is exactly an element of the fibre. ◻

Remark 152.24 — What the model does not settle

Every fibre IA(γ,a1,a2) is discrete, so identifications of identifications are trivial: the model interprets types as structures with at most one nontrivial dimension. It therefore says nothing about principles concerning identifications between identity proofs beyond their triviality, and in particular it neither validates nor refutes any statement whose content appears only in dimension two or higher. A model with genuine higher dimensions is a different construction, and proposition 152.22 is not a form of it.

The path-object structure abstracted

The verification of theorem 152.14 used three facts and nothing else: a factorization of the diagonal, a lifting property, and stability of both under reindexing. Isolating them explains which categories can play the role of Gpd, and it does so after the calculation rather than instead of it.

Definition 152.25 — Display maps and path objects

Let C be a category with finite limits and let D be a class of arrows, called display maps, containing all isomorphisms and stable under pullback. A path object for an object X is a factorization of the diagonal X r PX (s,t) X×X in which (s,t) is a display map and r has the left lifting property against every display map: for every display map e:EB and every commuting square with left edge r and right edge e there is a diagonal filler making both triangles commute.

Proposition 152.26 — Gpd has path objects

Take D to be the class of isofibrations: functors e:EB such that for every xE and every arrow β:e(x)b there is an arrow ξ:xy with e(ξ)=β. For a groupoid X let PX be the functor groupoid XI, where I is the groupoid with two objects and one arrow between any two of them, with r the constant functor and (s,t) evaluation at the two objects. Then D is stable under pullback, (s,t) is an isofibration, and r has the left lifting property against isofibrations. Hence definition 152.25 is satisfied.

Proof of Proposition 152.26 — Gpd has path objects

Proof. Stability. Given a pullback of e along f, an object of the pullback is a pair (a,x) with f(a)=e(x), and an arrow out of it in the base lifts by lifting its e-component and pairing.

(s,t) is an isofibration. An object of XI is an arrow w:x1x2 of X; an arrow of XI is a commuting square. Given w and arrows u1:x1y1, u2:x2y2 in X, the arrow w:=u2wu11 is an object of XI and (u1,u2) is an arrow ww over (u1,u2); this is the required lift, and it is exactly the reindexing formula of definition 152.11.

Lifting against r. Let e:EB be an isofibration and let a square be given with r on the left: that is, a functor k:XE, a functor :PXB with r=ek. For an object w:x1x2 of PX the arrow (id,w):(rx1)(w) of B has source e(k(x1)); lift it to an arrow ξw:k(x1)zw of E and put m(w):=zw. Choosing the lift to be the identity when w is an identity arrow makes mr=k on the nose, and the arrow part of m is determined by conjugating the chosen lifts, exactly as in the proof of theorem 152.14. Then em= because e was applied to the chosen lifts. ◻

Corollary 152.27 — The identity family is the path object of a type

For a closed type A of G, the comprehension (A×A).IA is isomorphic over A×A to PA=AI, the reflexivity term corresponds to r, and the projection corresponds to (s,t).

Proof of Corollary 152.27 — The identity family is the path object of a type

Proof. By construction 152.8 an object of (A×A).IA is a triple (a1,a2,s) with s:a1a2, and an arrow is a pair (q1,q2) with q2sq11=s. An object of AI is an arrow of A and an arrow is a commuting square, which is the same condition. The assignment (a1,a2,s)s is a functor with an evident inverse, commutes with the projections to A×A, and carries rA to r. ◻

Remark 152.28 — What the abstraction does and does not buy

Definition 152.25 names the structure that made theorem 152.14 work, and proposition 152.26 verifies it for groupoids. It does not by itself produce an interpretation of type theory: the lifting in proposition 152.26 was chosen, and different choices give different eliminators, as remark 152.15 already observed. Turning a class of path objects into a model therefore requires in addition that the choices be stable under reindexing on the nose, which is the strictness problem left open by proposition 151.27. A weak factorization system supplies existence, not stability.

Boundary

The results proved here are: the groupoid CwF (proposition 152.10), its identity types and eliminator (definition 152.11, theorem 152.14), the failure of uniqueness of identity proofs at a single closed type (theorem 152.17), the non-interpretability of K and of second-projection congruence (proposition 152.18, proposition 152.20), the description of identity on the universe (proposition 152.22), function extensionality (proposition 152.23), and the path-object structure (proposition 152.26, corollary 152.27).

The proof base is exact. The independence of uniqueness of identity proofs is Hofmann and Streicher’s [HS94]; the expanded groupoid interpretation, including the family/fibration presentation of definition 152.6, the Grothendieck construction of construction 152.8, the identity clauses of definition 152.11 and the universe discussion of section 152.6, is their longer account [HS98], whose scope restriction is recorded in theorem 54.34. The equivalent principles K and second-projection congruence, used in proposition 152.18, proposition 152.20, are Streicher’s [Str93]. Streicher’s retrospective [Str21] explains how the obstruction was found; it owns none of the statements above. The path-object abstraction of section 152.7 is stated here only at the signature verified in proposition 152.26.

Four boundaries are worth stating explicitly. The construction interprets the fragment recorded in theorem 54.34; parameterized inductive definitions in general were not verified there and are not verified here. All identity fibres are discrete (remark 152.24), so the model has exactly one nontrivial dimension and settles no question that lives above it. The underivability statements are relative to the metatheory of convention 151.2, exactly as in chapter 55. Finally, proposition 152.26 identifies a lifting structure, not a model: by remark 152.28 the passage from lifting to interpretation still requires strict stability, which this chapter does not supply.

[4]

Suggested first pass.

Begin with exercise 152.5, then exercise 152.6, and finish with exercise 152.8.

Exercise 152.5

★★☆ Let G act on X as in example 152.4. Describe Ty(X//G) concretely as a family of groupoids together with a compatible G-action, and show that a dependent object is a G-equivariant choice of an object in each fibre together with comparison arrows. Then compute IX//G(x,y) and say when it is empty.

Exercise 152.6

★★★ Proposition 152.18 used the family C(a,p)=Δ({p=ida}). Show that the analogous family over ΓA.IA, namely C(a1,a2,s):=Δ({s=id}), is not a family, by exhibiting an arrow of ΓA.IA whose source fibre is nonempty and whose target fibre is empty. Explain in one paragraph why this difference is exactly the difference between J and K.

Exercise 152.7

★★★ Replace Gpd throughout by the category of preorders and monotone maps, defining IA(a1,a2) to be the discrete set on {a1a2}. Determine which of lemma 152.12, lemma 152.13, theorem 152.14 survive, and locate the first step that fails. State the property of groupoids that the failing step uses.

Exercise 152.8 — Practical: a finite groupoid model checker

★★★ Practical project.groupoid-model-checker Implement the finite fragment of G: a groupoid is a finite object set with a composition table and inverses; a family over it is a table assigning a finite groupoid to each object and an isomorphism to each arrow, checked for functoriality; a dependent object is a choice of object per fibre together with the comparison arrows of definition 152.6, checked for the two equations. The invariant the program must maintain is that every table it accepts is functorial and every accepted dependent object satisfies both equations at every composable pair. The program must print, for each named input, whether the input is a well-formed family, the computed transport of a named element along a named arrow, and an accept or reject verdict for a proposed dependent object. The acceptance test is: the family of example 152.16 is accepted and the transport of u0 along (g,id) prints v1; the family C of proposition 152.18 is accepted and the search for a dependent object of it reports none; the family C of exercise 152.6 is rejected as non-functorial; and the identity family of A0 from theorem 152.17 has a fibre of size two at (,). Exhaustive search over finite tables is evidence for theorem 152.17, proposition 152.18 on those inputs only; it proves neither, and it says nothing about infinite groupoids.

Search the book

Type to search the local edition.