Math 2.0

Linear and multilinear algebra; matrix theory Proposition

A linear map is injective iff its kernel is trivial

Builds on Kernel of a linear mapLinear map

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.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • 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

Further reading

  1. Web https://en.wikipedia.org/wiki/Kernel_(linear_algebra), Properties
About this page
Tag0BJBYCGMWE
URIm2://0BJBYCGMWE
Kindstatement, proposition
WritingW0 stub
MSC15A04
StatusThis copy of the site has no build data. Run m2 status 0BJBYCGMWE.
UsesKernel of a linear map, Linear map

Markdown · JSON · Edit on GitHub

What this page 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 page is. They do not measure its truth.

What links here

No page links to this page yet.