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 that is not : 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
Assume the Axiom of Choice (The Axiom of Choice), which enters through Assuming the Axiom of Choice, has a Hamel basis over : there is such that every real is a finite -linear combination of elements of in exactly one way, and each basis vector carries a well-defined -linear coefficient map and hence through Zorn's lemma. Fix a Hamel basis of over the canonical copy of the rationals (The rationals embed densely in the reals, A field is a vector space over itself, and over any subfield every -vector space is a -vector space by restricting the scalars, Vector space over a field), fix , and let
be the coefficient map of (Assuming the Axiom of Choice, has a Hamel basis over : there is such that every real is a finite -linear combination of elements of in exactly one way, and each basis vector carries a well-defined -linear coefficient map, claim 4). Write (Linear combination of a finite list, and the span as the smallest linear subspace containing ). Then:
- is additive (Cauchy's functional equation , and the additive functions ) and is not of the form for any real (FALSE: every additive is of the form for a single real );
- is bounded neither above nor below on any nondegenerate interval (Lower bound, bounded below, bounded set, Intervals of : the nine order-convex forms, nondegeneracy, and length), is monotone on no nondegenerate interval (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences), is of constant sign on none, and is continuous at no point of (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point);
- the graph is dense in for the metric ( as the set of functions , and , , are metrics on it, Interior, closure, boundary, limit point, isolated point and dense subset of a metric space);
- the values of are exactly the rationals, and for every rational the level set is dense in ; for an irrational the level set is empty.
Claim 2 is the contrapositive of 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 applied to claim 1, clause by clause, and claim 3 is the contrapositive of its sixth clause.
Facts & Assumptions
Given: The Axiom of Choice; a Hamel basis of over ; a fixed ; the coefficient map and .
The Axiom of Choice (The Axiom of Choice, Zorn's lemma).
Assume the Axiom of Choice. Then a Hamel basis exists; for the coefficient map is well defined, additive, -homogeneous, has range all of , has , and (Assuming the Axiom of Choice, has a Hamel basis over : there is such that every real is a finite -linear combination of elements of in exactly one way, and each basis vector carries a well-defined -linear coefficient map, claims 1, 4 and 5, Linear combination of a finite list, and the span as the smallest linear subspace containing , Linear subspace of a vector space).
There is an additive that is not of the form , namely a coefficient map : it takes only rational values while would force irrational values (FALSE: every additive is of the form for a single real , Both and are dense in , and every nonempty open subset of is uncountable).
If an additive is bounded above on a nondegenerate interval, or bounded below on one, or monotone on one, or of constant sign on one, or continuous at a single point, or has non-dense graph in , then for every real (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 ).
is a metric on and a subset is dense exactly when every open ball meets it ( as the set of functions , and , , 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 is , equals together with its limit points, and is the smallest closed superset).
is a linear subspace of over , so and give , and is closed under addition (Linear subspace of a vector space, Linear combination of a finite list, and the span as the smallest linear subspace containing ).
Strictly between any two distinct reals there lies a rational, and is an ordered field (The rationals embed densely in the reals, Complete ordered field (least-upper-bound property)).
An additive satisfies for rational (An additive satisfies , and for every rational and every real ; in particular at every rational ).
Verification
Assume the Axiom of Choice, fix and , and put and .
Claim 1: is additive, and it is not of the form for any real .
Claim 4, the range: the range of is exactly , so for every irrational and for every rational .
is dense in : by [L1] there is with , and for every rational ; given reals , the two reals and are distinct, so a rational lies strictly between them, and then lies strictly between and if , and strictly between and if . Either way meets .
Claim 2, clause by clause. Were bounded above on a nondegenerate interval, or bounded below on one, or monotone on one, or of constant sign on one, or continuous at a single point, the regularity theorem would give for every real , contradicting step 2.1. So none of the five holds.
Claim 3: were the graph of not dense in , the sixth clause of the regularity theorem would give the same contradiction. So the graph is dense.
For a rational the level set is for any with : indeed holds exactly when , that is exactly when . Here follows from additivity.
Each such level set is dense in : given reals , the interval meets by step 2.3, say in , and then lies in . Claim 4 is proved, and with steps 2.1, 3.1 and 3.2 so are claims 1, 2 and 3.
Remarks
-
The pathology is entirely a consequence of the two facts in claim 1. The proof uses nothing about except that it is additive and not linear; every other property is read off 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 by contraposition. A single such function therefore witnesses the failure of all six regularity conditions at once.
-
What the level sets look like. They are the cosets of the -subspace , one for each rational value, and each is dense. So is partitioned into countably many dense sets, on each of which is constant. The companion function of 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 is built by relabelling those values.
-
No measurability claim is made. The classical statement that a Hamel coefficient map is not Lebesgue measurable is not asserted here: this library develops no measure as it stands, so the statement is not expressible, and nothing above depends on it.
Depends on
- Assuming the Axiom of Choice, $\mathbb{R}$ has a Hamel basis over $\mathbb{Q}$: there is $B \subseteq \mathbb{R}$ such that every real is a finite $\mathbb{Q}$-linear combination of elements of $B$ in exactly one way, and each basis vector carries a well-defined $\mathbb{Q}$-linear coefficient map
- FALSE: every additive $f : \mathbb{R} \to \mathbb{R}$ is of the form $x \mapsto cx$ for a single real $c$
- Cauchy's functional equation $f(x+y) = f(x) + f(y)$, and the additive functions $\mathbb{R} \to \mathbb{R}$
- An additive $f : \mathbb{R} \to \mathbb{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$
- Six regularity conditions each force an additive $f : \mathbb{R} \to \mathbb{R}$ to be $x \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 $\mathbb{R}^{2}$
- Vector space over a field
- A field is a vector space over itself, and over any subfield $K \subseteq F$ every $F$-vector space is a $K$-vector space by restricting the scalars
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- Linear subspace of a vector space
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- The closure of a nonempty $A$ is $\{x : d(x,A) = 0\}$, equals $A$ together with its limit points, and is the smallest closed superset
- Open ball, closed ball and sphere in a metric space
- The Axiom of Choice
- Zorn's lemma
- Lower bound, bounded below, bounded set
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The rationals embed densely in the reals
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- Complete ordered field (least-upper-bound property)
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of $\mathbb{R}$, with the dictionary to monotone sequences
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 192 results over 33 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)
- Hamel basis, in Basis (linear algebra) (Wikipedia) (standard reference, not scraped)
- On Functions Whose Graph Is a Hamel Basis (standard reference, not scraped)