### Archives

### Recent blog posts

- Prikry forcing may add a Souslin tree June 12, 2016
- The reflection principle $R_2$ May 20, 2016
- Prolific Souslin trees March 17, 2016
- Generalizations of Martin’s Axiom and the well-met condition January 11, 2015
- Many diamonds from just one January 6, 2015
- Happy new jewish year! September 24, 2014
- Square principles April 19, 2014
- Partitioning the club guessing January 22, 2014

### Keywords

Ascent Path Prevalent singular cardinals square principles stationary hitting Rado's conjecture very good scale reflection principles Distributive tree xbox L-space weak square Erdos Cardinal Fast club Weakly compact cardinal Small forcing free Boolean algebra Whitehead Problem Erdos-Hajnal graphs Antichain Cardinal Invariants Luzin set Postprocessing function polarized partition relation Forcing Axioms Dushnik-Miller projective Boolean algebra Rock n' Roll Uniformly coherent Hereditarily Lindelöf space coloring number Club Guessing Aronszajn tree incompactness Square-Brackets Partition Relations Axiom R Chang's conjecture Cohen real diamond star Generalized Clubs Souslin Tree ccc Mandelbrot set Reduced Power Stevo Todorcevic Knaster Fat stationary set Parameterized proxy principle Coherent tree 20M14 Kurepa Hypothesis Large Cardinals Non-saturation stationary reflection P-Ideal Dichotomy Absoluteness Successor of Singular Cardinal Singular coﬁnality Hindman's Theorem Selective Ultrafilter PFA Universal Sequences Successor of Regular Cardinal HOD Fodor-type reflection approachability ideal square Rainbow sets Forcing Almost countably chromatic Sakurai's Bell inequality Singular cardinals combinatorics b-scale tensor product graph Hedetniemi's conjecture weak diamond Foundations PFA(S)[S] Ostaszewski square Prikry-type forcing 11P99 Cardinal function Uniformization Singular Density Microscopic Approach Jonsson cardinal sap OCA 05A17 Minimal Walks Nonspecial tree Poset Constructible Universe Partition Relations Chromatic number Shelah's Strong Hypothesis Slim tree S-Space Martin's Axiom Commutative cancellative semigroups Almost Souslin Almost-disjoint famiy Diamond super-Souslin tree middle diamond

# 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