Countable set in the context of "Discrete symmetry"

An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative integers. The set of all integers is often denoted by the boldface Z or blackboard bold ${\displaystyle \mathbb {Z} }$.

The set of natural numbers ${\displaystyle \mathbb {N} }$ is a subset of ${\displaystyle \mathbb {Z} }$, which in turn is a subset of the set of all rational numbers ${\displaystyle \mathbb {Q} }$, itself a subset of the real numbers ⁠${\displaystyle \mathbb {R} }$⁠. Like the set of natural numbers, the set of integers ${\displaystyle \mathbb {Z} }$ is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, ⁠5+1/2⁠, 5/4, and the square root of 2 are not.

Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a one-to-one correspondence (bijection) with natural numbers), rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics".

The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometimes applied to parts of the field of discrete mathematics that deal with finite sets, particularly those areas relevant to business.

In set theory, an infinite set is a set that is not a finite set. Infinite sets may be countable or uncountable.

In probability theory, the sample space (also called sample description space, possibility space, or outcome space) of an experiment or random trial is the set of all possible outcomes or results of that experiment. A sample space is usually denoted using set notation, and the possible ordered outcomes, or sample points, are listed as elements in the set. It is common to refer to a sample space by the labels S, Ω, or U (for "universal set"). The elements of a sample space may be numbers, words, letters, or symbols. They can also be finite, countably infinite, or uncountably infinite.

A subset of the sample space is an event, denoted by ${\displaystyle E}$. If the outcome of an experiment is included in ${\displaystyle E}$, then event ${\displaystyle E}$ has occurred.

In mathematics, an uncountable set, informally, is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than aleph-null, the cardinality of the natural numbers.

Examples of uncountable sets include the set ⁠${\displaystyle \mathbb {R} }$⁠ of all real numbers and set of all subsets of the natural numbers.

In mathematics, a transcendental number is a real or complex number that is not algebraic: that is, not the root of a non-zero polynomial with integer (or, equivalently, rational) coefficients. The best-known transcendental numbers are π and e. The quality of a number being transcendental is called transcendence.

Though only a few classes of transcendental numbers are known (partly because it can be extremely difficult to show that a given number is transcendental) transcendental numbers are not rare: indeed, almost all real and complex numbers are transcendental, since the algebraic numbers form a countable set, while the set of real numbers ⁠${\displaystyle \mathbb {R} }$⁠ and the set of complex numbers ⁠${\displaystyle \mathbb {C} }$⁠ are both uncountable sets, and therefore larger than any countable set.

In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available.

Since there are only countably many notations, all ordinals with notations are exhausted well below the first uncountable ordinal ω₁; their supremum is called Church–Kleene ω₁ or ω
₁ (not to be confused with the first uncountable ordinal, ω₁), described below. Ordinal numbers below ω
₁ are the recursive ordinals (see below). Countable ordinals larger than this may still be defined, but do not have notations.