Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Comparing rational powers: 21/3<21/2<31/3

Example

(i) 21/2>21/3; (ii) 31/2>21/2; (iii) 21/2<31/3; hence

21/3<21/2<31/3.

All bases are positive and all exponents rational, so Rational powers ar of a positive base applies. Clauses (i) and (ii) are instances of the two monotonicity statements of Monotonicity of r↦ar and of a↦ar, but (iii) is not: it compares bases 2<3 against exponents in the opposite order 1/2>1/3, and neither monotonicity clause decides it.

Facts & Assumptions

Given: The positive bases 2 and 3 and the rational exponents 1/3<1/2 in Q.

[L1]

Rational powers (Rational powers ar of a positive base, Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a): for a>0 and rational r the value ar is defined and positive, and a1/n is the unique nonnegative n-th root of a.

[L2]

Rational power laws (Laws of rational exponents): (ar)s=ars for a>0 and rationals r,s, and a1=a.

[L3]

Monotonicity of rational powers (Monotonicity of r↦ar and of a↦ar): for a>1 and rationals r<s one has ar<as; and for rational r>0 and 0<a<b one has ar<br.

[L4]

Monotonicity of integer powers (Monotonicity of x↦xn and of n↦an): for j≥1, t↦tj is strictly increasing on the nonnegative reals, so 0≤u<v implies uj<vj.

[L5]

Integer powers (Integer powers am): 23=22⋅2=4⋅2=8 and 32=9 by the recursion clause and field arithmetic.

Verification

technique · direct
1.1L1L3algebra

Clause (i): 2>1 and 1/3<1/2 in Q, so exponent monotonicity [L3] gives 21/3<21/2.

1.2L1L3algebra

Clause (ii): 1/2>0 and 2<3 with both bases positive, so base monotonicity [L3] gives 21/2<31/2.

1.3L1L2L4L5algebra

Clause (iii): raising to the sixth power, (21/2)6=2(1/2)⋅6=23=8 and (31/3)6=3(1/3)⋅6=32=9 by [L2] and [L5], and 8<9; since 21/2≥0 and 31/3≥0 by [L1], the strict monotonicity of t↦t6 on the nonnegatives [L4] turns 8<9 into 21/2<31/3.

2.1step 1.1step 1.2step 1.3L3∎

Chaining (i) from step 1.1 and (iii) from step 1.3 gives 21/3<21/2<31/3, and (ii) from step 1.2 records the companion comparison 31/2>21/2; the three claims together are the displayed order, and only clause (iii) needed the sixth-power device, since no single monotonicity statement compares 21/2 with 31/3.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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