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