Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-28
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.

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}

Definition

Let R\mathbb{R} be the complete ordered field (Complete ordered field (least-upper-bound property), Ordered field, Field). A function f:RRf : \mathbb{R} \to \mathbb{R} is additive when it satisfies Cauchy's functional equation

f(x+y)  =  f(x)+f(y)for all x,yR.f(x + y) \;=\; f(x) + f(y) \qquad \text{for all } x, y \in \mathbb{R}.

Equivalently, ff is a homomorphism of the additive group of R\mathbb{R} into itself.

The linear maps are additive. For a fixed real cc the function xcxx \mapsto cx satisfies c(x+y)=cx+cyc(x+y) = cx + cy by distributivity, so it is additive. Cauchy's question is whether these are the only additive functions, and the answer is a genuine dichotomy: with any one of a short list of regularity conditions the answer is yes (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}), and without any of them it is no (FALSE: every additive f:RRf : \mathbb{R} \to \mathbb{R} is of the form xcxx \mapsto cx for a single real cc).

No continuity, no monotonicity and no measurability is part of the definition. The equation is purely algebraic, and every regularity hypothesis below is stated explicitly where it is used.

A first consequence, recorded here because it is used immediately. An additive ff satisfies f(0)=0f(0) = 0: putting x=y=0x = y = 0 gives f(0)=f(0)+f(0)f(0) = f(0) + f(0), and subtracting f(0)f(0) gives f(0)=0f(0) = 0. The remaining elementary consequences, including f(x)=f(x)f(-x) = -f(x) and Q\mathbb{Q}-homogeneity, are collected in 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.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 3 results over 3 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