Mathematical logic and foundations Definition
Axiom of dependent choice
Builds on SetBinary relationSequence
Definition
The axiom of dependent choice is the following statement. Let be a nonempty set and let be a binary relation on . Assume that for each there is with . Then there is a sequence of elements of such that for each .
Remarks
Example: let and let mean . Each has with , and the sequence satisfies the conclusion. Non-example of the hypothesis: on with , the element has no with . No sequence with for all exists, so the hypothesis cannot be dropped. The axiom is abbreviated DC. Over ZF, the axiom of choice implies DC, and DC implies the axiom of countable choice; neither implication reverses. Over ZF, DC is equivalent to the Baire category theorem for complete metric spaces. An equivalent form says that a relation on a nonempty set is well-founded if and only if there is no sequence with for all .
Reading path
To understand this page from the ground up, read these 12 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Sequence definition
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Axiom of dependent choice definition
Further reading
About this page
| Tag | TPXEFSBQYB |
|---|---|
| URI | m2://TPXEFSBQYB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 03E25 |
| Defines | Axiom of dependent choice |
| Uses | Set, Binary relation, Sequence |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.