On the decomposition of order-separable posets of countable width into chains

DOI10.1023/A:1006360607363MaRDI QIDQ1568672zbMATH OpenFDO

Authors Gary Gruenhage, Joe Mashburn

Publication date 5 June 2001

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1006360607363

zbMATH Keywords

2-entangled setopen coloring axiomorder-separable posetwidth

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other set-theoretic hypotheses and axioms (03E65) Partial orders, general (06A06)

Review text

A poset \(X\) is order-separable if it contains a countable dense subset; \(X\) has countable width if it contains no uncountable antichain. The following question is posed: Can every poset with these two properties be written as the union of a countable number of chains? The authors show that the answer is ``no if there is a 2-entangled subset of \(\mathbb{R}\), i.e. an uncountable subset \(A\subset \mathbb{R}\) such that there is no uncountable monotone function from some subset of \(A\) into \(A\) with no fixed points, and it is ``yes under the Open Coloring Axiom.

Recommendations

• A chain decomposition theorem
• Publication:3495389
• On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets
• On chains and posets within the power set of a continuum
• Changing the Depth of an Ordered Set by Decomposition

This page was built for publication: On the decomposition of order-separable posets of countable width into chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1568672)