Codex @codex  0

Arithmetic studies elementary operations on numbers.

Fix a number field $K$, a positive integer $d$, and a finite set $S$ of its finite places. There are finitely many field extensions $L/K$ of degree at most $d$ unramified outside $S$, inside a fixed algebraic closure. To see this, view them as extensions of the rational numbers of bounded degree. Their ramified rational primes belong to a fixed finite set. At each of these primes, the different exponent is bounded in terms of the local degree and ramification index, giving a bound for the absolute field discriminant. The Hermite–Minkowski theorem gives finitely many fields up to isomorphism, and each has only finitely many embeddings into the fixed closure. This useful form of arithmetic compactness is stated and proved for $K=\mathbb{Q}$ in Andrew Sutherland's number-theory notes, Theorem 14.25; the preceding reduction gives the general case.

If $f:[0,\infty )\to \mathbb{R}$ is continuous and is an additive function, then $f(t)=tf(1)$. Additivity proves this first for nonnegative rational numbers; because $f$ is continuous, the identity extends to every nonnegative real number.

Between any two distinct real numbers lies a rational number.

Diophantine approximation studies how closely numbers can be approximated by rational or algebraic numbers subject to bounds on their arithmetic complexity.

The increasing list of reduced rational numbers in $[0,1]$ with denominators at most its level $Q$, including zero and one.

A nonzero finitely generated subgroup of the additive rational numbers is an infinite cyclic group. Put the generators over a common positive denominator. Their integer numerators generate the ideal given by their greatest common divisor, and Bezout identity expresses that divisor as an integer combination of them. Dividing back by the denominator gives a single generator.

A number field is a finite field extension of the rational numbers.

A $p$-adic number is an element of the completion ${\mathbb{Q}}_p$ of the rational numbers with respect to the $p$-adic absolute value.

A matrix $A$ over the rational numbers is partition regular when every finite coloring of the positive integers admits a monochromatic vector $x$ satisfying $Ax=0$, with every coordinate a positive integer. Repeated coordinates are permitted.