Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds... 26 KB (3,678 words) - 08:20, 10 February 2024 |
titled Zorns Lemma after Zorn's lemma (also known as the Kuratowski–Zorn lemma), a proposition of set theory formulated by mathematician Max Zorn in 1935... 15 KB (1,672 words) - 05:03, 4 April 2024 |
sets amongst others. Zorn's lemma was first postulated by Kazimierz Kuratowski in 1922, and then independently by Zorn in 1935. Zorn was born in Krefeld... 8 KB (749 words) - 22:11, 21 March 2024 |
Poincaré's lemma Riesz's lemma Schur's lemma Schwarz's lemma Sperner's lemma Urysohn's lemma Vitali covering lemma Yoneda's lemma Zorn's lemma While these... 4 KB (402 words) - 14:38, 17 November 2023 |
induction. The theorem admits a simple proof using Zorn's lemma, and in fact is equivalent to Zorn's lemma, which in turn is equivalent to the axiom of choice... 2 KB (309 words) - 09:54, 30 January 2024 |
example of the use of chain for referring to totally ordered subsets is Zorn's lemma which asserts that, if every chain in a partially ordered set X has an... 21 KB (3,094 words) - 17:19, 9 April 2024 |
theory, the Teichmüller–Tukey lemma is equivalent to the axiom of choice, and therefore to the well-ordering theorem, Zorn's lemma, and the Hausdorff maximal... 2 KB (292 words) - 05:50, 27 August 2022 |
Hausdorff maximal principle is an alternate and earlier formulation of Zorn's lemma proved by Felix Hausdorff in 1914 (Moore 1982:168). It states that in... 3 KB (464 words) - 17:22, 16 April 2024 |
of the most common is in the proof that the axiom of choice implies Zorn's lemma. We first prove it for the case where X is chain complete and has no... 4 KB (540 words) - 10:40, 9 March 2021 |
equivalent to the axiom of choice. The most important among them are Zorn's lemma and the well-ordering theorem. In fact, Zermelo initially introduced... 59 KB (7,953 words) - 05:25, 27 March 2024 |