nLab
concrete category

Contents

Idea

A concrete category is a category that looks like a category of “sets with extra structure”.

Definition

A concrete category is a category C

The object c 0 is called a generator of the category.

Remark

Often the term “concrete category” is used without implying the second condition of representability. This second condition however is important for the statement of concrete dualities induced by dual adjunctions.

Examples

  • C=Set itself with c 0={} the singleton set;

  • C any category which has an object c 0 which is “free on one generator”, i.e which is the image under a functor F:SetC left adjoint to U of the singleton set. Then by definition of left adjoint and the above example, we have C(F({}),d)Set({},U(d))U(d), naturally in d. This abstract nonsense indicates the usual collection of examples of concrete categories: for instance monoids, groups, rings, algebras, etc. (… many more examples…)

  • Take C to be the category of Banach spaces with morphisms those (everywhere-defined) linear transformations with norm bounded (above) by 1 (so Tvv for all v in the source). Then there are two versions of U that one may use: one where U(V) (for V a Banach space) consists of every vector in V, and one where U(V) consists of those vectors bounded by 1 (so the closed unit ball in V). The first may seem more obvious at first, but only the second is representable (by a 1-dimensional Banach space).

  • A concrete category that is equipped with the structure of a site in a compatible way is a concrete site.

Characterization

Theorem

A finitely complete category is concrete, in the sense that it admits a faithful functor to Set, if and only if it is well-powered with respect to regular subobjects.

Proof

“Only if” was proven in (Isbell). To prove it, note that if F:CD is a faithful functor, then it is injective on equivalence classes of regular subobjects. For suppose that m:ax is the equalizer of f,g:xy, and n:bx is the equalizer of h,k:xz. If F(a)F(b) as subobjects of F(x), then since fm=gm and so F(f)F(m)=F(g)F(m), we must also have F(f)F(n)=F(g)F(n); hence (since F is faithful) fn=gn, so that n factors through m. Conversely, n factors through m, so we have ab as subobjects of x. Since Set is regularly well-powered, it follows that any category admitting a faithful functor to Set must also be so.

(Actually, Isbell proved a more general condition which applies to categories that may lack finite limits.)

“If” was proven in (Freyd). The argument is rather more involved, passing through additive categories, and is not reproduced here.

Generalisations

One can consider concrete categories over any base category X instead of necessarily over Set. This is the approach taken in The Joy of Cats. Then the (small) concrete categories over X form a 2-category Cat(X).

References

  • John Isbell, Two set-theoretical theorems in categories , Fund. Math 53 (1963)