Cofinal (mathematics)

Not to be confused with cofinite.

Mathematical property of subsets in order theory

In mathematics, a subset B ⊆ A {\displaystyle B\subseteq A} of a preordered set ( A , ≤ ) {\displaystyle (A,\leq )} is said to be cofinal or frequent[1] in  A {\displaystyle A} if for every  a ∈ A , {\displaystyle a\in A,} it is possible to find an element  b {\displaystyle b} in  B {\displaystyle B} that is "larger than  a {\displaystyle a} " (explicitly, "larger than  a {\displaystyle a} " means  a ≤ b {\displaystyle a\leq b} ).

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  A {\displaystyle A} is referred to as the cofinality of  A . {\displaystyle A.}

## Definitions[edit]

Let  ≤ {\displaystyle \,\leq \,} be a homogeneous binary relation on a set  A . {\displaystyle A.} A subset  B ⊆ A {\displaystyle B\subseteq A} is said to be cofinal or frequent[1] with respect to  ≤ {\displaystyle \,\leq \,} if it satisfies the following condition:

For every  a ∈ A , {\displaystyle a\in A,} there exists some  b ∈ B {\displaystyle b\in B} that  a ≤ b . {\displaystyle a\leq b.}

A subset that is not frequent is called infrequent.[1] This definition is most commonly applied when  ( A , ≤ ) {\displaystyle (A,\leq )} is a directed set, which is a preordered set with additional properties.

Final functions

A map f : X -> A {\displaystyle f:X\to A} between two directed sets is said to be final[2] if the image f ( X ) {\displaystyle f(X)} of  f {\displaystyle f} is a cofinal subset of  A . {\displaystyle A.}

Coinitial subsets

A subset  B ⊆ A {\displaystyle B\subseteq A} is said to be coinitial (or dense in the sense of forcing) if it satisfies the following condition:

For every  a ∈ A , {\displaystyle a\in A,} there exists some  b ∈ B {\displaystyle b\in B} such that  b ≤ a . {\displaystyle b\leq a.}

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.

## Properties[edit]

The cofinal relation over partially ordered sets ("posets") is reflexive: every poset is cofinal in itself. It is also transitive: if  B {\displaystyle B} is a cofinal subset of a poset  A , {\displaystyle A,} and  C {\displaystyle C} is a cofinal subset of  B {\displaystyle B} (with the partial ordering of  A {\displaystyle A} applied to  B {\displaystyle B} ), then  C {\displaystyle C} is also a cofinal subset of  A . {\displaystyle A.}

For a partially ordered set with maximal elements, every cofinal subset must contain all maximal elements, otherwise a maximal element that is not in the subset would fail to be less than or equal to any element of the subset, violating the definition of cofinal. For a partially ordered set with a greatest element, a subset is cofinal if and only if it contains that greatest element (this follows, since a greatest element is necessarily a maximal element). Partially ordered sets without greatest element or maximal elements admit disjoint cofinal subsets. For example, the even and odd natural numbers form disjoint cofinal subsets of the set of all natural numbers.

If a partially ordered set  A {\displaystyle A} admits a totally ordered cofinal subset, then we can find a subset  B {\displaystyle B} that is well-ordered and cofinal in  A . {\displaystyle A.}

If  ( A , ≤ ) {\displaystyle (A,\leq )} is a directed set and if  B ⊆ A {\displaystyle B\subseteq A} is a cofinal subset of  A {\displaystyle A} then  ( B , ≤ ) {\displaystyle (B,\leq )} is also a directed set.[1]

## Examples and sufficient conditions[edit]

Any superset of a cofinal subset is itself cofinal.[1]

If  ( A , ≤ ) {\displaystyle (A,\leq )} is a directed set and if some union of (one or more) finitely many subsets  S 1 ∪ ⋯ ∪ S n {\displaystyle S_{1}\cup \cdots \cup S_{n}} is cofinal then at least one of the set  S 1 , … , S n {\displaystyle S_{1},\ldots ,S_{n}} is cofinal.[1] This property is not true in general without the hypothesis that  ( A , ≤ ) {\displaystyle (A,\leq )} is directed.

Subset relations and neighborhood bases

Let  X {\displaystyle X} be a topological space and let  N x {\displaystyle {\mathcal {N}}_{x}} denote the neighborhood filter at a point  x ∈ X . {\displaystyle x\in X.} The superset relation  ⊇ {\displaystyle \,\supseteq \,} is a partial order on  N x {\displaystyle {\mathcal {N}}_{x}} : explicitly, for any sets  S {\displaystyle S} and  T , {\displaystyle T,} declare that  S ≤ T {\displaystyle S\leq T} if and only if  S ⊇ T {\displaystyle S\supseteq T} (so in essence,  ≤ {\displaystyle \,\leq \,} is equal to  ⊇ {\displaystyle \,\supseteq \,} ). A subset  B ⊆ N x {\displaystyle {\mathcal {B}}\subseteq {\mathcal {N}}_{x}} is called a neighborhood base at  x {\displaystyle x} if (and only if)  B {\displaystyle {\mathcal {B}}} is a cofinal subset of  ( N x , ⊇ ) ; {\displaystyle \left({\mathcal {N}}_{x},\supseteq \right);} that is, if and only if for every  N ∈ N x {\displaystyle N\in {\mathcal {N}}_{x}} there exists some  B ∈ B {\displaystyle B\in {\mathcal {B}}} such that  N ⊇ B . {\displaystyle N\supseteq B.} (I.e. such that  N ≤ B {\displaystyle N\leq B} .)

Cofinal subsets of the real numbers

For any  − ∞ < x < ∞ , {\displaystyle -\infty <x<\infty ,} the interval  ( x , ∞ ) {\displaystyle (x,\infty )} is a cofinal subset of  ( R , ≤ ) {\displaystyle (\mathbb {R} ,\leq )} but it is not a cofinal subset of  ( R , ≥ ) . {\displaystyle (\mathbb {R} ,\geq ).} The set  N {\displaystyle \mathbb {N} } of natural numbers (consisting of positive integers) is a cofinal subset of  ( R , ≤ ) {\displaystyle (\mathbb {R} ,\leq )} but this is not true of the set of negative integers  − N := { − 1 , − 2 , − 3 , … } . {\displaystyle -\mathbb {N} :=\\{-1,-2,-3,\ldots \\}.}

Similarly, for any  − ∞ < y < ∞ , {\displaystyle -\infty <y<\infty ,} the interval  ( − ∞ , y ) {\displaystyle (-\infty ,y)} is a cofinal subset of  ( R , ≥ ) {\displaystyle (\mathbb {R} ,\geq )} but it is not a cofinal subset of  ( R , ≤ ) . {\displaystyle (\mathbb {R} ,\leq ).} The set  − N {\displaystyle -\mathbb {N} } of negative integers is a cofinal subset of  ( R , ≥ ) {\displaystyle (\mathbb {R} ,\geq )} but this is not true of the natural numbers  N . {\displaystyle \mathbb {N} .} The set  Z {\displaystyle \mathbb {Z} } of all integers is a cofinal subset of  ( R , ≤ ) {\displaystyle (\mathbb {R} ,\leq )} and also a cofinal subset of  ( R , ≥ ) {\displaystyle (\mathbb {R} ,\geq )} ; the same is true of the set  Q . {\displaystyle \mathbb {Q} .}

## Cofinal set of subsets[edit]

A particular but important case is given if  A {\displaystyle A} is a subset of the power set ℘ ( E ) {\displaystyle \wp (E)} of some set  E , {\displaystyle E,} ordered by reverse inclusion  ⊇ . {\displaystyle \,\supseteq .} Given this ordering of  A , {\displaystyle A,} a subset  B ⊆ A {\displaystyle B\subseteq A} is cofinal in  A {\displaystyle A} if for every  a ∈ A {\displaystyle a\in A} there is a  b ∈ B {\displaystyle b\in B} such that  a ⊇ b . {\displaystyle a\supseteq b.}

For example, let  E {\displaystyle E} be a group and let  A {\displaystyle A} be the set of normal subgroups of finite index. The profinite completion of  E {\displaystyle E} is defined to be the inverse limit of the inverse system of finite quotients of  E {\displaystyle E} (which are parametrized by the set  A {\displaystyle A} ). In this situation, every cofinal subset of  A {\displaystyle A} is sufficient to construct and describe the profinite completion of  E . {\displaystyle E.}

## See also[edit]

* Cofinite – Being a subset whose complement is a finite setPages displaying short descriptions of redirect targets
* Cofinality – Size of subsets in order theory
* Upper set – Subset of a preorder that contains all larger elements
* a subset  U {\displaystyle U} of a partially ordered set  ( P , ≤ ) {\displaystyle (P,\leq )} that contains every element  y ∈ P {\displaystyle y\in P} for which there is an  x ∈ U {\displaystyle x\in U} with  x ≤ y {\displaystyle x\leq y}

## References[edit]

1. ^ a b c d e f Schechter 1996, pp. 158–165.
2. ^ Bredon, Glen (1993). Topology and Geometry. Springer. p. 16.

* Lang, Serge (1993), Algebra (Third ed.), Reading, Mass.: Addison-Wesley, ISBN 978-0-201-55540-0, Zbl 0848.13001
* Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. ISBN 978-0-12-622760-4. OCLC 175294365.

* v
* t
* e

Order theory

* Topics
* Glossary
* Category

Key concepts|

* Binary relation
* Boolean algebra
* Cyclic order
* Lattice
* Partial order
* Preorder
* Total order
* Weak ordering

Results|

* Boolean prime ideal theorem
* Cantor–Bernstein theorem
* Cantor's isomorphism theorem
* Dilworth's theorem
* Dushnik–Miller theorem
* Hausdorff maximal principle
* Knaster–Tarski theorem
* Kruskal's tree theorem
* Laver's theorem
* Mirsky's theorem
* Szpilrajn extension theorem
* Zorn's lemma

Properties & Types (list)|

* Antisymmetric
* Asymmetric
* Boolean algebra
* topics
* Completeness
* Connected
* Covering
* Dense
* Directed
* (Partial) Equivalence
* Foundational
* Heyting algebra
* Homogeneous
* Idempotent
* Lattice
* Bounded
* Complemented
* Complete
* Distributive
* Join and meet
* Reflexive
* Partial order
* Chain-complete
* Graded
* Eulerian
* Strict
* Prefix order
* Preorder
* Total
* Semilattice
* Semiorder
* Symmetric
* Total
* Tolerance
* Transitive
* Well-founded
* Well-quasi-ordering (Better)
* (Pre) Well-order

Constructions|

* Composition
* Converse/Transpose
* Lexicographic order
* Linear extension
* Product order
* Reflexive closure
* Series-parallel partial order
* Star product
* Symmetric closure
* Transitive closure

Topology & Orders|

* Alexandrov topology & Specialization preorder
* Ordered topological vector space
* Normal cone
* Order topology
* Order topology
* Topological vector lattice
* Banach
* Fréchet
* Locally convex
* Normed

Related|

* Antichain
* Cofinal
* Cofinality
* Comparability
* Graph
* Duality
* Filter
* Hasse diagram
* Ideal
* Net
* Subnet
* Order morphism
* Embedding
* Isomorphism
* Order type
* Ordered field
* Ordered vector space
* Partially ordered
* Positive cone
* Riesz space
* Upper set
* Young's lattice

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template