Isomorphism of categories

Isomorphism of categories

In category theory, two categories "C" and "D" are isomorphic if there exist functors "F" : "C" → "D" and "G" : "D" → "C" which 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; 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 isomorphism, 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 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 representations 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 over "k", GL("V") is the group of its "k"-linear automorphisms, and ρ is a group homomorphism, we turn "V" into a left "kG" module by defining:(sum_{gin G} a_g g) v = sum_{gin G} a_g ho(g)(v)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 rings. Given a Boolean algebra "B", we turn "B" into a Boolean ring by using the symmetric difference as addition and the meet operation land as multiplication. Conversely, given a Boolean ring "R", we define the join operation by "a"lor"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.


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Isomorphism theorem — In mathematics, specifically abstract algebra, the isomorphism theorems are three theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules,… …   Wikipedia

  • 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… …   Wikipedia

  • Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… …   Wikipedia

  • Order isomorphism — In the mathematical field of order theory an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets). Whenever two posets are order isomorphic, they can be… …   Wikipedia

  • Norm residue isomorphism theorem — In the mathematical field of algebraic K theory, the norm residue isomorphism theorem is a long sought result whose complete proof was announced in 2009. It previously was known as the Bloch–Kato conjecture, after Spencer Bloch and Kazuya Kato,… …   Wikipedia

  • Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… …   Wikipedia

  • Myhill isomorphism theorem — For the Goodman–Myhill theorem in constructive set theory, see Diaconescu s theorem. In computability theory the Myhill isomorphism theorem, named after John Myhill, provides a characterization for two numberings to induce the same notion of… …   Wikipedia

  • Musical isomorphism — In mathematics, the musical isomorphism (or canonical isomorphism) is an isomorphism between the tangent bundle TM and the cotangent bundle T*M of a Riemannian manifold given by its metric. There are similar isomorphisms on symplectic manifolds.… …   Wikipedia

  • Quasi-isomorphism — In homological algebra, a branch of mathematics, a quasi isomorphism is a morphism A → B of chain complexes (respectively, cochain complexes) such that the induced morphisms :H n(A ullet) o H n(B ullet) ( ext{respectively, } H^n(A^ullet) o… …   Wikipedia

  • Mimetic isomorphism — in organization theory refers to the tendency of an organization to imitate another organization s structure because of the belief that the structure of the latter organization is beneficial. An example for this is a family company transforming… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”