Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

A bounded function on R 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 R into (0,1)

Example

Assume the Axiom of Choice (The Axiom of Choice, Zorn's lemma), which enters through Assuming the Axiom of Choice, R has a Hamel basis over Q: there is B⊆R such that every real is a finite Q-linear combination of elements of B in exactly one way, and each basis vector carries a well-defined Q-linear coefficient map. Let f=Λb⋆:R→R be the Hamel coefficient map of An additive f:R→R 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 R2, and every nonempty level set is dense in R, whose values are exactly the rationals and each of whose nonempty level sets is dense in R. Define

φ:R→R,φ(u)  :=  12+u2 (1+∣u∣),g:=φ∘f.

Say that x is a local maximum point of g when there is a real δ>0 with g(y)≤g(x) for every y∈Nδ(x) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R), and a local minimum point when there is a real δ>0 with g(y)≥g(x) for every y∈Nδ(x). Then:

  1. 0<g(x)<1 for every real x, so g is bounded (Lower bound, bounded below, bounded set);
  2. g has no local maximum point and no local minimum point;
  3. g is upper semicontinuous at no point of R and lower semicontinuous at no point (Upper and lower semicontinuity of f:A→R at a point of A and on A); in particular it is continuous at no point (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).

Why φ and not a bijection onto Q∩(0,1). All that is needed of φ is that it be strictly increasing, take values in (0,1), 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 f; the map φ above; and g=φ∘f.

[A1]

The Axiom of Choice (The Axiom of Choice, Zorn's lemma).

[L2]

A set S⊆R is dense exactly when S∩Nδ(x)≠∅ for every real x and every real δ>0 (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L4]

R is an ordered field, and ∣u∣≥0 with ∣u∣=u for u≥0 and ∣u∣=−u for u≤0 (Complete ordered field (least-upper-bound property), Basic properties of the absolute value).

[L5]

m 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); Nδ(x)=(x−δ,x+δ) is a nondegenerate interval (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · constructive
1.1

Assume the Axiom of Choice and fix f as in [L1]; define φ(u):=1/2+u/(2(1+∣u∣)) and g:=φ∘f.

A1L1construct
2.1

φ is strictly increasing. For 0≤u1<u2: u1(1+u2)<u2(1+u1) reduces to u1<u2, and dividing by the positive (1+u1)(1+u2) gives u1/(1+u1)<u2/(1+u2). For u1<u2≤0: u1(1−u2)<u2(1−u1) reduces to u1<u2, and dividing by the positive (1−u1)(1−u2) gives u1/(1−u1)<u2/(1−u2). For u1<0≤u2 the first quantity is negative and the second is nonnegative. In every case u1/(1+∣u1∣)<u2/(1+∣u2∣), and φ is an increasing function of that quantity.

step 1.1L4
3.1

0<φ(u)<1 for every real u, since ∣u∣/(1+∣u∣)<1 gives −1<u/(1+∣u∣)<1; and φ takes rationals to rationals, since ∣u∣ and 1+∣u∣≠0 are rational when u is. Claim 1 follows: 0<g(x)<1 for every real x.

step 1.1step 2.1L4
3.2

Let x be real and put r:=f(x), a rational, and v:=g(x)=φ(r). The reals r−1 and r+1 are rational, and φ(r−1)<v<φ(r+1) by step 2.1.

step 1.1step 2.1L1
4.1

With r and v as in step 3.2, every real δ>0 gives points y−,y+∈Nδ(x) with g(y−)=φ(r−1)<v and g(y+)=φ(r+1)>v: the level sets f−1({r−1}) and f−1({r+1}) are dense in R, hence meet Nδ(x).

step 3.2L1L2
5.1

Claim 2: x is not a local maximum point, since every Nδ(x) contains y+ with g(y+)>g(x); and x is not a local minimum point, since every Nδ(x) contains y− with g(y−)<g(x). As x was arbitrary, g has no local maximum point and no local minimum point.

step 4.1L5
5.2

Claim 3: put ε+:=φ(r+1)−v>0. For every real δ>0 the point y+ of step 4.1 lies in Nδ(x) and satisfies g(y+)=v+ε+, so the inequality g(y+)<g(x)+ε+ fails; hence no δ witnesses upper semicontinuity at x for ε+, and g is upper semicontinuous at no point.

step 3.2step 4.1L3
6.1

Symmetrically, with ε−:=v−φ(r−1)>0 the point y− satisfies g(y−)=v−ε−, so g(y−)>g(x)−ε− fails and g is lower semicontinuous at no point; being continuous at a point would require both, so g is continuous at no point.

step 3.2step 4.1step 5.2L3
7.1

Claims 1, 2 and 3 hold for the function g constructed in step 1.1.

step 3.1step 5.1step 5.2step 6.1discharge-construct∎

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 (0,1) 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 f used after step 1.1 is that its nonempty level sets are dense and indexed by the rationals (An additive f:R→R 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 R2, and every nonempty level set is dense in R); φ contributes only the bounding into (0,1) 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 f is not used here. It was used to prove that the level sets are dense, on the companion item; once that is known, g has nothing to do with Cauchy's equation. In particular g is not additive: it takes values in (0,1) and g(0)≠0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

80 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources