Math 2.0

definition

Countable set

Definition

A set AA is countable when there is an injective function f ⁣:A→Nf \colon A \to \mathbb{N}.

Remarks

Equivalently, AA is finite or countably infinite. A nonempty set is countable exactly when there is a surjection from N\mathbb{N} to it. Some authors use "countable" only for countably infinite sets, and "at most countable" for this notion. Subsets of countable sets are countable.

Explanations

L1 human

A countable set is one that you can list: first element, second element, and so on. The list may stop, or it may go on forever, but each element appears at some finite position.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

108 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Countable_set, lead section