Jump to ContentJump to Main Navigation
Category Theory$
Users without a subscription are not able to see the full content.

Steve Awodey

Print publication date: 2006

Print ISBN-13: 9780198568612

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198568612.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 19 July 2019

CATEGORIES OF DIAGRAMS

CATEGORIES OF DIAGRAMS

Chapter:
(p.159) 8 CATEGORIES OF DIAGRAMS
Source:
Category Theory
Author(s):

Steve Awodey

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198568612.003.0008

This chapter presents the proof for the Yoneda Lemma, which is probably the single most used result in category theory. It is interesting how often it comes up, especially in view of the fact that it is a straightforward generalization of facts that are fairly easily shown in relation to monoids and posets. The topics discussed include set-valued functor categories, Yoneda embedding, limits in categories of diagrams, colimits in categories of diagrams, exponentials in categories of diagrams, and Topoi. Exercises are provided in the last part of the chapter.

Keywords:   Yoneda Lemma, category theory, set-valued functor categories, categories of diagrams, exponentials, colimits, Topoi

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .