Axiom of countable choice in the context of Countably infinite


Axiom of countable choice in the context of Countably infinite

Axiom of countable choice Study page number 1 of 1

Play TriviaQuestions Online!

or

Skip to study material about Axiom of countable choice in the context of "Countably infinite"


⭐ Core Definition: Axiom of countable choice

The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty sets must have a choice function. That is, given a function with domain (where denotes the set of natural numbers) such that is a non-empty set for every , there exists a function with domain such that for every .

↓ Menu
HINT:

In this Dossier

Axiom of countable choice in the context of Countable set

In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is countable if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements.

In more technical terms, assuming the axiom of countable choice, a set is countable if its cardinality (the number of elements of the set) is not greater than that of the natural numbers. A countable set that is not finite is said to be countably infinite.

View the full Wikipedia page for Countable set
↑ Return to Menu