nLab
idempotent complete (infinity,1)-category

Contents

Idea

An ordinary category is idempotent complete, aka Karoubi complete or Cauchy complete , if every idempotent splits. Since the splitting of an idempotent is a limit or colimit of that idempotent, any category with all finite limits or all finite colimits is idempotent complete.

In an (∞,1)-category the idea is the same, except that the notion of idempotent is more complicated. Instead of just requiring that ee=e, we need an equivalence eee, together with higher coherence data saying that, for instance, the two derived equivalences eeee are equivalent, and so on up. In particular, being idempotent is no longer a property of a morphism, but structure on it.

It is still true that a splitting of an idempotent in an (,1)-category is a limit or colimit of that idempotent (now regarded as a diagram with all its higher coherence data), but this limit is no longer a finite limit; thus an (,1)-category can have all finite limits without being idempotent-complete.

Definition

Definition

Let for a linearly ordered set J the simplicial set Δ J:=N(J) be defined to be the nerve of J; i.e. Δ J is given in degree n given by nondecreasing maps {0,...,n}J.

The simplicial set Idem + is defined as follows: for every nonempty, finite, linearly ordered set J, sSet(Δ J,Idem +) is the set of pairs (J 0,), where J 0J and is an equivalence relation on J 0 which satisfies the following condition:

  • Let ijk be elements of J such that i,kJ 0 , and ik. Then jJ 0 , and ijk.

Let Idem denote the simplicial subset of Idem +, corresponding to those pairs (J 0,) such that J=J 0 . Let RetIdem + denote the simplicial subset corresponding to those pairs (J 0,) such that the quotient J 0/ has at most one element.

(Lurie, 4.4.5.2 p.249)

Definition

Let C be an -category, incarnated as a quasi-category.

  1. An idempotent morphism in C is a map of simplicial sets IdemC. We will refer to Fun(Idem,C) as the (,1)-category of idempotents in C.

  2. A weak retraction diagram in C is a homomorphism of simplicial sets RetC. We refer to Fun(Ret,C) as the (,1)-category of weak retraction diagrams in C.

  3. A strong retraction diagram in C is a map of simplicial sets Idem +C. We will refer to Fun(Idem+,C) as the (,1)-category of strong retraction diagrams in C.

(Lurie, 4.4.5.4 p.250)

Definition

An idempotent F:IdemC is effective if it extends to a map Idem +C.

(Lurie, above corollary 4.4.5.14)

Proposition

An idempotent diagram F:IdemC is effective precisely if it admits an (∞,1)-limit, equivalently if it admits an (∞,1)-colimit.

By (Lurie, lemma 4.3.2.13).

Definition

C is called an idempotent complete (,1) if every idempotent is effective.

(Lurie, above corollary 4.4.5.14)

Properties

The following properties generalize those of idempotent-complete 1-categories.

Theorem

A small (∞,1)-category is idempotent-complete if and only if it is accessible.

This is HTT, 5.4.3.6.

Theorem

For C a small (∞,1)-category and κ a regular cardinal, the (∞,1)-Yoneda embedding CCInd κ(C) with C the full subcategory on κ-compact objects exhibits C as the idempotent completion of C.

This is HTT, lemma 5.4.2.4.

References

Section 4.4.5 of

Revised on November 16, 2012 00:42:53 by Guillaume Brunerie (192.16.204.210)