Partition properties for simply definable colourings
Philipp L\"ucke

TL;DR
This paper investigates how large cardinal assumptions and forcing axioms influence partition properties of definable colourings on uncountable regular cardinals, revealing differences between and and exploring implications for inaccessible cardinals.
Contribution
It establishes new connections between large cardinal properties, forcing axioms, and partition properties for and , especially for -definable colourings, and analyzes their consistency strengths.
Findings
Large cardinal assumptions imply homogeneous closed unbounded subsets for -definable colourings.
Certain large cardinals lead to strong partition properties at inaccessible cardinals.
Martin's Maximum is compatible with -colourings lacking uncountable homogeneous sets.
Abstract
We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and forcing axioms imply that there is a homogeneous closed unbounded subset of for every colouring of the finite sets of countable ordinals that is definable by a -formula that only uses the cardinal and real numbers as parameters. Moreover, it is shown that certain large cardinal properties cause analogous partition properties to hold at the given large cardinal and these implications yield natural examples of inaccessible cardinals that possess strong partition properties for -definable colourings and are not weakly compact. In contrast, we show that -definability behaves fundamentally different at…
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.
