Mitchell embedding theorem

from Wikipedia, the free encyclopedia

The embedding theorem of Mitchell is a mathematical result on Abelian categories . It states that these initially very abstract categories can be understood as concrete categories of modules . As a consequence of this, the proof procedure by element-by-element diagram hunting may be used in any Abelian categories. The set is named after Barry Mitchell .

Statement of the sentence

The exact statement is: Be a small Abelian category. Then there is a ring and a fully faithful and exact functor from over into the category of links modules .

The functor induces an equivalence between and a subcategory of . In calculated cores and coke cores correspond to the ordinary cores and coke cores in .

Proof idea

The idea of ​​proof is based on the Yoneda lemma . Assumed would already be in . Then every object delivers a left exact functor . The assignment then provides a duality between and the category of left exact functors from to . In order to recover from , one proceeds as follows: In the category of the left exact functors from to one constructs a certain injective cogenerator , whose endomorphism ring one chooses as. By for in each set, then obtained a functor with the desired properties.

Application to large categories

Immediately, Mitchell's embedding theorem seems to justify the chart hunt procedure only for all small Abelian categories. If, however, a diagram is given for an arbitrary Abelian category , consider the smallest Abelian full sub-category of , which contains all objects appearing in the diagram. This is a small Abelian category. To put it clearly, one takes the amount (!) Of objects used in the diagram as objects and then repeatedly adds missing cores and coke cores of morphisms and biproducts of objects.


  • Mitchell's embedding theorem. In: PlanetMath. Retrieved October 10, 2010 .
  • B. Mitchell: The Full Embedding Theorem . In: American Journal of Math . tape 86 , 1964, pp. 619-637 (English).