Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge 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.

An additive f:R→R satisfies f(0)=0, f(−x)=−f(x) and f(qx)=q f(x) for every rational q and every real x; in particular f(q)=q f(1) at every rational q

Statement

Let f:R→R be additive (Cauchy's functional equation f(x+y)=f(x)+f(y), and the additive functions R→R), and identify N⊆Z⊆Q⊆R along the canonical embeddings (The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals), writing ι(n) for the canonical natural of n in R (The canonical natural ι(n)=n⋅1F of a field). Then, for every real x:

  1. f(0)=0;
  2. f(−x)=−f(x);
  3. f(ι(n) x)=ι(n) f(x) for every n∈N;
  4. f(mx)=m f(x) for every integer m;
  5. f(qx)=q f(x) for every rational q.

In particular, taking x=1 in claim 5, f(q)=q f(1) at every rational q: an additive function is determined on Q by its value at 1.

What this does not say. Claim 5 is Q-homogeneity, not R-homogeneity: nothing here gives f(λx)=λf(x) for irrational λ, and that is exactly the gap that FALSE: every additive f:R→R is of the form x↦cx for a single real c shows cannot be closed without a regularity hypothesis.

Facts & Assumptions

Given: An additive f:R→R, so f(x+y)=f(x)+f(y) for all reals x,y.

[L3]

Every integer is ι(n) or −ι(n) for a natural n, and every rational is m/ι(n) with m an integer and n a natural ≥1; the embeddings preserve sums and products, and ι(n)≠0 for n≥1 (The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals, The integers as equivalence classes of pairs of naturals, Canonical naturals are positive and strictly increasing).

[L4]

R is a field, so cancellation, distributivity and inverses of nonzero elements are available (Complete ordered field (least-upper-bound property)).

Proof

technique · induction
1.1

Claim 1: taking x=y=0 in the functional equation gives f(0)=f(0)+f(0), and adding −f(0) to both sides gives f(0)=0.

A1L4
1.2

Claim 3, inductive hypothesis: suppose f(ι(n)x)=ι(n)f(x) for a given n∈N and every real x.

ih
2.1

Claim 2: taking y=−x gives 0=f(0)=f(x)+f(−x), so f(−x)=−f(x).

step 1.1A1L4
2.2

Claim 3, base case n=0: ι(0)=0, so f(ι(0)x)=f(0)=0=ι(0)f(x).

step 1.1L2base
2.3

Claim 3, inductive step: ι(n+1)x=ι(n)x+x, so f(ι(n+1)x)=f(ι(n)x)+f(x)=ι(n)f(x)+f(x)=(ι(n)+1)f(x)=ι(n+1)f(x).

step 1.2A1L2L4
3.1

Claim 3 holds for every n∈N and every real x, by induction on n from steps 2.2 and 2.3.

step 2.2step 2.3L1
4.1

Claim 4: an integer m is ι(n) or −ι(n) for some natural n. In the first case claim 3 applies directly. In the second, f(mx)=f(−(ι(n)x))=−f(ι(n)x)=−ι(n)f(x)=mf(x).

step 2.1step 3.1L3
5.1

Claim 5: let q be rational and write q=m/ι(n) with m an integer and n a natural ≥1, so ι(n)≠0. Applying claim 4 with the integer ι(n) to the real qx gives ι(n)f(qx)=f(ι(n)qx)=f(mx)=mf(x), and dividing by ι(n) gives f(qx)=(m/ι(n))f(x)=qf(x).

step 4.1L3L4
6.1

Taking x=1 in claim 5 gives f(q)=qf(1) for every rational q, and all five claims are proved.

step 1.1step 2.1step 3.1step 4.1step 5.1discharge-induction∎

Remarks

Depends on

Used by

Dependency tree · two levels

40 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources