An uncountable version of Pt\'ak's combinatorial lemma

DOI10.1016/J.JMAA.2018.10.049MaRDI QIDQ6301619arXivWikidataFDO

Authors Petr Hájek, Tommaso Russo

Publication date 15 May 2018

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JMAA.2018.10.049

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20)

arXiv classification

math.FAmath.GN

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 $omeg{a}_1$ can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.

This page was built for publication: An uncountable version of Pt\'ak's combinatorial lemma

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