Canonization of analytic equivalences on the Carlson-Simpson forcing
Michal Doucha

TL;DR
This paper establishes a canonization theorem for the Carlson-Simpson forcing, extending previous results to uncountable colorings with analytic equivalence relations, advancing the understanding of partition regularities.
Contribution
It generalizes the weak Carlson-Simpson theorem to uncountable colorings with analytic equivalence relations, providing a broader canonization framework.
Findings
Proves a canonization result for Carlson-Simpson forcing.
Extends the weak Carlson-Simpson theorem to uncountable colorings.
Shows that analytic equivalence relations can be canonized in this setting.
Abstract
We prove a canonization result for the Carlson-Simpson forcing in the spirit of \cite{KSZ}. We generalize the weak form of the Carlson-Simpson theorem (\cite{CaSi}) dealing with partitions without free blocks: instead of dealing with finite Borel (resp. Baire-property) colorings we deal with (uncountable) colorings such that the corresponding equivalence relation (two partitions are equivalent if they are colored by the same color) is analytic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Functional Equations Stability Results · Mathematical Dynamics and Fractals
