Math 2.0

definition

Formal power series

Definition

Let RR be a commutative ring. A formal power series in one variable XX over RR is a sequence (an)n≥0(a_n)_{n \ge 0} of elements of RR, written ∑n≥0anXn\sum_{n \ge 0} a_n X^n. The set of these series is written R[ ⁣[X] ⁣]R[\![X]\!].

Addition is termwise: ∑anXn+∑bnXn=∑(an+bn)Xn\sum a_n X^n + \sum b_n X^n = \sum (a_n + b_n) X^n. Multiplication is the Cauchy product: (∑anXn)(∑bnXn)=∑n(∑i+j=naibj)Xn\left( \sum a_n X^n \right) \left( \sum b_n X^n \right) = \sum_n \left( \sum_{i+j=n} a_i b_j \right) X^n. With these operations R[ ⁣[X] ⁣]R[\![X]\!] is a commutative ring, and it contains the polynomial ring R[X]R[X].

Remarks

The word formal means that no convergence is required. A series is a sequence of coefficients, not a function. A series ∑anXn\sum a_n X^n is a unit in R[ ⁣[X] ⁣]R[\![X]\!] if and only if a0a_0 is a unit in RR. The coefficient of XnX^n in a series ff is written [Xn]f[X^n] f.

Explanations

L1 human

A formal power series is like a polynomial that may go on forever. You add and multiply it like a polynomial, and you never substitute a number for XX, so the question of convergence does not arise.

What this node needs for W2
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

9 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Formal_power_series, Definition of the formal power series ring