, Volume 1, Issue 2, pp 147–157

Compactness and subsets of ordered sets that meet all maximal chains


  • John Ginsburg
    • Department of MathematicsUniversity of Winnipeg

DOI: 10.1007/BF00565650

Cite this article as:
Ginsburg, J. Order (1984) 1: 147. doi:10.1007/BF00565650


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 symbolsP1 andP2 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 ofP1 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 ofP1 orP2 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.

AMS (MOS) subject classifications (1980)


Key words

Maximal chaincutsetchain completeantichaincofinal subset

Copyright information

© D. Reidel Publishing Company 1984