Английская Википедия:Axiom of dependent choice

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description In mathematics, the axiom of dependent choice, denoted by <math> \mathsf{DC} </math>, is a weak form of the axiom of choice (<math> \mathsf{AC} </math>) that is still sufficient to develop much of real analysis. It was introduced by Paul Bernays in a 1942 article that explores which set-theoretic axioms are needed to develop analysis.

Formal statement

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

The axiom of dependent choice can be stated as follows: For every nonempty set <math>X</math> and every total relation <math>R</math> on <math>X,</math> there exists a sequence <math>(x_n)_{n \in \N}</math> in <math>X</math> such that

<math>x_n\, R~x_{n + 1}</math> for all <math>n \in \N.</math>

In fact, x₀ 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 x₀ and in which subsequent terms are in relation <math>R</math>, 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 <math>X</math> above is restricted to be the set of all real numbers, then the resulting axiom is denoted by <math>\mathsf{DC}_{\R}. </math>

Use

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

The axiom <math> \mathsf{DC} </math> is the fragment of <math> \mathsf{AC} </math> 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 <math> \mathsf{ZF} </math> (Zermelo–Fraenkel set theory without the axiom of choice), <math> \mathsf{DC} </math> is equivalent to the Baire category theorem for complete metric spaces.

It is also equivalent over <math> \mathsf{ZF} </math> to the downward Löwenheim–Skolem theorem.

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

Furthermore, <math> \mathsf{DC} </math> is equivalent to a weakened form of Zorn's lemma; specifically <math> \mathsf{DC} </math> 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 <math>\,\mathsf{DC} \iff</math> Every pruned tree with ω levels has a branch

<math>(\,\Longleftarrow\,)</math> Let <math>R</math> be an entire binary relation on <math>X</math>. The strategy is to define a tree <math>T</math> on <math>X</math> of finite sequences whose neighboring elements satisfy <math>R.</math> Then a branch through <math>T</math> is an infinite sequence whose neighboring elements satisfy <math>R.</math> Start by defining <math>\langle x_0, \dots, x_n\rangle \in T</math> if <math>x_k R\,x_{k+1}</math> for <math>0 \le k < n.</math> Since <math>R</math> is entire, <math>T</math> is a pruned tree with <math>\omega</math> levels. Thus, <math>T</math> has a branch <math>\langle x_0, \dots, x_n, \dots\rangle.</math> So, for all <math>n \ge 0\!:</math> <math>\langle x_0, \dots, x_n, x_{n+1}\rangle \in T,</math> which implies <math>x_nR\,x_{n+1}.</math> Therefore, <math>\mathsf{DC}</math> is true. <math>(\,\Longrightarrow\,)</math> Let <math>T</math> be a pruned tree on <math>X</math> with <math>\omega</math> levels. The strategy is to define a binary relation <math>R</math> on <math>T</math> so that <math>\mathsf{DC}</math> produces a sequence <math>t_n = \langle x_0, \dots, x_{f(n)} \rangle</math> where <math>t_nR\,t_{n+1}</math> and <math>f(n)</math> is a strictly increasing function. Then the infinite sequence <math>\langle x_0, \dots, x_k, \dots \rangle</math> is a branch. (This proof only needs to prove this for <math>f(n) = m + n.</math>) Start by defining <math>u\,R\,v</math> if <math>u</math> is an initial subsequence of <math>v,\operatorname{length}(u) > 0,\,</math> and <math>\operatorname{length}(v) =</math> <math>\operatorname{length}(u) + 1.</math> Since <math>T</math> is a pruned tree with <math>\omega</math> levels, <math>R</math> is entire. Therefore, <math>\mathsf{DC}</math> implies that there is an infinite sequence <math>t_n</math> such that <math>t_n\,R\,t_{n+1}.</math> Now <math>t_0 = \langle x_0, \dots, x_m \rangle</math> for some <math>m \ge 0.</math> Let <math>x_{m+n}</math> be the last element of <math>t_n.</math> Then <math>t_n = \langle x_0, \dots, x_m, \dots, x_{m+n} \rangle.</math> For all <math>k \ge 0,</math> the sequence <math>\langle x_0, \dots, x_k \rangle</math> belongs to <math>T</math> because it is an initial subsequence of <math>t_0\, (k \le m)</math> or it is a <math>t_n\, (k \ge m).</math> Therefore, <math>\langle x_0, \dots, x_k, \dots \rangle</math> is a branch.

Relation with other axioms

Unlike full <math> \mathsf{AC} </math>, <math> \mathsf{DC} </math> is insufficient to prove (given <math> \mathsf{ZF} </math>) 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 <math> \mathsf{ZF} + \mathsf{DC} </math>, 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.

References

• Шаблон:Cite book