Archives
Keywords
Weakly compact cardinal stationary reflection projective Boolean algebra Erdos-Hajnal graphs Lipschitz reduction sap Filter reflection reflection principles Shelah's Strong Hypothesis positive partition relation Generalized descriptive set theory Square-Brackets Partition Relations Iterated forcing weak Kurepa tree Sigma-Prikry Microscopic Approach AIM forcing ZFC construction Strong coloring Singular Density middle diamond Almost-disjoint family Ulam matrix Successor of Regular Cardinal Knaster Closed coloring Commutative projection system b-scale Diamond-sharp Fat stationary set Rainbow sets Vanishing levels Martin's Axiom Subnormal ideal HOD Uniformization transformations Amenable C-sequence Whitehead Problem strongly bounded groups Subtle tree property Subadditive Reduced Power Open Access Small forcing square principles Dowker space Subtle cardinal Countryman line Respecting tree Rado's conjecture Parameterized proxy principle xbox stationary hitting Precaliber Coherent tree OCA club_AD Chang's conjecture tensor product graph Luzin set Jonsson cardinal Axiom R Minimal Walks Absoluteness Selective Ultrafilter Non-saturation Partition relations for trees Uniformly homogeneous C-sequence PFA(S)[S] incompactness free Boolean algebra Rock n' Roll Singular cardinals combinatorics diamond star O-space Universal Sequences Forcing with side conditions Ostaszewski square polarized partition relation Slim tree Mandelbrot set Diamond for trees Souslin Tree Chromatic number ccc higher Baire space coloring number weak diamond Aronszajn tree Ramsey theory over partitions Sakurai's Bell inequality Uniformly coherent Distributive tree Analytic sets Postprocessing function Local Club Condensation. super-Souslin tree SNR Well-behaved magma Fast club Ascent Path Partition Relations Knaster and friends Constructible Universe Club Guessing Hindman's Theorem Sierpinski's onto mapping principle L-space full tree Commutative cancellative semigroups Entangled linear order Interval topology on trees stick Cohen real Kurepa Hypothesis specializable Souslin tree GMA nonmeager set Erdos Cardinal approachability ideal perfectly normal Successor of Singular Cardinal Hereditarily Lindelöf space free Souslin tree weak square Nonspecial tree unbounded function indecomposable filter Was Ulam right? Cardinal function S-Space Fodor-type reflection Forcing Diamond Foundations Ineffable cardinal countably metacompact 54G20 Ascending path Generalized Clubs Dushnik-Miller very good scale Almost countably chromatic Intersection model Antichain square Strongly compact cardinal Prikry-type forcing Hedetniemi's conjecture Strongly Luzin set Singular cofinality Cardinal Invariants regressive Souslin tree P-Ideal Dichotomy Large Cardinals Poset Prevalent singular cardinals Reflecting stationary set Forcing Axioms Almost Souslin PFA Monotonically far Greatly Mahlo
Category Archives: Expository
The uniformization property for $\aleph_2$
Given a subset of a regular uncountable cardinal $S\subseteq\kappa$, $UP_S$ (read: “the uniformization property holds for $S$”) asserts that for every sequence $\overrightarrow f=\langle f_\alpha\mid \alpha\in S\rangle$ satisfying for all $\alpha\in S$: $f_\alpha$ is a 2-valued function; $\text{dom}(f_\alpha)$ is a … Continue reading
The Engelking-Karlowicz theorem, and a useful corollary
Theorem (Engelking-Karlowicz, 1965). For cardinals $\kappa\le\lambda\le\mu\le 2^\lambda$, the following are equivalent: $\lambda^{<\kappa}=\lambda$; there exists a collection of functions, $\langle f_i:\mu\rightarrow\lambda\mid i<\lambda\rangle$, such that for every $X\in[\mu]^{<\kappa}$ and every function $f:X\rightarrow\lambda$, there exists some $i<\lambda$ with $f\subseteq f_i$. Proof. (2)$\Rightarrow$(1) Suppose … Continue reading
Kurepa trees and ineffable cardinals
Recall that $T$ is said to be a $\kappa$-Kurepa tree if $T$ is a tree of height $\kappa$, whose levels $T_\alpha$ has size $\le|\alpha|$ for co-boundedly many $\alpha<\kappa$, and such that the set of branches of $T$ has size $>\kappa$. … Continue reading
Variations on diamond
Jensen’s diamond principle has many equivalent forms. The translation between these forms is often straight-forward, but there is one form whose equivalence to the usual form is somewhat surprising, and Devlin’s translation from one to the other, seems a little … Continue reading
The P-Ideal Dichotomy and the Souslin Hypothesis
John Krueger is visiting Toronto these days, and in a conversation today, we asked ourselves how do one prove the Abraham-Todorcevic theorem that PID implies SH. Namely, that the next statement implies that there are no Souslin trees: Definition. The … Continue reading
The chromatic numbers of the Erdos-Hajnal graphs
Recall that a coloring $c:G\rightarrow\kappa$ of an (undirected) graph $(G,E)$ is said to be chromatic if $c(v_1)\neq c(v_2)$ whenever $\{v_1,v_2\}\in E$. Then, the chromatic number of a graph $(G,E)$ is the least cardinal $\kappa$ for which there exists a chromatic … Continue reading
Posted in Blog, Expository
Tagged Chromatic number, Erdos-Hajnal graphs, Rado's conjecture, reflection principles
14 Comments
Shelah’s approachability ideal (part 1)
Given an infinite cardinal $\lambda$, Shelah defines an ideal $I[\lambda]$ as follows. Definition (Shelah, implicit in here). A set $S$ is in $I[\lambda]$ iff $S\subseteq\lambda$ and there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$, and some club $E\subseteq\lambda$, so … Continue reading
Dushnik-Miller for regular cardinals (part 3)
Here is what we already know about the Dushnik-Miller theorem in the case of $\omega_1$ (given our earlier posts on the subject): $\omega_1\rightarrow(\omega_1,\omega+1)^2$ holds in ZFC; $\omega_1\rightarrow(\omega_1,\omega+2)^2$ may consistently fail; $\omega_1\rightarrow(\omega_1,\omega_1)^2$ fails in ZFC. In this post, we shall provide … Continue reading
A large cardinal in the constructible universe
In this post, we shall provide a proof of Silver’s theorem that the Erdos caridnal $\kappa(\omega)$ relativizes to Godel’s constructible universe. First, recall some definitions. Given a function $f:[\kappa]^{<\omega}\rightarrow \mu$, we say that $I\subseteq\kappa$ is a set of indiscernibles for … Continue reading
c.c.c. forcing without combinatorics
In this post, we shall discuss a short paper by Alan Mekler from 1984, concerning a non-combinatorial verification of the c.c.c. property for forcing notions. Recall that a notion of forcing $\mathbb P$ is said to satisfy the c.c.c. iff … Continue reading
