## You are here

HomeTukey's lemma

## Primary tabs

# Tukey’s lemma

Each nonempty family of finite character has a maximal element.

Here, by a maximal element we mean a maximal element with respect to the inclusion ordering: $A\leq B$ iff $A\subseteq B$. This lemma is equivalent to the axiom of choice.

Related:

AxiomOfChoice, MaximalityPrinciple, ZornsLemma, ZermelosPostulate, KuratowskisLemma

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

03E25*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella