Math 2.0

definition

Kernel of a linear map

Definition

Let FF be a field, let VV and WW be vector spaces over FF, and let T ⁣:V→WT \colon V \to W be a linear map. The kernel of TT is ker⁡T={v∈V:T(v)=0}.\ker T = \{v \in V : T(v) = 0\}.

Remarks

The kernel is a linear subspace of VV. A linear map is injective if and only if its kernel is trivial. For the map x↦Axx \mapsto Ax of a matrix AA, the kernel is the null space of AA, the solution set of Ax=0Ax = 0. The kernel of the projection R3→R2\R^3 \to \R^2, (x,y,z)↦(x,y)(x, y, z) \mapsto (x, y), is the zz-axis.

Explanations

L1 human

The kernel collects the vectors that the map sends to zero. It measures how much information the map loses. If only the zero vector goes to zero, then the map loses nothing.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • 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 this needs

To read this node, read these 3 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. Vector space definition
  2. Linear map definition
  3. Kernel of a linear map definition

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Kernel_(linear_algebra), lead section