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: 26 June 2019

ADJOINTS

ADJOINTS

Chapter:
(p.179) 9 ADJOINTS
Source:
Category Theory
Author(s):

Steve Awodey

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

This chapter focuses on notion of adjoint functor, which applies everything that has been learned so far to unify and subsume all the different universal mapping properties encountered, from free groups to limits to exponentials. It also captures an important mathematical phenomenon that is invisible without the use of the lens of category theory. It is argued that adjointness is a concept of fundamental logical and mathematical importance not captured elsewhere in mathematics. Topics discussed include hom-set definition, examples of adjoints, order adjoints, quantifiers as adjoints, RAPL 197, locally cartesian closed categories, and the adjoint functor theorem.

Keywords:   adjoint functor theorem, adjointness, hom-set definition, quantifiers, cartesian closed categories

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 .