University of Cambridge > Talks.cam > Category Theory Seminar > Kernels and weak factorisation systems

Kernels and weak factorisation systems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Nathan Bowler.

Suppose given a category V which is a suitable base for enrichment. Now for any (weak) factorisation system (L,R) on V, and any V-enriched category C, we may enquire as to whether the former may be lifted “representably” to the latter; in other words, whether there is a (weak) factorisation system (L’, R’) on C whose right class R’ comprises those maps in C which are sent by each covariant representable to a map in R.

We show that, under suitable (co)completeness and boundedness assumptions on the category C, our question may be answered in the affirmative; the heart of the matter being a (possibly iterated) generalised kernel-cokernel construction.

This talk is part of the Category Theory Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity