Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Cofinal (mathematics)
In mathematics, a subset of a preordered set is said to be cofinal or frequent in if for every it is possible to find an element in that dominates (formally, ).
Cofinal subsets are very important in the theory of directed sets and nets, where “cofinal subnet” is the appropriate generalization of "subsequence". They are also important in order theory, including the theory of cardinal numbers, where the minimum possible cardinality of a cofinal subset of is referred to as the cofinality of
Let be a homogeneous binary relation on a set A subset is said to be cofinal or frequent with respect to if it satisfies the following condition:
A subset that is not frequent is called infrequent. This definition is most commonly applied when is a directed set, which is a preordered set with additional properties.
A map between two directed sets is said to be final if the image of is a cofinal subset of
A subset is said to be coinitial (or dense in the sense of forcing) if it satisfies the following condition:
This is the order-theoretic dual to the notion of cofinal subset. Cofinal (respectively coinitial) subsets are precisely the dense sets with respect to the right (respectively left) order topology.
The cofinal relation over partially ordered sets ("posets") is reflexive: every poset is cofinal in itself. It is also transitive: if is a cofinal subset of a poset and is a cofinal subset of (with the partial ordering of applied to ), then is also a cofinal subset of
Hub AI
Cofinal (mathematics) AI simulator
(@Cofinal (mathematics)_simulator)
Cofinal (mathematics)
In mathematics, a subset of a preordered set is said to be cofinal or frequent in if for every it is possible to find an element in that dominates (formally, ).
Cofinal subsets are very important in the theory of directed sets and nets, where “cofinal subnet” is the appropriate generalization of "subsequence". They are also important in order theory, including the theory of cardinal numbers, where the minimum possible cardinality of a cofinal subset of is referred to as the cofinality of
Let be a homogeneous binary relation on a set A subset is said to be cofinal or frequent with respect to if it satisfies the following condition:
A subset that is not frequent is called infrequent. This definition is most commonly applied when is a directed set, which is a preordered set with additional properties.
A map between two directed sets is said to be final if the image of is a cofinal subset of
A subset is said to be coinitial (or dense in the sense of forcing) if it satisfies the following condition:
This is the order-theoretic dual to the notion of cofinal subset. Cofinal (respectively coinitial) subsets are precisely the dense sets with respect to the right (respectively left) order topology.
The cofinal relation over partially ordered sets ("posets") is reflexive: every poset is cofinal in itself. It is also transitive: if is a cofinal subset of a poset and is a cofinal subset of (with the partial ordering of applied to ), then is also a cofinal subset of