Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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\sum 1/\iota(k+1)^{p} for rational p>0p>0, cross-checked against the published pp-series theorem

Example

Let pQp \in \mathbb{Q} with p>0p > 0 (Order on the rationals) and define

fp:[0,)R,fp(t)  :=  (t+1)p,f_p : [0,\infty) \to \mathbb{R}, \qquad f_p(t) \;:=\; (t+1)^{-p} ,

the rational power of the positive base t+11t+1 \ge 1 (Rational powers ara^r of a positive base). Then fpf_p is nonnegative and nonincreasing, so The integral test: for f0f \ge 0 nonincreasing on [0,)[0,\infty), kf(k)\sum_k f(k) converges if and only if the sequence (0Nf)N\bigl(\int_0^N f\bigr)_N is bounded, with 0Nfk<Nf(k)f(0)+0Nf\int_0^N f \le \sum_{k<N} f(k) \le f(0) + \int_0^N f applies, and its terms are

fp(k)  =  1ι(k+1)p(kN).f_p(k) \;=\; \frac{1}{\iota(k+1)^{p}} \qquad (k \in \mathbb{N}) .

The series kfp(k)\sum_k f_p(k) is exactly the pp-series k11/ι(k)p\sum_{k \ge 1} 1/\iota(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>1p > 1 (For rational p>0p > 0, 1/kp\sum 1/k^p converges iff p>1p > 1). The integral test therefore delivers, with no primitive computed anywhere:

(0Nfp)NN  is bounded abovep>1.\Bigl(\textstyle\int_0^N f_p\Bigr)_{N \in \mathbb{N}} \ \text{ is bounded above} \qquad \Longleftrightarrow \qquad p > 1 .

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

0N(t+1)2dt  =  11ι(N+1)  <  1,\int_0^N (t+1)^{-2}\,\mathrm{d}t \;=\; 1 - \frac{1}{\iota(N+1)} \;<\; 1 ,

so the sequence is bounded by 11, in agreement with the verdict above at p=2>1p = 2 > 1. At p=1p = 1 the verdict is that (0N(t+1)1)N\bigl(\int_0^N (t+1)^{-1}\bigr)_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,)p \in [1,\infty)" is not a statement that can be made here.

Facts & Assumptions

Given: A rational p>0p>0, the function fp(t)=(t+1)pf_p(t) = (t+1)^{-p} on [0,)[0,\infty), and a natural number NN.

[L1]

For a>0a>0 and rationals r,sr,s: ar>0a^{r}>0, ar+s=arasa^{r+s} = a^{r}a^{s}, ar=1/ara^{-r} = 1/a^{r}, and a0=1a^{0}=1 (Laws of rational exponents, Rational powers ara^r of a positive base).

[L2]

For rational r>0r>0 and 0<a<b0<a<b: ar<bra^{r}<b^{r} (Monotonicity of rarr \mapsto a^{r} and of aara \mapsto a^{r}, claim 2); the nonstrict form follows by adjoining equality.

[L3]

ι(k+1)1>0\iota(k+1) \ge 1 > 0 for kNk \in \mathbb{N}, ι(k+1)=ι(k)+1\iota(k+1) = \iota(k)+1, and ι\iota is nondecreasing (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L5]

k11/ι(k)p\sum_{k\ge1}1/\iota(k)^{p} converges if and only if p>1p>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 j1/ι(j+1)pj \mapsto 1/\iota(j+1)^{p} on N\mathbb{N} (For rational p>0p > 0, 1/kp\sum 1/k^p converges iff p>1p > 1).

[L7]

For n1n \ge 1 the map yyny \mapsto y^{-n} has derivative ι(n)yn1-\iota(n)y^{-n-1} at every y0y \ne 0; sums, scalar multiples and composites of differentiable functions differentiate by the usual rules (For a natural n1n \ge 1 the function xxnx \mapsto x^{n} is differentiable everywhere with derivative ι(n)xn1\iota(n)\,x^{\,n-1}; for n=0n = 0 it is the constant 11, with derivative 00; for a natural n1n \ge 1 the function xxnx \mapsto x^{-n} is differentiable at every x0x \ne 0 with derivative ι(n)xn1-\iota(n)\,x^{-n-1}; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, claim 3, Sums, scalar multiples, products and quotients: (f+g)(c)=f(c)+g(c)(f+g)'(c) = f'(c) + g'(c), (αf)(c)=αf(c)(\alpha f)'(c) = \alpha f'(c), (fg)(c)=f(c)g(c)+f(c)g(c)(fg)'(c) = f'(c)g(c) + f(c)g'(c), and (f/g)(c)=(f(c)g(c)f(c)g(c))/g(c)2(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2} when g(c)0g(c) \ne 0, The chain rule, in one line from Carathéodory: if gg is differentiable at cc and ff is differentiable at g(c)g(c), then fgf \circ g is differentiable at cc with (fg)(c)=f(g(c))g(c)(f \circ g)'(c) = f'(g(c))\,g'(c), The derivative f(c)=limxcf(x)f(c)xcf'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c} of f:ARf : A \to \mathbb{R} at a point cAc \in A that is a limit point of AA, and differentiability on a set).

[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<st0<s\le t gives 1/t1/s1/t \le 1/s, and the order is total and transitive (Ordered field, Complete ordered field (least-upper-bound property), Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

For t0t \ge 0 the base t+1t+1 is 1>0\ge 1 > 0, so fp(t)=(t+1)pf_p(t) = (t+1)^{-p} is defined and positive by [L1].

givenL1
1.2

The cross-check at p=2p = 2. By [L6], f2(t)=(t+1)2f_2(t) = (t+1)^{-2} is the integer power, and by [L7] the function G(t):=(t+1)1G(t) := -(t+1)^{-1} is differentiable at every t0t \ge 0 with G(t)=((t+1)2)1=(t+1)2=f2(t)G'(t) = -\bigl(-(t+1)^{-2}\bigr)\cdot 1 = (t+1)^{-2} = f_2(t).

givenL6L7
2.1

fpf_p is nonincreasing: for 0tu0 \le t \le u one has 0<t+1u+10 < t+1 \le u+1, so (t+1)p(u+1)p(t+1)^{p} \le (u+1)^{p} by [L2], and taking reciprocals reverses the inequality by [L9], giving fp(u)fp(t)f_p(u) \le f_p(t) by [L1].

step 1.1L1L2L9
2.2

fp(k)=(ι(k)+1)p=1/ι(k+1)pf_p(k) = (\iota(k)+1)^{-p} = 1/\iota(k+1)^{p} by [L1] and [L3], so the sequence kfp(k)k \mapsto f_p(k) is the one named in [L5].

step 1.1L1L3
2.3

f2(t)=1/(t+1)2f_2(t) = 1/(t+1)^{2} is a quotient of polynomial functions whose denominator does not vanish on [0,N][0,N], hence continuous there by [L10], hence integrable there by [L8]; so [L8] applied to GG gives 0Nf2=G(N)G(0)=1/ι(N+1)+1\int_0^N f_2 = G(N)-G(0) = -1/\iota(N+1) + 1.

step 1.2L3L8
3.1

By [L4], kfp(k)\sum_k f_p(k) converges if and only if (0Nfp)N\bigl(\int_0^N f_p\bigr)_N is bounded above.

step 1.1step 2.1L4
4.1

Hence, by [L5] and step 3.1, (0Nfp)N\bigl(\int_0^N f_p\bigr)_N is bounded above if and only if p>1p > 1.

step 3.1step 2.2L5
5.1

Since ι(N+1)1>0\iota(N+1) \ge 1 > 0, 0<1/ι(N+1)10 < 1/\iota(N+1) \le 1, so 00Nf2<10 \le \int_0^N f_2 < 1 for every NN: the sequence is bounded above by 11, which agrees with step 4.1 at p=2>1p = 2 > 1.

step 2.3L3L9
6.1

The verdict at p=1p = 1. By [L5] the series k11/ι(k)\sum_{k\ge1}1/\iota(k) diverges, so by step 4.1 the sequence (0N(t+1)1dt)N\bigl(\int_0^N (t+1)^{-1}\,\mathrm{d}t\bigr)_N is not bounded above. No primitive of (t+1)1(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 · next 3 levels

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