Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

FALSE: every additive f:RRf : \mathbb{R} \to \mathbb{R} is of the form xcxx \mapsto cx for a single real cc

Statement

FALSE. Every additive f:RRf : \mathbb{R} \to \mathbb{R} (Cauchy's functional equation f(x+y)=f(x)+f(y)f(x+y) = f(x) + f(y), and the additive functions RR\mathbb{R} \to \mathbb{R}) is of the form xcxx \mapsto c\,x for a single real cc.

What is true is the Q\mathbb{Q}-linear part of it, f(qx)=qf(x)f(qx) = q f(x) for rational qq (An additive f:RRf : \mathbb{R} \to \mathbb{R} satisfies f(0)=0f(0) = 0, f(x)=f(x)f(-x) = -f(x) and f(qx)=qf(x)f(qx) = q\,f(x) for every rational qq and every real xx; in particular f(q)=qf(1)f(q) = q\,f(1) at every rational qq), and the conditional statements of Six regularity conditions each force an additive f:RRf : \mathbb{R} \to \mathbb{R} to be xf(1)xx \mapsto f(1)x: continuity at a single point, monotonicity on a nondegenerate interval, boundedness above on one, boundedness below on one, constancy of sign on one, and a graph that is not dense in R2\mathbb{R}^{2}, each of which adds a regularity hypothesis. The claim above asserts the conclusion with no hypothesis at all, and it is false.

The refutation assumes the Axiom of Choice (The Axiom of Choice), which it uses through Assuming the Axiom of Choice, R\mathbb{R} has a Hamel basis over Q\mathbb{Q}: there is BRB \subseteq \mathbb{R} such that every real is a finite Q\mathbb{Q}-linear combination of elements of BB in exactly one way, and each basis vector carries a well-defined Q\mathbb{Q}-linear coefficient map and hence through Zorn's lemma. The hypothesis is carried explicitly in the Facts below and in every step that needs it. It is an axiom already adopted in this library, so the refutation is a refutation and not a conditional one; what it does not settle is whether a counterexample exists without choice, and nothing here bears on that question.

Facts & Assumptions

Given: The Axiom of Choice, and Q\mathbb{Q} denoting the canonical copy of the rationals inside R\mathbb{R} (The rationals embed densely in the reals).

[A1]

The Axiom of Choice (The Axiom of Choice, Zorn's lemma).

[L1]

Assume the Axiom of Choice. Then there is BRB \subseteq \mathbb{R}, a basis of R\mathbb{R} as a vector space over Q\mathbb{Q} by restriction of scalars, and for each bBb_{\star} \in B a map Λb:RQ\Lambda_{b_{\star}} : \mathbb{R} \to \mathbb{Q} with Λb(x+y)=Λb(x)+Λb(y)\Lambda_{b_{\star}}(x+y) = \Lambda_{b_{\star}}(x) + \Lambda_{b_{\star}}(y) for all reals x,yx, y, with Λb(b)=1\Lambda_{b_{\star}}(b_{\star}) = 1, and with range the whole of Q\mathbb{Q} (Assuming the Axiom of Choice, R\mathbb{R} has a Hamel basis over Q\mathbb{Q}: there is BRB \subseteq \mathbb{R} such that every real is a finite Q\mathbb{Q}-linear combination of elements of BB in exactly one way, and each basis vector carries a well-defined Q\mathbb{Q}-linear coefficient map, claims 1 and 4, A field is a vector space over itself, and over any subfield KFK \subseteq F every FF-vector space is a KK-vector space by restricting the scalars, Vector space over a field, Linear combination of a finite list, and the span span(S)\operatorname{span}(S) as the smallest linear subspace containing SS).

[L2]

A function f:RRf : \mathbb{R} \to \mathbb{R} is additive when f(x+y)=f(x)+f(y)f(x+y) = f(x)+f(y) for all reals x,yx, y (Cauchy's functional equation f(x+y)=f(x)+f(y)f(x+y) = f(x) + f(y), and the additive functions RR\mathbb{R} \to \mathbb{R}).

[L3]

There exists an irrational real, that is a real not lying in Q\mathbb{Q}: the irrationals are dense in R\mathbb{R} and in particular nonempty (Both Q\mathbb{Q} and RQ\mathbb{R} \setminus \mathbb{Q} are dense in R\mathbb{R}, and every nonempty open subset of R\mathbb{R} is uncountable).

[L4]

R\mathbb{R} is a field, so a nonzero real is invertible (Complete ordered field (least-upper-bound property)).

Refutation

technique · direct
1.1

Assume the Axiom of Choice and fix a Hamel basis BB of R\mathbb{R} over Q\mathbb{Q} together with an element bBb_{\star} \in B; such an element exists because BB spans R\mathbb{R}, which is not {0}\{0\}, so BB is nonempty. Put f:=Λbf := \Lambda_{b_{\star}}, regarded as a function RR\mathbb{R} \to \mathbb{R}.

A1L1construct
2.1

ff is additive: Λb(x+y)=Λb(x)+Λb(y)\Lambda_{b_{\star}}(x+y) = \Lambda_{b_{\star}}(x) + \Lambda_{b_{\star}}(y) for all reals x,yx, y is one of the properties of the coefficient map.

step 1.1L1L2
2.2

Every value of ff is rational, and f(b)=1f(b_{\star}) = 1.

step 1.1L1
3.1

Suppose there were a real cc with f(x)=cxf(x) = c\,x for every real xx. Then cb=f(b)=1c\,b_{\star} = f(b_{\star}) = 1, so c0c \ne 0 and cc is invertible.

step 1.1step 2.2L4
4.1

Take an irrational real θ\theta and put x0:=c1θx_{0} := c^{-1}\theta. Then f(x0)=cx0=θf(x_{0}) = c\,x_{0} = \theta, which is irrational; but every value of ff is rational by step 2.2. This is impossible, so no such cc exists.

step 2.2step 3.1L3L4
5.1

So ff is an additive function RR\mathbb{R} \to \mathbb{R} that is not of the form xcxx \mapsto c\,x for any real cc, and the claim in the Statement is false.

step 2.1step 4.1discharge-construct

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 177 results over 32 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources