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 , and the additive functions
Definition
Let be the complete ordered field (Complete ordered field (least-upper-bound property), Ordered field, Field). A function is additive when it satisfies Cauchy's functional equation
Equivalently, is a homomorphism of the additive group of into itself.
The linear maps are additive. For a fixed real the function satisfies 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 to be : 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 ), and without any of them it is no (FALSE: every additive is of the form for a single real ).
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 satisfies : putting gives , and subtracting gives . The remaining elementary consequences, including and -homogeneity, are collected in An additive satisfies , and for every rational and every real ; in particular at every rational .
Depends on
Used by
- A discontinuous positive solution of F(x+y)=F(x)F(y) Counterexample
- Assuming Choice, a Hamel coefficient map is midpoint convex but discontinuous and therefore not convex Counterexample
- A bounded function on ℝ with no local maximum and no local minimum at any point, upper semicontinuous at no point and lower semicontinuous at no point: compose the Hamel coefficient with a strictly increasing injection of ℝ into (0,1) Example
- An additive f : ℝ → ℝ that is not x ↦ cx: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in ℝ², and every nonempty level set is dense in ℝ Example
- FALSE: every additive f : ℝ → ℝ is of the form x ↦ cx for a single real c False statement
- An additive f : ℝ → ℝ 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 Lemma
- If an additive f : ℝ → ℝ is bounded above on some nondegenerate interval, then f(x) = f(1) x for every real x Lemma
- Six regularity conditions each force an additive f : ℝ → ℝ to be x ↦ 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 ℝ² Theorem
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
- Cauchy's functional equation (Wikipedia) (standard reference, not scraped)