Archives
Keywords
HOD Prikry-type forcing Martin's Axiom Mandelbrot set Analytic sets Lipschitz reduction higher Baire space Erdos-Hajnal graphs Iterated forcing Commutative cancellative semigroups Distributive tree Filter reflection Strong coloring Parameterized proxy principle Prevalent singular cardinals Knaster Intersection model Reflecting stationary set Hindman's Theorem Club Guessing Foundations polarized partition relation Subtle tree property Partition Relations Constructible Universe Closed coloring Subtle cardinal Erdos Cardinal Well-behaved magma Generalized descriptive set theory Coherent tree Dowker space SNR Fodor-type reflection Jonsson cardinal 54G20 Almost-disjoint family weak square Fast club Chang's conjecture Generalized Clubs Ineffable cardinal Ramsey theory over partitions Rock n' Roll Diamond for trees Shelah's Strong Hypothesis Was Ulam right? Whitehead Problem Singular Density PFA(S)[S] L-space Reduced Power AIM forcing Sigma-Prikry Cardinal function incompactness Selective Ultrafilter Subnormal ideal Local Club Condensation. Cohen real Uniformly coherent very good scale Axiom R regressive Souslin tree Minimal Walks Partition relations for trees Rado's conjecture positive partition relation Absoluteness P-Ideal Dichotomy Commutative projection system Poset Uniformization stick specializable Souslin tree stationary hitting stationary reflection OCA Forcing Axioms Cardinal Invariants Respecting tree Uniformly homogeneous Large Cardinals Strongly Luzin set Diamond-sharp Subadditive Weakly compact cardinal Chromatic number super-Souslin tree transformations PFA weak diamond nonmeager set square principles indecomposable filter Sakurai's Bell inequality diamond star Small forcing Aronszajn tree Ulam matrix Diamond Microscopic Approach approachability ideal Hedetniemi's conjecture Dushnik-Miller Successor of Regular Cardinal Rainbow sets strongly bounded groups C-sequence Precaliber Ascent Path free Boolean algebra Monotonically far club_AD Countryman line tensor product graph Knaster and friends Fat stationary set Nonspecial tree Non-saturation Universal Sequences ccc Forcing with side conditions GMA Ascending path Vanishing levels projective Boolean algebra Singular cardinals combinatorics Antichain S-Space Greatly Mahlo Luzin set Strongly compact cardinal Postprocessing function Slim tree O-space full tree unbounded function middle diamond coloring number xbox reflection principles Almost Souslin Square-Brackets Partition Relations Successor of Singular Cardinal b-scale Singular cofinality square Entangled linear order sap Interval topology on trees Kurepa Hypothesis perfectly normal Amenable C-sequence Souslin Tree ZFC construction Almost countably chromatic countably metacompact Ostaszewski square weak Kurepa tree Open Access free Souslin tree Hereditarily Lindelöf space Sierpinski's onto mapping principle Forcing
Tag Archives: Sierpinski’s onto mapping principle
Was Ulam right? III: Indecomposable ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Ulam’s measure problem. In contrast to our previous works, we shift our focus from measures stratified by their additivity, to measures stratified by their indecomposability. The breakthrough here is … Continue reading
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Ramsey theory over partitions III: Strongly Luzin sets and partition relations
Joint work with Menachem Kojman and Juris Steprāns. Abstract. The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of … Continue reading
Jones’ theorem on the cardinal invariant $\mathfrak p$
This post continues the study of the cardinal invariant $\mathfrak p$. We refer the reader to a previous post for all the needed background. For ordinals $\alpha,\alpha_0,\alpha_1,\beta,\beta_0,\beta_1$, the polarized partition relation $$\left(\begin{array}{c}\alpha\\\beta\end{array}\right)\rightarrow\left(\begin{array}{cc}\alpha_0&\alpha_1\\\beta_0&\beta_1\end{array}\right)$$ asserts that for every coloring $f:\alpha\times\beta\rightarrow 2$, (at least) … Continue reading
Posted in Blog, Expository
Tagged polarized partition relation, Sierpinski's onto mapping principle
Leave a comment
