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