Skip to main content
added Wikipedia links
Source Link
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

Hindman's theoremHindman's theorem : if I remember correctly, the original proof was elementary but very long and complicated; whereas a proof using an idempotent ultrafilter can be explained in less than a page.

Still with ultrafilters, there's also Tychonoff's theoremTychonoff's theorem : the original proofs, either Tychonoff's with complete accumulation points, or the one with the Alexander subbase theoremAlexander subbase theorem are somewhat technical and require some imagination.

The proof using ultrafilters is extremely straightforward and anyone who has learned about ultrafilters can find it with little to no imagination. It also has the advantage of showing that if you work with Hausdorff spaces, you don't need the full axiom of choice, whereas the Alexander subbase theorem uses Zorn's lemma indistinctly.

Hindman's theorem : if I remember correctly, the original proof was elementary but very long and complicated; whereas a proof using an idempotent ultrafilter can be explained in less than a page.

Still with ultrafilters, there's also Tychonoff's theorem : the original proofs, either Tychonoff's with complete accumulation points, or the one with the Alexander subbase theorem are somewhat technical and require some imagination.

The proof using ultrafilters is extremely straightforward and anyone who has learned about ultrafilters can find it with little to no imagination. It also has the advantage of showing that if you work with Hausdorff spaces, you don't need the full axiom of choice, whereas the Alexander subbase theorem uses Zorn's lemma indistinctly.

Hindman's theorem : if I remember correctly, the original proof was elementary but very long and complicated; whereas a proof using an idempotent ultrafilter can be explained in less than a page.

Still with ultrafilters, there's also Tychonoff's theorem : the original proofs, either Tychonoff's with complete accumulation points, or the one with the Alexander subbase theorem are somewhat technical and require some imagination.

The proof using ultrafilters is extremely straightforward and anyone who has learned about ultrafilters can find it with little to no imagination. It also has the advantage of showing that if you work with Hausdorff spaces, you don't need the full axiom of choice, whereas the Alexander subbase theorem uses Zorn's lemma indistinctly.

Source Link
Maxime Ramzi
  • 15.8k
  • 2
  • 40
  • 74

Hindman's theorem : if I remember correctly, the original proof was elementary but very long and complicated; whereas a proof using an idempotent ultrafilter can be explained in less than a page.

Still with ultrafilters, there's also Tychonoff's theorem : the original proofs, either Tychonoff's with complete accumulation points, or the one with the Alexander subbase theorem are somewhat technical and require some imagination.

The proof using ultrafilters is extremely straightforward and anyone who has learned about ultrafilters can find it with little to no imagination. It also has the advantage of showing that if you work with Hausdorff spaces, you don't need the full axiom of choice, whereas the Alexander subbase theorem uses Zorn's lemma indistinctly.

Post Made Community Wiki by Maxime Ramzi