Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-10T04:51:55.700Z Has data issue: false hasContentIssue false

On partitioning ordered sets into cofinal subsets

Published online by Cambridge University Press:  26 February 2010

A. H. Stone
Affiliation:
University of Rochester.
Get access

Extract

Let (X, ≺) denote a non-empty (partially) ordered set, or more generally a non-empty set X with an arbitrary transitive relation ≺ on it. The relation ≺ will be fixed throughout what follows, so to simplify the notation we often write (X, ≺) as X. A successor of x ∈ X is an element y ∈ X such that xy; thus x may or may not be a successor of itself. As usual, a subset A ⊂ X is cofinal if each x ∈ X has a successor in A. A partition of X is a family of (pairwise) disjoint nonempty subsets of X whose union is X.

Type
Research Article
Copyright
Copyright © University College London 1968

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Kelley, J. L., General topology (New York, 1955).Google Scholar