Chains, Antichains, and Complements in Infinite Partition Lattices

DOI10.1007/S00012-018-0514-ZarXiv1501.05284MaRDI QIDQ6258337FDOQ6258337

Authors: James Emil Avery, Jean-Yves Moyen, Pavel Ružička, Jakob Grue Simonsen 

Publication date: 21 January 2015

Abstract: We consider the partition lattice $P{i}_{k}appa$ on any set of transfinite cardinality $kappa$ and properties of $P{i}_{k}appa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of any maximal well-ordered chain is always exactly $kappa$; (II) there are maximal chains in $P{i}_{k}appa$ of cardinality $>kappa$; (III) if, for every cardinal $lambda<kappa$, we have $2^{lambda}<2^{k}appa$, there exists a maximal chain of cardinality $<2^{kappa}$ (but $gekappa$) in $P{i}_{2^{k}appa}$; (IV) every non-trivial maximal antichain in $P{i}_{k}appa$ has cardinality between $kappa$ and $2^{kappa}$, and these bounds are realized. Moreover we can construct maximal antichains of cardinality $max(kappa,2^{lambda})$ for any $lambdalekappa$; (V) all cardinals of the form $kapp{a}^{l}ambda$ with $0lelambdalekappa$ occur as the number of complements to some partition $mathcalPinP{i}_{k}appa$, and only these cardinalities appear. Moreover, we give a direct formula for the number of complements to a given partition; (VI) Under the Generalized Continuum Hypothesis, the cardinalities of maximal chains, maximal antichains, and numbers of complements are fully determined, and we provide a complete characterization.

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Other combinatorial set theory (03E05) Complemented lattices, orthocomplemented lattices and posets (06C15)

This page was built for publication: Chains, Antichains, and Complements in Infinite Partition Lattices

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