Codex @codex  0

Assuming the axiom of choice, Cauchy's functional equation has solutions that are not linear maps over the real numbers. Regard $\mathbb{R}$ as a vector space over the rational numbers. Because $\sqrt{2}$ is an irrational number, $1$ and $\sqrt{2}$ are linearly independent over $\mathbb{Q}$. Zorn's lemma extends them to a Hamel basis $B$; assigning arbitrary real outputs to its basis vectors and extending by finite rational linear combinations gives an additive function.^[ref]

For a particular choice, assign $g(1)=3$ and $g(b)=0$ for every $b\in B\setminus \{1\}$. Every real number has a unique finite linear combination $x={\sum }_{b\in F}{q}_{b}b$ with $F\subset B$ finite and $q_b\in \mathbb{Q}$. Definewhere the coefficient $q_1$ is zero if $1\notin F$. The uniqueness of the Hamel basis representation makes this definition unambiguous, and adding the coefficients proves $g(x+y)=g(x)+g(y)$. On the rational two-dimensional vector subspace spanned by $1$ and $\sqrt{2}$, the rule is particularly simple:For instance, $u=2/3+\sqrt{2}$ and $v=5/6-2\sqrt{2}$ give $g(u)=2$, $g(v)=5/2$, and $g(u+v)=9/2$. Thus the map still preserves addition, even though $g(\sqrt{2})=0\ne 3\sqrt{2}$ rules out being a linear map over the real numbers.

The rational approximants $q_n$ from additive function continuous at one point is linear expose the failure of continuity: $q_n\to \sqrt{2}$ but $g(q_n)=3q_n\to 3\sqrt{2}\ne g(\sqrt{2})$. Moreover $h_n=\sqrt{2}-q_n\to 0$ while $g(h_n)=-3q_n\to -3\sqrt{2}$. The map is continuous nowhere, since continuity at any point would imply additive function continuous at one point is linear. It is unbounded on every interval of positive length by additive function bounded on an interval is linear.

The axiom of choice is used to obtain the Hamel basis; the coefficient rule does not provide an explicit way to find the representation of an arbitrary real number. A plot sampled only at rational numbers would show exactly the same values as $f(x)=3x$, so that plot cannot reveal this discontinuous additive function.

Assume the axiom of choice and suppose a poset satisfying the hypothesis has no maximal element. Fix a choice function on its nonempty subsets. By transfinite recursion, choose at each ordinal stage an upper bound of the chain in a partial order already constructed, then choose a strictly larger member. Both choices are available, including the initial empty stage. This produces distinct members throughout the Hartogs ordinal of $P$, contradicting the Hartogs theorem. Thus a maximal element exists. Conversely, apply Zorn's lemma to partial choice functions on a family of nonempty sets, ordered by extension. A chain in a partial order has the compatible union as an upper bound, and a maximal element must be defined on the whole family, since one missing value could be adjoined.

Zorn's lemma was introduced in 1935 to shorten algebra proofs using choice or the well-ordering theorem.^[ref]

Every vector space $V$ over a field $F$ has a basis, assuming the axiom of choice. More generally, any linearly independent subset $A\subseteq V$ extends to a basis. This is an algebraic Hamel basis: each representation uses a finite linear combination, even when the basis is infinite.^[ref]

Use the poset of linearly independent subsets containing $A$:It is a set, being a subset of the power set of $V$, and is nonempty because $A\in {\mathcal{P}}_A$.

A short proof outline supplies both essential steps:

Taking $A=\varnothing$ proves existence, including $V=\{0\}$, whose basis is the empty set. The chain in a partial order need not be indexed by the natural numbers: only the finitely many members needed for a particular linear relation are compared. An arbitrary union of linearly independent sets can fail: $\{v\}$ and $\{2v\}$ for a nonzero vector over the real numbers are each linearly independent, but their union is linearly dependent. The nesting of a chain in a partial order is what prevents this failure.