Global Information Lookup Global Information

Category of preordered sets information


In mathematics, the category Ord has preordered sets as objects and order-preserving functions as morphisms. This is a category because the composition of two order-preserving functions is order preserving and the identity map is order preserving.

The monomorphisms in Ord are the injective order-preserving functions.

The empty set (considered as a preordered set) is the initial object of Ord, and the terminal objects are precisely the singleton preordered sets. There are thus no zero objects in Ord.

The categorical product in Ord is given by the product order on the cartesian product.

We have a forgetful functor OrdSet that assigns to each preordered set the underlying set, and to each order-preserving function the underlying function. This functor is faithful, and therefore Ord is a concrete category. This functor has a left adjoint (sending every set to that set equipped with the equality relation) and a right adjoint (sending every set to that set equipped with the total relation).

and 23 Related for: Category of preordered sets information

Request time (Page generated in 1.0355 seconds.)

Category of preordered sets

Last Update:

empty set (considered as a preordered set) is the initial object of Ord, and the terminal objects are precisely the singleton preordered sets. There...

Word Count : 300

Preorder

Last Update:

order – preorder that is antisymmetric and total Directed set Category of preordered sets Prewellordering Well-quasi-ordering For "proset", see e.g....

Word Count : 3351

Alexandrov topology

Last Update:

category of sets and maps. Let Top denote the category of topological spaces and continuous maps; and let Pro denote the category of preordered sets and monotone...

Word Count : 2160

Outline of category theory

Last Update:

spaces Category of sets and relations Category of topological spaces Category of metric spaces Category of preordered sets Category of groups Category of abelian...

Word Count : 402

Ord

Last Update:

U.S. Ord, the category of preordered sets Ord, the proper class of all ordinal numbers ord(V), the order type of a well-ordered set V ordn(a), the multiplicative...

Word Count : 275

Posetal category

Last Update:

amounts to a preordered class (or a preordered set, if its objects form a set). As suggested by the name, the further requirement that the category be skeletal...

Word Count : 320

Partially ordered set

Last Update:

called topological sorting. Every poset (and every preordered set) may be considered as a category where, for objects x {\displaystyle x} and y , {\displaystyle...

Word Count : 5396

Preordered class

Last Update:

common in a set theory are no longer possible in this framework. Equivalently, a preordered class is a thin category, that is, a category with at most...

Word Count : 228

Ordered field

Last Update:

A preordered field is a field equipped with a preordering P . {\displaystyle P.} Its non-zero elements P ∗ {\displaystyle P^{*}} form a subgroup of the...

Word Count : 2208

Directed set

Last Update:

element of a directed preordered set is a greatest element. Indeed, a directed preordered set is characterized by equality of the (possibly empty) sets of maximal...

Word Count : 2671

Monoidal category

Last Update:

representation categories of linear algebraic groups. A preordered monoid is a monoidal category in which for every two objects c , c ′ ∈ O b ( C ) {\displaystyle...

Word Count : 2389

Interior algebra

Last Update:

in an interior algebra of the form B(X) for some preordered set X giving the above-mentioned representation as a field of sets (a preorder field). This...

Word Count : 3849

Enriched category

Last Update:

In category theory, a branch of mathematics, an enriched category generalizes the idea of a category by replacing hom-sets with objects from a general...

Word Count : 1966

Continuous poset

Last Update:

approximating it. Let a , b ∈ P {\displaystyle a,b\in P} be two elements of a preordered set ( P , ≲ ) {\displaystyle (P,\lesssim )} . Then we say that a {\displaystyle...

Word Count : 1156

Finite topological space

Last Update:

finitely many open sets (and only finitely many closed sets). A topology on a finite set can also be thought of as a sublattice of ( P ( X ) , ⊂ ) {\displaystyle...

Word Count : 2613

Upper set

Last Update:

to some element of S is necessarily also an element of S. Let ( X , ≤ ) {\displaystyle (X,\leq )} be a preordered set. An upper set in X {\displaystyle...

Word Count : 1291

Field of sets

Last Update:

(X,\leq )} is a preordered set and ( X , F ) {\displaystyle (X,{\mathcal {F}})} is a field of sets. Like the topological fields of sets, preorder fields...

Word Count : 3674

Riesz space

Last Update:

{\displaystyle b} of S , {\displaystyle S,} a ≤ b {\displaystyle a\leq b} (resp. a ≥ b {\displaystyle a\geq b} ). A preordered vector lattice is a preordered vector...

Word Count : 5296

Ordered vector space

Last Update:

{\displaystyle \,\leq \,} on the set X , {\displaystyle X,} the pair ( X , ≤ ) {\displaystyle (X,\leq )} is called a preordered vector space and we say that...

Word Count : 3901

Order theory

Last Update:

contains upper bounds of finite subsets, but does not have to be a lower set. Furthermore, it is often generalized to preordered sets. A subset which is...

Word Count : 4508

Galois connection

Last Update:

defined on preordered sets or classes; this article presents the common case of posets. The literature contains two closely related notions of "Galois connection"...

Word Count : 4173

Constant function

Last Update:

y'(x)=\left(x\mapsto -{\sqrt {2}}\right)'=0} . For functions between preordered sets, constant functions are both order-preserving and order-reversing;...

Word Count : 985

Product order

Last Update:

\varnothing } is a set and for every a ∈ A , {\displaystyle a\in A,} ( I a , ≤ ) {\displaystyle \left(I_{a},\leq \right)} is a preordered set. Then the product...

Word Count : 644

PDF Search Engine © AllGlobal.net