<?xml version="1.0" encoding="UTF-8"?>

<record version="6" id="1341">
 <title>Zorn's lemma</title>
 <name>ZornsLemma</name>
 <created>2002-01-05 08:28:54</created>
 <modified>2009-02-16 15:42:14</modified>
 <type>Theorem</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="27" name="Evandar"/>
 <classification>
	<category scheme="msc" code="06A06"/>
	<category scheme="msc" code="03E25"/>
 </classification>
 <related>
	<object name="AxiomOfChoice"/>
	<object name="MaximalityPrinciple"/>
	<object name="HaudorffsMaximumPrinciple"/>
	<object name="ZornsLemmaAndTheWellOrderingTheoremEquivalenceOfHaudorffsMaximumPrinciple"/>
	<object name="EveryVectorSpaceHasABasis"/>
	<object name="TukeysLemma"/>
	<object name="ZermelosPostulate"/>
	<object name="KuratowskisLemma"/>
	<object name="EveryRingHasAMaximalIdeal"/>
	<object name="InductivelyOrdered"/>
 </related>
 <keywords>
	<term>Set theory</term>
 </keywords>
 <preamble>%\usepackage{amssymb}
%\usepackage{amsmath}
%\usepackage{amsfonts}</preamble>
 <content>\PMlinkescapeword{equivalent}

If $X$ is a partially ordered set
such that every chain in $X$ has an upper bound,
then $X$ has a maximal element.

Note that the empty chain in $X$ has an upper bound in $X$
if and only if $X$ is non-empty.
Because this case is rather different from the case of non-empty chains,
Zorn's Lemma is often stated in the following form:
If $X$ is a non-empty partially ordered set
such that every non-empty chain in $X$ has an upper bound,
then $X$ has a maximal element.
(In other words: Any non-empty inductively ordered set has a maximal element.)

In ZF, Zorn's Lemma is equivalent to the \PMlinkname{Axiom of Choice}{AxiomOfChoice}.
</content>
</record>
