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