Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)verified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

Real powers from suprema of rational powers, with the reciprocal convention below base one

Definition

For a>1a>1 and xRx\in\mathbb R, set Sa(x):={aq:qQ, q<x},a[x]:=supSa(x).S_a(x):=\{a^q:q\in\mathbb Q,\ q<x\},\qquad a^{[x]}:=\sup S_a(x). The set is nonempty because a rational lies below xx (The rationals embed densely in the reals). It is bounded above: choose a natural m>xm>x (Every complete ordered field is Archimedean), so every q<xq<x satisfies q<mq<m and aqama^q\le a^m (Monotonicity of rarr \mapsto a^{r} and of aara \mapsto a^{r}). The supremum therefore exists in R\mathbb R by the least-upper-bound property of a complete ordered field (Complete ordered field (least-upper-bound property), Upper bound, least upper bound, and strict upper bound), and it is strictly positive, because it is at least the element aqa^q of Sa(x)S_a(x) for any rational q<xq<x and every rational power of a positive base is positive (Rational powers ara^r of a positive base).

For 0<a<10<a<1, define a[x]:=1/((a1)[x])a^{[x]}:=1/\bigl((a^{-1})^{[x]}\bigr); for a=1a=1, define 1[x]:=11^{[x]}:=1. The notation a[x]a^{[x]} distinguishes this rational-supremum construction from the exponential construction until their agreement is proved.

Remarks

The direct supremum formula is intentionally restricted to a>1a>1. When 0<a<10<a<1, the set {aq:q<x}\{a^q:q<x\} is unbounded above as qq tends to negative infinity.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 65 results over 19 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