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.

Summable families of formal series are locally finite in every coefficient range

Definition

Let (fi)i∈I be a family in R⟦x⟧. It is summable if, for every N∈N, only finitely many i∈I have a nonzero coefficient in a degree n<N. Its sum is defined coefficientwise by

[xn]∑i∈Ifi:=∑i∈I[xn]fi,

where the right side is the finite sum over indices whose displayed coefficient is nonzero. The empty family is summable and has sum 0.

For a sequence (uk)k≥0 with ord⁡x(uk)→+∞, define

∏k≥0(1+uk)

to be the unique series whose residue class modulo xN equals every sufficiently long finite partial product modulo xN. Such stabilization is part of the definition until existence and uniqueness are proved. The empty product is 1.

Depends on

Used by

Dependency tree · two levels

9 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