Big Ramsey combinatorics of the Cantor set and a simple proof of Blass' perfect set theorem
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914342164758528 |
|---|---|
| author | Mašulović, Dragan |
| author_facet | Mašulović, Dragan |
| contents | In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^ω$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^ω$, viewed as a topological space, has finite big Ramsey degrees. We then examine several natural topological first-order structures arising from the Cantor set and prove that each of them inherits finite big Ramsey degrees. As a consequence, we obtain a simple proof of Blass' perfect set theorem, although our method does not recover the sharp bound $(n-1)!$ for the number of colors. We also show that the complete Boolean algebra on countably many atoms has finite big Ramsey degrees, in contrast with the recent result showing that the countable atomless Boolean algebra does not have big Ramsey degrees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_18836 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Big Ramsey combinatorics of the Cantor set and a simple proof of Blass' perfect set theorem Mašulović, Dragan Logic Combinatorics In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^ω$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^ω$, viewed as a topological space, has finite big Ramsey degrees. We then examine several natural topological first-order structures arising from the Cantor set and prove that each of them inherits finite big Ramsey degrees. As a consequence, we obtain a simple proof of Blass' perfect set theorem, although our method does not recover the sharp bound $(n-1)!$ for the number of colors. We also show that the complete Boolean algebra on countably many atoms has finite big Ramsey degrees, in contrast with the recent result showing that the countable atomless Boolean algebra does not have big Ramsey degrees. |
| title | Big Ramsey combinatorics of the Cantor set and a simple proof of Blass' perfect set theorem |
| topic | Logic Combinatorics |
| url | https://arxiv.org/abs/2602.18836 |