Math 2.0

example

Differentiation as a linear map

Example

Let FF be a field and let F[x]F[x] be the vector space of polynomials over FF. The formal derivative is the map D ⁣:F[x]→F[x]D \colon F[x] \to F[x] with D(∑k=0nakxk)=∑k=1nk akxk−1.D\left(\sum_{k=0}^{n} a_k x^k\right) = \sum_{k=1}^{n} k\, a_k x^{k-1}. It is a linear map: D(p+q)=D(p)+D(q)D(p + q) = D(p) + D(q) and D(cp)=c D(p)D(cp) = c\, D(p) for all polynomials p,qp, q and all c∈Fc \in F.

Remarks

Over a field of characteristic 00, the kernel of DD is the space of constant polynomials. On the space F[x]<nF[x]_{<n} of polynomials of degree less than nn, DD is nilpotent: Dn=0D^n = 0. In the basis 1,x,x21, x, x^2 of F[x]<3F[x]_{<3}, the matrix of DD is (010002000)\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 2 \\ 0 & 0 & 0 \end{pmatrix}. Over R\R, differentiation is also a linear map on the space of differentiable functions.

Explanations

L1 human

Differentiation is linear: the derivative of a sum is the sum of the derivatives, and constants come out. So calculus gives important examples of linear maps. On polynomials of bounded degree, we can even write differentiation as a matrix.

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 this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Space of polynomials of bounded degree example
  2. Vector space definition
  3. Linear map definition
  4. Differentiation as a linear map example

Sources

  1. Web https://en.wikipedia.org/wiki/Linear_map, Examples