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