In mathematics, a pointed set (also based set or rooted set) is an ordered pair where is a set and is an element of called the base point, also spelled basepoint.
Maps between pointed sets and —called based maps, pointed maps, or point-preserving maps—are functions from to that map one basepoint to another, i.e. maps such that . Based maps are usually denoted
Pointed sets are very simple algebraic structures. In the sense of universal algebra, a pointed set is a set together with a single nullary operation which picks out the basepoint. Pointed maps are the homomorphisms of these algebraic structures.
The class of all pointed sets together with the class of all based maps form a . In this category the pointed singleton sets are initial objects and terminal objects, i.e. they are zero objects. There is a faithful functor from pointed sets to usual sets, but it is not full and these categories are not equivalent. In particular, the empty set is not a pointed set because it has no element that can be chosen as the basepoint.
The category of pointed sets and based maps is equivalent to the category of sets and partial functions. The base point serves as a "default value" for those arguments for which the partial function is not defined. One textbook notes that "This formal completion of sets and partial maps by adding 'improper', 'infinite' elements was reinvented many times, in particular, in topology (one-point compactification) and in theoretical computer science."
The category of pointed sets and pointed maps is isomorphic to the (), where is (a functor that selects) a singleton set, and (the identity functor of) the . This coincides with the algebraic characterization, since the unique map extends the commutative triangles defining arrows of the coslice category to form the commutative squares defining homomorphisms of the algebras.
The category of pointed sets and pointed maps has both and coproducts, but it is not a . It is also an example of a category where is not isomorphic to .
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.
In mathematics, a comma category (a special case being a slice category) is a construction in . It provides another way of looking at morphisms: instead of simply relating objects of a to one another, morphisms become objects in their own right. This notion was introduced in 1963 by F. W. Lawvere (Lawvere, 1963 p. 36), although the technique did not become generally known until many years later. Several mathematical concepts can be treated as comma categories. Comma categories also guarantee the existence of some s and colimits.
In , a branch of abstract mathematics, an equivalence of categories is a relation between two that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned.
In , a branch of mathematics, an initial object of a C is an object I in C such that for every object X in C, there exists precisely one morphism I → X. The notion is that of a terminal object (also called terminal element): T is terminal if for every object X in C there exists exactly one morphism X → T. Initial objects are also called coterminal or universal, and terminal objects are also called final. If an object is both initial and terminal, it is called a zero object or null object.
We extend the group-theoretic notion of conditional flatness for a localization functor to any pointed category, and investigate it in the context of homological categories and of semi-abelian categories. In the presence of functorial fiberwise localizatio ...