Defining Choice Functions: When & How Without Using Axiom of Choice

In summary, the choice function allows you to select one element from a set, as long as the set is the domain of the choice function. If the set is finite, you do not need to use the Axiom of Choice. However, for infinite sets, it depends on whether the set is well-ordered or not. If every subset of the set is well-ordered, then you can define a choice function without using the Axiom of Choice. However, for sets like the real numbers, which are dense, you would need to use the Axiom of Choice to define a choice function. Additionally, the integers are not naturally well-ordered, but you can define a choice function by choosing the minimal ordered pair
  • #71
A function f with domain S is a choice function for S if and only if [itex]f(s) \in s[/itex] for all s in S.
 
Physics news on Phys.org
  • #72
The Axiom of Choice is equivalent to the statement that every non-empty set has a choice function. [Is this correct?]

If so, then for some sets a choice function can be defined without using the Axiom of Choice. [Is this correct?]

If so, the I may define an explicit choice function for that set.
 
  • #73
Oxymoron said:
The Axiom of Choice is equivalent to the statement that every non-empty set has a choice function.
No; the AoC is the statement that every set of nonempty sets has a choice function.

Just to make it explicit, the mistakes you made were:
(1) The AoC applies to the empty set. (It's choice function is the empty function)

(2) If S contains the empty set, it cannot possibly have a choice function (you cannot possibly have [itex]f(\emptyset) \in \emptyset[/itex]). The AoC applies to all sets that do not contain the empty set.


If so, the I may define an explicit choice function for that set.
If you can explicitly define a choice function, then you can explicitly define a choice function.

An example of an explicitly defined choice function is the following choice function for the set S = {{a}, {b, c}}:

f({a}) := a
f({b, c}) := c

or, as a set-of-ordered-pairs:

f := { ({a}, a), ({b, c}, c) }
 
Last edited:
  • #74
Oxymoron said:
If so, the I may define an explicit choice function for that set.

If you have to use AC, then you don't have an explicit choice function, you just know that some choice function exists.
 

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
6
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
13
Views
958
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
11
Views
5K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
88
  • Set Theory, Logic, Probability, Statistics
Replies
10
Views
1K
Back
Top