Hostname: page-component-76c49bb84f-ndtt8 Total loading time: 0 Render date: 2025-07-10T07:24:07.711Z Has data issue: false hasContentIssue false
  • English
  • Français

Local fibred right adjoints are polynomial

Published online by Cambridge University Press:  03 October 2012

ANDERS KOCK  and
JOACHIM KOCK
ANDERS KOCK
Affiliation:
Matematisk Institut, Aarhus Universitet, Denmark Email: kock@imf.au.dk
JOACHIM KOCK
Affiliation:
Departament de Matemàtiques, Universitat Autònoma de Barcelona, Spain Email: kock@mat.uab.cat
Get access Rights & Permissions [Opens in a new window]

Abstract

For any locally cartesian closed category ℰ, we prove that a local fibred right adjoint between slices of ℰ is given by a polynomial. The slices in question are taken in a well-known fibred sense.

Information

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 23 , Issue 1 , February 2013 , pp. 131 - 141
Copyright
Copyright © Cambridge University Press 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Abbott, M., Altenkirch, T. and Ghani, N. (2003) Categories of containers. In: Foundations of software science and computation structures. Springer-Verlag Lecture Notes in Computer Science 2620 23–38.CrossRefGoogle Scholar
Borceux, F. (1994) Handbook of categorical algebra. Volume 2: Categories and structures, Cambridge University Press.Google Scholar
Carboni, A. and Johnstone, P. (1995) Connected limits, familial representability and Artin glueing. Mathematical Structures in Computer Science 5 441–459. (With corrigenda in Mathematical Structures in Computer Science 14 (2004) 185–187.)CrossRefGoogle Scholar
Gambino, N. and Hyland, M. (2004) Wellfounded trees and dependent polynomial functors. In: Berardi, S., Coppo, M. and Damiani, F. (eds.) TYPES 2003. Springer-Verlag Lecture Notes in Computer Science 3085 210–225.CrossRefGoogle Scholar
Gambino, N. and Kock, J. (2009) Polynomial functors and polynomial monads. (Available at arXiv:0906.4931. To be published in Mathematical Proceedings of the Cambridge Philosophical Society.)Google Scholar
Johnstone, P. (1997) Cartesian monads on toposes. Journal of Pure and Applied Algebra 116 199–220.CrossRefGoogle Scholar
Johnstone, P. (2002) Sketches of an elephant: a topos theory compendium: Volume 1, The Clarendon Press.Google Scholar
Kock, A. (1972) Strong functors and monoidal monads. Archiv der Mathematik 23 113–120.CrossRefGoogle Scholar
Kock, A. and Reyes, G. E. (1999) Aspects of fractional exponent functors. Theory and Applications of Categories 5 251–265.Google Scholar
Manes, E. G. and Arbib, M. A. (1986) Algebraic approaches to program semantics, Springer-Verlag.CrossRefGoogle Scholar
Moerdijk, I. and Palmgren, E. (2000) Wellfounded trees in categories. Annals of Pure and Applied Logic 104 189–218.CrossRefGoogle Scholar
Streicher, T. (1999) Fibred categories à la Jean Bénabou. Notes, available from http://www.mathematik.tu-darmstadt.de/~streicher/.Google Scholar
Weber, M. (2007) Familial 2-functors and parametric right adjoints. Theory and Applications of Categories 18 665–732.Google Scholar
Yetter, D. (1987) On right adjoints to exponential functors. Journal of Pure and Applied Algebra 45 287–304. (With corrigenda in Journal of Pure and Applied Algebra 58 (1989) 103–105.)CrossRefGoogle Scholar