Math 2.0

definition

Nullity

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 nullity of TT is nullity⁡T=dim⁡ker⁡T,\operatorname{nullity} T = \dim \ker T, the dimension of the kernel of TT. The nullity of a matrix AA is the nullity of the map x↦Axx \mapsto Ax, the dimension of the null space of AA.

Remarks

The nullity is 00 if and only if TT is injective. For an m×nm \times n matrix, the nullity is the number of free variables of Ax=0Ax = 0. By the rank–nullity theorem, rank⁡T+nullity⁡T=dim⁡V\rank T + \operatorname{nullity} T = \dim V when VV is finite-dimensional.

Explanations

L1 human

The nullity counts the dimensions that the map crushes to zero. The projection of space onto a plane crushes one direction, so its nullity is 11. Rank counts what survives, and nullity counts what is lost.

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 12 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 combination definition
  3. Linear map definition
  4. Linear subspace definition
  5. Linear independence definition
  6. Kernel of a linear map definition
  7. Linear span definition
  8. Spanning set definition
  9. Basis definition
  10. Finite-dimensional vector space definition
  11. Dimension definition
  12. Nullity definition

What depends on this

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

Sources

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