Hubbry Logo
SubobjectSubobjectMain
Open search
Subobject
Community hub
Subobject
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something
Subobject
Subobject
from Wikipedia

In category theory, a branch of mathematics, a subobject is, roughly speaking, an object that sits inside another object in the same category. The notion is a generalization of concepts such as subsets from set theory, subgroups from group theory,[1] and subspaces from topology. Since the detailed structure of objects is immaterial in category theory, the definition of subobject relies on a morphism that describes how one object sits inside another, rather than relying on the use of elements.

The dual concept to a subobject is a quotient object. This generalizes concepts such as quotient sets, quotient groups, quotient spaces, quotient graphs, etc.

Definitions

[edit]

An appropriate categorical definition of "subobject" may vary with context, depending on the goal. One common definition is as follows.

In detail, let be an object of some category. Given two monomorphisms

with codomain , we define an equivalence relation by if there exists an isomorphism with .

Equivalently, we write if factors through —that is, if there exists such that . The binary relation defined by

is an equivalence relation on the monomorphisms with codomain , and the corresponding equivalence classes of these monomorphisms are the subobjects of .

The relation ≤ induces a partial order on the collection of subobjects of .

The collection of subobjects of an object may in fact be a proper class; this means that the discussion given is somewhat loose. If the subobject-collection of every object is a set, the category is called well-powered or, rarely, locally small (this clashes with a different usage of the term locally small, namely that there is a set of morphisms between any two objects).

To get the dual concept of quotient object, replace "monomorphism" by "epimorphism" above and reverse arrows. A quotient object of A is then an equivalence class of epimorphisms with domain A.

However, in some contexts these definitions are inadequate as they do not concord with well-established notions of subobject or quotient object. In the category of topological spaces, monomorphisms are precisely the injective continuous functions; but not all injective continuous functions are subspace embeddings. In the category of rings, the inclusion is an epimorphism but is not the quotient of by a two-sided ideal. To get maps which truly behave like subobject embeddings or quotients, rather than as arbitrary injective functions or maps with dense image, one must restrict to monomorphisms and epimorphisms satisfying additional hypotheses. Therefore, one might define a "subobject" to be an equivalence class of so-called "regular monomorphisms" (monomorphisms which can be expressed as an equalizer of two morphisms) and a "quotient object" to be any equivalence class of "regular epimorphisms" (morphisms which can be expressed as a coequalizer of two morphisms)

Interpretation

[edit]

This definition corresponds to the ordinary understanding of a subobject outside category theory. When the category's objects are sets (possibly with additional structure, such as a group structure) and the morphisms are set functions (preserving the additional structure), one thinks of a monomorphism in terms of its image. An equivalence class of monomorphisms is determined by the image of each monomorphism in the class; that is, two monomorphisms f and g into an object T are equivalent if and only if their images are the same subset (thus, subobject) of T. In that case there is the isomorphism of their domains under which corresponding elements of the domains map by f and g, respectively, to the same element of T; this explains the definition of equivalence.

Examples

[edit]

In Set, the category of sets, a subobject of A corresponds to a subset B of A, or rather the collection of all maps from sets equipotent to B with image exactly B. The subobject partial order of a set in Set is just its subset lattice.

In Grp, the category of groups, the subobjects of A correspond to the subgroups of A.

Given a partially ordered class P = (P, ≤), we can form a category with the elements of P as objects, and a single arrow from p to q iff pq. If P has a greatest element, the subobject partial order of this greatest element will be P itself. This is in part because all arrows in such a category will be monomorphisms.

A subobject of a terminal object is called a subterminal object.

See also

[edit]

Notes

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In , a subobject of an object YY in a category C\mathcal{C} is defined as an of monomorphisms with YY, where two monomorphisms f:XYf: X \to Y and g:ZYg: Z \to Y are equivalent if there exists an h:XZh: X \to Z such that gh=fg \circ h = f. This structure generalizes the notion of a or substructure in concrete categories, such as subsets in the (where monomorphisms are injective functions) or subgroups in the category of groups. Subobjects capture "inclusions" or "parts" of an object in a way that respects the categorical framework, where direct reference to elements is avoided in favor of morphisms. They form a (poset) under inclusion, defined by the existence of a between representatives of two subobjects, allowing for operations like intersections (via limits of the relevant diagram) and unions in certain categories. In the , every subobject corresponds uniquely to a via its , and the poset of subobjects is isomorphic to the power set ordered by inclusion. A central role for subobjects arises in the study of toposes, where the subobject classifier Ω\Omega—an object that classifies all subobjects via characteristic morphisms—enables the internal logic of the category, analogous to truth values in . For instance, in the category of sets, Ω\Omega is the two-element set {true, false}, and subobjects biject with functions to Ω\Omega. Subobjects are also stable under pullbacks in many categories, preserving their structure under limits, and they dualize to quotient objects, highlighting category theory's duality principles. These properties make subobjects foundational for advanced topics, including exact categories, sheaf theory, and the semantics of logic within categories.

Core Concepts

Definition

In , a subobject of an object CC in a category C\mathcal{C} is formally defined as an of monomorphisms with CC. Specifically, given monomorphisms m:ACm: A \to C and m:ACm': A' \to C, they represent the same subobject if there exists an i:AAi: A \to A' such that mi=mm' \circ i = m. This identifies monomorphisms that are "essentially the same" up to isomorphism in their domains, allowing subobjects to capture injective embeddings in a category-independent manner. A m:ACm: A \to C is a that is left-cancellative: for any object XX and any pair of morphisms f,g:XAf, g: X \to A, if mf=mgm \circ f = m \circ g, then f=gf = g. This property ensures that mm embeds AA into CC without "collapsing" distinct elements from AA, analogous to injectivity in categories. Monomorphisms form the basis for subobjects by providing the arrows whose equivalence classes define them. Subobjects are commonly denoted using the equivalence class notation [m:AC][m: A \hookrightarrow C], where the hook arrow \hookrightarrow indicates that mm is a . This notation highlights the representative monic morphism and its domain while abstracting away isomorphic variants.

Equivalence Relation on Monomorphisms

In , the notion of a subobject is refined by imposing an on the class of monomorphisms with a fixed . Specifically, two monomorphisms m:ACm: A \to C and m:ACm': A' \to C are deemed equivalent—and thus represent the same subobject—if there exists an i:AAi: A \to A' such that m=mim = m' \circ i. This relation partitions the monomorphisms into , each class identifying a unique subobject up to isomorphism. This ensures that subobjects are intrinsically defined, independent of the particular choice of representative object or embedding morphism, thereby emphasizing the categorical "" or embedded structure rather than any specific realization. By quotienting the monomorphisms in this manner, the captures the essential notion of a substructure in a way that is robust across isomorphic variants, aligning with the abstract goals of . Monomorphisms here function as the categorical analogue of injective functions, generalizing the idea of embeddings without presupposing underlying elements.

Interpretations and Motivations

Relation to Classical Substructures

In the , denoted Set, subobjects of an object CC correspond precisely to the subsets of CC. Specifically, each ACA \subseteq C determines a subobject via the inclusion monomorphism i:ACi: A \hookrightarrow C, and two such monomorphisms represent the same subobject if they are related by an making the appropriate triangle commute, thereby identifying isomorphic copies of the same . This notion extends naturally to other classical structures. In the category of groups, Grp, subobjects of a group GG are the subgroups of GG, realized through inclusion monomorphisms that embed a subgroup injectively into GG. Similarly, in the category of vector spaces over a field kk, denoted Vect_k, subobjects of a vector space VV correspond to its subspaces, via monomorphisms that are linear injections preserving the vector space structure. Subobjects thus offer a unified categorical framework for conceptualizing "substructures" or "parts" of objects across diverse mathematical domains, independent of any underlying set of elements. This is particularly valuable in categories lacking a global choice of elements or where direct element-wise descriptions are unavailable, allowing for consistent treatment via morphisms alone.

Categorical Perspective

In , subobjects formalize the notion of "parts" of an object in a manner that is invariant under , defined as equivalence classes of monomorphisms with a common . This abstraction allows for the categorical construction of and exact sequences via universal properties, particularly through kernels and . In pointed categories, the kernel of a f:ABf: A \to B is the subobject kerfA\ker f \hookrightarrow A that ff and the zero morphism, satisfying the universal property that any other such equalizer factors uniquely through it. Similarly, the cokernel provides the dual universal quotient. In abelian categories, this enables the definition of exactness as the coincidence of an image subobject with a kernel subobject. The non-elementary nature of subobjects distinguishes them from the set-theoretic case, where inclusions suffice; in general categories, monomorphisms may represent more structured embeddings, such as regular monomorphisms that preserve additional categorical features without relying on global elements or pointwise inclusions. This generality ensures that subobjects adapt to the ambient category's logic, avoiding dependence on extraneous set-like operations. In , subobjects are indispensable for classifying extensions and short exact sequences, as in 0MEN00 \to M \to E \to N \to 0, where the subobject MEM \hookrightarrow E identifies the kernel, and equivalence classes of such extensions correspond bijectively to elements in Ext groups, providing a measure of how NN extends MM. This framework underpins derived functors and homological invariants, treating subobjects as the building blocks for sequence exactness and resolution theory. Philosophically, subobjects underscore category theory's morphism-centric paradigm, prioritizing relational structures defined by arrows over intrinsic object properties, thereby unifying diverse mathematical contexts through diagrammatic universality rather than elemental inspection.

Examples

In the Category of Sets

In the , denoted Set\mathbf{Set}, subobjects of an object CC are defined as isomorphism classes of into CC. A in Set\mathbf{Set} is an , and thus every subobject corresponds to the of such an injection, which is a of CC. Specifically, for any ACA \subseteq C, the iA:ACi_A: A \to C defined by iA(a)=ai_A(a) = a for all aAa \in A is a , providing a representative for the subobject associated to AA. Conversely, every monomorphism m:BCm: B \to C in Set\mathbf{Set} is isomorphic to the inclusion map of its image im(m)={m(b)bB}C\operatorname{im}(m) = \{m(b) \mid b \in B\} \subseteq C. Here, the isomorphism arises from the fact that mm factors uniquely as Bim(m)CB \xrightarrow{\sim} \operatorname{im}(m) \hookrightarrow C
Add your contribution
Related Hubs
Contribute something
User Avatar
No comments yet.