首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Compactness and subsets of ordered sets that meet all maximal chains
Authors:John Ginsburg
Institution:(1) Department of Mathematics, University of Winnipeg, R3B 2E9 Winnipeg, Manitoba, Canada
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 phmmat (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.
Keywords:06A10  54D30
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号