In the mathematical field of , the category of sets, denoted as Set, is the whose 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.
Many other categories (such as the , with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind.
The axioms of a category are satisfied by Set because composition of functions is associative, and because every set X has an identity function idX : X → X which serves as identity element for function composition.
The epimorphisms in Set are the surjective maps, the monomorphisms are the injective maps, and the s are the bijective maps.
The empty set serves as the initial object in Set with empty functions as morphisms. Every singleton is a terminal object, with the functions mapping all elements of the source sets to the single target element as morphisms. There are thus no zero objects in Set.
The category Set is . The in this category is given by the cartesian product of sets. The is given by the disjoint union: given sets Ai where i ranges over some index set I, we construct the coproduct as the union of Ai×{i} (the cartesian product with i serves to ensure that all the components stay disjoint).
Set is the prototype of a ; other categories are concrete if they are "built on" Set in some well-defined way.
Every two-element set serves as a subobject classifier in Set. The power object of a set A is given by its power set, and the exponential object of the sets A and B is given by the set of all functions from A to B. Set is thus a topos (and in particular and ).
Set is not , nor .
Every non-empty set is an injective object in Set. Every set is a projective object in Set (assuming the axiom of choice).
The in Set are the finite sets. Since every set is a direct limit of its finite subsets, the category Set is a .
If C is an arbitrary category, the contravariant functors from C to Set are often an important object of study.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
The course is based on Durrett's text book
Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
This course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
Learn to optimize on smooth, nonlinear spaces: Join us to build your foundations (starting at "what is a manifold?") and confidently implement your first algorithm (Riemannian gradient descent).
In the mathematical field of , the category of sets, denoted as Set, is the whose 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. Many other categories (such as the , with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind.
In mathematics, a category (sometimes called an abstract category to distinguish it from a ) 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 , whose objects are sets and whose arrows are functions. is a branch of mathematics that seeks to generalize all of mathematics in terms of categories, independent of what their objects and arrows represent.
In mathematics, particularly in , a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in analysis and topology, continuous functions, and so on.