In
category theory
Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...
, two categories ''C'' and ''D'' are isomorphic if there exist
functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
s ''F'' : ''C'' → ''D'' and ''G'' : ''D'' → ''C'' that are mutually inverse to each other, i.e. ''FG'' = 1
''D'' (the identity functor on ''D'') and ''GF'' = 1
''C''.
This means that both the
objects and the
morphisms of ''C'' and ''D'' stand in a
one-to-one correspondence to each other. Two isomorphic categories share all properties that are defined solely in terms of category theory; for all practical purposes, they are identical and differ only in the notation of their objects and morphisms.
Isomorphism of categories is a very strong condition and rarely satisfied in practice. Much more important is the notion of
equivalence of categories
In category theory, a branch of abstract mathematics, an equivalence of categories is a relation between two Category (mathematics), categories that establishes that these categories are "essentially the same". There are numerous examples of cate ...
; roughly speaking, for an equivalence of categories we don't require that
be ''equal'' to
, but only ''
naturally isomorphic
In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a natur ...
'' to
, and likewise that
be naturally isomorphic to
.
Properties
As is true for any notion of
isomorphism
In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
, we have the following general properties formally similar to an
equivalence relation:
* any category ''C'' is isomorphic to itself
* if ''C'' is isomorphic to ''D'', then ''D'' is isomorphic to ''C''
* if ''C'' is isomorphic to ''D'' and ''D'' is isomorphic to ''E'', then ''C'' is isomorphic to ''E''.
A functor ''F'' : ''C'' → ''D'' yields an isomorphism of categories if and only if it is
bijective
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equival ...
on objects and on
morphism sets.
This criterion can be convenient as it avoids the need to construct the inverse functor ''G''.
Examples
* Consider a finite
group ''G'', a
field ''k'' and the
group algebra ''kG''. The category of ''k''-linear
group representation
In the mathematical field of representation theory, group representations describe abstract groups in terms of bijective linear transformations of a vector space to itself (i.e. vector space automorphisms); in particular, they can be used ...
s of ''G'' is isomorphic to the category of
left modules over ''kG''. The isomorphism can be described as follows: given a group representation ρ : ''G'' → GL(''V''), where ''V'' is a
vector space
In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
over ''k'', GL(''V'') is the group of its ''k''-linear
automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphism ...
s, and ρ is a
group homomorphism
In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that
: h(u*v) = h(u) \cdot h(v)
whe ...
, we turn ''V'' into a left ''kG'' module by defining
for every ''v'' in ''V'' and every element Σ ''a
g'' ''g'' in ''kG''. Conversely, given a left ''kG'' module ''M'', then ''M'' is a ''k'' vector space, and multiplication with an element ''g'' of ''G'' yields a ''k''-linear automorphism of ''M'' (since ''g'' is invertible in ''kG''), which describes a group homomorphism ''G'' → GL(''M''). (There are still several things to check: both these assignments are functors, i.e. they can be applied to maps between group representations resp. ''kG'' modules, and they are inverse to each other, both on objects and on morphisms.) See also .
* Every
ring can be viewed as a
preadditive category with a single object. The
functor category
In category theory, a branch of mathematics, a functor category D^C is a category where the objects are the functors F: C \to D and the morphisms are natural transformations \eta: F \to G between the functors (here, G: C \to D is another object i ...
of all
additive functors from this category to the
category of abelian groups
In mathematics, the category Ab has the abelian groups as objects and group homomorphisms as morphisms. This is the prototype of an abelian category: indeed, every small abelian category can be embedded in Ab.
Properties
The zero object o ...
is isomorphic to the category of left modules over the ring.
* Another isomorphism of categories arises in the theory of
Boolean algebra
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variable (mathematics), variables are the truth values ''true'' and ''false'', usually denot ...
s: the category of Boolean algebras is isomorphic to the category of
Boolean rings. Given a Boolean algebra ''B'', we turn ''B'' into a Boolean ring by using the
symmetric difference
In mathematics, the symmetric difference of two sets, also known as the disjunctive union and set sum, is the set of elements which are in either of the sets, but not in their intersection. For example, the symmetric difference of the sets \ and ...
as addition and the meet operation
as multiplication. Conversely, given a Boolean ring ''R'', we define the join operation by ''a''
''b'' = ''a'' + ''b'' + ''ab'', and the meet operation as multiplication. Again, both of these assignments can be extended to morphisms to yield functors, and these functors are inverse to each other.
* If ''C'' is a category with an initial object s, then the
slice category (''s''↓''C'') is isomorphic to ''C''.
Dually, if ''t'' is a terminal object in ''C'', the functor category (''C''↓''t'') is isomorphic to ''C''. Similarly, if 1 is the category with one object and only its identity morphism (in fact, 1 is the
terminal category), and ''C'' is any category, then the functor category ''C''
1, with objects functors ''c'': 1 → ''C'', selecting an object ''c''∈Ob(''C''), and arrows natural transformations ''f'': ''c'' → ''d'' between these functors, selecting a morphism ''f'': ''c'' → ''d'' in ''C'', is again isomorphic to ''C''.
References
{{DEFAULTSORT:Isomorphism Of Categories
Adjoint functors
Equivalence (mathematics)