Archives
Keywords
Minimal Walks Hedetniemi's conjecture Precaliber Parameterized proxy principle Uniformization Cardinal Invariants Jonsson cardinal Uniformly coherent Sigma-Prikry Luzin set Rainbow sets middle diamond Subtle tree property Ineffable cardinal tensor product graph HOD Ostaszewski square Amenable C-sequence Almost-disjoint family P-Ideal Dichotomy Martin's Axiom Subtle cardinal Knaster Open Access Axiom R Poset Small forcing Nonspecial tree full tree Non-saturation Rado's conjecture ZFC construction Rock n' Roll Weakly compact cardinal Knaster and friends Foundations Singular cardinals combinatorics Singular cofinality ccc Erdos Cardinal OCA Almost Souslin higher Baire space Strongly Luzin set Lipschitz reduction weak square b-scale Hereditarily Lindelöf space Greatly Mahlo Constructible Universe GMA strongly bounded groups Erdos-Hajnal graphs free Souslin tree Ulam matrix very good scale Diamond for trees Whitehead Problem Chang's conjecture Club Guessing Selective Ultrafilter Partition Relations Distributive tree approachability ideal Cardinal function SNR incompactness Shelah's Strong Hypothesis specializable Souslin tree Successor of Singular Cardinal Almost countably chromatic countably metacompact Universal Sequences Chromatic number Dushnik-Miller Fodor-type reflection C-sequence Sakurai's Bell inequality Subadditive Souslin Tree Mandelbrot set PFA Forcing Axioms O-space Well-behaved magma free Boolean algebra Reduced Power Subnormal ideal Was Ulam right Slim tree square principles Successor of Regular Cardinal Strong coloring Fat stationary set Iterated forcing Reflecting stationary set Dowker space Vanishing levels regressive Souslin tree Absoluteness Forcing xbox Diamond-sharp stick PFA(S)[S] Square-Brackets Partition Relations Kurepa Hypothesis sap weak Kurepa tree Prevalent singular cardinals Ramsey theory over partitions super-Souslin tree Filter reflection Sierpinski's onto mapping principle polarized partition relation stationary reflection Hindman's Theorem Uniformly homogeneous Aronszajn tree Prikry-type forcing S-Space L-space AIM forcing 54G20 coloring number unbounded function Postprocessing function Large Cardinals Microscopic Approach Ascent Path Generalized Clubs positive partition relation Cohen real Diamond Antichain Analytic sets Commutative cancellative semigroups Singular Density indecomposable ultrafilter square Fast club Local Club Condensation. stationary hitting transformations projective Boolean algebra weak diamond Generalized descriptive set theory diamond star Coherent tree Closed coloring club_AD reflection principles nonmeager set
Category Archives: Expository
Bell’s theorem on the cardinal invariant $\mathfrak p$
In this post, we shall provide a proof to a famous theorem of Murray Bell stating that $MA_\kappa(\text{the class of }\sigma\text{-centered posets})$ holds iff $\kappa<\mathfrak p$. We commence with defining the cardinal invariant $\mathfrak p$. For sets $A$ and $B$, … Continue reading
The $\Delta$-system lemma: an elementary proof
Here is an elementary proof of (the finitary version of) the $\Delta$-system lemma. Thanks goes to Bill Weiss who showed me this proof! Lemma. Suppose that $\kappa$ is a regular uncountable cardinal, and $\mathcal A$ is a $\kappa$-sized family of finite … Continue reading
Posted in Blog, Expository, Surprisingly short
17 Comments
Prikry Forcing
Recall that the chromatic number of a (symmetric) graph $(G,E)$, denoted $\text{Chr}(G,E)$, is the least (possible finite) cardinal $\kappa$, for which there exists a coloring $c:G\rightarrow\kappa$ such that $gEh$ entails $c(g)\neq c(h)$. Given a forcing notion $\mathbb P$, it is … Continue reading
Shelah’s approachability ideal (part 2)
In a previous post, we defined Shelah’s approachability ideal $I[\lambda]$. We remind the reader that a subset $S\subseteq\lambda$ is in $I[\lambda]$ iff there exists a collection $\{ \mathcal D_\alpha\mid\alpha<\lambda\}\subseteq\mathcal [\mathcal P(\lambda)]^{<\lambda}$ such that for club many $\delta\in S$, the union … Continue reading
Posted in Blog, Expository, Open Problems
Tagged approachability ideal, Club Guessing
Leave a comment
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 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
