nLab transfor

Redirected from "(n,k)-transformation".
Contents

Context

Higher category theory

higher category theory

Basic concepts

Basic theorems

Applications

Models

Morphisms

Functors

Universal constructions

Extra properties and structure

1-categorical presentations

Contents

Idea

A kk-transfor is an operation from one nn-category CC to another DD (for some value of nn) that takes objects of CC to kk-morphisms of DD (and more generally jj-morphisms in CC to (j+k)(j+k)-morphisms in DD) in a coherent way. Equivalently, a kk-transfor is a kk-cell in an internal-hom nn-category. Transfors are a common generalisation of:

The word “transfor” was coined by Sjoerd Crans in this paper; it is a portmanteau of “functor” and “transformation.” A collection of components which forms a transfor is said to be transforial, as a generalization of “functorial” and “natural.”

Terminology

Once upon a time, there were categories, functors between them, and natural transformations between them. Then when nn-categories came along, people called the arrows between them ‘nn-functors’ even though one could just as easily say ‘functors’. In the same vein, people said ‘nn-transformations’ for natural transformations (that is, 2-transfors) between nn-categories. At the same time, we saw that we needed modifications between nn-transformations, and that there would have to be things between higher modifications, and so on. However, due to the prior use of “nn-transformation” for a 2-transfor between nn-categories, the natural choice “kk-transformation” is unavailable to mean a kk-transfor.

Here are some other possible terms for a kk-transfor between nn-categories, which additionally notate the value of nn (although this is, strictly speaking, unnecessary).

  • (n,k)(n,k)-transformation
  • nn-kk-transfor
  • nn-dimensional kk-transfor
  • nn-categorical kk-transfor
  • nn-natural kk-transformation

Definitions

We haven't gotten around to saying anything precise yet, but you can see something in the discussion below, or in Crans's paper.

Special cases

See this periodic table of kk-transfors between nn-categories for common names for low values of nn and kk. On the nn-Lab, we tend to omit the prefix nn- whenever possible (as ironic as that may be).

k k ↓\ n n 1 -1 0 0 1 1 2 2 3 3 ...
0 0 implicationfunctionfunctor 2 2 -functor 3 3 -functor...
1 1 trivialequality of functionsnatural transformation 2 2 -transformation 3 3 -transformation...
2 2 "trivialequality of natural transformationsmodification 3 3 -modification...
3 3 ""trivialequality of modificationsperturbation...
4 4 """trivialequality of perturbations...
5 5 """"trivial...
"""""

Note that the source and target of a kk-transfor (between nn-categories) are (k1)(k-1)-transfors (between the same nn-categories). Given two fixed source and target (k1)(k-1)-transfors, the kk-transfors between them (and the (k+1)(k+1)-transfors between those, and so on) form an (nk)(n-k)-category.

For n-posets

A similar table periodic table of kk-transfors between nn-posets exists for common names for low values of nn and kk.

k k ↓\ n n 1 -1 0 0 1 1 2 2 3 3 ...
0 0 implicationmonotonic functionfunctor 2 2 -functor 3 3 -functor...
1 1 trivialpartial order of monotonic functionsnatural transformation 2 2 -transformation 3 3 -transformation...
2 2 "trivialpartial order of natural transformationsmodification 3 3 -modification...
3 3 ""trivialpartial order of modificationsperturbation...
4 4 """trivialpartial order of perturbations...
5 5 """"trivial...
"""""

References

Last revised on September 5, 2025 at 16:04:38. See the history of this page for a list of all contributions to it.