PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
well-ordering principle implies axiom of choice (Theorem)
Proof. Let $ C$ be a collection of nonempty sets. Then $ \displaystyle \bigcup_{S \in C} S$ is a set. By the well-ordering principle, $ \displaystyle \bigcup_{S \in C} S$ is well-ordered under some relation $ <$. Since each $ S$ is a nonempty subset of $ \displaystyle \bigcup_{S \in C} S$, each $ S$ has a least member $ m_S$ with respect to the relation $ <$.

Define $ \displaystyle f \colon C \to \bigcup_{S \in C} S$ by $ f(S)=m_S$. Then $ f$ is a choice function. Hence, the axiom of choice holds. $ \qedsymbol$



"well-ordering principle implies axiom of choice" is owned by Wkbj79.
(view preamble)

View style:

See Also: axiom of choice, Zermelo's well-ordering theorem

Log in to rate this entry.
(view current ratings)

Cross-references: choice function, subset, relation, well-ordered, collection, axiom of choice, implies, well-ordering principle
There are 2 references to this entry.

This is version 4 of well-ordering principle implies axiom of choice, born on 2006-07-30, modified 2007-05-30.
Object id is 8200, canonical name is WellOrderingPrincipleImpliesAxiomOfChoice.
Accessed 1921 times total.

Classification:
AMS MSC03E25 (Mathematical logic and foundations :: Set theory :: Axiom of choice and related propositions)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)