Archives
Keywords
Distributive tree HOD diamond star Small forcing Weakly compact cardinal perfectly normal Subtle tree property Erdos Cardinal Poset regressive Souslin tree 54G20 Dushnik-Miller ccc Microscopic Approach polarized partition relation Interval topology on trees Kurepa Hypothesis Selective Ultrafilter Partition relations for trees xbox Nonspecial tree Fat stationary set Analytic sets stationary hitting Rado's conjecture Constructible Universe Commutative cancellative semigroups Intersection model Axiom R projective Boolean algebra stick Rock n' Roll Diamond for trees Absoluteness Prikry-type forcing Prevalent singular cardinals Fodor-type reflection Souslin Tree Forcing Axioms P-Ideal Dichotomy Cardinal function Club Guessing Luzin set Singular Density S-Space Jonsson cardinal Strong coloring Fast club stationary reflection square principles ZFC construction specializable Souslin tree O-space Almost Souslin Non-saturation Minimal Walks SNR Subtle cardinal nonmeager set super-Souslin tree Cardinal Invariants Almost-disjoint family Foundations tensor product graph Rainbow sets transformations Entangled linear order Slim tree positive partition relation Erdos-Hajnal graphs Chromatic number Hedetniemi's conjecture Forcing PFA Diamond indecomposable filter countably metacompact Iterated forcing approachability ideal Open Access Knaster L-space Ascending path Commutative projection system Local Club Condensation. Whitehead Problem strongly bounded groups AIM forcing Hereditarily Lindelöf space Parameterized proxy principle Sakurai's Bell inequality weak diamond Amenable C-sequence Uniformization Forcing with side conditions Partition Relations b-scale square weak Kurepa tree very good scale sap Dowker space Ineffable cardinal Almost countably chromatic Ascent Path Precaliber Lipschitz reduction Sierpinski's onto mapping principle Hindman's Theorem Square-Brackets Partition Relations middle diamond Antichain Mandelbrot set Strongly compact cardinal Ramsey theory over partitions Singular cardinals combinatorics Universal Sequences Closed coloring Postprocessing function Subnormal ideal reflection principles free Boolean algebra Subadditive Respecting tree Chang's conjecture Countryman line Shelah's Strong Hypothesis Strongly Luzin set Vanishing levels Large Cardinals incompactness Well-behaved magma weak square Uniformly coherent Reduced Power Greatly Mahlo Successor of Singular Cardinal Ostaszewski square C-sequence free Souslin tree full tree unbounded function Monotonically far Sigma-Prikry higher Baire space Cohen real Generalized Clubs Knaster and friends club_AD Was Ulam right? GMA Filter reflection Coherent tree PFA(S)[S] Uniformly homogeneous Aronszajn tree coloring number Ulam matrix Reflecting stationary set Martin's Axiom OCA Successor of Regular Cardinal Diamond-sharp Singular cofinality Generalized descriptive set theory
Category Archives: Blog
Pure logic
While traveling downtown today, I came across a sign near a local church, with a quotation of Saint-Exupéry:
Jane’s Addiction visiting Toronto
Last night, I went to see a live show by Jane’s Addiction, in downtown Toronto. Here’s a video snippet from that show which I could found on YouTube: The playlist was excellent, but there was one song which I was … Continue reading
c.c.c. vs. the Knaster property
After my previous post on Mekler’s characterization of c.c.c. notions of forcing, Sam, Mike and myself discussed the value of it . We noticed that a prevalent verification of the c.c.c. goes like this: given an uncountable set of conditions, … 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
An inconsistent form of club guessing
In this post, we shall present an answer (due to P. Larson) to a question by A. Primavesi concerning a certain strong form of club guessing. We commence with recalling Shelah’s concept of club guessing. Concept (Shelah). Given a regular … 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
Dushnik-Miller for singular cardinals (part 2)
In the first post on this subject, we provided a proof of $\lambda\rightarrow(\lambda,\omega+1)^2$ for every regular uncountable cardinal $\lambda$. In the second post, we provided a proof of $\lambda\rightarrow(\lambda,\omega)^2$ for every singular cardinal $\lambda$, and showed that $\lambda\rightarrow(\lambda,\omega+1)^2$ fails for every … Continue reading
Posted in Blog, Expository
Tagged Dushnik-Miller, Partition Relations, Singular cardinals combinatorics
27 Comments
Dushnik-Miller for regular cardinals (part 2)
In this post, we shall provide a proof of Todorcevic’s theorem, that $\mathfrak b=\omega_1$ implies $\omega_1\not\rightarrow(\omega_1,\omega+2)^2$. This will show that the Erdos-Rado theorem that we discussed in an earlier post, is consistently optimal. Our exposition of Todorcevic’s theorem would be … Continue reading
Dushnik-Miller for singular cardinals (part 1)
Continuing the previous post, let us now prove the following. Theorem (Erdos-Dushnik-Miller, 1941). For every singular cardinal λ, we have: $$\lambda\rightarrow(\lambda,\omega)^2.$$ Proof. Suppose that $\lambda$ is a singular cardinal, and $c:[\lambda]^2\rightarrow\{0,1\}$ is a given coloring. For any ordinal $\alpha<\lambda$, denote … Continue reading
