HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, the ind-completion or ind-construction is the process of freely adding
filtered colimit In category theory, filtered categories generalize the notion of directed set understood as a category (hence called a directed category; while some use directed category as a synonym for a filtered category). There is a dual notion of cofiltered c ...
s to a given
category Category, plural categories, may refer to: General uses *Classification, the general act of allocating things to classes/categories Philosophy * Category of being * ''Categories'' (Aristotle) * Category (Kant) * Categories (Peirce) * Category ( ...
''C''. The objects in this ind-completed category, denoted Ind(''C''), are known as direct systems, they are
functor In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) ar ...
s from a small
filtered category In category theory, filtered categories generalize the notion of directed set understood as a category (hence called a directed category; while some use directed category as a synonym for a filtered category). There is a dual notion of cofiltered c ...
''I'' to ''C''. The
dual Dual or Duals may refer to: Paired/two things * Dual (mathematics), a notion of paired concepts that mirror one another ** Dual (category theory), a formalization of mathematical duality *** see more cases in :Duality theories * Dual number, a nu ...
concept is the pro-completion, Pro(''C'').


Definitions


Filtered categories

Direct systems depend on the notion of ''filtered categories''. For example, the category N, whose objects are
natural number In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers , while others start with 1, defining them as the positive in ...
s, and with exactly one morphism from ''n'' to ''m'' whenever n \le m, is a filtered category.


Direct systems

A ''direct system'' or an ''ind-object'' in a category ''C'' is defined to be a functor :F : I \to C from a small filtered category ''I'' to ''C''. For example, if ''I'' is the category N mentioned above, this datum is equivalent to a sequence :X_0 \to X_1 \to \cdots of objects in ''C'' together with morphisms as displayed.


The ind-completion

Ind-objects in ''C'' form a category ind-''C''. Two ind-objects : F:I\to C and G:J\to C determine a functor :''I''op x ''J'' \to ''Sets'', namely the functor :\operatorname_C(F(i),G(j)). The set of morphisms between ''F'' and ''G'' in Ind(''C'') is defined to be the colimit of this functor in the second variable, followed by the limit in the first variable: :\operatorname_(F,G) = \lim_i \operatorname_j \operatorname_C(F(i), G(j)). More colloquially, this means that a morphism consists of a collection of maps F(i) \to G(j_i) for each ''i'', where j_i is (depending on ''i'') large enough.


Relation between ''C'' and Ind(''C'')

The final category I = consisting of a single object * and only its
identity morphism In mathematics, a morphism is a concept of category theory that generalizes structure-preserving maps such as homomorphism between algebraic structures, functions from a set to another set, and continuous functions between topological spaces. Alt ...
is an example of a filtered category. In particular, any object ''X'' in ''C'' gives rise to a functor :\ \to C, * \mapsto X and therefore to a functor :C \to \operatorname(C), X \mapsto (* \mapsto X). This functor is, as a direct consequence of the definitions, fully faithful. Therefore Ind(''C'') can be regarded as a larger category than ''C''. Conversely, there need not in general be a natural functor :\operatorname(C) \to C. However, if ''C'' possesses all
filtered colimit In category theory, filtered categories generalize the notion of directed set understood as a category (hence called a directed category; while some use directed category as a synonym for a filtered category). There is a dual notion of cofiltered c ...
s (also known as direct limits), then sending an ind-object F: I \to C (for some filtered category ''I'') to its colimit :\operatorname _I F(i) does give such a functor, which however is not in general an equivalence. Thus, even if ''C'' already has all filtered colimits, Ind(''C'') is a strictly larger category than ''C''. Objects in Ind(''C'') can be thought of as formal direct limits, so that some authors also denote such objects by : \text\varinjlim_ \text F(i). This notation is due to
Pierre Deligne Pierre René, Viscount Deligne (; born 3 October 1944) is a Belgian mathematician. He is best known for work on the Weil conjectures, leading to a complete proof in 1973. He is the winner of the 2013 Abel Prize, 2008 Wolf Prize, 1988 Crafoor ...
.


Universal property of the ind-completion

The passage from a category ''C'' to Ind(''C'') amounts to freely adding filtered colimits to the category. This is why the construction is also referred to as the ''ind-completion'' of ''C''. This is made precise by the following assertion: any functor F: C \to D taking values in a category ''D'' that has all filtered colimits extends to a functor Ind(C) \to D that is uniquely determined by the requirements that its value on ''C'' is the original functor ''F'' and such that it preserves all filtered colimits.


Basic properties of ind-categories


Compact objects

Essentially by design of the morphisms in Ind(''C''), any object ''X'' of ''C'' is
compact Compact as used in politics may refer broadly to a pact or treaty; in more specific cases it may refer to: * Interstate compact, a type of agreement used by U.S. states * Blood compact, an ancient ritual of the Philippines * Compact government, a t ...
when regarded as an object of Ind(''C''), i.e., the corepresentable functor :\operatorname_(X, -) preserves filtered colimits. This holds true no matter what ''C'' or the object ''X'' is, in contrast to the fact that ''X'' need not be compact in ''C''. Conversely, any compact object in Ind(''C'') arises as the image of an object in ''X''. A category ''C'' is called compactly generated, if it is equivalent to \operatorname(C_0) for some small category C_0. The ind-completion of the category
FinSet In the mathematical field of category theory, FinSet is the category whose objects are all finite sets and whose morphisms are all functions between them. FinOrd is the category whose objects are all finite ordinal numbers and whose morphisms are ...
of ''finite'' sets is the category of ''all'' sets. Similarly, if ''C'' is the category of finitely generated groups, ''ind-C'' is equivalent to the category of all groups.


Recognizing ind-completions

These identifications rely on the following facts: as was mentioned above, any functor F: C \to D taking values in a category ''D'' that has all filtered colimits, has an extension :\tilde F: \operatorname(C) \to D, that preserves filtered colimits. This extension is unique up to equivalence. First, this functor \tilde F is essentially surjective if any object in ''D'' can be expressed as a filtered colimits of objects of the form F(c) for appropriate objects ''c'' in ''C''. Second, \tilde F is
fully faithful In category theory, a faithful functor is a functor that is injective on hom-sets, and a full functor is surjective on hom-sets. A functor that has both properties is called a fully faithful functor. Formal definitions Explicitly, let ''C'' and ' ...
if and only if the original functor ''F'' is fully faithful and if ''F'' sends arbitrary objects in ''C'' to ''compact'' objects in ''D''. Applying these facts to, say, the inclusion functor :F: \operatorname \subset \operatorname, the equivalence :\operatorname(\operatorname) \cong \operatorname expresses the fact that any set is the filtered colimit of finite sets (for example, any set is the union of its finite subsets, which is a filtered system) and moreover, that any finite set is compact when regarded as an object of ''Set''.


The pro-completion

Like other categorical notions and constructions, the ind-completion admits a dual known as the pro-completion: the pro-completion Pro(''C'') can defined in terms of the ind-completion as : \operatorname(C) := \operatorname(C^)^. (The original definition of pro-''C'' is due to .) Therefore, the objects of Pro(''C'') are or in ''C''. By definition, these are direct system in the
opposite category In category theory, a branch of mathematics, the opposite category or dual category C^ of a given Category (mathematics), category C is formed by reversing the morphisms, i.e. interchanging the source and target of each morphism. Doing the reversal ...
C^ or, equivalently, functors :F: I \to C from a small category ''I''.


Examples of pro-categories

While Pro(''C'') exists for any category ''C'', several special cases are noteworthy because of connections to other mathematical notions. *If ''C'' is the category of
finite group In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving tra ...
s, then ''pro-C'' is equivalent to the category of
profinite group In mathematics, a profinite group is a topological group that is in a certain sense assembled from a system of finite groups. The idea of using a profinite group is to provide a "uniform", or "synoptic", view of an entire system of finite groups. ...
s and continuous homomorphisms between them. *The process of endowing a
preordered set In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. The name is meant to suggest that preorders are ''almost'' partial orders, but not quite, as they are not necessar ...
with its
Alexandrov topology In general topology, an Alexandrov topology is a topology in which the intersection of an ''arbitrary'' family of open sets is open (while the definition of a topology only requires this for a ''finite'' family). Equivalently, an Alexandrov top ...
yields an equivalence of the pro-category of the category of finite preordered sets, \operatorname(\operatorname), with the category of spectral topological spaces and quasi-compact morphisms. *
Stone duality In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they ...
asserts that the pro-category \operatorname(\operatorname) of the
category of finite sets In the mathematical field of category theory, FinSet is the category whose objects are all finite sets and whose morphisms are all functions between them. FinOrd is the category whose objects are all finite ordinal numbers and whose morphisms are ...
is equivalent to the category of
Stone space In topology and related areas of mathematics, a Stone space, also known as a profinite space or profinite set, is a compact Hausdorff totally disconnected space. Stone spaces are named after Marshall Harvey Stone who introduced and studied them i ...
s. The appearance of topological notions in these pro-categories can be traced to the equivalence, which is itself a special case of Stone duality, :\operatorname^ = \operatorname which sends a finite set to the
power set In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is po ...
(regarded as a finite Boolean algebra). The duality between pro- and ind-objects and known description of ind-completions also give rise to descriptions of certain opposite categories. For example, such considerations can be used to show that the opposite category of the
category of vector spaces In algebra, given a ring ''R'', the category of left modules over ''R'' is the category whose objects are all left modules over ''R'' and whose morphisms are all module homomorphisms between left ''R''-modules. For example, when ''R'' is the rin ...
(over a fixed field) is equivalent to the category of linearly compact vector spaces and continuous linear maps between them.


Applications

Pro-completions are less prominent than ind-completions, but applications include shape theory. Pro-objects also arise via their connection to pro-representable functors, for example in
Grothendieck's Galois theory In mathematics, Grothendieck's Galois theory is an abstract approach to the Galois theory of fields, developed around 1960 to provide a way to study the fundamental group of algebraic topology in the setting of algebraic geometry. It provides, in th ...
, and also in Schlessinger's criterion in
deformation theory In mathematics, deformation theory is the study of infinitesimal conditions associated with varying a solution ''P'' of a problem to slightly different solutions ''P''ε, where ε is a small number, or a vector of small quantities. The infinitesima ...
.


Related notions

Tate objects are a mixture of ind- and pro-objects.


Infinity-categorical variants

The ind-completion (and, dually, the pro-completion) has been extended to
∞-categories In mathematics, more specifically category theory, a quasi-category (also called quasicategory, weak Kan complex, inner Kan complex, infinity category, ∞-category, Boardman complex, quategory) is a generalization of the notion of a category. Th ...
by .


See also

* * *
completions in category theory In category theory, a branch of mathematics, there are several ways (completions) to enlarge a given category in a way somehow analogous to a completion in topology. These are (ignoring the set-theoretic matters for simplicity): *free cocompletion, ...


Notes


References

* * . * * * * * * {{DEFAULTSORT:Inverse System Functors Limits (category theory)