nLab
2-congruence

Context

Relations

2-Category theory

Internal (,1)-Categories

Contents

Idea

The notion of 2-congruence is the generalization of the notion of congruence from category theory to 2-category theory.

The correct notions of regularity and exactness for 2-categories is one of the subtler parts of the theory of first-order structure. In particular, we need a suitable replacement for the 1-categorical notion of equivalence relation. The (almost) correct definition was probably first written down in StreetCBS.

One way to express the idea is that in an n-category, every object is internally a (n1)-category; exactness says that conversely every “internal (n1)-category” is represented by an object. When n=1, an “internal 0-category” means an internal equivalence relation; thus exactness for 1-categories says that every equivalence relation is a kernel (i.e. is represented by some object). Thus, we need to find a good notion of “internal 1-category” in a 2-category.

Of course, there is an obvious notion of an internal category in a 2-category, as a straightforward generalization of internal categories in a 1-category. But internal categories in Cat are double categories, so we need to somehow cut down the double categories to those that really represent honest 1-categories. These are the 2-congruences.

Definition

Before we define 2-congruences below in def. 3, we need some preliminaries.

2-Congruences

Definition

If K is a finitely complete 2-category, a homwise-discrete category in K consists of

  • a discrete morphism D 1D 0×D 0, together

  • with composition and identity maps D 0D 1 and D 1× D 0D 1D 1 in K/(D 0×D 0),

which satisfy the usual axioms of an internal category up to isomorphism.

Together with the evident notions of internal functor and internal natural transformation there is a 2-category HDC(K) of hom-wise discrete 2-categories in K.

Remark

Since D 1D 0×D 0 is discrete, the structural isomorphisms will automatically satisfy any coherence axioms one might care to impose.

Remark

The transformations between functors DE are a version of the notion for internal categories, thus given by a morphism D 0E 1 in K. The 2-cells in K(D 0,E 0) play no explicit role, but we will recapture them below.

Remark

By homwise-discreteness, any “modification” between transformations is necessarily a unique isomorphism, so (after performing some quotienting, if we want to be pedantic) we really have a 2-category HDC(K) rather than a 3-category.

Definition

If f:AB is any morphism in K, there is a canonical homwise-discrete category (f/f)A×A, where (f/f) is the comma object of f with itself. We call this the kernel ker(f) of f (the “comma kernel pair” or “comma Cech nerve” of f).

In particular, if f=1 A then (1 A/1 A)=A 2, so we have a canonical homwise-discrete category A 2A×A called the kernel ker(A) of A.

Remark

It is easy to check that taking kernels of objects defines a functor Φ:KHDC(K); this might first have been noticed by Street. See prop. 1 below.

Theorem

If D 1D 0 is a homwise-discrete category in K, the following are equivalent.

  1. D 0D 1D 0 is a two-sided fibration in K.

  2. There is a functor ker(D 0)D whose object-map D 0D 0 is the identity.

Actually, homwise-discreteness is not necessary for this result, but we include it to avoid worrying about coherence isomorphisms, and since that is the case we are most interested in here.

Proof

We consider the case K=Cat; the general case follows because all the notions are defined representably. A homwise-discrete category in Cat is, essentially, a double category whose horizontal 2-category is homwise-discrete (hence equivalent to a 1-category). We say “essentially” because the pullbacks and diagrams only commute up to isomorphism, but up to equivalence we may replace D 1D 0×D 0 by an isofibration, obtaining a (pseudo) double category in the usual sense. Now the key is to compare both properties to a third: the existence of a companion for any vertical arrow.

Suppose first that D 0D 1D 0 is a two-sided fibration. Then for any (vertical) arrow f:xy in D 0 we have cartesian and opcartesian morphisms (squares) in D 1:

(1)x id x x f 1 y opcart f f cart x f 2 y y id y\array{ x & \overset{id}{\to} & x & \qquad & x & \overset{f_1}{\to} & y' \\ {}^{\mathllap{\cong}}\downarrow & opcart & \downarrow^{\mathrlap{f}} & \qquad & {}^{\mathllap{f}}\downarrow & cart & \downarrow^{\mathrlap{\cong}} \\ x' & \overset{f_2}{\to} & y & \qquad & y & \overset{id}{\to} & y }

The vertical arrows marked as isomorphisms are so by one of the axioms for a two-sided fibration. Moreover, the final compatibility axiom for a 2-sided fibration says that the square

(2)x f 1 y x f 2 y,\array{ x & \overset{f_1}{\to} & y'\\ \cong \downarrow & & \downarrow\cong \\ x' & \overset{f_2}{\to} & y,}

induced by factoring the horizontal identity square of f through these cartesian and opcartesian squares, must be an isomorphism. We can then show that f 1 (or equivalently f 2) is a companion for f just as in (Shulman 07, theorem 4.1). Conversely, from a companion pair we can show that D 0D 1D 0 is a two-sided fibration just as as in loc cit.

The equivalence between the existence of companions and the existence of a functor from the kernel of D 0 is essentially found in (Fiore 06), although stated only for the “edge-symmetric” case. In their language, a kernel ker(A) is the double category A of commutative squares in A, and a functor ker(D 0)D which is the identity on D 0 is a thin structure on D. In one direction, clearly ker(D 0) has companions, and this property is preserved by any functor ker(D 0)D. In the other direction, sending any vertical arrow to its horizontal companion is easily checked to define a functor ker(D 0)D.

In particular, we conclude that up to isomorphism, there can be at most one functor ker(D 0)D which is the identity on objects.

Definition

A 2-congruence in a finitely complete 2-category K is a homwise-discrete category, def. 1 in K satisfying the equivalent conditions of Theorem 1.

Example

The kernel ker(A), def. 2 of any object is a 2-congruence.

More generally, the kernel ker(f) of any morphism is also a 2-congruence.

2-Forks and Quotients

The idea of a 2-fork is to characterize the structure that relates a morphism f to its kernel ker(f). The kernel then becomes the universal 2-fork on f, while the quotient of a 2-congruence is the couniversal 2-fork constructed from it.

Definition

A 2-fork in a 2-category consists of a 2-congruence s,t:D 1D 0, i:D 0D 1, c:D 1× D 0D 1D 1, and a morphism f:D 0X, together with a 2-cell ϕ:fsft such that ϕi=f and such that

D 1× D 0D 1 D 1 = D 1 ϕ D 1 D 0 D 0 ϕ f f D 1 D 0 f X=D 1× D 0D 1 c D 1 D 0 ϕ f D 1 f X.\array{ D_1\times_{D_0} D_1 & \to & D_1 & = & D_1\\ \downarrow && \downarrow & \Downarrow_\phi & \downarrow\\ D_1 & \to & D_0 && D_0\\ || &\Downarrow_\phi && \searrow^f & \downarrow f\\ D_1 & \to & D_0 & \overset{f}{\to} & X } \qquad = \qquad \array{ D_1\times_{D_0} D_1 \\ & \searrow^c\\ && D_1 & \to & D_0\\ && \downarrow & \Downarrow_\phi & \downarrow f\\ && D_1 & \overset{f}{\to} & X. }

The comma square in the definition of the kernel of a morphism f:AB gives a canonical 2-fork

(f/f)AfB.(f/f) \;\rightrightarrows\; A \overset{f}{\to} B.

It is easy to see that any other 2-fork

D 1D 0=AfBD_1 \;\rightrightarrows\; D_0 = A \overset{f}{\to} B

factors through the kernel by an essentially unique functor Dker(f) that is the identity on A.

If D 1D 0fX is a 2-fork, we say that it equips f with an action by the 2-congruence D. If g:D 0X also has an action by D, say ψ:gsgt, a 2-cell α:fg is called an action 2-cell if (αt).ϕ=ψ.(αs). There is an evident category Act(D,X) of morphisms D 0X equipped with actions.

Definition

A quotient for a 2-congruence D 1D 0 in a 2-category K is a 2-fork D 1D 0qQ such that for any object X, composition with q defines an equivalence of categories

K(Q,X)Act(D,X).K(Q,X) \simeq Act(D,X).

A quotient can also, of course, be defined as a suitable 2-categorical limit.

Lemma

The quotient q in any 2-congruence is eso.

Proof

If m:AB is ff, then the square we must show to be a pullback is

Act(D,A) Act(D,B) K(D 0,A) K(D 0,B)\array{Act(D,A) & \overset{}{\to} & Act(D,B)\\ \downarrow && \downarrow\\ K(D_0,A)& \underset{}{\to} & K(D_0,B)}

But this just says that an action of D on A is the same as an action of D on B which happens to factor through m, and this follows directly from the assumption that m is ff.

Definition

A 2-fork D 1D 0fX is called exact if f is a quotient of D and D is a kernel of f.

This is the 2-categorical analogue of the notion of exact fork in a 1-category, and plays an analogous role in the definition of a regular 2-category and an exact 2-category.

The 2-category of 2-conguences

There is an evident but naive 2-category of 2-congruences in any 2-category. And there is a refined version where internal functors are replaced by internal anafunctors.

Definition

For K a 2-category, write 2Cong s(K) for the full sub-2-category of that of hom-wise discrete internal categories, def. 1 on the 2-congruences, def. 3

2Cong s(K)HDC(K).2 Cong_s(K) \hookrightarrow HDC(K) \,.
Proposition

There is a 2-functor

Φ:K2Cong s(K)\Phi : K\to 2Cong_s(K)

sending each object to its kernel, def. 2.

Definition

Let the 2-category K be equipped with the structure of a 2-site. With this understood, write

2Cong(K)2 Cong(K)

for the 2-category of 2-congruences with morphisms the anafunctors between them.

Remark

The evident inclusion

2Cong s(K)2Cong(K)2 Cong_s(K) \hookrightarrow 2 Cong(K)

is a homwise-full sub-2-category closed under finite limits.

Properties

Opposites

The opposite of a homwise-discrete category is again a homwise-discrete category. However, the opposite of a 2-congruence in K is a 2-congruence in K co, since 2-cell duals interchange fibrations and opfibrations. Likewise, passage to opposites takes 2-forks in K to 2-forks in K co, and preserves and reflects kernels, quotients, and exactness.

Regularity

We discuss that when the ambient 2-category K has finite 2-limits, then its 2-category 2Cong s(K) of 2-congruences, def. 7 is a regular 2-category. This is theorem 2 below. A sub-2-category of Cong s(K) is the regular completion of K.

In the following and throughout, ”n” denotes either of (see (n,r)-category)

n=(0,1),(1,1),(2,1),(2,2).n = (0,1), (1,1), (2,1), (2,2) \,.
Lemma

Suppose that K has finite 2-limits. Then:

  1. HDC(K) (def. 1) has finite limits.

  2. nCong s(K) is closed under finite limits in HDC(K).

  3. The 2-functor Φ:K2Cong s(K), prop. 1, is 2-fully-faithful (that is, an equivalence on hom-categories) and preserves finite limits.

Proof

It suffices to deal with finite products, inserters, and equifiers. Evidently Φ(1) is a terminal object. If D and E are homwise-discrete categories, define P 0=D 0×E 0 and P 1=D 1×E 1; it is easy to check that then P 1P 0 is a homwise-discrete category that is the product D×E in HDC(K). Since (D 0×E 0) 2(D 0) 2×(E 0) 2, and products preserve ffs, we see that P is an n-congruence if D and E are and that Φ preserves products.

For inserters, let f,g:CD be functors in HDC(K), define i 0:I 0C 0 by the pullback

I 0 D 1 i 0 C 0 (f 0,g 0) D 0×D 0,\array{I_0 & \to & D_1\\ i_0 \downarrow && \downarrow \\ C_0 & \overset{(f_0,g_0)}{\to} & D_0\times D_0,}

and define i 1:I 1C 1 by the pullback

I 1 X i 1 C 1 (f 1,g 1) D 1×D 1\array{I_1 & \to & X\\ i_1\downarrow && \downarrow\\ C_1 & \overset{(f_1,g_1)}{\to} & D_1\times D_1}

where X is the “object of commutative squares in D.” Then I 1I 0 is a homwise-discrete category and i:IC is an inserter of f,g. Also, I is an n-congruence if C is, and Φ preserves inserters.

Finally, for equifiers, suppose we have functors f,g:CD and 2-cells α,β:fg in HDC(K), represented by morphisms a,b:C 0D 1 such that (s,t)a(f 0,g 0)(s,t)b. Let e 0:E 0C 0 be the universal morphism equipped with an isomorphism ϕ:ae 0be 0 such that (s,t)ϕ is the given isomorphism (s,t)a(s,t)b (this is a finite limit in K.) Note that since (s,t):D 1D 0×D 0 is discrete, e 0 is ff. Now let E 1=(e 0×e 0) *C 1; then E 1E 0 is a homwise-discrete category and e:EC is an equifier of α and β in HDC(K). Also E is an n-congruence if C is, and Φ preserves equifiers.

For any morphism f:AB in K, Φ(f) is the functor ker(A)ker(B) that consists of f:AB and f 2:A 2B 2. A transformation between Φ(f) and Φ(g) is a morphism AB 2 whose composites AB 2B are f and g; but this is just a transformation fg in K. Thus, Φ is homwise fully faithful. And homwise essential-surjectivity follows from the essential uniqueness of thin structures, or equivalently a version of Prop 6.4 in FBMF.

Moreover, we have:

Theorem

If K is an n-category with finite limits, then nCong s(K) is regular.

Proof

It is easy to see that a functor f:CD between n-congruences is ff in nCong s(K) iff the square

C 1 D 1 C 0×C 0 D 0×D 0\array{C_1 & \to & D_1\\ \downarrow && \downarrow\\ C_0\times C_0 & \to & D_0\times D_0}

is a pullback in K.

We claim that if e:ED is a functor such that e 0:E 0D 0 is split (that is, e 0s1 D 0 for some s:D 0E 0), then e is eso in nCong s(K). For if efg for some ff f:CD as above, then we have g 0s:D 0C 0 with f 0g 0se 0s1 D 0, and so the fact that C 1 is a pullback induces a functor h:DC with h 0=g 0s and fh1 D. But this implies f is an equivalence; thus e is eso.

Moreover, if e 0:E 0D 0 is split, then the same is true for any pullback of e. For the pullback of e:ED along some k:CD is given by a P where P 0=E 0× D 0D iso× D 0C 0; here D isoD 1 is the “object of isomorphisms” in D. What matters is that the projection P 0C 0 has a splitting given by combining the splitting of e 0 with the “identities” morphism D 0D iso.

Now suppose that f:DE is any functor in nCong s(K). It is easy to see that if we define Q 0=D 0 and let Q 1 be the pullback

Q 1 E 1 Q 0×Q 0 f 0×f 0 E 0×E 0\array{ Q_1 & \to & E_1 \\ \downarrow && \downarrow\\ Q_0 \times Q_0 & \overset{f_0\times f_0}{\to} & E_0\times E_0}

then fme where e:DQ and m:QE are the obvious functors. Moreover, clearly m is ff, and e satisfies the condition above, so any pullback of it is eso. It follows that if f itself were eso, then it would be equivalent to e, and thus any pullback of it would also be eso; hence esos are stable under pullback.

Since m is ff, the kernel of f is the same as the kernel of e, so to prove K regular it remains only to show that e is a quotient of that kernel. If CD denotes ker(f), then C is the comma object (f/f) and thus we can calculate

C 0=D 0× E 0E 1× E 0D 0Q 1.C_0 = D_0\times_{E_0} E_1 \times_{E_0} D_0 \cong Q_1.

Therefore, if g:DX is equipped with an action by ker(f), then the action 2-cell is given by a morphism Q 1=C 0X 1, and the action axioms evidently make this into a functor QX. Thus, Q is a quotient of ker(f), as desired.

Remark

There are three “problems” with the 2-category nCong s(K).

  1. It is too big. It is not necessary to include every n-congruence in order to get a regular category containing K, only those that occur as kernels of morphisms in K.
  2. It is too small. While it is regular, it is not exact.
  3. It doesn’t remember information about K. If K is already regular, then passing to nCong s(K) destroys most of the esos and quotients already present in K.

The solution to the first problem is straightforward.

Definition

If K is a 2-category with finite limits, define

K reg/lex2Cong s(K)K_{reg/lex} \hookrightarrow 2 Cong_s(K)

to be the sub-2-category of 2Cong s(K) spanned by the 2-congruences which occur as kernels of morphisms in K.

Remark

If K is an n-category then any such kernel is an n-congruence, so in this case K reg/lex is contained in nCong s(K) and is an n-category. Also, clearly Φ factors through K reg/lex.

Theorem

For any finitely complete 2-category K, the 2-category K reg/lex is regular?, and the functor Φ:KK reg/lex induces an equivalence

Reg(K reg/lex,L)Lex(K,L)Reg(K_{reg/lex},L) \simeq Lex(K,L)

for any regular 2-category K.

Here Reg(,) denotes the 2-category of regular functors, transformations, and modifications between two regular 2-categories, and likewise Lex(,) denotes the 2-category of finite-limit-preserving functors, transformations, and modifications between two finitely complete 2-categories.

Proof

It is easy to verify that K reg/lex is closed under finite limits in 2Cong s(K), and also under the eso-ff factorization constructed in Theorem 2; thus it is regular. If F:KL is a lex functor where L is regular, we extend it to K reg/lex by sending ker(f) to the quotient in L of ker(Ff), which exists since L is regular. It is easy to verify that this is regular and is the unique regular extension of F.

In particular, if K is a regular 1-category, K reg/lex is the ordinary regular completion of K. In this case our construction reduces to one of the usual constructions (see, for example, the Elephant).

To solve the second and third problems with nCong s(K), we need to modify its morphisms.

Exactness

Let now the ambient 2-category K be equipped with the structure of a 2-site. Recall from def. 8 the 2-category 2Cong(K) whose objects are 2-congruences in K, and whose morpisms are internal anafunctors between these, with respect to the given 2-site structure.

Notice that when K is a regular 2-category it comes with a canonical structure of a 2-site: its regular coverage.

Theorem

For any subcanonical and finitely complete 2-site K (such as a regular coverage), the 2-category 2Cong(K) from def. 8

  • is finitely complete;

  • contains 2Cong s(K), def. 7 as a homwise-full sub-2-category (that is, 2Cong s(K)(D,E)2Cong(K)(D,E) is ff) closed under finite limits.

Proof

It is easy to see that products in 2Cong S(K) remain products in nCong(K). Before dealing with inserters and equifiers, we observe that if AFB is an anafunctor in 2Cong(K) and e:X 0F 0 is any eso, then pulling back F 1 to X 0×X 0 defines a new congruence X and an anafunctor AXB which is isomorphic to the original in 2Cong(K)(A,B). Thus, if AFB and AGB are parallel anafunctors in 2Cong(K), by pulling them both back to F× AG we may assume that they are defined by spans with the same first leg, i.e. we have AXB.

Now, for the inserter of F and G as above, let EX be the inserter of XB in 2Cong s(K). It is easy to check that the composite EXA is an inserter of F,G in 2Cong(K). Likewise, given α,β:FG with F and G as above, we have transformations between the two functors XB in 2Cong s(K), and it is again easy to check that their equifier in 2Cong s(K) is again the equifier in 2Cong(K) of the original 2-cells α,β. Thus, 2Cong(K) has finite limits. Finally, by construction clearly the inclusion of 2Cong s(K) preserves finite limits.

Theorem

If K is a subcanonical finitely complete n-site, then the functor Φ:KnCong(K), prop. 1, is 2-fully-faithful.
If K is an n-exact n-category equipped with its regular coverage, then

Φ:KnCong(K)\Phi : K \to n Cong(K)

is an equivalence of 2-categories.

Proof

Since Φ:KnCong s(K) is 2-fully-faithful and nCong s(K)nCong(K) is homwise fully faithful, Φ:KnCong(K) is homwise fully faithful. For homwise essential-surjectivity, suppose that ker(A)Fker(B) is an anafunctor. Then h:F 0A is a cover and F 1 is the pullback of A 2 along it; but this just says that F 1=(h/h). The functor FB consists of morphisms g:F 0B and F 1=(h/h)B 2, and functoriality says precisely that the resulting 2-cell equips g with an action by the congruence F. But since F is precisely the kernel of h:F 0A, which is a cover in a subcanonical 2-site and hence the quotient of this kernel, we have an induced morphism f:AB in K. It is then easy to check that f is isomorphic, as an anafunctor, to F. Thus, Φ is homwise an equivalence.

Now suppose that K is an n-exact n-category and that D is an n-congruence. Since K is n-exact, D has a quotient q:D 0Q, and since D is the kernel of q, we have a functor Dker(Q) which is a weak equivalence. Thus, we can regard it either as an anafunctor Dker(Q) or ker(Q)D, and it is easy to see that these are inverse equivalences in nCong(K). Thus, Φ is essentially surjective, and hence an equivalence.

Note that by working in the generality of 2-sites, this construction includes the previous one.

Remark

If K is a finitely complete 2-category equipped with its minimal coverage, in which the covering families are those that contain a split epimorphism, then

nCong(K)nCong s(K).n Cong(K) \simeq n Cong_s(K) \,.
Proof

This is immediate from the proof of Theorem 2, which implies that the first leg of any anafunctor relative to this coverage is both eso and ff in nCong s(K), and hence an equivalence.

Theorem

If K is a 2-exact 2-category with enough groupoids, then

K2Cong(gpd(K)).K\simeq 2 Cong(gpd(K)) \,.

Likewise, if K is 2-exact and has enough discretes, then

K2Cong(disc(K)).K\simeq 2 Cong(disc(K)) \,.
Proof

Define a functor K2Cong(gpd(K)) by taking each object A to the kernel of j:JA where j is eso and J is groupoidal (for example, it might be the core of A). Note that this kernel lives in 2Cong(gpd(K)) since (j/j)J×J is discrete, hence (j/j) is also groupoidal. The same argument as in Theorem 5 shows that this functor is 2-fully-faithful for any regular 2-category K with enough groupoids, and essentially-surjective when K is 2-exact; thus it is an equivalence. The same argument works for discrete objects.

In particular, the 2-exact 2-categories having enough discretes are precisely the 2-categories of internal categories and anafunctors in 1-exact 1-categories.

Our final goal is to construct the n-exact completion of a regular n-category, and a first step towards that is the following.

Theorem

If K is a regular n-category, so is nCong(K). The functor Φ:KnCong(K) is regular, and moreover for any n-exact 2-category L it induces an equivalence

Reg(nCong(K),L)Reg(K,L).Reg(n Cong(K), L) \to Reg(K,L).
Proof

We already know that nCong(K) has finite limits and Φ preserves finite limits. The rest is very similar to Theorem 2. We first observe that an anafunctor AFB is an equivalence as soon as FB is also a weak equivalence (its reverse span BFA then provides an inverse.) Also, AFB is ff if and only if

F 1 B 1 F 0×F 0 B 0×B 0\array{F_1 & \to & B_1\\ \downarrow && \downarrow \\ F_0\times F_0 & \to & B_0\times B_0}

is a pullback.

Now we claim that if AFB is an anafunctor such that F 0B 0 is eso, then F is eso. For if we have a composition

F G M A C B\array{ &&&& F \\ &&& \swarrow && \searrow\\ && G &&&& M\\ & \swarrow && \searrow && \swarrow && \searrow\\ A &&&& C &&&& B}

such that M is ff, then F 0B 0 being eso implies that M 0B 0 is also eso; thus MB is a weak equivalence and so M is an equivalence. Moreover, by the construction of pullbacks in nCong(K), anafunctors with this property are stable under pullback.

Now suppose that AFB is any anafunctor, and define C 0=F 0 and let C 1 be the pullback of B 1 to C 0×C 0 along C 0=F 0toB 0. Then C is an n-congruence, CB is ff in nCong s(K) and thus also in nCong(K), and AFB factors through C. (In fact, C is the image of FB in nCong s(K).) The kernel of AFB can equally well be calculated as the kernel of FB, which is the same as the kernel of FC.

Finally, given any AGD with an action by this kernel, we may as well assume (by pullbacks) that F=G (which leaves C unchanged up to equivalence). Then since the kernel acting is the same as the kernel of FC, regularity of nCong s(K) gives a descended functor CD. Thus, AFC is the quotient of its kernel; so nCong(K) is regular.

Finally, if L is n-exact, then any functor KL induces one nCong(K)nCong(L), but nCong(L)L, so we have our extension, which it can be shown is unique up to equivalence.

When K is a regular 1-category, it is well-known that 1Cong(K) (which, in that case, is the category of internal equivalence relations and functional relations) is the 1-exact completion of K (the reflection of K from regular 1-categories into 1-exact 1-categories). Theorem 7 shows that in general, nCong(K) will be the n-exact completion of K whenver it is n-exact. However, in general for n>1 we need to “build up exactness” in stages by iterating this construction.

It is possible that the iteration will converge at some finite stage, but for now, define nCong r(K)=nCong(nCong r1(K)) and let K nex/reg=colim rnCong r(K).

Theorem

For any regular n-category K, K nex/reg is an n-exact n-category and there is a 2-fully-faithful regular functor Φ:KK nex/reg that induces an equivalence

Reg(K nex/reg,L)Reg(K,L)Reg(K_{n ex/reg},L) \simeq Reg(K,L)

for any n-exact 2-category L.

Proof

Sequential colimits preserve 2-fully-faithful functors as well as functors that preserve finite limits and quotients, and the final statement follows easily from Theorem 7. Thus it remains only to show that K nex/reg is n-exact. But for any n-congruence D 1D 0 in K nex/reg, there is some r such that D 0 and D 1 both live in nCong r(K), and thus so does the congruence since nCong r(K) sits 2-fully-faithfully in K nex/reg preserving finite limits. This congruence in nCong r(K) is then an object of nCong r+1(K) which supplies a quotient there, and thus also in K nex/reg.

Examples

In Grpd

Under construction.

Let K:= Grpd be the 2-category of groupoids.

We would like to see that the following statement is true:

The 2-category of 2-congruences in Grpd is equivalent to the 2-category Cat of small categories.

2Cong(Grpd)Cat.2Cong(Grpd) \simeq Cat \,.

Let’s check:

For C a small category, construct a 2-congruence in Grpd as follows.

  • let 0:=Core(C)Grpd be the core of C;

  • let 1:=Core(C Δ[1])Grpd be the core of the arrow category of C;

  • let (s,t): 1 0 be image under Core:CatGrpd of the endpoint evaluation functor

C Δ[0]Δ[0]Δ[1]:C Δ[1]C Δ[0]Δ[0]=C×C.C^{\Delta[0] \coprod \Delta[0] \to \Delta[1]} : C^{\Delta[1]} \to C^{\Delta[0] \coprod \Delta[0]} = C \times C \,.

(Here we are using the canonical embedding ΔCat of the simplex category.)

This is clearly a faithful functor. Moreover, every morphism in Grpd is trivially a conservative morphism. So 1 0× 0 is a discrete morphism in Grpd.

Since Grpd is a (2,1)-category, the 2-pullbacks in Grpd are homotopy pullbacks. Using that (s,t) is (under the right adjoint nerve embedding N:GrpdsSet) a Kan fibration (by direct inspection, but also as a special case of standard facts about the model structure on simplicial sets), the object of composable morphisms is found to be

1× 0 1Core(C Δ[2]).\mathbb{C}_1 \times_{\mathbb{C}_0} \mathbb{C}_1 \simeq Core(C^{\Delta[2]}) \,.

Accordingly, let the internal composition in be induced by the given composition in C:

1× 0 1Core(C Δ[2])Core(C Δ[1]) 1.\mathbb{C}_1 \times_{\mathbb{C}_0} \mathbb{C}_1 \simeq Core(C^{\Delta[2]}) \stackrel{}{\to} Core(C^{\Delta[1]}) \simeq \mathbb{C}_1 \,.

This is clearly associative and unital and hence makes a hom-wise discrete category, def. 1, internal to Grpd.

Observe next (for instance using the discussion and examples at homotopy pullback, see also path object) that

ker( 0)=( 0 Δ[1] 0).ker(\mathbb{C}_0) = ( \mathbb{C}_0^{\Delta[1]} \stackrel{\to}{\to} \mathbb{C}_0) \,.

Notice that up to equivalence of groupoids, this is just the diagonal Δ: 0 0× 0.

Therefore there is an evident internal functor ker( 0), which on the first equivalent incarnation of ker( 0) given by the inclusion

ker( 0) 0 Δ[1]Core(C) Δ[1]Core(C Δ[1]),ker(\mathbb{C}_0) \simeq \mathbb{C}_0^{\Delta[1]} \simeq Core(C)^{\Delta[1]} \hookrightarrow Core(C^{\Delta[1]}) \,,

but which in the second version above simply reproduces the identity-assigning morphism of the internal category .

It follows that is indeed a 2-congruence, def. 3.

Conversely, given a 2-congruence in Grpd, define a category C as follows:

(…)

Remark

In the notation of the above proof, we can also form internally the core of . This is evidently the internally discrete category 0idid 0.

This means that the 2-congruences in the above proof are complete Segal spaces

:[n]Core(C Δ[n]),\mathbb{C} : [n] \mapsto Core(C^{\Delta[n]}) \,,

hence are internal categories in an (∞,1)-category in the (2,1)-category Grpd.

In a general (2,1)-category

(…)

References

The above material is taken from

and

Some lemmas are taken from

and

Revised on November 27, 2012 16:58:23 by Urs Schreiber (131.174.40.3)