Surf Wiki
Save to docs
general/axiom-of-choice

From Surf Wiki (app.surf) — the open knowledge base

Axiom of dependent choice

Weak form of the axiom of choice

Summary

Weak form of the axiom of choice

In mathematics, the axiom of dependent choice, denoted by \mathsf{DC} , is a weak form of the axiom of choice ( \mathsf{AC} ) that is still sufficient to develop much of real analysis. It was introduced by Paul Bernays in a 1942 article in reverse mathematics that explores which set-theoretic axioms are needed to develop analysis."The foundation of analysis does not require the full generality of set theory but can be accomplished within a more restricted frame." The axiom of dependent choice is stated on p. 86.

Formal statement

A homogeneous relation R on X is called a total relation if for every a \in X, there exists some b \in X such that a,R~b is true.

The axiom of dependent choice can be stated as follows: For every nonempty set X and every total relation R on X, there exists a sequence (x_n){n \in \N} in X such that :x_n, R~x{n + 1} for all n \in \N.

In fact, x0 may be taken to be any desired element of X. (To see this, apply the axiom as stated above to the set of finite sequences that start with x0 and in which subsequent terms are in relation R, together with the total relation on this set of the second sequence being obtained from the first by appending a single term.)

If the set X above is restricted to be the set of all real numbers, then the resulting axiom is denoted by \mathsf{DC}_{\R}.

Use

Even without such an axiom, for any n, one can use ordinary mathematical induction to form the first n terms of such a sequence. The axiom of dependent choice says that we can form a whole (countably infinite) sequence this way.

The axiom \mathsf{DC} is the fragment of \mathsf{AC} that is required to show the existence of a sequence constructed by transfinite recursion of countable length, if it is necessary to make a choice at each step and if some of those choices cannot be made independently of previous choices.

Equivalent statements

Over \mathsf{ZF} (Zermelo–Fraenkel set theory without the axiom of choice), \mathsf{DC} is equivalent to the Baire category theorem for complete metric spaces.

It is also equivalent over \mathsf{ZF} to the downward Löwenheim–Skolem theorem.Moore states that "Principle of Dependent Choices \Rightarrow Löwenheim–Skolem theorem" — that is, \mathsf{DC} implies the Löwenheim–Skolem theorem. See table

\mathsf{DC} is also equivalent over \mathsf{ZF} to the statement that every pruned tree with \omega levels has a branch (proof below).

Furthermore, \mathsf{DC} is equivalent to a weakened form of Zorn's lemma; specifically \mathsf{DC} is equivalent to the statement that any partial order such that every well-ordered chain is finite and bounded, must have a maximal element.

Proof that \,\mathsf{DC} \iff Every pruned tree with ω levels has a branch
(\,\Longleftarrow\,) Let R be an entire binary relation on X. The strategy is to define a tree T on X of finite sequences whose neighboring elements satisfy R. Then a branch through T is an infinite sequence whose neighboring elements satisfy R. Start by defining \langle x_0, \dots, x_n\rangle \in T if x_k R\,x_{k+1} for 0 \le k Since R is entire, T is a pruned tree with \omega levels. Thus, T has a branch \langle x_0, \dots, x_n, \dots\rangle. So, for all n \ge 0\!: \langle x_0, \dots, x_n, x_{n+1}\rangle \in T, which implies x_nR\,x_{n+1}. Therefore, \mathsf{DC} is true.

Relation with other axioms

Unlike full \mathsf{AC} , \mathsf{DC} is insufficient to prove (given \mathsf{ZF} ) that there is a non-measurable set of real numbers, or that there is a set of real numbers without the property of Baire or without the perfect set property. This follows because the Solovay model satisfies \mathsf{ZF} + \mathsf{DC} , and every set of real numbers in this model is Lebesgue measurable, has the Baire property and has the perfect set property.

The axiom of dependent choice implies the axiom of countable choice and is strictly stronger.

It is possible to generalize the axiom to produce transfinite sequences. If these are allowed to be arbitrarily long, then it becomes equivalent to the full axiom of choice.

Notes

References

References

  1. Blair, Charles E.. (1977). "The Baire category theorem implies the principle of dependent choices". Bull. Acad. Polon. Sci. Sér. Sci. Math. Astron. Phys..
  2. (1989). "Computability and Logic". Cambridge University Press.
  3. Wolk, Elliot S.. (1983). "On the principle of dependent choices and some forms of Zorn's lemma". [[Canadian Mathematical Bulletin]].
  4. Bernays, Paul. (1942). "Part III. Infinity and enumerability. Analysis.". Journal of Symbolic Logic.
  5. Jech, Thomas. (1973). "The Axiom of Choice". North Holland.
Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

axiom-of-choice
Want to explore this topic further?

Ask Mako anything about Axiom of dependent choice — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report