Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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\mathbb{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\mathbb{R} into (0,1)(0,1)

Example

Assume the Axiom of Choice (The Axiom of Choice, Zorn's lemma), which enters through Assuming the Axiom of Choice, R\mathbb{R} has a Hamel basis over Q\mathbb{Q}: there is BRB \subseteq \mathbb{R} such that every real is a finite Q\mathbb{Q}-linear combination of elements of BB in exactly one way, and each basis vector carries a well-defined Q\mathbb{Q}-linear coefficient map. Let f=Λb:RRf = \Lambda_{b_{\star}} : \mathbb{R} \to \mathbb{R} be the Hamel coefficient map of An additive f:RRf : \mathbb{R} \to \mathbb{R} that is not xcxx \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 R2\mathbb{R}^{2}, and every nonempty level set is dense in R\mathbb{R}, whose values are exactly the rationals and each of whose nonempty level sets is dense in R\mathbb{R}. Define

φ:RR,φ(u)  :=  12+u2(1+u),g:=φf.\varphi : \mathbb{R} \to \mathbb{R}, \qquad \varphi(u) \;:=\; \frac{1}{2} + \frac{u}{2\,(1 + |u|)}, \qquad g := \varphi \circ f .

Say that xx is a local maximum point of gg when there is a real δ>0\delta > 0 with g(y)g(x)g(y) \le g(x) for every yNδ(x)y \in N_\delta(x) (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}), and a local minimum point when there is a real δ>0\delta > 0 with g(y)g(x)g(y) \ge g(x) for every yNδ(x)y \in N_\delta(x). Then:

  1. 0<g(x)<10 < g(x) < 1 for every real xx, so gg is bounded (Lower bound, bounded below, bounded set);
  2. gg has no local maximum point and no local minimum point;
  3. gg is upper semicontinuous at no point of R\mathbb{R} and lower semicontinuous at no point (Upper and lower semicontinuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA); in particular it is continuous at no point (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).

Why φ\varphi and not a bijection onto Q(0,1)\mathbb{Q} \cap (0,1). All that is needed of φ\varphi is that it be strictly increasing, take values in (0,1)(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 ff; the map φ\varphi above; and g=φfg = \varphi \circ f.

[A1]

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

[L2]

A set SRS \subseteq \mathbb{R} is dense exactly when SNδ(x)S \cap N_\delta(x) \ne \varnothing for every real xx and every real δ>0\delta > 0 (Both Q\mathbb{Q} and RQ\mathbb{R} \setminus \mathbb{Q} are dense in R\mathbb{R}, and every nonempty open subset of R\mathbb{R} is uncountable, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

R\mathbb{R} is an ordered field, and u0|u| \ge 0 with u=u|u| = u for u0u \ge 0 and u=u|u| = -u for u0u \le 0 (Complete ordered field (least-upper-bound property), Basic properties of the absolute value).

[L5]

mm 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+δ)N_\delta(x) = (x-\delta, x+\delta) is a nondegenerate interval (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · constructive
1.1

Assume the Axiom of Choice and fix ff as in [L1]; define φ(u):=1/2+u/(2(1+u))\varphi(u) := 1/2 + u/(2(1+|u|)) and g:=φfg := \varphi \circ f.

A1L1construct
2.1

φ\varphi is strictly increasing. For 0u1<u20 \le u_{1} < u_{2}: u1(1+u2)<u2(1+u1)u_{1}(1+u_{2}) < u_{2}(1+u_{1}) reduces to u1<u2u_{1} < u_{2}, and dividing by the positive (1+u1)(1+u2)(1+u_{1})(1+u_{2}) gives u1/(1+u1)<u2/(1+u2)u_{1}/(1+u_{1}) < u_{2}/(1+u_{2}). For u1<u20u_{1} < u_{2} \le 0: u1(1u2)<u2(1u1)u_{1}(1-u_{2}) < u_{2}(1-u_{1}) reduces to u1<u2u_{1} < u_{2}, and dividing by the positive (1u1)(1u2)(1-u_{1})(1-u_{2}) gives u1/(1u1)<u2/(1u2)u_{1}/(1-u_{1}) < u_{2}/(1-u_{2}). For u1<0u2u_{1} < 0 \le u_{2} the first quantity is negative and the second is nonnegative. In every case u1/(1+u1)<u2/(1+u2)u_{1}/(1+|u_{1}|) < u_{2}/(1+|u_{2}|), and φ\varphi is an increasing function of that quantity.

step 1.1L4
3.1

0<φ(u)<10 < \varphi(u) < 1 for every real uu, since u/(1+u)<1|u|/(1+|u|) < 1 gives 1<u/(1+u)<1-1 < u/(1+|u|) < 1; and φ\varphi takes rationals to rationals, since u|u| and 1+u01 + |u| \ne 0 are rational when uu is. Claim 1 follows: 0<g(x)<10 < g(x) < 1 for every real xx.

step 1.1step 2.1L4
3.2

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

step 1.1step 2.1L1
4.1

With rr and vv as in step 3.2, every real δ>0\delta > 0 gives points y,y+Nδ(x)y_{-}, y_{+} \in N_\delta(x) with g(y)=φ(r1)<vg(y_{-}) = \varphi(r-1) < v and g(y+)=φ(r+1)>vg(y_{+}) = \varphi(r+1) > v: the level sets f1({r1})f^{-1}(\{r-1\}) and f1({r+1})f^{-1}(\{r+1\}) are dense in R\mathbb{R}, hence meet Nδ(x)N_\delta(x).

step 3.2L1L2
5.1

Claim 2: xx is not a local maximum point, since every Nδ(x)N_\delta(x) contains y+y_{+} with g(y+)>g(x)g(y_{+}) > g(x); and xx is not a local minimum point, since every Nδ(x)N_\delta(x) contains yy_{-} with g(y)<g(x)g(y_{-}) < g(x). As xx was arbitrary, gg has no local maximum point and no local minimum point.

step 4.1L5
5.2

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

step 3.2step 4.1L3
6.1

Symmetrically, with ε:=vφ(r1)>0\varepsilon_{-} := v - \varphi(r-1) > 0 the point yy_{-} satisfies g(y)=vεg(y_{-}) = v - \varepsilon_{-}, so g(y)>g(x)εg(y_{-}) > g(x) - \varepsilon_{-} fails and gg is lower semicontinuous at no point; being continuous at a point would require both, so gg is continuous at no point.

step 3.2step 4.1step 5.2L3
7.1

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

step 3.1step 5.1step 5.2step 6.1discharge-construct

Remarks

Depends on

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