Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 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.

The rational-supremum construction of real powers agrees with the exponential construction

Statement

For every a>0 and x∈R, the rational-supremum value a[x] of Real powers from suprema of rational powers, with the reciprocal convention below base one equals the exponential real power ax of Real powers for positive bases, with the zero-base positive-exponent convention.

Facts & Assumptions

Given: A real x and a positive base a.

[L1]

For a>1, Sa(x):={aq:q∈Q, q<x} and a[x]:=sup⁡Sa(x); for 0<a<1, a[x]:=1/((a−1)[x]); and 1[x]:=1 (Real powers from suprema of rational powers, with the reciprocal convention below base one).

[L3]

Rational numbers are dense in R, and the epsilon characterisation identifies a supremum of a nonempty bounded-above set (The rationals embed densely in the reals, Epsilon characterisation of the supremum).

[L4]

For a,b>0 and r,s∈R: ar+s=aras, (ab)r=arbr, (a/b)r=ar/br, and (ar)s=ars (The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents).

Proof

technique · direct
1.1

Assume a>1. For every rational q<x, strict increase of t↦at gives aq<ax, so ax is an upper bound of Sa(x).

L1L2
1.2

Given ε>0, continuity of t↦at at x supplies δ>0 such that ∣t−x∣<δ implies ∣at−ax∣<ε; density supplies rational q with x−δ<q<x, hence ax−ε<aq∈Sa(x).

L2L3choose
2.1

By the supremum characterisation, steps 1.1 and 1.2 give a[x]=ax when a>1.

step 1.1step 1.2L3
3.1

For a=1 both values are 1. For 0<a<1 the base a−1 exceeds 1, so step 2.1 applied to that base and the same exponent x gives (a−1)[x]=(a−1)x; the subunit clause of [L1] then gives a[x]=1/((a−1)x). By [L4] with r=−1 and s=x, (a−1)x=a−x; and by [L4] again, a−xax=a−x+x=a0=1, so 1/a−x=ax. Hence a[x]=ax.

step 2.1L1L2L4∎

Depends on

Used by

Dependency tree · two levels

37 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