Math 2.0

example

Space of polynomials of bounded degree

Example

Let FF be a field and let n≥0n \ge 0 be an integer. Let F[x]<nF[x]_{<n} be the set of polynomials in xx with coefficients in FF and of degree less than nn, with the zero polynomial included. It is a vector space over FF, with the usual addition of polynomials and multiplication by constants. The monomials 1,x,x2,…,xn−11, x, x^2, \dots, x^{n-1} form a basis, so dim⁡F[x]<n=n\dim F[x]_{<n} = n.

Remarks

The set of polynomials of degree exactly nn is not a vector space. It does not contain 00, and it is not closed under addition. The whole polynomial ring F[x]F[x] is an infinite-dimensional vector space with basis 1,x,x2,…1, x, x^2, \dots. Differentiation is a linear map from F[x]<nF[x]_{<n} to F[x]<n−1F[x]_{<n-1} for n≥1n \ge 1.

Explanations

L1 human

Polynomials of small degree can be added and scaled, and the result stays a polynomial of small degree. So they form a vector space. A polynomial a0+a1x+a2x2a_0 + a_1 x + a_2 x^2 is the same data as the list (a0,a1,a2)(a_0, a_1, a_2).

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (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

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Polynomial_ring, lead section