Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-13
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.

Order of a formal series, congruence modulo xN, and the x-adic notions of convergence and Cauchy sequence

Definition

For a nonzero f∈R⟦x⟧, its formal order is

ord⁡x(f):=min⁡{n∈N:[xn]f≠0},

and ord⁡x(0):=+∞. We use the conventions m<+∞, m+(+∞)=+∞, and min⁡(m,+∞)=m.

For N∈N, write

f≡g(modxN)

when [xn]f=[xn]g for every n<N. Equivalently, ord⁡x(f−g)≥N. At N=0 the coefficient condition is empty, so any two series are congruent modulo x0=1.

A sequence (fj)j≥0 converges x-adically to f if for every N there is J such that fj≡f(modxN) whenever j≥J. It is x-adically Cauchy if for every N there is J such that fj≡fk(modxN) whenever j,k≥J. Thus convergence and the Cauchy condition mean eventual stability of each finite coefficient prefix; they do not assert analytic convergence.

Depends on

Used by

Dependency tree · two levels

4 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