Abstract
Given a partially ordered set (D,≤), a companion (C⪯) of (D,≤) is a well ordered set where C is a cofinal subsets of (D,≤) such that for every c1,c2∈C if c1≤c2 then c1⪯c2. The Ordering Lemma says that every partially ordered set has a companion. Given a directed set (D,≤) and a net f:D→X, the restriction f↾C of the net to the companion (C,⪯) of (D,≤) is a transfinite sequence. We show how the convergence and clustering of f↾C is related to the convergence and clustering of f.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
