Archives
Keywords
Foundations coloring number Martin's Axiom sap Postprocessing function Vanishing levels Ulam matrix AIM forcing Cardinal Invariants Greatly Mahlo Rainbow sets Rock n' Roll Selective Ultrafilter Diamond Sakurai's Bell inequality Constructible Universe Square-Brackets Partition Relations Large Cardinals Ineffable cardinal Lipschitz reduction O-space Antichain Souslin Tree Mandelbrot set super-Souslin tree Fodor-type reflection Distributive tree Almost countably chromatic Weakly compact cardinal PFA(S)[S] Shelah's Strong Hypothesis tensor product graph Reduced Power PFA Singular cardinals combinatorics OCA Dushnik-Miller Aronszajn tree specializable Souslin tree Dowker space Absoluteness Non-saturation C-sequence Ostaszewski square positive partition relation Sierpinski's onto mapping principle Prevalent singular cardinals Nonspecial tree Erdos Cardinal Generalized Clubs indecomposable ultrafilter HOD Successor of Singular Cardinal Erdos-Hajnal graphs Subnormal ideal Slim tree Fast club Generalized descriptive set theory Sigma-Prikry Kurepa Hypothesis ZFC construction SNR stationary hitting Small forcing stationary reflection Uniformly homogeneous Hereditarily Lindelöf space b-scale stick Cohen real Jonsson cardinal Hindman's Theorem Knaster and friends weak square Microscopic Approach Analytic sets P-Ideal Dichotomy full tree unbounded function Subtle cardinal Partition Relations projective Boolean algebra Poset Singular cofinality Axiom R Reflecting stationary set Diamond-sharp Universal Sequences very good scale Amenable C-sequence Fat stationary set Strong coloring Coherent tree Ascent Path Local Club Condensation. Successor of Regular Cardinal ccc square Commutative cancellative semigroups free Souslin tree Closed coloring Rado's conjecture transformations Club Guessing GMA Was Ulam right free Boolean algebra Uniformization polarized partition relation weak diamond Forcing diamond star Hedetniemi's conjecture reflection principles Diamond for trees nonmeager set higher Baire space Singular Density Luzin set Chang's conjecture Almost Souslin xbox incompactness regressive Souslin tree Parameterized proxy principle Open Access club_AD Cardinal function square principles Strongly Luzin set middle diamond approachability ideal Filter reflection Almost-disjoint family Chromatic number 54G20 Ramsey theory over partitions Knaster Iterated forcing strongly bounded groups Well-behaved magma Uniformly coherent countably metacompact S-Space Precaliber L-space Whitehead Problem Minimal Walks Forcing Axioms Prikry-type forcing Subadditive Subtle tree property
Category Archives: Expository
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing $\aleph_1\nrightarrow[\aleph_1]^2_3$ has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found … Continue reading
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
Generalizations of Martin’s Axiom and the well-met condition
Recall that Martin’s Axiom asserts that for every partial order $\mathbb P$ satisfying c.c.c., and for any family $\mathcal D$ of $<2^{\aleph_0}$ many dense subsets of $\mathbb P$, there exists a directed subset $G$ of $\mathbb P$ such that $G\cap … Continue reading
Many diamonds from just one
Recall Jensen’s diamond principle over a stationary subset $S$ of a regular uncountable cardinal $\kappa$: there exists a sequence $\langle A_\alpha\mid \alpha\in S \rangle$ such that $\{\alpha\in S\mid A\cap\alpha=A_\alpha\}$ is stationary for every $A\subseteq\kappa$. Equivalently, there exists a sequence $\langle … Continue reading
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function $f:A\rightarrow B$ is said to … Continue reading
Syndetic colorings with applications to S and L
Notation. Write $\mathcal Q(A):=\{ a\subseteq A\mid a\text{ is finite}, a\neq\emptyset\}$. Definition. An L-space is a regular hereditarily Lindelöf topological space which is not hereditarily separable. Definition. We say that a coloring $c:[\omega_1]^2\rightarrow\omega$ is L-syndetic if the following holds. For every uncountable … Continue reading
Open coloring and the cardinal invariant $\mathfrak b$
Nik Weaver asked for a direct proof of the fact that Todorcevic’s axiom implies the failure of CH fails. Here goes. Notation. For a set $X$, we write $[X]^2$ for the set of unordered pairs $\{ \{x,x’\}\mid x,x’\in X, x\neq … Continue reading
PFA and the tree property at $\aleph_2$
Recall that a poset $\langle T,\le\rangle$ is said to be a $\lambda^+$-Aronszajn tree, if it isomorphic to a poset $(\mathcal T,\subseteq)$ of the form: $\emptyset\in \mathcal T\subseteq{}^{<\lambda^+}\lambda$; Write $\mathcal T_\alpha:=\{\sigma\in\mathcal T\mid \text{dom}(\sigma)=\alpha\}$; for all $\alpha<\lambda^+$, $\mathcal T_\alpha$ has size $\le\lambda$, … Continue reading