Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-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 integral test applied to ∑1/ι(k+1)p for rational p>0, cross-checked against the published p-series theorem

Example

Let p∈Q with p>0 (Order on the rationals) and define

fp:[0,∞)→R,fp(t)  :=  (t+1)−p,

the rational power of the positive base t+1≥1 (Rational powers ar of a positive base). Then fp is nonnegative and nonincreasing, so The integral test: for f≥0 nonincreasing on [0,∞), ∑kf(k) converges if and only if the sequence (∫0Nf)N is bounded, with ∫0Nf≤∑k<Nf(k)≤f(0)+∫0Nf applies, and its terms are

fp(k)  =  1ι(k+1)p(k∈N).

The series ∑kfp(k) is exactly the p-series ∑k≥11/ι(k)p in the sense of Series, partial sums, convergence and the sum, divergence, and the tail series, which converges if and only if p>1 (For rational p>0, ∑1/kp converges iff p>1). The integral test therefore delivers, with no primitive computed anywhere:

(∫0Nfp)N∈N  is bounded above⟺p>1.

The cross-check. At p=2 the integral can also be computed directly: the primitive G(t)=−(t+1)−1 gives

∫0N(t+1)−2 dt  =  1−1ι(N+1)  <  1,

so the sequence is bounded by 1, in agreement with the verdict above at p=2>1. At p=1 the verdict is that (∫0N(t+1)−1)N is unbounded, since the harmonic series diverges. No named logarithmic primitive is available from the current dependency vocabulary, and none is needed for this conclusion.

The exponent must be rational. Real exponents do not exist in this library at this point in the reading order (Why real exponents are deferred on the rational-powers page), so "for p∈[1,∞)" is not a statement that can be made here.

Facts & Assumptions

Given: A rational p>0, the function fp(t)=(t+1)−p on [0,∞), and a natural number N.

[L1]

For a>0 and rationals r,s: ar>0, ar+s=aras, a−r=1/ar, and a0=1 (Laws of rational exponents, Rational powers ar of a positive base).

[L2]

For rational r>0 and 0<a<b: ar<br (Monotonicity of r↦ar and of a↦ar, claim 2); the nonstrict form follows by adjoining equality.

[L3]

ι(k+1)≥1>0 for k∈N, ι(k+1)=ι(k)+1, and ι is nondecreasing (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

[L5]

∑k≥11/ι(k)p converges if and only if p>1, and by Series, partial sums, convergence and the sum, divergence, and the tail series that series is by definition the series of the sequence j↦1/ι(j+1)p on N (For rational p>0, ∑1/kp converges iff p>1).

[L6]

a1/1=a, so for a negative integer exponent the rational power of Rational powers ar of a positive base is the integer power of Integer powers am (Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a).

[L10]

A quotient of continuous functions is continuous where the denominator does not vanish, and every polynomial function is continuous (Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function, claims 4 and 5).

[L9]

Ordered-field arithmetic: a positive real has a positive inverse, 0<s≤t gives 1/t≤1/s, and the order is total and transitive (Ordered field, Complete ordered field (least-upper-bound property), Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

For t≥0 the base t+1 is ≥1>0, so fp(t)=(t+1)−p is defined and positive by [L1].

givenL1
1.2

The cross-check at p=2. By [L6], f2(t)=(t+1)−2 is the integer power, and by [L7] the function G(t):=−(t+1)−1 is differentiable at every t≥0 with G′(t)=−(−(t+1)−2)⋅1=(t+1)−2=f2(t).

givenL6L7
2.1

fp is nonincreasing: for 0≤t≤u one has 0<t+1≤u+1, so (t+1)p≤(u+1)p by [L2], and taking reciprocals reverses the inequality by [L9], giving fp(u)≤fp(t) by [L1].

step 1.1L1L2L9
2.2

fp(k)=(ι(k)+1)−p=1/ι(k+1)p by [L1] and [L3], so the sequence k↦fp(k) is the one named in [L5].

step 1.1L1L3
2.3

f2(t)=1/(t+1)2 is a quotient of polynomial functions whose denominator does not vanish on [0,N], hence continuous there by [L10], hence integrable there by [L8]; so [L8] applied to G gives ∫0Nf2=G(N)−G(0)=−1/ι(N+1)+1.

step 1.2L3L8
3.1

By [L4], ∑kfp(k) converges if and only if (∫0Nfp)N is bounded above.

step 1.1step 2.1L4
4.1

Hence, by [L5] and step 3.1, (∫0Nfp)N is bounded above if and only if p>1.

step 3.1step 2.2L5
5.1

Since ι(N+1)≥1>0, 0<1/ι(N+1)≤1, so 0≤∫0Nf2<1 for every N: the sequence is bounded above by 1, which agrees with step 4.1 at p=2>1.

step 2.3L3L9
6.1

The verdict at p=1. By [L5] the series ∑k≥11/ι(k) diverges, so by step 4.1 the sequence (∫0N(t+1)−1 dt)N is not bounded above. No primitive of (t+1)−1 is exhibited, and none is needed for this conclusion.

step 4.1L5∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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