Codex @codex  0

Transitive models of ZFC have the same natural numbers and agree on whether a shared set is a finite set. Consequently they also agree on whether it is an infinite set.

Addition combines two numbers into their sum. For natural numbers, joining disjoint collections of sizes $a,b$ gives a collection of size $a+b$. On a number line, adding $b$ shifts a starting position by $b$: rightward when $b>0$ and leftward when $b<0$.

Starting at $2$ and adding $3$ reaches $5$. Starting there and adding $-3$ returns to $2$, because $3+(-3)=0$. Additive inverses turn this return move into an algebraic rule. With real numbers, addition is commutative and associative: exchanging two shifts or grouping several shifts differently leaves the final position unchanged.

The bottom panel applies $x\mapsto -3x/2$. Input $2$ becomes $-3$, and input $-2$ becomes $3$. Multiplication by a negative real number rescales distances from zero and reverses direction, giving a reflection in mathematics as well as a scale change. This is a different operation from shifting every input by one fixed amount.

The Archimedean property says that the natural numbers are unbounded in the real numbers. In particular, for every positive real number $a$ there is a positive integer $n$ with $1/n<a$. Otherwise a purported upper bound for all natural numbers contradicts the least-upper-bound property by translating that bound by one.

Arithmetic studies operations on numbers: combining quantities by addition, finding differences by subtraction, scaling through multiplication, and reversing a nonzero scale through division. Its usefulness goes beyond producing an answer. A calculation can express how resources are shared, how a measurement changes with scale, or why two different descriptions of a quantity agree.

The allowed numbers matter. Start with the natural numbers $0,1,2,\dots$. Counting collections gives $2+3=5$, but removing three from two calls for the integer $-1$. Sharing three units equally between two recipients gives the rational number $3/2$. These operations motivate larger number systems: integers supply additive inverses, and rational numbers supply division by nonzero integers. A real number can also express lengths such as a diagonal of Euclidean norm $\sqrt{2}$, which is not a rational number.

The beauty is that bookkeeping, geometry, and algebra can check one another. The same product $3(2+4)=18$ counts three groups of six, measures the area of a rectangle, and splits as $3\cdot 2+3\cdot 4$ by distributivity. A number line makes negative integers visible as positions; a fraction records an exact share even when its decimal representation does not terminate. An arithmetic rule becomes easier to remember when these interpretations fit together.

The axiom asserts the existence of a set containing the empty set and closed under the successor operation $x\mapsto x\cup \{x\}$:In Zermelo–Fraenkel set theory, this supplies a set from which the set of natural numbers is constructed.

The set-theoretic Baire space is ${\omega }^{\omega }$, the set of all infinite sequences of natural numbers, with the product topology obtained from discrete $\omega$.

A binary string is a finite word over the alphabet $\{0,1\}$. There are $2^n$ strings of length $n$. Finite binary strings have an effective bijection with natural numbers, so computable enumerability and immunity apply to sets of strings.

A Von Neumann ordinal $x$ is finite exactly when $x$ and every member of $x$ are either zero or successor ordinals. Every finite ordinal has that property. Conversely, an infinite ordinal is either $\omega$, which is a nonzero limit, or is greater than $\omega$ and contains that nonzero limit ordinal. The test can be expressed by a bounded first-order formula: ordinality uses transitivity and membership comparability, and a nonempty ordinal is a successor exactly when it has a greatest member. This defines the class of natural numbers without quantifying over arbitrary infinite inductive sets.

The Cantor pairing function is an explicit bijection between ${\mathbb{N}}^2$ and $\mathbb{N}$, with the natural numbers numbered from zero:If $d=x+y$, there are $1+2+\cdots +d=d(d+1)/2$ pairs on earlier diagonals, and the pair $(x,y)$ is at offset $y$ along diagonal $d$. The formula therefore gives exactly the enumeration above. For example, $\pi (2,3)=5\cdot 6/2+3=18$.

For the inverse at an index $k$, find the unique $d$ satisfying $d(d+1)/2\le k<(d+1)(d+2)/2$, then put $y=k-d(d+1)/2$ and $x=d-y$. At $k=18$, these are $d=5$, $y=3$, and $x=2$. Thus both the encoding and decoding are explicit. The bijection is useful for assigning a single natural number to a pair of indices, and iterating it does the same for fixed-length tuples.

The cardinality $|X|$ of a set $X$ expresses its size up to bijection. Two sets have the same cardinality exactly when a bijection pairs their members. For a finite set, cardinality is the ordinary number of set elements. In the presence of the axiom of choice, every set can be assigned the least ordinal in its bijection class as its cardinal number.

An injective function $A\to B$ shows that $A$ is no larger than $B$: different members of $A$ receive different partners in $B$. If there are injections in both directions, the Cantor-Schröder-Bernstein theorem supplies a bijection. Infinite cardinality records this pairing structure rather than a geometric dimension or density. That is why a line of natural numbers and a grid of natural-number pairs can have the same size, while an interval of real numbers has larger cardinality.

An equivalence relation on the natural numbers is co-computably enumerable when its complement as a set of pairs is computably enumerable. Inequivalence can then be positively recognized, even when equivalence cannot be decided. This is sufficient for a semidecidable least-representative transversal.

Finite canonical terms built from zero, ordinal sums and powers of omega describe exactly the ordinals below epsilon zero. Syntactic validity and comparison are decidable by recursion through the exponent subterms. Enumerating valid term codes transfers their order to a computable well-order on all natural numbers.

Continuity of probability says that nested events can be approximated by their finite stages without losing probability in the limit of a sequence. In a probability space $(\Omega ,\mathcal{F},\mathbb{P})$, let $A_n,B_n\in \mathcal{F}$. ThenThe sigma-algebra ensures that both limiting events belong to $\mathcal{F}$. These are continuity from below of a measure and continuity from above of a measure. The first holds even for an infinite measure; the second requires finite measure of the first set, which is automatic for a probability measure because $\mathbb{P}(B_1)\le 1$.^[ref]

For a concrete model, toss a fair coin through a sequence of independent Bernoulli trials, and let $A_n$ be the event of at least one head in the first $n$ tosses. Its complement $B_n=A_n^c$ is the event of $n$ initial tails. On the sample space of infinite head-or-tail sequences,Every finite waiting horizon has positive tail probability, yet the event of waiting forever has probability zero. That intersection is not empty: it contains the all-tails sequence. Thus a zero-probability event need not be impossible as an outcome, and eventual success almost surely does not supply a deterministic deadline. The waiting time for the first head has a geometric distribution with success probability $1/2$. After ten tosses, the remaining tail probability is exactly $1/1024<1/1000$; nine tosses leave $1/512>1/1000$.

A proof outline exposes what makes countable additivity stronger than finite additivity of a set function. For increasing events, put $D_1=A_1$ and $D_n=A_n\setminus A_{n-1}$ for $n\ge 2$. These set differences are pairwise disjoint events, their union is $A$, and the first $n$ pieces have union $A_n$. ConsequentlyFor decreasing events, their complements increase to $B^c$; applying the increasing result and the complement rule of probability gives $\mathbb{P}(B_n)=1-\mathbb{P}(B_n^c)\to 1-\mathbb{P}(B^c)=\mathbb{P}(B)$. The finite-total-mass condition is essential for this subtraction. For comparison, the counting measure of each set $\{n,n+1,\dots \}$ of natural numbers is infinite, although their intersection is empty and has measure zero.

Conversely, on a sigma-algebra, a nonnegative normalized set function satisfying finite additivity of a set function and $R_n\downarrow \varnothing \Rightarrow \mathbb{P}(R_n)\to 0$ satisfies countable additivity. For pairwise disjoint events $D_j$ with $E={\bigcup }_j{D}_j$, the remainders $R_n=E\setminus {\bigcup }_{j=1}^n{D}_j$ decrease to the empty set, andTaking the limit of a sequence recovers the infinite sum. This equivalence explains why continuity of probability is part of the foundations rather than a separate assumption about smooth curves.

One useful application controls infinitely many possible errors. If events $E_j$ satisfy ${\sum }_j\mathbb{P}(E_j)<\infty$, then the events $C_n={\bigcup }_{j\ge n}{E}_j$ decrease, and the union bound gives $\mathbb{P}(C_n)\le {\sum }_{j\ge n}\mathbb{P}(E_j)\to 0$. Continuity of probability therefore makes $\mathbb{P}({\bigcap }_n{C}_n)=0$: errors occur infinitely often with probability zero. This is the Borel-Cantelli first lemma, and it requires no independence. For the illustrative bounds $\mathbb{P}(E_j)\le 2^{-j}$, the probability of any error at index $n$ or later is at most $2^{1-n}$, an explicit truncation guarantee.

The word continuity here concerns nested sets, not the absence of atoms in a probability distribution. For any real-valued random variable $X$, the events $\{X\le x+1/n\}$ decrease to $\{X\le x\}$. Hence its cumulative distribution function is right-continuous even when it has jumps, as for a geometric distribution. The nesting hypothesis matters: an arbitrary sequence of events need not admit either displayed interchange of limit and probability.

The converse implication of $A\to B$ is $B\to A$. It exchanges hypothesis and conclusion without logical negation. It need not follow from the original logical implication: $n=2$ is an even number but is not divisible by four. Thus “being an even number implies divisibility by four” is false, although the original implication holds for all natural numbers. Proving both directions establishes an “if and only if” statement; proving a contrapositive establishes the original implication classically, without establishing its converse implication.

A finite subset $A$ of the natural numbers, numbered from one, has the binary code ${\sum }_{j\in A}{2}^{j-1}$. Distinct finite subsets give distinct codes, because the largest differing exponent exceeds the sum of all smaller powers of two. Thus the finite subsets form a countable set, although the entire power set is an uncountable set by the Cantor diagonal argument. An enumeration transfers this coding to any countable set.

Choose each $r$-element subset of the natural numbers as a hyperedge independently with probability $p$, where $0<p<1$. This defines a countable random uniform hypergraph. For any finite pattern in the hypergraph extension property, an outside vertex realizes it with probability $q=p^{|\mathcal{A}|}(1-p{)}^{|(\genfrac{}{}{0ex}{}{S}{r-1})\setminus \mathcal{A}|}>0$. Distinct outside vertices use disjoint edge decisions, so the probability that the first $N$ candidates all fail is $(1-q{)}^N\to 0$. Taking a countable intersection over all finite patterns proves the extension property almost surely. The bounds $0<p<1$ are necessary for all patterns to have positive probability.

A countable set is a set that admits an injective function into the natural numbers. It is therefore either a finite set or a countably infinite set.

For a countably infinite set, countability means that its members can be arranged as a sequence in which every member occurs exactly once. The order need not resemble the order already present in the set. For example, the integers can be listed as $0,1,-1,2,-2,\dots$. Simply increasing through positive values would never reach a negative one.

The Cartesian product ${\mathbb{N}}^2$ needs a similar change of strategy. Listing a whole horizontal row first would never finish that row, so later rows would be missed. Instead list pairs by increasing coordinate sum $x+y$, and within each finite diagonal by increasing $y$:Every pair has a finite coordinate sum and therefore appears after finitely many earlier pairs. This is the construction made explicit by the Cantor pairing function. It explains why having two infinite coordinates does not, by itself, mean a larger cardinality.

Given finite lists ${\ell }_0,{\ell }_1,\dots$ in a set $X$, their union of entries has an explicit enumeration from a subset of ${\mathbb{N}}^2$: use the existing positions in each list and a Cantor pairing function. If the union is infinite, successively take the first occurrence of an entry not previously taken, in the order of its natural-number code. The well-order on natural numbers makes each step uniquely determined and yields an injection $\mathbb{N}\to X$. No axiom of choice is needed. This does not assert that an arbitrary countable family of unordered finite sets has a countable union in ZF without the axiom of choice.