Graduate About the “Axiom of Dependent Choice”

  • Thread starter Thread starter steenis
  • Start date Start date
  • Tags Tags
    Choice Logic
Click For Summary
The "Axiom of Dependent Choice" states that for any nonempty set and entire binary relation, a sequence can be constructed where each element relates to the next. This axiom is particularly useful in real analysis for creating sequences with distinct elements. It is considered weaker than the Axiom of Choice (AC), which raises questions about its implications for well-ordering and paradoxes like Banach-Tarski. Many mathematicians prefer using the full AC or its equivalents, such as Zorn's lemma, to ensure results without delving into weaker assumptions. The discussion highlights the balance between practical application and theoretical exploration in mathematical practice.
steenis
Messages
312
Reaction score
18
I learned something new today: the “Axiom of Dependent Choice”:

The axiom can be stated as follows: For every nonempty set ##X## and every entire binary relation ##R## on ##X##, there exists a sequence ##(x_n)_{ n \in \mathbb{N} }## in ##X## such that ##x_nRx_{n+1}## for all ##n \in \mathbb{N}##. (Here, an entire binary relation on ##X## is one where for every ##a \in X##, there exists a ##b \in X## such that ##aRb##.)

See Wikipedia: https://en.wikipedia.org/wiki/Axiom_of_dependent_choice

I want to ask here: what is your experience with this axiom? Did you ever use the “Axiom of Dependent Choice”, how and why?
 
  • Like
Likes member 587159
Physics news on Phys.org
I have not heard of it, but can see why it would be useful. Sometimes in real analysis one wants to make a sequence in which the next element is different from the current one. Using the relation ##\neq## and the above axiom, one can assert the existence of such a sequence in any set with two or more elements, as the relation is entire if there are more than two elements.

There was a proof that was being discussed on here the other day that needed something like that. Unfortunately I can't remember the context, other than it was real analysis - probably something about sequences. Not knowing about this axiom, I just said we had to assume AC - assuming it needed the full version.

It sounds from the wiki article like this axiom is strictly weaker than AC. It would be nice if it allowed one to recover most of the popular results of real analysis without having to accept the Banach-Tarski conundrum, or the theorem that every set can be well-ordered as a conclusion. I wonder if it is weak enough to prevent either or both of those.
 
I think most mathematicians use the full axiom of choice, or some of its more useful equivalents such as Zorn's lemma, when they need this kind of arguments, even in cases where the axiom of dependent choice would suffice. Because what is important fot most mathematicians is to get job done, not investigate which are the weakest assumptions necessary. It is mainly logicians, set theorists et al who are interested in the latter.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 21 ·
Replies
21
Views
12K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K