Accessible category

Last updated

The theory of accessible categories is a part of mathematics, specifically of category theory. It attempts to describe categories in terms of the "size" (a cardinal number) of the operations needed to generate their objects.

Mathematics Field of study concerning quantity, patterns and change

Mathematics includes the study of such topics as quantity, structure (algebra), space (geometry), and change. It has no generally accepted definition.

Category theory logic and mathematics

Category theory formalizes mathematical structure and its concepts in terms of a labeled directed graph called a category, whose nodes are called objects, and whose labelled directed edges are called arrows. A category has two basic properties: the ability to compose the arrows associatively, and the existence of an identity arrow for each object. The language of category theory has been used to formalize concepts of other high-level abstractions such as sets, rings, and groups. Informally, category theory is a general theory of functions.

Cardinal number unit of measure for the cardinality (size) of sets

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. The transfinite cardinal numbers describe the sizes of infinite sets.

Contents

The theory originates in the work of Grothendieck completed by 1969 [1] , and Gabriel and Ulmer (1971) [2] . It has been further developed in 1989 by Michael Makkai and Robert Paré, with motivation coming from model theory, a branch of mathematical logic. [3] A standard text book by Adámek and Rosický appeared in 1994. [4] Accessible categories also have applications in homotopy theory. [5] [6] Grothendieck continued the development of the theory for homotopy-theoretic purposes in his (still partly unpublished) 1991 manuscript Les dérivateurs. [7] Some properties of accessible categories depend on the set universe in use, particularly on the cardinal properties and Vopěnka's principle. [8]

Alexander Grothendieck French mathematician

Alexander Grothendieck was a mathematician who became the leading figure in the creation of modern algebraic geometry. His research extended the scope of the field and added elements of commutative algebra, homological algebra, sheaf theory and category theory to its foundations, while his so-called "relative" perspective led to revolutionary advances in many areas of pure mathematics. He is considered by many to be the greatest mathematician of the 20th century.

Michael Makkai is Canadian mathematician of Hungarian origin, specializing in mathematical logic. He works in model theory, category theory, algebraic logic, type theory and the theory of topoi.

In mathematics, model theory is the study of classes of mathematical structures from the perspective of mathematical logic. The objects of study are models of theories in a formal language. A set of sentences in a formal language is one of the components that form a theory. A model of a theory is a structure that satisfies the sentences of that theory.

-directed colimits and -presentable objects

Let be an infinite regular cardinal, i.e. a cardinal number that is not the sum of a smaller number of smaller cardinals; examples are (aleph-0), the first infinite cardinal number, and , the first uncountable cardinal). A partially ordered set is called -directed if every subset of of cardinality less than has an upper bound in . In particular, the ordinary directed sets are precisely the -directed sets.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. So, crudely speaking, a regular cardinal is one that cannot be broken into a smaller collection of smaller parts.

Aleph number infinite cardinal number

In mathematics, and in particular set theory, the aleph numbers are a sequence of numbers used to represent the cardinality of infinite sets that can be well-ordered. They are named after the symbol used to denote them, the Hebrew letter aleph.

Partially ordered set set ordered by a transitive, antisymmetric, and reflexive binary relation

In mathematics, especially order theory, a partially ordered set formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word partial in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable.

Now let be a category. A direct limit (also known as a directed colimit) over a -directed set is called a -directed colimit. An object of is called -presentable if the Hom functor preserves all -directed colimits in . It is clear that every -presentable object is also -presentable whenever , since every -directed colimit is also a -directed colimit in that case. A -presentable object is called finitely presentable.

Category (mathematics) algebraic structure

In mathematics, a category is a collection of "objects" that are linked by "arrows". A category has two basic properties: the ability to compose the arrows associatively and the existence of an identity arrow for each object. A simple example is the category of sets, whose objects are sets and whose arrows are functions.

In mathematics, a direct limit is a way to construct a object from many objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any category. The way they are put together is specified by a system of homomorphisms between those smaller objects. The direct limit of the objects , where ranges over some directed set , is denoted by .

In mathematics, specifically in category theory, hom-sets, i.e. sets of morphisms between objects, give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics.

Examples

In the mathematical field of category theory, the category of sets, denoted as Set, is the category whose objects are sets. The arrows or morphisms between sets A and B are the total functions from A to B, and the composition of morphisms is the composition of functions.

Category of groups category in mathematics

In mathematics, the category Grp has the class of all groups for objects and group homomorphisms for morphisms. As such, it is a concrete category. The study of this category is known as group theory.

-accessible and locally presentable categories

The category is called -accessible provided that:

An -accessible category is called finitely accessible. A category is called accessible if it is -accessible for some infinite regular cardinal . When an accessible category is also cocomplete, it is called locally presentable.

A functor between -accessible categories is called -accessible provided that preserves -directed colimits.

Examples

Theorems

One can show that every locally presentable category is also complete. [9] Furthermore, a category is locally presentable if and only if it is equivalent to the category of models of a limit sketch. [10]

Adjoint functors between locally presentable categories have a particularly simple characterization. A functor between locally presentable categories:

Notes

  1. Grothendieck, Alexander; et al. (1972), Théorie des Topos et Cohomologie Étale des Schémas, Lecture Notes in Mathematics 269, Springer
  2. Gabriel, P; Ulmer, F (1971), Lokal Präsentierbare Kategorien, Lecture Notes in Mathematics 221, Springer
  3. Makkai, Michael; Paré, Robert (1989), Accessible categories: The foundation of Categorical Model Theory, Contemporary Mathematics, AMS, ISBN   0-8218-5111-X
  4. Adamek/Rosický 1994
  5. J. Rosický "On combinatorial model categories", arXiv , 16 August 2007. Retrieved on 19 January 2008.
  6. Rosický, J. "Injectivity and accessible categories." Cubo Matem. Educ 4 (2002): 201-211.
  7. Grothendieck, Alexander (1991), Les dérivateurs, Contemporary Mathematics, manuscript (Les Dérivateurs: Texte d'Alexandre Grothendieck. Édité par M. Künzer, J. Malgoire, G. Maltsiniotis)
  8. Adamek/Rosický 1994, chapter 6
  9. Adamek/Rosický 1994, remark 1.56
  10. Adamek/Rosický 1994, corollary 1.52

Related Research Articles

In mathematics, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:

There is no set whose cardinality is strictly between that of the integers and the real numbers.

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

In mathematics, an uncountable set is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than that of the set of all natural numbers.

In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from another cardinal by repeated successor operations. These cardinals are sometimes called simply "limit cardinals" when the context is clear.

In mathematics, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written , where is the second Hebrew letter (beth). The beth numbers are related to the aleph numbers, but there may be numbers indexed by that are not indexed by .

In mathematics, a Grothendieck universe is a set U with the following properties:

  1. If x is an element of U and if y is an element of x, then y is also an element of U.
  2. If x and y are both elements of U, then is an element of U.
  3. If x is an element of U, then P(x), the power set of x, is also an element of U.
  4. If is a family of elements of U, and if I is an element of U, then the union is an element of U.

This is a glossary of properties and concepts in category theory in mathematics.

In mathematics, Vopěnka's principle is a large cardinal axiom. The intuition behind the axiom is that the set-theoretical universe is so large that in every proper class, some members are similar to others, with this similarity formalized through elementary embeddings.

In category theory, filtered categories generalize the notion of directed set understood as a category. There is a dual notion of cofiltered category which will be recalled below.

In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the continuum and combinatorics on successors of singular cardinals.

In the mathematical theory of categories, a sketch is a category D, together with a set of cones intended to be limits and a set of cocones intended to be colimits. A model of the sketch in a category C is a functor

In mathematics, a topos is a category that behaves like the category of sheaves of sets on a topological space. Topoi behave much like the category of sets and possess a notion of localization; they are a direct generalization of point-set topology. The Grothendieck topoi find applications in algebraic geometry; the more general elementary topoi are used in logic.

In mathematics, a Grothendieck category is a certain kind of abelian category, introduced in Alexander Grothendieck's Tôhoku paper of 1957 in order to develop the machinery of homological algebra for modules and for sheaves in a unified manner. The theory of these categories was further developed in Pierre Gabriel's seminal thèse in 1962.

In Category theory, the notion of final functor is a generalization of the notion of final object in a category.

In category theory, a branch of mathematics, the inserter category is a variation of the comma category where the two functors are required to have the same domain category.

In mathematics, compact objects, also referred to as finitely presented objects, or objects of finite presentation, are objects in a category satisfying a certain finiteness condition.

In mathematics, the ind-completion or ind-construction is the process of freely adding filtered colimits to a given category C. The objects in this ind-completed category, denoted Ind(C), are known as direct systems, they are functors from a small filtered category I to C.

References