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.
Formal Laurent series , their order, derivative, and residue
Definition
For a field , a formal Laurent series is a coefficient function whose support is bounded below. Write
Addition is coefficientwise and multiplication is finite convolution in each degree. If the supports of two factors are bounded below by and , then their product is bounded below by , and a fixed coefficient has only finitely many contributing pairs. For nonzero , define
and set . Define for every integer , extending coefficientwise, and define the formal residue
This generalizes the real-coefficient construction of The formal Laurent series : support bounded below, valuation, leading coefficient and uses the same finite-convolution and least-support conventions proved in is a commutative ring: the product is a finite sum and both operations preserve support bounded below and Valuation and leading coefficient in : , and the behaviour of under sums. It changes the indeterminate notation from that page's to .
Depends on
- Field
- The formal Laurent series $\mathbb{R}((t^{-1}))$: support bounded below, valuation, leading coefficient
- $\mathbb{R}((t^{-1}))$ is a commutative ring: the product is a finite sum and both operations preserve support bounded below
- Valuation and leading coefficient in $\mathbb{R}((t^{-1}))$: $v(fg) = v(f) + v(g)$, and the behaviour of $v$ under sums
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 40 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Benjamin Sambale, An Invitation to Formal Power Series (standard reference, not scraped)