Bounded-height classification for Salinas Schmeis's ω-chain extension question

Question 2.32 on page 14 of Remi Salinas Schmeis's General Criterion for a Poset to Admit a Partition Into ω-Chains (arXiv:2610.29056v1, 2026) asks whether every poset has an ω-chain-partitionable extension that order-embeds into every such extension. We answer negatively: even a two-element antichain has no such extension. Two countable extensions force incompatible behavior for upper bounds of incomparable elements. The same argument gives the connected three-element fork as a counterexample and, by order duality, the corresponding negative answer for ω*-chains. More generally, a nonempty countable poset of bounded finite height has such a least extension if and only if it has a greatest element. Every poset has a partitionable extension, even with ω replaced by any nonzero ordinal.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24411301
Primary Topic
Advanced Topology and Set Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Bounded-height classification for Salinas Schmeis's ω-chain extension question

Wenlin Zhang, Haobo Ma
Zenodo (CERN European Organization for Nuclear Research)
Advanced Topology and Set Theory
preprint

Bounded-height classification for Salinas Schmeis's ω-chain extension question

Wenlin Zhang, Haobo Ma
preprint en

Abstract

Question 2.32 on page 14 of Remi Salinas Schmeis's General Criterion for a Poset to Admit a Partition Into ω-Chains (arXiv:2610.29056v1, 2026) asks whether every poset has an ω-chain-partitionable extension that order-embeds into every such extension. We answer negatively: even a two-element antichain has no such extension. Two countable extensions force incompatible behavior for upper bounds of incomparable elements. The same argument gives the connected three-element fork as a counterexample and, by order duality, the corresponding negative answer for ω*-chains. More generally, a nonempty countable poset of bounded finite height has such a least extension if and only if it has a greatest element. Every poset has a partitionable extension, even with ω replaced by any nonzero ordinal.

Zenodo (CERN European Organization for Nuclear Research)
National University of Singapore (SG)
Advanced Topology and Set Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon