The chain covering number of a poset with no infinite antichains
The chain covering number $\operatorname{Cov}(P)$ of a poset $P$ is the least number of chains needed to cover $P$. For an uncountable cardinal $\nu $, we give a list of posets of cardinality and covering number $\nu $ such that for every poset $P$ with no infinite antichain, $\operatorname{Cov}(P)\...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Académie des sciences
2023-10-01
|
Series: | Comptes Rendus. Mathématique |
Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.511/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The chain covering number $\operatorname{Cov}(P)$ of a poset $P$ is the least number of chains needed to cover $P$. For an uncountable cardinal $\nu $, we give a list of posets of cardinality and covering number $\nu $ such that for every poset $P$ with no infinite antichain, $\operatorname{Cov}(P)\ge \nu $ if and only if $P$ embeds a member of the list. This list has two elements if $\nu $ is a successor cardinal, namely $[\nu ]^2$ and its dual, and four elements if $\nu $ is a limit cardinal with $\operatorname{cf}(\nu )$ weakly compact. For $\nu = \aleph _1$, a list was given by the first author; his construction was extended by F. Dorais to every infinite successor cardinal $\nu $. |
---|---|
ISSN: | 1778-3569 |