Abstract
LetP be a chain complete ordered set. By considering subsets which meet all maximal chains, we describe conditions which imply that the space of maximal chains ofP is compact. The symbolsP 1 andP 2 refer to two particular ordered sets considered below. It is shown that the space of maximal chains ℳ (P) is compact ifP satisfies any of the following conditions: (i)P contains no copy ofP 1 or its dual and all antichains inP are finite. (ii)P contains no properN and every element ofP belongs to a finite maximal antichain ofP. (iii)P contains no copy ofP 1 orP 2 and for everyx inP there is a finite subset ofP which is coinitial abovex. We also describe an example of an ordered set which is complete and densely ordered and in which no antichain meets every maximal chain.
Similar content being viewed by others
References
M. Bell and J. Ginsburg: Compact spaces and spaces of maximal complete subgraphs, to appear inTrans. Amer. Math. Soc.
J. Ginsburg, I. Rival, and B. Sands: Antichains and finite sets that meet all maximal chains, to appear.
P. A. Grillet (1969) Maximal chains and antichains,Fund. Math. 65, 157–167.
K. Kunen (1977) Combinatorics, inHandbook of Mathematical Logic (ed. Jon Barwise), North-Holland Amsterdam, pp. 371–401.
I. Rival and N. Zaguia: Crosscuts and cutsets, to appear.
N. Sauer and R. Woodrow (1984) Finite cutsets and Finite antichains,Order 1, 35–46.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
Rights and permissions
About this article
Cite this article
Ginsburg, J. Compactness and subsets of ordered sets that meet all maximal chains. Order 1, 147–157 (1984). https://doi.org/10.1007/BF00565650
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00565650