Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-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.

The alternating sequence (−1)k/(k+1) converges to 0

Example

Let (sk) be the sequence with s0=1 and sσ(k)=−sk — the sequence usually written (−1)k, introduced and proved non-convergent as a bounded sequence in FALSE: every bounded sequence converges. The sequence yk:=sk(k+1)−1 converges to 0 (Limits and Cauchy sequences of reals): a null sequence may oscillate in sign at every term. The proof is the null-times-bounded lemma (A null sequence times a bounded sequence is null) applied to the null sequence of The sequence 1/(k+1) converges to 0 and the bounded sequence (sk), so no estimate depending on the sign pattern is needed.

Facts & Assumptions

Given: The unique sequence (sk) of reals with s0=1 and sσ(k)=−sk (The recursion theorem), the sequence yk:=sk(k+1)−1 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), and the sequence uk:=(k+1)−1.

[F1]

The recursion: (sk) is the unique sequence with s0=1 and sσ(k)=−sk for every k (FALSE: every bounded sequence converges).

[F2]

Induction principle: if P(0) holds and P(k) implies P(σ(k)) for every k, then P(k) holds for every natural k (The principle of mathematical induction).

[F3]

Absolute value is even: ∣−u∣=∣u∣ (Basic properties of the absolute value).

[F4]

Absolute value: ∣u∣=u if u≥0 and ∣u∣=−u if u<0 (Absolute value in an ordered field).

[F5]

(uk)=((k+1)−1) converges to 0 and every term is positive (The sequence 1/(k+1) converges to 0).

[F6]

Null times bounded: if (zk) converges to 0 and (wk) is bounded, then (zkwk) converges to 0 (A null sequence times a bounded sequence is null).

[F7]

Boundedness: (zk) is bounded when there is a real M with ∣zk∣≤M for every k∈N (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

Verification

technique · direct
1.1givenF1F2F3F4F8

By induction [F2], ∣sk∣=1 for every k: the base is ∣s0∣=∣1∣=1, valid because 1≥0 by [F8] and ∣u∣=u for u≥0 by [F4]; and if ∣sk∣=1 then ∣sσ(k)∣=∣−sk∣=∣sk∣=1 by the recursion [F1] and [F3].

1.2givenF5

The sequence (uk)=((k+1)−1) converges to 0.

2.1step 1.1F7

Hence (sk) is bounded with bound 1: ∣sk∣=1≤1 for every k, which is the condition of [F7] with M=1.

3.1step 2.1step 1.2F6∎

The product yk=skuk is the product of the bounded sequence (sk) of step 2.1 and the null sequence (uk) of step 1.2, so [F6] gives yk→0; no hypothesis on the sign pattern of (sk) beyond boundedness is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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