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.
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
Example
Assume the Axiom of Choice (The Axiom of Choice, Zorn's lemma), 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. Let be the Hamel coefficient map of 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 , whose values are exactly the rationals and each of whose nonempty level sets is dense in . Define
Say that is a local maximum point of when there is a real with for every (The -neighbourhood and the punctured -neighbourhood of a point of ), and a local minimum point when there is a real with for every . Then:
- for every real , so is bounded (Lower bound, bounded below, bounded set);
- has no local maximum point and no local minimum point;
- is upper semicontinuous at no point of and lower semicontinuous at no point (Upper and lower semicontinuity of at a point of and on ); in particular it is continuous at no point (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
Why and not a bijection onto . All that is needed of is that it be strictly increasing, take values in , and send rationals to rationals; the explicit formula above does all three and costs no countability argument.
Facts & Assumptions
Given: The Axiom of Choice; the Hamel coefficient map ; the map above; and .
The Axiom of Choice (The Axiom of Choice, Zorn's lemma).
Assume the Axiom of Choice. Then there is an additive whose range is exactly the canonical copy of the rationals and each of whose level sets , , is dense in (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 , claims 1 and 4, 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, Cauchy's functional equation , and the additive functions , An additive satisfies , and for every rational and every real ; in particular at every rational , The rationals embed densely in the reals).
A set is dense exactly when for every real and every real (Both and are dense in , and every nonempty open subset of is uncountable, The -neighbourhood and the punctured -neighbourhood of a point of ).
is upper semicontinuous at when for every real there is a real with for every , lower semicontinuous at with , and continuous at exactly when it is both (Upper and lower semicontinuity of at a point of and on , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, is upper semicontinuous on if and only if is relatively open in for every real , lower semicontinuous if and only if is, and continuous if and only if it is both).
is an ordered field, and with for and for (Complete ordered field (least-upper-bound property), Basic properties of the absolute value).
is a maximum of a set when it belongs to it and dominates it, and dually for a minimum (Maximum and minimum of a set); is a nondegenerate interval (The -neighbourhood and the punctured -neighbourhood of a point of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
Verification
Assume the Axiom of Choice and fix as in [L1]; define and .
is strictly increasing. For : reduces to , and dividing by the positive gives . For : reduces to , and dividing by the positive gives . For the first quantity is negative and the second is nonnegative. In every case , and is an increasing function of that quantity.
for every real , since gives ; and takes rationals to rationals, since and are rational when is. Claim 1 follows: for every real .
Let be real and put , a rational, and . The reals and are rational, and by step 2.1.
With and as in step 3.2, every real gives points with and : the level sets and are dense in , hence meet .
Claim 2: is not a local maximum point, since every contains with ; and is not a local minimum point, since every contains with . As was arbitrary, has no local maximum point and no local minimum point.
Claim 3: put . For every real the point of step 4.1 lies in and satisfies , so the inequality fails; hence no witnesses upper semicontinuity at for , and is upper semicontinuous at no point.
Symmetrically, with the point satisfies , so fails and is lower semicontinuous at no point; being continuous at a point would require both, so is continuous at no point.
Claims 1, 2 and 3 hold for the function constructed in step 1.1.
Remarks
-
Boundedness is what makes the example surprising. A function with no local extremum anywhere is easy to arrange if it is allowed to be unbounded; here every value lies strictly inside and yet no point is even a local extremum, because arbitrarily close to any point the function takes both a strictly larger and a strictly smaller value.
-
Everything comes from the level sets. The only property of used after step 1.1 is that its nonempty level sets are dense and indexed by the rationals (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 ); contributes only the bounding into and the preservation of strict order. Any function with countably many dense level sets, relabelled by a strictly increasing injection into a bounded interval, would do as well.
-
The additivity of is not used here. It was used to prove that the level sets are dense, on the companion item; once that is known, has nothing to do with Cauchy's equation. In particular is not additive: it takes values in and .
Depends on
- An additive $f : \mathbb{R} \to \mathbb{R}$ that is not $x \mapsto cx$: the coefficient of one fixed Hamel basis vector. It is unbounded above and below on every nondegenerate interval, its graph is dense in $\mathbb{R}^{2}$, and every nonempty level set is dense in $\mathbb{R}$
- 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
- 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$
- Upper and lower semicontinuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$
- $f$ is upper semicontinuous on $A$ if and only if $\{x \in A : f(x) < \alpha\}$ is relatively open in $A$ for every real $\alpha$, lower semicontinuous if and only if $\{x \in A : f(x) > \alpha\}$ is, and continuous if and only if it is both
- Maximum and minimum of a set
- The rationals embed densely in the reals
- Lower bound, bounded below, bounded set
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Both $\mathbb{Q}$ and $\mathbb{R} \setminus \mathbb{Q}$ are dense in $\mathbb{R}$, and every nonempty open subset of $\mathbb{R}$ is uncountable
- 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
- Complete ordered field (least-upper-bound property)
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- Basic properties of the absolute value
- The Axiom of Choice
- Zorn's lemma
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 179 results over 32 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
- Semi-continuity (Wikipedia) (standard reference, not scraped)
- Cauchy's functional equation (Wikipedia) (standard reference, not scraped)