Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

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}

Statement

Let f:RRf : \mathbb{R} \to \mathbb{R} be additive (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}) and put c:=f(1)c := f(1). Write R2\mathbb{R}^{2} for the set of functions 2R2 \to \mathbb{R} with the metric d((a,b),(a,b))=max{aa, bb}d_\infty\bigl((a,b),(a',b')\bigr) = \max\{|a-a'|,\ |b-b'|\} (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric), and let

Γ  :=  {(x,f(x))  :  xR}    R2\Gamma \;:=\; \{\, (x, f(x)) \;:\; x \in \mathbb{R} \,\} \;\subseteq\; \mathbb{R}^{2}

be the graph of ff. If any one of the following six conditions holds, then f(x)=cxf(x) = c\,x for every real xx.

  1. ff is continuous at some single point of R\mathbb{R} (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).
  2. ff is monotone on some nondegenerate interval (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R\mathbb{R}, with the dictionary to monotone sequences, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).
  3. ff is bounded above on some nondegenerate interval (Lower bound, bounded below, bounded set).
  4. ff is bounded below on some nondegenerate interval.
  5. ff has constant sign on some nondegenerate interval II: either f(z)0f(z) \ge 0 for every zIz \in I, or f(z)0f(z) \le 0 for every zIz \in I.
  6. Γ\Gamma is not dense in R2\mathbb{R}^{2} (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

Conditions 3, 4 and 5 are not independent, and the proof does not pretend they are. Condition 5 is the special case of 3 or of 4 with the bound 00, and condition 4 is condition 3 applied to f-f; they are listed separately only because each is the form in which the hypothesis usually arises. Condition 1 and condition 2 are each reduced to condition 3 in one line. Condition 6 is the only one that is not, and it is proved in the contrapositive: if ff is not of the form xcxx \mapsto cx, then Γ\Gamma is dense.

Two classical clauses are absent. Boundedness on a set of positive measure and Lebesgue measurability also force linearity, and neither is stated here: both require a measure, and this library develops none as it stands. Each is an independent sufficient condition, so restoring them would change nothing else on this page.

Facts & Assumptions

Given: An additive f:RRf : \mathbb{R} \to \mathbb{R} with c:=f(1)c := f(1), and its graph Γ={(x,f(x)):xR}\Gamma = \{(x,f(x)) : x \in \mathbb{R}\}.

[L2]

If an additive gg is bounded above on some [p,r][p,r] with p<rp < r, then g(x)=g(1)xg(x) = g(1)x for every real xx (If an additive f:RRf : \mathbb{R} \to \mathbb{R} is bounded above on some nondegenerate interval, then f(x)=f(1)xf(x) = f(1)\,x for every real xx).

[L3]

A nondegenerate interval contains a closed [p,r][p,r] with p<rp < r, by order-convexity (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

ff continuous at c0c_{0} means: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 with f(x)f(c0)<ε|f(x) - f(c_{0})| < \varepsilon whenever xc0<δ|x - c_{0}| < \delta; and u<ε|u| < \varepsilon gives u<εu < \varepsilon (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Basic properties of the absolute value).

[L5]

ff nondecreasing on II means f(x)f(y)f(x) \le f(y) for xyx \le y in II, and nonincreasing means f(x)f(y)f(x) \ge f(y); monotone means one of the two (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R\mathbb{R}, with the dictionary to monotone sequences).

[L6]

dd_\infty is a metric on R2\mathbb{R}^{2} and its open ball of centre (a,b)(a,b) and radius ε\varepsilon is {(u,v):ua<ε and vb<ε}\{(u,v) : |u-a| < \varepsilon \text{ and } |v-b| < \varepsilon\}; a subset SS of a metric space is dense exactly when every open ball meets SS (Rn\mathbb{R}^n as the set of functions nRn \to \mathbb{R}, and d1d_1, d2d_2, dd_\infty are metrics on it, Open ball, closed ball and sphere in a metric space, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA together with its limit points, and is the smallest closed superset).

Proof

technique · cases
1.1

Assume at least one of the six conditions holds. The six steps below treat the six conditions in turn and are exhaustive for that assumption; in each the conclusion reached is f(x)=cxf(x) = cx for every real xx.

construct
2.1

Condition 3. If ff is bounded above on a nondegenerate interval, that interval contains a closed [p,r][p,r] with p<rp < r on which ff is bounded above, and the boundedness lemma gives f(x)=f(1)x=cxf(x) = f(1)x = cx for every real xx.

step 1.1L2L3assume-case above
2.2

Condition 6, in the contrapositive: if ff is not xcxx \mapsto cx then Γ\Gamma is dense in R2\mathbb{R}^{2}. Suppose f(x2)cx2f(x_{2}) \ne c\,x_{2} for some real x2x_{2}. Then x20x_{2} \ne 0, since f(0)=0f(0) = 0. Put x1:=1x_{1} := 1, v1:=(x1,f(x1))=(1,c)v_{1} := (x_{1}, f(x_{1})) = (1, c) and v2:=(x2,f(x2))v_{2} := (x_{2}, f(x_{2})), and put Δ:=x1f(x2)x2f(x1)=f(x2)cx2\Delta := x_{1}f(x_{2}) - x_{2}f(x_{1}) = f(x_{2}) - c\,x_{2}, which is nonzero by assumption.

step 1.1L1assume-case graph
3.1

Condition 4. If ff is bounded below on a nondegenerate interval II, say f(z)mf(z) \ge m for zIz \in I, then f-f is additive and satisfies f(z)m-f(z) \le -m on II, so f-f is bounded above on II; by step 2.1 applied to f-f we get f(x)=(f)(1)x=cx-f(x) = (-f)(1)\,x = -cx, hence f(x)=cxf(x) = cx.

step 2.1A1assume-case below
3.2

Condition 2. Let ff be monotone on a nondegenerate interval, which contains [p,r][p,r] with p<rp < r. If ff is nondecreasing there then f(z)f(r)f(z) \le f(r) for every z[p,r]z \in [p,r], and if ff is nonincreasing there then f(z)f(p)f(z) \le f(p); either way ff is bounded above on [p,r][p,r] and step 2.1 applies.

step 2.1L3L5assume-case mono
3.3

Condition 1. Let ff be continuous at a point c0c_{0}. Taking ε:=1\varepsilon := 1 gives a real δ>0\delta > 0 with f(x)f(c0)<1|f(x) - f(c_{0})| < 1, hence f(x)<f(c0)+1f(x) < f(c_{0}) + 1, for every xx with xc0<δ|x - c_{0}| < \delta. The set of such xx is the nondegenerate interval (c0δ, c0+δ)(c_{0}-\delta,\ c_{0}+\delta), so ff is bounded above on a nondegenerate interval and step 2.1 applies.

step 2.1L3L4assume-case cont
3.4

Let (a,b)R2(a,b) \in \mathbb{R}^{2} and let ε>0\varepsilon > 0 be real. Put α:=(af(x2)bx2)/Δ\alpha := (a\,f(x_{2}) - b\,x_{2})/\Delta and β:=(bx1af(x1))/Δ\beta := (b\,x_{1} - a\,f(x_{1}))/\Delta. Then αx1+βx2=a\alpha x_{1} + \beta x_{2} = a and αf(x1)+βf(x2)=b\alpha f(x_{1}) + \beta f(x_{2}) = b, as multiplying out and cancelling Δ\Delta shows in each case.

step 2.2L7
4.1

Condition 5. If f(z)0f(z) \ge 0 for every zz in a nondegenerate interval II then ff is bounded below on II by 00 and step 3.1 applies; if f(z)0f(z) \le 0 for every zIz \in I then ff is bounded above on II by 00 and step 2.1 applies. So sign-constancy is a special case of the two preceding conditions and needs no separate argument.

step 2.1step 3.1assume-case sign
4.2

Choose rationals q1,q2q_{1}, q_{2} with q1α<η|q_{1} - \alpha| < \eta and q2β<η|q_{2} - \beta| < \eta, where η>0\eta > 0 is a real chosen with η(x1+x2)<ε\eta\,(|x_{1}| + |x_{2}|) < \varepsilon and η(f(x1)+f(x2))<ε\eta\,(|f(x_{1})| + |f(x_{2})|) < \varepsilon; such rationals exist because a rational lies strictly between any two distinct reals, and such an η\eta exists because for a real K0K \ge 0 the inequality ηK<ε\eta K < \varepsilon holds for all small enough η>0\eta > 0.

step 3.4L7
5.1

Put x:=q1x1+q2x2x := q_{1}x_{1} + q_{2}x_{2}. Then f(x)=q1f(x1)+q2f(x2)f(x) = q_{1}f(x_{1}) + q_{2}f(x_{2}) by additivity and rational homogeneity, so (x,f(x))Γ(x, f(x)) \in \Gamma. Moreover xa=(q1α)x1+(q2β)x2η(x1+x2)<ε|x - a| = |(q_{1}-\alpha)x_{1} + (q_{2}-\beta)x_{2}| \le \eta(|x_{1}| + |x_{2}|) < \varepsilon and likewise f(x)bη(f(x1)+f(x2))<ε|f(x) - b| \le \eta(|f(x_{1})| + |f(x_{2})|) < \varepsilon.

step 3.4step 4.2A1L1L7
6.1

So every open ball of R2\mathbb{R}^{2} meets Γ\Gamma, that is, Γ\Gamma is dense in R2\mathbb{R}^{2}. Reading this contrapositively: if Γ\Gamma is not dense in R2\mathbb{R}^{2} then f(x)=cxf(x) = cx for every real xx, which is condition 6.

step 2.2step 5.1L6
7.1

Each of the six conditions has now been shown to force f(x)=cxf(x) = cx for every real xx: condition 1 at step 3.3, condition 2 at step 3.2, condition 3 at step 2.1, condition 4 at step 3.1, condition 5 at step 4.1 and condition 6 at step 6.1.

step 2.1step 3.1step 4.1step 3.2step 3.3step 6.1cases-exhaustive

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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