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