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 converges to
Example
Let be the sequence with and — the sequence usually written , introduced and proved non-convergent as a bounded sequence in FALSE: every bounded sequence converges. The sequence converges to (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 converges to and the bounded sequence , so no estimate depending on the sign pattern is needed.
Facts & Assumptions
Given: The unique sequence of reals with and (The recursion theorem), the sequence (Sequences of reals: bounded, eventually, frequently, tails, subsequences), and the sequence .
The recursion: is the unique sequence with and for every (FALSE: every bounded sequence converges).
Induction principle: if holds and implies for every , then holds for every natural (The principle of mathematical induction).
Absolute value is even: (Basic properties of the absolute value).
Absolute value: if and if (Absolute value in an ordered field).
converges to and every term is positive (The sequence converges to ).
Null times bounded: if converges to and is bounded, then converges to (A null sequence times a bounded sequence is null).
Boundedness: is bounded when there is a real with for every (Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Verification
By induction [F2], for every : the base is , valid because by [F8] and for by [F4]; and if then by the recursion [F1] and [F3].
The sequence converges to .
Hence is bounded with bound : for every , which is the condition of [F7] with .
The product is the product of the bounded sequence of step 2.1 and the null sequence of step 1.2, so [F6] gives ; no hypothesis on the sign pattern of beyond boundedness is used.
Depends on
- FALSE: every bounded sequence converges
- A null sequence times a bounded sequence is null
- The sequence $1/(k+1)$ converges to $0$
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Limits and Cauchy sequences of reals
- The recursion theorem
- The principle of mathematical induction
- Basic properties of the absolute value
- Absolute value in an ordered field
- Order on the reals
- The multiplicative identity is positive
- Sign rules for products and monotonicity of multiplication
- Ordered field
- Field
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
- John K. Hunter, An Introduction to Real Analysis (complete author-hosted lecture notes, 307 pp.) (standard reference, not scraped)
- Jiri Lebl, Basic Analysis I: Introduction to Real Analysis, Volume I (author-hosted complete book PDF) (standard reference, not scraped)