Archives
Keywords
Almost countably chromatic Almost Souslin Uniformization higher Baire space ccc very good scale Intersection model Hindman's Theorem Rock n' Roll Iterated forcing strongly bounded groups Kurepa Hypothesis Uniformly coherent Singular Density Distributive tree AIM forcing Erdos-Hajnal graphs diamond star Square-Brackets Partition Relations Forcing Vanishing levels polarized partition relation stationary hitting Subadditive regressive Souslin tree Commutative projection system Knaster and friends 54G20 Strong coloring square principles SNR Nonspecial tree Hereditarily Lindelöf space xbox Prikry-type forcing nonmeager set Reduced Power Axiom R projective Boolean algebra Strongly Luzin set GMA L-space Successor of Regular Cardinal Respecting tree Partition Relations Constructible Universe Chang's conjecture Antichain Rainbow sets Weakly compact cardinal O-space Postprocessing function approachability ideal Small forcing tensor product graph Precaliber Generalized descriptive set theory weak diamond C-sequence Mandelbrot set Knaster b-scale Ramsey theory over partitions Fodor-type reflection Parameterized proxy principle Ineffable cardinal Hedetniemi's conjecture Filter reflection Subnormal ideal weak Kurepa tree Subtle cardinal Chromatic number Singular cofinality coloring number PFA(S)[S] OCA countably metacompact Dowker space square Ostaszewski square specializable Souslin tree Local Club Condensation. Lipschitz reduction Singular cardinals combinatorics S-Space Club Guessing Fast club Diamond-sharp Dushnik-Miller middle diamond Luzin set free Boolean algebra HOD Sakurai's Bell inequality stick Absoluteness Forcing Axioms Rado's conjecture Poset Partition relations for trees Cardinal function Universal Sequences Minimal Walks Closed coloring Martin's Axiom Cardinal Invariants Monotonically far positive partition relation Amenable C-sequence Foundations Aronszajn tree Analytic sets Forcing with side conditions Sigma-Prikry Uniformly homogeneous Successor of Singular Cardinal Ascent Path unbounded function Ulam matrix Was Ulam right? sap Large Cardinals PFA Slim tree stationary reflection Countryman line Cohen real P-Ideal Dichotomy Fat stationary set Entangled linear order Commutative cancellative semigroups Diamond Prevalent singular cardinals ZFC construction Shelah's Strong Hypothesis Souslin Tree Greatly Mahlo Almost-disjoint family Diamond for trees free Souslin tree Sierpinski's onto mapping principle perfectly normal incompactness super-Souslin tree Jonsson cardinal Selective Ultrafilter Reflecting stationary set Erdos Cardinal Whitehead Problem Open Access Interval topology on trees reflection principles Well-behaved magma Ascending path Coherent tree indecomposable filter club_AD full tree Generalized Clubs transformations Subtle tree property Microscopic Approach Strongly compact cardinal Non-saturation weak square
Category Archives: Blog
The S-space problem, and the cardinal invariant $\mathfrak p$
Recall that an $S$-space is a regular hereditarily separable topological space which is not hereditarily Lindelöf. Do they exist? Consistently, yes. However, Szentmiklóssy proved that compact $S$-spaces do not exist, assuming Martin’s Axiom. Pushing this further, Todorcevic later proved that … Continue reading
Posted in Blog, Expository, Open Problems
Tagged Cardinal Invariants, Hereditarily Lindelöf space, P-Ideal Dichotomy, PFA(S)[S], S-Space
4 Comments
Jones’ theorem on the cardinal invariant $\mathfrak p$
This post continues the study of the cardinal invariant $\mathfrak p$. We refer the reader to a previous post for all the needed background. For ordinals $\alpha,\alpha_0,\alpha_1,\beta,\beta_0,\beta_1$, the polarized partition relation $$\left(\begin{array}{c}\alpha\\\beta\end{array}\right)\rightarrow\left(\begin{array}{cc}\alpha_0&\alpha_1\\\beta_0&\beta_1\end{array}\right)$$ asserts that for every coloring $f:\alpha\times\beta\rightarrow 2$, (at least) … Continue reading
Erdős 100
The influential mathematician Paul Erdős was born 100 years ago, 26 March 1913, in Budapest. One evidence of his impact on mathematics is reflected in the particular list of invited speakers for the upcoming conference in his honor. Erdős is also … Continue reading
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
A natural Mandelbrot set
Chris Hadfield is a Canadian astronaut, with a very high-profile twitter account. He posts there beautiful photos everyday, and I (plus half a million followers) enjoy it very much. Today, Chris posted the following picture: and I find it quite … Continue reading
What’s next?
I took an offer for a tenure-track position at the Mathematics department of Bar-Ilan University.
Posted in Blog
13 Comments
Review: Stevo Todorcevic’s CRM-Fields-PIMS Prize Lecture
After winning the 2012 CRM-Fields-PIMS Prize, Stevo Todorcevic gave a series of talks on his research: at CRM, at PIMS and at the Fields Institute. The director of the Fields Institute asked me to write a short review on Stevo’s … Continue reading
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
