Isomorphism of categories
Encyclopedia
In category theory
, two categories C and D are isomorphic if there exist functor
s F : C → D and G : D → C which are mutually inverse to each other, i.e. FG = 1D (the identity functor on D) and GF = 1C. 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
; roughly speaking, for an equivalence of categories we don't require that FG(x) be equal to x, but only isomorphic to x in the category D, and likewise that GF(y) be isomorphic to y in C.
, we have the following general properties formally similar to an equivalence relation
:
A functor F : C → D yields an isomorphism of categories if and only if it is bijective on objects and on morphism sets. This criterion can be convenient as it avoids the need to construct the inverse functor G.
G, a field
k and the group algebra
kG. The category of k-linear group representation
s of G is isomorphic to the category of left module
s over kG. The isomorphism can be described as follows: given a group representation ρ : G → GL(V), where V is a vector space
over k, GL(V) is the group of its k-linear automorphism
s, and ρ is a group homomorphism
, we turn V into a left kG module by defining
for every v in V and every element Σ ag 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).
Every ring
can be viewed as a preadditive category
with a single object. The functor category
of all additive functors from this category to the category of abelian groups
is isomorphic to the category of left modules over the ring.
Another isomorphism of categories arises in the theory of Boolean algebras: the category of Boolean algebras is isomorphic to the category of Boolean ring
s. Given a Boolean algebra B, we turn B into a Boolean ring by using the symmetric difference
as addition and the meet operation as multiplication. Conversely, given a Boolean ring R, we define the join operation by ab = 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.
Category theory
Category theory is an area of study in mathematics that examines in an abstract way the properties of particular mathematical concepts, by formalising them as collections of objects and arrows , where these collections satisfy certain basic conditions...
, two categories C and D are isomorphic if there exist functor
Functor
In category theory, a branch of mathematics, a functor is a special type of mapping between categories. Functors can be thought of as homomorphisms between categories, or morphisms when in the category of small categories....
s F : C → D and G : D → C which are mutually inverse to each other, i.e. FG = 1D (the identity functor on D) and GF = 1C. 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
Equivalence of categories
In category theory, an abstract branch of mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics...
; roughly speaking, for an equivalence of categories we don't require that FG(x) be equal to x, but only isomorphic to x in the category D, and likewise that GF(y) be isomorphic to y in C.
Properties
As is true for any notion of isomorphismIsomorphism
In abstract algebra, an isomorphism is a mapping between objects that shows a relationship between two properties or operations. If there exists an isomorphism between two structures, the two structures are said to be isomorphic. In a certain sense, isomorphic structures are...
, we have the following general properties formally similar to an equivalence relation
Equivalence relation
In mathematics, an equivalence relation is a relation that, loosely speaking, partitions a set so that every element of the set is a member of one and only one cell of the partition. Two elements of the set are considered equivalent if and only if they are elements of the same cell...
:
- 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 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 groupGroup (mathematics)
In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines any two of its elements to form a third element. To qualify as a group, the set and the operation must satisfy a few conditions called group axioms, namely closure, associativity, identity...
G, a field
Field (mathematics)
In abstract algebra, a field is a commutative ring whose nonzero elements form a group under multiplication. As such it is an algebraic structure with notions of addition, subtraction, multiplication, and division, satisfying certain axioms...
k and the group algebra
Group algebra
In mathematics, the group algebra is any of various constructions to assign to a locally compact group an operator algebra , such that representations of the algebra are related to representations of the group...
kG. The category of k-linear group representation
Group representation
In the mathematical field of representation theory, group representations describe abstract groups in terms of linear transformations of vector spaces; in particular, they can be used to represent group elements as matrices so that the group operation can be represented by matrix multiplication...
s of G is isomorphic to the category of left module
Module (mathematics)
In abstract algebra, the concept of a module over a ring is a generalization of the notion of vector space, wherein the corresponding scalars are allowed to lie in an arbitrary ring...
s over kG. The isomorphism can be described as follows: given a group representation ρ : G → GL(V), where V is a vector space
Vector space
A vector space is a mathematical structure formed by a collection of vectors: objects that may be added together and multiplied by numbers, called scalars in this context. Scalars are often taken to be real numbers, but one may also consider vector spaces with scalar multiplication by complex...
over k, GL(V) is the group of its k-linear automorphism
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 automorphisms of an object forms a group, called the automorphism...
s, and ρ is a group homomorphism
Group homomorphism
In mathematics, given two groups and , a group homomorphism from to is a function h : G → H such that for all u and v in G it holds that h = h \cdot h...
, we turn V into a left kG module by defining
for every v in V and every element Σ ag 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).
Every ring
Ring (mathematics)
In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition and a semigroup under multiplication such that multiplication distributes over addition...
can be viewed as a preadditive category
Preadditive category
In mathematics, specifically in category theory, a preadditive category is a category that is enriched over the monoidal category of abelian groups...
with a single object. The functor category
Functor category
In category theory, a branch of mathematics, the functors between two given categories form a category, where the objects are the functors and the morphisms are natural transformations between the functors...
of all additive functors from this category to the category of abelian groups
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....
is isomorphic to the category of left modules over the ring.
Another isomorphism of categories arises in the theory of Boolean algebras: the category of Boolean algebras is isomorphic to the category of Boolean ring
Boolean ring
In mathematics, a Boolean ring R is a ring for which x2 = x for all x in R; that is, R consists only of idempotent elements....
s. Given a Boolean algebra B, we turn B into a Boolean ring by using the symmetric difference
Symmetric difference
In mathematics, the symmetric difference of two sets is the set of elements which are in either of the sets and not in their intersection. The symmetric difference of the sets A and B is commonly denoted by A\,\Delta\,B\,orA \ominus B....
as addition and the meet operation as multiplication. Conversely, given a Boolean ring R, we define the join operation by ab = 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.