unnatural isomorphism

Unnatural isomorphisms


A natural isomorphism is the “correct” notion of isomorphism between functors. Informally, one sometimes speaks of two objects being “naturally isomorphic” if they are the images of two functors that are naturally isomorphic. However, sometimes one encounters functors that are “pointwise isomorphic” but not naturally. There is not much to say mathematically about such “unnatural isomorphisms”, but some discussion of them can help the intuitive understanding of natural isomorphisms and their importance.

On this page we will adhere to the convention that an “unnatural isomorphism” means an isomorphism that is not necessarily natural (but might be), similarly to how a “noncommutative ring” might happen to be commutative. The word “unnatural” is not to be taken perjoratively or as suggesting that unnatural isomorphisms are rare; in cardinality terms there are many more unnatural isomorphisms than natural ones, although in mathematical practice surprisingly many isomorphisms are indeed natural. Other possible terms with the same meaning are “pointwise isomorphic” or “objectwise isomorphic”.

The term “natural” is used for traditional reasons, cf. EilenbergMac Lane45, and is an example of the common phenomenon that concepts branded natural, normal or regular tend to be rather non-generic or non-random. In fact, Eilenberg and MacLane comment (cf. p. 233, first paragraph in loc. cit) on the term, associating it with an intuition of simultaneity, rather than genericity. This intuition is in tune with conceiving of naturality as generalized commutatitivity.


Between functors

Let F,G:CDF,G:C\to D be functors. An unnatural isomorphism between FF and GG consists of, for each object cCc\in C, an isomorphism F(c)G(c)F(c) \cong G(c), satisfying no further conditions.

In other words, it is an unnatural transformation whose components are isomorphisms, or equivalently that is an isomorphism in the category of unnatural transformations.

Note that if each component of a natural transformation is an isomorphism, then it is necessarily a natural isomorphism. (Depending on the definition of “natural isomorphism”, this could be a tautology; but the non-tautologous statement is that if each component of a natural transformation is an isomorphism then it is an isomorphism in the functor category. This statement, though non-tautologous, is easy to prove for 1-categories, but more difficult for higher categories.)

More generally, an unnatural isomorphism (or transformation) might be natural with respect to only some morphisms in the domain, such as for instance the isomorphisms. Some people have proposed calling transformations that are natural only with respect to isomorphisms “canonical”.

Between objects

If one says that two objects AA and BB are “unnaturally isomorphic”, it might mean that they are the images of two functors that are unnaturally isomorphic, but it might also mean only that there is no obvious way even to make them the images of two functors. For instance, this seems to be the meaning in Section 1.1 of Strickland.

Somewhat relatedly, the complex numbers \mathbb{C} and the p-adic complex numbers C p\mathbf{C}_p are “unnaturally isomorphic”. More precisely, there is no way of making constructions such as “algebraic closure of a field” or “injective hull of an RR-module” functorial, if the desired embeddings into these constructions are to be natural, and this precludes speaking of any two such constructions as “naturally isomorphic”. We touch on this again below, but see here.

Reasons for unnaturality

Intuitively, there are several reasons that an isomorphism might fail to be natural.

Making the unnatural natural

Unnatural isomorphisms are not very well-behaved mathematically, so if we have an unnatural isomorphism we may want to “make it natural”. There are several ways to do this:

  1. Use a different definition that includes more structure, such as derivators instead of triangulated categories. See for instance this Wikipedia discussion on axioms for triangulated categories.

  2. Relatedly, pass to a higher-categorical context in which a non-commuting square can commute up to a higher transformation; see pseudonatural transformation and lax natural transformation.

  3. Cut down to a smaller class of morphisms in the domain category for which the naturality square does commute.

Natural, canonical, and functorial

The use of adjectives like canonical, invariant, functorial, natural is sometimes satirized. For example, as quoted in MO2010, André Weil writes:

I can assure you, at any rate, that (…) my results are invariant, probably canonical, perhaps even functorial. (Oeuvres, vol. 2, page 558)

which may be subtly mocking.

These three terms can be distinguished in the following way:

In particular, the adjectives “functorial” and “natural” in general apply to different classes of things.

See non-canonical isomorphism for examples of natural isomorphisms that are not canonical.


  1. Let U:VectAffU: Vect\to Aff be the functor taking the underlying affine space of a vector space, and D:AffVectD:Aff\to Vect the functor constructing the vector space of displacements of an affine space. Then there is a natural isomorphism DUId VectD \circ U \cong Id_{Vect}, but only an unnatural isomorphism “UDId AffU \circ D \cong Id_{Aff}”. In particular, these functors do not form an equivalence of categories. A similar phenomenon occurs with groups and heaps, and with torsors of groups.

  2. As a particular example of the last phenomenon: there is a bijective correspondence between linear orderings of a set SS and permutations of SS. Indeed, the set Lin(S)Lin(S) is a torsor over Perm(S)Perm(S): there is a group action α:Perm(S)×Lin(S)Lin(S)\alpha: Perm(S) \times Lin(S) \to Lin(S) such that for any choice of linear ordering LL, the map α(,L):Perm(S)Lin(S)\alpha(-, L): Perm(S) \to Lin(S) is a bijection. But, there is no canonical choice of ordering LL.

  3. Species are functors for which unnatural isomorphisms are sometimes discussed. For example, the species of linear orders is unnaturally isomorphic to the species of permutations; for a related example, see the commentary under this MathOverflow answer MO2014. Yorgey2014 explicitly uses the term: his definition 3.3.4 introduces an “equipotence between species (…) as an ”unnatural“ isomorphism between [the two species in question]”.

  4. The term unnatural isomorphism is often used in homological algebra, in particular in discussions of splittings of exact sequences. An example is Hilton-Stammbach, Theorem 4.3, which explicitly uses the term to describe an isomorphism between Hom- and Ext-functors. More generally, unnatural transformations also often occur in homological algebra.

  5. It is often said that while there is an isomorphism between the field of complex numbers \mathbb{C} and the completion C p\mathbf{C}_p (with respect to the canonical absolute value) of the algebraic closure of the p-adic numbers p\mathbb{Q}_p, this isomorphism is not natural. This statement, while somewhat loose since there are no functors specified, can be made formally precise along the lines of Adámek, Herrlich, Rosický, and Tholen. The abstract reads: “In a category with injective hulls and a cogenerator, the embeddings into injective hulls can never form a natural transformation, unless all objects are injective. In particular, assigning to a field its algebraic closure, to a poset or Boolean algebra its MacNeille completion, and to an RR-module its injective envelope is not functorial, if one wants the respective embeddings to form a natural transformation.”

  6. If CC and DD have only one object (or slightly more generally, one isomorphism class of objects), then any two functors F,G:CDF,G:C\to D are unnaturally isomorphic. For example, for any ring RR, any two endofunctors of the category of rank-one free RR-modules are unnaturally isomorphic.

  7. See MathOverflow2013.