An uncountable version of Pták's combinatorial lemma

0496180 - MÚ 2019 RIV US eng J - Článek v odborném periodiku
Hájek, Petr Pavel - Russo, T.
An uncountable version of Pták's combinatorial lemma.
Journal of Mathematical Analysis and Applications. Roč. 470, č. 2 (2019), s. 1070-1080. ISSN 0022-247X. E-ISSN 1096-0813
Grant CEP: GA ČR GA16-07378S
Institucionální podpora: RVO:67985840
Klíčová slova: adequate family * convex mean * Corson compact * Erdős space
Obor OECD: Pure mathematics
Impakt faktor: 1.220, rok: 2019
https://www.sciencedirect.com/science/article/pii/S0022247X18308783?via%3Dihub

In this note we are concerned with the validity of an uncountable analogue of a combinatorial lemma due to Vlastimil Pták. We show that the validity of the result for ω1 can not be decided in ZFC alone. We also provide a sufficient condition, for a class of larger cardinals.
Trvalý link: http://hdl.handle.net/11104/0289005