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 satisfies , and for every rational and every real ; in particular at every rational
Statement
Let be additive (Cauchy's functional equation , and the additive functions ), and identify along the canonical embeddings (The naturals embed in the integers, The integers embed in the rationals, The rationals embed densely in the reals), writing for the canonical natural of in (The canonical natural of a field). Then, for every real :
- ;
- ;
- for every ;
- for every integer ;
- for every rational .
In particular, taking in claim 5, at every rational : an additive function is determined on by its value at .
What this does not say. Claim 5 is -homogeneity, not -homogeneity: nothing here gives for irrational , and that is exactly the gap that FALSE: every additive is of the form for a single real shows cannot be closed without a regularity hypothesis.
Facts & Assumptions
Given: An additive , so for all reals .
for all reals (Cauchy's functional equation , and the additive functions ).
Induction on (The principle of mathematical induction).
The canonical natural satisfies and , and it agrees with the additive multiple (The canonical natural of a field, In a field, the additive multiple is the canonical natural : the additive power of the group-power definition and the canonical natural are the same function, both being the unique one given by the recursion , , Canonical naturals are positive and strictly increasing).
Every integer is or for a natural , and every rational is with an integer and a natural ; the embeddings preserve sums and products, and for (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).
is a field, so cancellation, distributivity and inverses of nonzero elements are available (Complete ordered field (least-upper-bound property)).
Proof
Claim 1: taking in the functional equation gives , and adding to both sides gives .
Claim 3, inductive hypothesis: suppose for a given and every real .
Claim 2: taking gives , so .
Claim 3, base case : , so .
Claim 3, inductive step: , so .
Claim 3 holds for every and every real , by induction on from steps 2.2 and 2.3.
Claim 4: an integer is or for some natural . In the first case claim 3 applies directly. In the second, .
Claim 5: let be rational and write with an integer and a natural , so . Applying claim 4 with the integer to the real gives , and dividing by gives .
Taking in claim 5 gives for every rational , and all five claims are proved.
Remarks
-
The induction is on and everything else is algebra. Only claim 3 needs induction; claims 4 and 5 are obtained from it by the two field operations, and claims 1 and 2 are two substitutions into the equation. The base case is , where and the identity reads ; it is a genuine case and not a convention, since contains .
-
This is the whole of the algebraic theory. Every regularity theorem about Cauchy's equation (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 ) works by combining claim 5 with density of in : the value of is pinned on a dense set, and a regularity hypothesis is what forbids the values off that set from being arbitrary.
Depends on
- Cauchy's functional equation $f(x+y) = f(x) + f(y)$, and the additive functions $\mathbb{R} \to \mathbb{R}$
- The principle of mathematical induction
- The rationals embed densely in the reals
- The integers embed in the rationals
- The naturals embed in the integers
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- In a field, the additive multiple $n \cdot 1_F$ is the canonical natural $\iota(n)$: the additive power of the group-power definition and the canonical natural are the same function, both being the unique one given by the recursion $\iota(0) = 0_F$, $\iota(\sigma(n)) = \iota(n) + 1_F$
- Complete ordered field (least-upper-bound property)
- The integers as equivalence classes of pairs of naturals
- Canonical naturals are positive and strictly increasing
Used by
- 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
- 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: 81 results over 29 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)