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