An uncountable version of Pt\'ak's combinatorial lemma
Functional Analysis
2020-06-09 v2 General Topology
Abstract
In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pt\'ak. We show that the validity of the result for can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.
Keywords
Cite
@article{arxiv.1805.06028,
title = {An uncountable version of Pt\'ak's combinatorial lemma},
author = {Petr Hájek and Tommaso Russo},
journal= {arXiv preprint arXiv:1805.06028},
year = {2020}
}
Comments
13 pp