Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Category theory

From Wikipedia, the free encyclopedia
General theory of mathematical structures
icon
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Category theory" – news ·newspapers ·books ·scholar ·JSTOR
(November 2024) (Learn how and when to remove this message)
Schematic representation of three objects and three morphisms of a category, which form acommutative diagram

Category theory is a general theory ofmathematical structures and their relations. It was introduced bySamuel Eilenberg andSaunders Mac Lane in the mid-20th century in their foundational work onalgebraic topology.[1] Category theory is used in most areas of mathematics. In particular, many constructions of newmathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples includequotient spaces,direct products, completion, andduality.

Many areas ofcomputer science also rely on category theory, such asfunctional programming andsemantics.

Acategory is formed by two sorts ofobjects: theobjects of the category, and themorphisms, that relate two objects called thesource and thetarget of the morphism. A morphism is often represented by an arrow from its source to its target (see the figure). Morphisms can be composed if the target of the first morphism equals the source of the second one. Morphism composition has similar properties asfunction composition (associativity and existence of anidentity morphism for each object). Morphisms are often some sort offunctions, but this is not always the case. For example, amonoid may be viewed as a category with a single object, whose morphisms are the elements of the monoid.

The second fundamental concept of category theory is the concept of afunctor, which plays the role of a morphism between two categoriesC1{\displaystyle {\mathcal {C}}_{1}} andC2{\displaystyle {\mathcal {C}}_{2}}: it maps objects ofC1{\displaystyle {\mathcal {C}}_{1}} to objects ofC2{\displaystyle {\mathcal {C}}_{2}} and morphisms ofC1{\displaystyle {\mathcal {C}}_{1}} to morphisms ofC2{\displaystyle {\mathcal {C}}_{2}} in such a way that sources are mapped to sources, and targets are mapped to targets (or, in the case of acontravariant functor, sources are mapped to targets andvice-versa). A third fundamental concept is anatural transformation that may be viewed as a morphism of functors.

Categories, objects, and morphisms

[edit]
Main articles:Category (mathematics) andMorphism

Categories

[edit]

AcategoryC{\displaystyle {\mathcal {C}}} consists of the following three mathematical entities:

Examples

[edit]

Morphisms

[edit]

Relations among morphisms (such asfg =h) are often depicted usingcommutative diagrams, with "points" (corners) representing objects and "arrows" representing morphisms.

Morphisms can have any of the following properties. A morphismf :ab is:

  • amonomorphism (ormonic) iffg1 =fg2 impliesg1 =g2 for all morphismsg1,g2 :xa.
  • anepimorphism (orepic) ifg1f =g2f impliesg1 =g2 for all morphismsg1,g2 :bx.
  • abimorphism iff is both epic and monic.
  • anisomorphism if there exists a morphismg :ba such thatfg = 1b andgf = 1a.[c]
  • anendomorphism ifa =b. end(a) denotes the class of endomorphisms ofa.
  • anautomorphism iff is both an endomorphism and an isomorphism. aut(a) denotes the class of automorphisms ofa.
  • aretraction if a right inverse off exists, i.e. if there exists a morphismg :ba withfg = 1b.
  • asection if a left inverse off exists, i.e. if there exists a morphismg :ba withgf = 1a.

Every retraction is an epimorphism, and every section is a monomorphism. Furthermore, the following three statements are equivalent:

  • f is a monomorphism and a retraction;
  • f is an epimorphism and a section;
  • f is an isomorphism.

Functors

[edit]
Main article:Functor

Functors are structure-preserving maps between categories. They can be thought of as morphisms in the category of all (small) categories.

A (covariant) functorF from a categoryC to a categoryD, writtenF :CD, consists of:

  • for each objectx inC, an objectF(x) inD; and
  • for each morphismf :xy inC, a morphismF(f) :F(x) →F(y) inD,

such that the following two properties hold:

  • For every objectx inC,F(1x) = 1F(x);
  • For all morphismsf :xy andg :yz,F(gf) =F(g) ∘F(f).

Acontravariant functorF:CD is like a covariant functor, except that it "turns morphisms around" ("reverses all the arrows"). More specifically, every morphismf :xy inC must be assigned to a morphismF(f) :F(y) →F(x) inD. In other words, a contravariant functor acts as a covariant functor from theopposite categoryCop toD.

Natural transformations

[edit]
Main article:Natural transformation

Anatural transformation is a relation between two functors. Functors often describe "natural constructions" and natural transformations then describe "natural homomorphisms" between two such constructions. Sometimes two quite different constructions yield "the same" result; this is expressed by a natural isomorphism between the two functors.

IfF andG are (covariant) functors between the categoriesC andD, then a natural transformationη fromF toG associates to every objectX inC a morphismηX :F(X) →G(X) inD such that for every morphismf :XY inC, we haveηYF(f) =G(f) ∘ηX; this means that the following diagram iscommutative:

Commutative diagram defining natural transformations
Commutative diagram defining natural transformations

The two functorsF andG are callednaturally isomorphic if there exists a natural transformation fromF toG such thatηX is an isomorphism for every objectX inC.

Other concepts

[edit]

Universal constructions, limits, and colimits

[edit]
Main articles:Universal property andLimit (category theory)

Using the language of category theory, many areas of mathematical study can be categorized. Categories include sets, groups and topologies.

Each category is distinguished by properties that all its objects have in common, such as theempty set or theproduct of two topologies, yet in the definition of a category, objects are considered atomic, i.e., wedo not know whether an objectA is a set, a topology, or any other abstract concept. Hence, the challenge is to define special objects without referring to the internal structure of those objects. To define the empty set without referring to elements, or the product topology without referring to open sets, one can characterize these objects in terms of their relations to other objects, as given by the morphisms of the respective categories. Thus, the task is to finduniversal properties that uniquely determine the objects of interest.

Numerous important constructions can be described in a purely categorical way if thecategory limit can be developed and dualized to yield the notion of acolimit.

Equivalent categories

[edit]
Main articles:Equivalence of categories andIsomorphism of categories

It is a natural question to ask: under which conditions can two categories be consideredessentially the same, in the sense that theorems about one category can readily be transformed into theorems about the other category? The major tool one employs to describe such a situation is calledequivalence of categories, which is given by appropriate functors between two categories. Categorical equivalence has foundnumerous applications in mathematics.

Further concepts and results

[edit]

The definitions of categories and functors provide only the very basics of categorical algebra; additional important topics are listed below. Although there are strong interrelations between all of these topics, the given order can be considered as a guideline for further reading.

  • Thefunctor categoryDC has as objects the functors fromC toD and as morphisms the natural transformations of such functors. TheYoneda lemma is one of the most famous basic results of category theory; it describes representable functors in functor categories.
  • Duality: Every statement, theorem, or definition in category theory has adual which is essentially obtained by "reversing all the arrows". If one statement is true in a categoryC then its dual is true in the dual categoryCop. This duality, which is transparent at the level of category theory, is often obscured in applications and can lead to surprising relationships.
  • Adjoint functors: A functor can be left (or right) adjoint to another functor that maps in the opposite direction. Such a pair of adjoint functors typically arises from a construction defined by a universal property; this can be seen as a more abstract and powerful view on universal properties.

Higher-dimensional categories

[edit]
Main article:Higher category theory

Many of the above concepts, especially equivalence of categories, adjoint functor pairs, and functor categories, can be situated into the context ofhigher-dimensional categories. Briefly, if we consider a morphism between two objects as a "process taking us from one object to another", then higher-dimensional categories allow us to profitably generalize this by considering "higher-dimensional processes".

For example, a (strict)2-category is a category together with "morphisms between morphisms", i.e., processes which allow us to transform one morphism into another. We can then "compose" these "bimorphisms" both horizontally and vertically, and we require a 2-dimensional "exchange law" to hold, relating the two composition laws. In this context, the standard example isCat, the 2-category of all (small) categories, and in this example, bimorphisms of morphisms are simplynatural transformations of morphisms in the usual sense. Another basic example is to consider a 2-category with a single object; these are essentiallymonoidal categories.Bicategories are a weaker notion of 2-dimensional categories in which the composition of morphisms is not strictly associative, but only associative "up to" an isomorphism.

This process can be extended for allnatural numbersn, and these are calledn-categories. There is even a notion ofω-category corresponding to theordinal numberω.

Higher-dimensional categories are part of the broader mathematical field ofhigher-dimensional algebra, a concept introduced byRonald Brown. For a conversational introduction to these ideas, seeJohn Baez, 'A Tale ofn-categories' (1996).

Historical notes

[edit]
icon
This sectionneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources in this section. Unsourced material may be challenged and removed.(November 2015) (Learn how and when to remove this message)
Main article:Timeline of category theory and related mathematics

It should be observed first that the whole concept of a category is essentially an auxiliary one; our basic concepts are essentially those of a functor and of a natural transformation [...]

— Eilenberg andMac Lane (1945)[2]

Whilst specific examples of functors and natural transformations had been given bySamuel Eilenberg andSaunders Mac Lane in a 1942 paper ongroup theory,[3] these concepts were introduced in a more general sense, together with the additional notion of categories, in a 1945 paper by the same authors[2] (who discussed applications of category theory to the field ofalgebraic topology).[4] Their work was an important part of the transition from intuitive and geometrichomology tohomological algebra, Eilenberg and Mac Lane later writing that their goal was to understand natural transformations, which first required the definition of functors, then categories.

Stanislaw Ulam, and some writing on his behalf, have claimed that related ideas were current in the late 1930s in Poland.[citation needed] Eilenberg was Polish, and studied mathematics in Poland in the 1930s.[5] Category theory is also, in some sense, a continuation of the work ofEmmy Noether (one of Mac Lane's teachers) in formalizing abstract processes;[6] Noether realized that understanding a type of mathematical structure requires understanding the processes that preserve that structure (homomorphisms).[citation needed] Eilenberg and Mac Lane introduced categories for understanding and formalizing the processes (functors) that relatetopological structures to algebraic structures (topological invariants) that characterize them.

Category theory was originally introduced for the need ofhomological algebra, and widely extended for the need of modernalgebraic geometry (scheme theory). Category theory may be viewed as an extension ofuniversal algebra, as the latter studiesalgebraic structures, and the former applies to any kind ofmathematical structure and studies also the relationships between structures of different nature. For this reason, it is used throughout mathematics. Applications tomathematical logic andsemantics (categorical abstract machine) came later.

Certain categories calledtopoi (singulartopos) can even serve as an alternative toaxiomatic set theory as a foundation of mathematics. A topos can also be considered as a specific type of category with two additional topos axioms. These foundational applications of category theory have been worked out in fair detail as a basis for, and justification of,constructive mathematics.Topos theory is a form of abstractsheaf theory, with geometric origins, and leads to ideas such aspointless topology.

Categorical logic is now a well-defined field based ontype theory forintuitionistic logics, with applications infunctional programming anddomain theory, where acartesian closed category is taken as a non-syntactic description of alambda calculus. At the very least, category theoretic language clarifies what exactly these related areas have in common (in someabstract sense).

Category theory has been applied in other fields as well, seeapplied category theory. For example,John Baez has shown a link betweenFeynman diagrams inphysics and monoidal categories.[7] Another application of category theory, more specifically topos theory, has been made in mathematical music theory, see for example the bookThe Topos of Music, Geometric Logic of Concepts, Theory, and Performance byGuerino Mazzola.

More recent efforts to introduce undergraduates to categories as a foundation for mathematics include those ofLawvere & Rosebrugh (2003),[8] and Lawvere andStephen Schanuel (1997).

See also

[edit]

Notes

[edit]
  1. ^The name "hom" derives from the fact that the notion of morphism is a generalisation of the notion ofhomomorphism. But even in categories whose objects have no notion of homomorphism or where the morphisms are explicitly not (or not precisely) homomorphisms, the classeshom(a,b){\displaystyle {\text{hom}}(a,b)} are still referred to as hom-classes.
  2. ^Some authors compose in the opposite order, writingfg orfg forgf. Computer scientists using category theory very commonly writef ;g forgf
  3. ^A morphism that is both epic and monic is not necessarily an isomorphism. An elementary counterexample: in the category consisting of two objectsA andB, the identity morphisms, and a single morphismf fromA toB,f is both epic and monic but is not an isomorphism.

References

[edit]

Citations

[edit]
  1. ^Marquis, Jean-Pierre (2023),"Category Theory", in Zalta, Edward N.; Nodelman, Uri (eds.),The Stanford Encyclopedia of Philosophy (Fall 2023 ed.), Metaphysics Research Lab, Stanford University, retrieved2024-04-23
  2. ^abEilenberg, Samuel; Mac Lane, Saunders (1945)."General theory of natural equivalences"(PDF).Transactions of the American Mathematical Society.58: 247.doi:10.1090/S0002-9947-1945-0013131-6.ISSN 0002-9947.Archived(PDF) from the original on 2022-10-10.
  3. ^Eilenberg, S.; Mac Lane, S. (1942)."Group Extensions and Homology".Annals of Mathematics.43 (4):757–831.doi:10.2307/1968966.ISSN 0003-486X.JSTOR 1968966.
  4. ^Marquis, Jean-Pierre (2019)."Category Theory".Stanford Encyclopedia of Philosophy. Department of Philosophy,Stanford University. Retrieved26 September 2022.
  5. ^"Samuel Eilenberg – Biography".
  6. ^Reck, Erich (2020).The Prehistory of Mathematical Structuralism (1st ed.). Oxford University Press. pp. 215–219.ISBN 9780190641221.
  7. ^Baez, J.C.; Stay, M. (2010). "Physics, Topology, Logic and Computation: A Rosetta Stone".New Structures for Physics. Lecture Notes in Physics. Vol. 813. pp. 95–172.arXiv:0903.0340.doi:10.1007/978-3-642-12821-9_2.ISBN 978-3-642-12820-2.S2CID 115169297.
  8. ^Lawvere, F. William; Rosebrugh, Robert (2003).Sets for Mathematics. Cambridge University Press.ISBN 978-0-521-01060-3.

Sources

[edit]

Further reading

[edit]
  • Marquis, Jean-Pierre (2008).From a Geometrical Point of View: A Study of the History and Philosophy of Category Theory. Springer.ISBN 978-1-4020-9384-5.

External links

[edit]
This article'suse ofexternal links may not follow Wikipedia's policies or guidelines. Pleaseimprove this article by removingexcessive orinappropriate external links, and converting useful links where appropriate intofootnote references.(November 2025) (Learn how and when to remove this message)
Wikimedia Commons has media related toCategory theory.
Wikiquote has quotations related toCategory theory.
Majormathematics areas
Foundations
Algebra
Analysis
Discrete
Geometry
Number theory
Topology
Applied
Computational
Related topics
Key concepts
Key concepts
Universal constructions
Limits
Colimits
Algebraic categories
Constructions on categories
A simple triangular commutative diagram
Key concepts
n-categories
Weakn-categories
Strictn-categories
Categorified concepts
Note: This template roughly follows the 2012ACM Computing Classification System.
Hardware
Computer systems organization
Networks
Software organization
Software notations andtools
Software development
Theory of computation
Algorithms
Mathematics ofcomputing
Information systems
Security
Human-centered computing
Concurrency
Artificial intelligence
Machine learning
Graphics
Applied computing
Specialized PlatformDevelopment
Mathematical logic
Set theory
Type theory
Category theory
International
National
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=Category_theory&oldid=1323791847"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp