Math 2.0

statement proposition

A linear map is injective iff its kernel is trivial

Statement

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. Then TT is injective if and only if ker⁡T={0}\ker T = \{0\}, where ker⁡T\ker T is the kernel of TT.

Remarks

The key step is T(u)=T(v)  ⟺  T(u−v)=0  ⟺  u−v∈ker⁡TT(u) = T(v) \iff T(u - v) = 0 \iff u - v \in \ker T. Thus each nonempty fibre T−1(w)T^{-1}(w) is a coset v+ker⁡Tv + \ker T. For a matrix AA, the map x↦Axx \mapsto Ax is injective if and only if Ax=0Ax = 0 has only the trivial solution.

Explanations

L1 human

To test if a linear map is one to one, we only need to look at the vectors that go to zero. If two vectors have the same image, then their difference goes to zero. So if only 00 goes to 00, then no two vectors share an image.

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. Vector space definition
  2. Linear map definition
  3. Kernel of a linear map definition
  4. A linear map is injective iff its kernel is trivial statement

Sources

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