Archives
Keywords
super-Souslin tree S-Space Commutative cancellative semigroups Hedetniemi's conjecture stationary reflection Nonspecial tree Subnormal ideal Diamond for trees Ostaszewski square Martin's Axiom Uniformly coherent Subtle cardinal Forcing with side conditions Diamond-sharp Uniformly homogeneous perfectly normal reflection principles C-sequence Selective Ultrafilter O-space Fast club Erdos-Hajnal graphs Absoluteness Rock n' Roll unbounded function Lipschitz reduction Interval topology on trees Prikry-type forcing Strong coloring square principles Chang's conjecture Forcing regressive Souslin tree Partition Relations Respecting tree Monotonically far Weakly compact cardinal Postprocessing function Sakurai's Bell inequality Dowker space specializable Souslin tree Whitehead Problem Fat stationary set GMA Iterated forcing Singular cofinality Precaliber Countryman line Club Guessing Foundations Luzin set Cardinal function Knaster and friends OCA 54G20 HOD Filter reflection PFA very good scale indecomposable filter Fodor-type reflection Reduced Power Analytic sets Entangled linear order Strongly compact cardinal diamond star positive partition relation Square-Brackets Partition Relations Large Cardinals coloring number weak Kurepa tree Axiom R Partition relations for trees Almost countably chromatic free Boolean algebra SNR middle diamond Subtle tree property Singular cardinals combinatorics nonmeager set club_AD Ulam matrix b-scale ZFC construction Poset square AIM forcing Ineffable cardinal Sigma-Prikry Generalized Clubs Souslin Tree Commutative projection system stick Uniformization Universal Sequences Prevalent singular cardinals Cohen real Was Ulam right? Greatly Mahlo Mandelbrot set polarized partition relation Antichain Intersection model Dushnik-Miller L-space Strongly Luzin set Singular Density approachability ideal Hindman's Theorem Almost Souslin Hereditarily Lindelöf space Non-saturation free Souslin tree Ascending path Open Access Forcing Axioms Parameterized proxy principle stationary hitting Vanishing levels Coherent tree Almost-disjoint family weak diamond Constructible Universe Local Club Condensation. Distributive tree Slim tree PFA(S)[S] Minimal Walks Chromatic number Microscopic Approach xbox tensor product graph ccc Small forcing full tree Cardinal Invariants Sierpinski's onto mapping principle Rainbow sets Diamond countably metacompact Successor of Regular Cardinal Aronszajn tree higher Baire space Ascent Path Successor of Singular Cardinal Ramsey theory over partitions transformations Kurepa Hypothesis Rado's conjecture Closed coloring incompactness projective Boolean algebra P-Ideal Dichotomy strongly bounded groups weak square Amenable C-sequence Generalized descriptive set theory Jonsson cardinal Shelah's Strong Hypothesis sap Erdos Cardinal Knaster Well-behaved magma Reflecting stationary set Subadditive
Category Archives: Expository
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing $\aleph_1\nrightarrow[\aleph_1]^2_3$ has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found … Continue reading
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
Generalizations of Martin’s Axiom and the well-met condition
Recall that Martin’s Axiom asserts that for every partial order $\mathbb P$ satisfying c.c.c., and for any family $\mathcal D$ of $<2^{\aleph_0}$ many dense subsets of $\mathbb P$, there exists a directed subset $G$ of $\mathbb P$ such that $G\cap … Continue reading
Posted in Blog, Expository
Tagged ccc, Forcing Axioms, GMA, Martin's Axiom, Uniformization
Leave a comment
Many diamonds from just one
Recall Jensen’s diamond principle over a stationary subset $S$ of a regular uncountable cardinal $\kappa$: there exists a sequence $\langle A_\alpha\mid \alpha\in S \rangle$ such that $\{\alpha\in S\mid A\cap\alpha=A_\alpha\}$ is stationary for every $A\subseteq\kappa$. Equivalently, there exists a sequence $\langle … Continue reading
Square principles
Since the birth of Jensen’s original Square principle, many variations of the principle were introduced and intensively studied. Asaf Karagila suggested me today to put some order into all of these principles. Here is a trial. Definition. A square principle … Continue reading
Partitioning the club guessing
In a recent paper, I am making use of the following fact. Theorem (Shelah, 1997). Suppose that $\kappa$ is an accessible cardinal (i.e., there exists a cardinal $\theta<\kappa$ such that $2^\theta\ge\kappa)$. Then there exists a sequence $\langle g_\delta:C_\delta\rightarrow\omega\mid \delta\in E^{\kappa^+}_\kappa\rangle$ … Continue reading
Walk on countable ordinals: the characteristics
In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function $f:A\rightarrow B$ is said to … Continue reading
Syndetic colorings with applications to S and L
Notation. Write $\mathcal Q(A):=\{ a\subseteq A\mid a\text{ is finite}, a\neq\emptyset\}$. Definition. An L-space is a regular hereditarily Lindelöf topological space which is not hereditarily separable. Definition. We say that a coloring $c:[\omega_1]^2\rightarrow\omega$ is L-syndetic if the following holds. For every uncountable … Continue reading
Open coloring and the cardinal invariant $\mathfrak b$
Nik Weaver asked for a direct proof of the fact that Todorcevic’s axiom implies the failure of CH fails. Here goes. Notation. For a set $X$, we write $[X]^2$ for the set of unordered pairs $\{ \{x,x’\}\mid x,x’\in X, x\neq … Continue reading
PFA and the tree property at $\aleph_2$
Recall that a poset $\langle T,\le\rangle$ is said to be a $\lambda^+$-Aronszajn tree, if it isomorphic to a poset $(\mathcal T,\subseteq)$ of the form: $\emptyset\in \mathcal T\subseteq{}^{<\lambda^+}\lambda$; Write $\mathcal T_\alpha:=\{\sigma\in\mathcal T\mid \text{dom}(\sigma)=\alpha\}$; for all $\alpha<\lambda^+$, $\mathcal T_\alpha$ has size $\le\lambda$, … Continue reading
