User:IssaRice/Linear algebra/Equivalent statements for injectivity and surjectivity

Let $A$ be an $m\times n$ matrix.

Injective	Surjective	Bijective
$A$ is injective	$A$ is surjective	$A$ is bijective
$A$ has a left inverse	$A$ has a right inverse	$A$ has both a left and right inverse (which turn out to be the same)
for each $b$, the equation $Ax=b$ has at most one solution (in other words, a solution may not exist, but if it does, it is unique)	for each $b$, the equation $Ax=b$ has at least one solution (in other words, a solution always exists, but it may not be unique)	for each $b$, the equation $Ax=b$ has exactly one (in other words, a solution always exists, and it is unique)
the columns of $A$ are linearly independent	the columns of $A$ span ${\mathbf{R}}^m$	the columns of $A$ are a basis of ${\mathbf{R}}^m$
the rows of $A$ span ${\mathbf{R}}^m$	the rows of $A$ are linearly independent	the rows of $A$ are a basis of ${\mathbf{R}}^m$
		$det(A)\ne 0$
$A$ has rank $n$	$A$ has rank $m$	$A$ has rank $n=m$
in the row echelon form of $A$, there is a pivot in every column	in the row echelon form of $A$, there is a pivot in every row	in the row echelon form of $A$, there is a pivot in every column and every row
$\mathrm{n}\mathrm{u}\mathrm{l}\mathrm{l}A=\{0\}$	$\mathrm{r}\mathrm{a}\mathrm{n}\mathrm{g}\mathrm{e}A={\mathbf{R}}^m$