Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

Contractive sequence: ∣xk+2−xk+1∣≤c ∣xk+1−xk∣ for a fixed 0<c<1

Definition

A sequence (xk) of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences) is contractive when there is a real c with

0<c<1and∣xk+2−xk+1∣  ≤  c ∣xk+1−xk∣for every k∈N,

the order and the absolute value being those of R (Order on the reals, Basic properties of the absolute value). Such a c is called a contraction constant for (xk).

The constant must not depend on k. This is the whole content of the definition and the only place it can go wrong. A sequence whose consecutive gaps each shrink, so that

∣xk+2−xk+1∣<∣xk+1−xk∣for every k,

is not contractive on that evidence: what is required is a single c<1 working at every index simultaneously. The two conditions really are different: there is a sequence satisfying the second that satisfies the first for no c<1 and does not converge, and it is the named counterexample of the companion page, recalled in the remarks below.

The constant is not unique. If c is a contraction constant then so is every c′ with c≤c′<1, since c ∣xk+1−xk∣≤c′ ∣xk+1−xk∣ when ∣xk+1−xk∣≥0 (Basic properties of the absolute value). Statements about contractive sequences therefore quantify over a chosen constant, and the error bound in Every contractive sequence is Cauchy, hence converges, with error bound ∣x−xk∣≤ck−1∣x2−x1∣/(1−c) for k≥1 is sharper for a smaller c.

Degenerate cases are included. A constant sequence is contractive with every c∈(0,1), all the gaps being 0. A sequence that is eventually constant is contractive as soon as the inequality holds at the finitely many earlier indices. Nothing in the definition forces the gaps to be positive.

Remarks

Depends on

Used by

Dependency tree · two levels

14 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