Archives
Keywords
Closed coloring Sakurai's Bell inequality Analytic sets Filter reflection Was Ulam right? Knaster Hindman's Theorem Small forcing weak diamond transformations stationary reflection Subnormal ideal Ulam matrix free Souslin tree Forcing 54G20 OCA Subtle tree property Microscopic Approach Sierpinski's onto mapping principle Precaliber ZFC construction weak Kurepa tree Generalized Clubs coloring number middle diamond Cardinal function Open Access perfectly normal Well-behaved magma Chang's conjecture Parameterized proxy principle Antichain Reflecting stationary set Respecting tree O-space Commutative projection system Singular Density Ascending path Erdos-Hajnal graphs Lipschitz reduction GMA Aronszajn tree Reduced Power Strongly Luzin set PFA(S)[S] Nonspecial tree Distributive tree Partition relations for trees Slim tree Club Guessing Interval topology on trees club_AD Knaster and friends Ineffable cardinal C-sequence Dowker space square Diamond-sharp Universal Sequences Uniformization Successor of Regular Cardinal tensor product graph Countryman line Axiom R projective Boolean algebra Martin's Axiom Amenable C-sequence Cohen real SNR strongly bounded groups Almost Souslin Selective Ultrafilter Ascent Path P-Ideal Dichotomy Ramsey theory over partitions Forcing with side conditions Chromatic number Rock n' Roll Uniformly coherent incompactness Singular cofinality Minimal Walks Square-Brackets Partition Relations Subadditive stick Commutative cancellative semigroups Entangled linear order very good scale square principles PFA unbounded function Intersection model Cardinal Invariants countably metacompact Singular cardinals combinatorics sap Sigma-Prikry higher Baire space Luzin set Dushnik-Miller Greatly Mahlo Iterated forcing Poset Mandelbrot set b-scale specializable Souslin tree Forcing Axioms Almost countably chromatic polarized partition relation Partition Relations Diamond HOD Foundations Large Cardinals xbox Erdos Cardinal super-Souslin tree reflection principles AIM forcing Postprocessing function Absoluteness Fat stationary set Rado's conjecture Fodor-type reflection Local Club Condensation. weak square Hedetniemi's conjecture free Boolean algebra Hereditarily Lindelöf space Strongly compact cardinal Prevalent singular cardinals approachability ideal ccc Weakly compact cardinal Prikry-type forcing Diamond for trees S-Space nonmeager set full tree Successor of Singular Cardinal Subtle cardinal regressive Souslin tree Non-saturation stationary hitting positive partition relation Generalized descriptive set theory Coherent tree Constructible Universe Uniformly homogeneous Almost-disjoint family Jonsson cardinal indecomposable filter Ostaszewski square Rainbow sets Kurepa Hypothesis Fast club diamond star Strong coloring Whitehead Problem Monotonically far L-space Vanishing levels Souslin Tree Shelah's Strong Hypothesis
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
Posted in Blog, Expository
Tagged ccc, Forcing Axioms, GMA, Martin's Axiom, Uniformization
Leave a comment
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
