Review

Dimension
• The dimension of a nonzero vector space 𝒱 is the number of
vectors in a basis for 𝒱.
• We often write dim 𝒱 for the dimension of 𝒱.
• We also define the dimension of the trivial vector space {0} to be
zero.

The following are dimensions of some familiar vector spaces:

dim(ℝn) = n : the standard basis has n vectors
dim(Pn) = n + 1 : the standard basis has n + 1 vectors
dim(Mmn) = m × n : the standard basis has m × n vectors
 Dimension
Let 𝒱 be an n-dimensional vector space, and let S = {v1, v2, ..., vn} be
any basis.
(a) If a set in 𝒱 has more than n vectors, then S is not linearly
independent.
(b) (b) If a set in 𝒱 has fewer than n vectors, then S does not span 𝒱.

Corollaries:
(1) If a vector space 𝒱 has dimension n, then a minimal spanning set
for 𝒱 contains n vectors.
(2) If vector space 𝒱 has dimension n, then any subset of m > n
vectors must be not linearly independent.
(3) If vector space 𝒱 has dimension n, then any subset of m < n
vectors cannot span 𝒱.
Rank dan Nullity
Basis for the Column Space of a Matrix
Theorem 1:
If a matrix R is in row echelon form, then the row vectors with the
leading 1’s (the nonzero row vectors) form a basis for the row space
of R, and the column vectors with the leading 1’s of the row vectors
form a basis for the column space of R.

Theorem 1 makes it possible to find find bases for the row and
column spaces of a matrix in row echelon form by inspection.
Basis for the Column Space of a Matrix
Theorem 2:
If A and B are row equivalent matrices, then:
(a) A given set of column vectors of A is linearly independent if and
only if the corresponding column vectors of B are linearly
independent.
(b) A given set of column vectors of A forms a basis for the column
space of A if and only if the corresponding column vectors of B
form a basis for the column space of B.
Basis for a Row Space by Row Reduction
Example 1:
Find a basis for the row space of the matrix
2
<latexit sha1_base64="IYkztzBMM4FN5ZMOZW85YnmuDPM=">AAACknicbVHNbhMxEPZu+Snmp2nhxsUiAnFJtJuS/iABqXpBiEMRpK2UXUVeZzax6vWu7FmkaJXn4Bl4HW68BY+AvckB2o40o2/mmx97JquUtBhFv4Nw687de/e3H9CHjx4/2ens7p3bsjYCxqJUpbnMuAUlNYxRooLLygAvMgUX2dWp5y++g7Gy1N9wWUFa8LmWuRQcXWja+ZkUHBdZ3pys2DtGEwU5TmiSwVzqhhvDl6vGtLKiMXvFevvOvPFg4MzQOzRJqHd6B84ce+ATj5wObqc8OPRU6/mGPd+xTRy2Hk1AzzbjaWLkfIHptNON+lEr7CaIN6A7+vRnLwu//jibdn4ls1LUBWgUils7iaMKU9cVpVDg+tYWKi6u+BwmDmpegE2bdqUr9tJFZiwvjVONrI3+W9HwwtplkblMv0B7nfPB27hJjflR2khd1QharAfltWJYMn8fNpMGBKqlA1wY6d7KxIIbLtBdkbolxNe/fBOcD/rxQX/wJe6Ojslatslz8oK8JjE5JCPykZyRMRHBTjAM3gcfwmfh2/AkPF2nhsGm5in5T8LPfwH4jrXa</latexit>

3
1 3 4 2 5 4
6 2 6 9 1 8 2 7
A=4 6 7
2 6 9 1 9 7 5
1 3 4 2 5 4
Solution:
Since elementary row operations do not change the row space of a
matrix (see Lecture 16), we can find a basis for the row space of A by
finding a basis for the row space of any row echelon form of A.
Basis for a Row Space by Row Reduction
Reducing A to row echelon form and by these row operations:
2 × R1 – R2 ➝ R2
2 × R1 – R3 ➝ R3
R1 + R4 ➝ R4
–1 × R2 ➝ R2
R2 + R3 ➝ R3
–1 × R3 ➝ R3

we obtain
<latexit sha1_base64="jM7v+00hK82JSq7+5OdP1HtMEig=">AAACjHicbVHbahsxENVu0zZR2tRJHvMiYlL6EnfXuRMChkIIfUovTgLexWjlWVtEq12k2YJZ/B39gP5R3/oX+YRq1y64SQZmOJpzZkYaJYWSFoPgj+e/WHn56vXqGl1/83bjXWtz68bmpRHQF7nKzV3CLSipoY8SFdwVBniWKLhN7j/V/O0PMFbm+jtOC4gzPtYylYKjSw1bv6KM4yRJq68zdsFopCDFAY0SGEtdcWP4dFaZxmY0ZO/Z/oELhzXounBUH2gU0cCB2mvJwT92/3iZWpYcPUc0TiPQo8VgGhk5nmA8bLWDTtAYewrCBWj3Pj9sJf63n9fD1u9olIsyA41CcWsHYVBg7LqiFApc39JCwcU9H8PAQc0zsHHVLHPG9lxmxNLcONfImuxyRcUza6dZ4pT16uxjrk4+xw1KTE/jSuqiRNBiPigtFcOc1T/DRtKAQDV1gAsj3V2ZmHDDBbr/o24J4eMnPwU33U543Ol+Cdu9MzK3VbJDdskHEpIT0iNX5Jr0ifDWvI/eqXfmb/iH/rl/MZf63qJmm/xn/uVfVYW0Yg==</latexit>

2 3
1 3 4 2 5 4
6 0 0 1 3 2 6 7
R=6
4 0
7
0 0 0 1 5 5
0 0 0 0 0 0
Basis for a Row Space by Row Reduction
By Theorem 1, the nonzero row vectors of R form a basis for the row
space of R and hence form a basis for the row space of A. These
basis vectors are
r1 = [1 –3 4 –2 5 4]
r2 = [0 0 1 3 –2 –6]
r3 = [0 0 0 0 1 5]
 Basis for a Column Space by
Row Reduction
Example 2:
Find a basis for the row space of the matrix
2
<latexit sha1_base64="IYkztzBMM4FN5ZMOZW85YnmuDPM=">AAACknicbVHNbhMxEPZu+Snmp2nhxsUiAnFJtJuS/iABqXpBiEMRpK2UXUVeZzax6vWu7FmkaJXn4Bl4HW68BY+AvckB2o40o2/mmx97JquUtBhFv4Nw687de/e3H9CHjx4/2ens7p3bsjYCxqJUpbnMuAUlNYxRooLLygAvMgUX2dWp5y++g7Gy1N9wWUFa8LmWuRQcXWja+ZkUHBdZ3pys2DtGEwU5TmiSwVzqhhvDl6vGtLKiMXvFevvOvPFg4MzQOzRJqHd6B84ce+ATj5wObqc8OPRU6/mGPd+xTRy2Hk1AzzbjaWLkfIHptNON+lEr7CaIN6A7+vRnLwu//jibdn4ls1LUBWgUils7iaMKU9cVpVDg+tYWKi6u+BwmDmpegE2bdqUr9tJFZiwvjVONrI3+W9HwwtplkblMv0B7nfPB27hJjflR2khd1QharAfltWJYMn8fNpMGBKqlA1wY6d7KxIIbLtBdkbolxNe/fBOcD/rxQX/wJe6Ojslatslz8oK8JjE5JCPykZyRMRHBTjAM3gcfwmfh2/AkPF2nhsGm5in5T8LPfwH4jrXa</latexit>

3
1 3 4 2 5 4
6 2 6 9 1 8 2 7
A=4 6 7
2 6 9 1 9 7 5
1 3 4 2 5 4

that consists of column vectors of A.

 Basis for a Column Space by
Row Reduction
Solution:
From Example 1, we obtain the row echelon form of A
2 3
<latexit sha1_base64="jM7v+00hK82JSq7+5OdP1HtMEig=">AAACjHicbVHbahsxENVu0zZR2tRJHvMiYlL6EnfXuRMChkIIfUovTgLexWjlWVtEq12k2YJZ/B39gP5R3/oX+YRq1y64SQZmOJpzZkYaJYWSFoPgj+e/WHn56vXqGl1/83bjXWtz68bmpRHQF7nKzV3CLSipoY8SFdwVBniWKLhN7j/V/O0PMFbm+jtOC4gzPtYylYKjSw1bv6KM4yRJq68zdsFopCDFAY0SGEtdcWP4dFaZxmY0ZO/Z/oELhzXounBUH2gU0cCB2mvJwT92/3iZWpYcPUc0TiPQo8VgGhk5nmA8bLWDTtAYewrCBWj3Pj9sJf63n9fD1u9olIsyA41CcWsHYVBg7LqiFApc39JCwcU9H8PAQc0zsHHVLHPG9lxmxNLcONfImuxyRcUza6dZ4pT16uxjrk4+xw1KTE/jSuqiRNBiPigtFcOc1T/DRtKAQDV1gAsj3V2ZmHDDBbr/o24J4eMnPwU33U543Ol+Cdu9MzK3VbJDdskHEpIT0iNX5Jr0ifDWvI/eqXfmb/iH/rl/MZf63qJmm/xn/uVfVYW0Yg==</latexit>

1 3 4 2 5 4
6 0 0 1 3 2 6 7
R=6 4 0
7
0 0 0 1 5 5
0 0 0 0 0 0

Keeping in mind that A and R can have different column spaces, we

cannot find a basis for the column space of A directly from the
column vectors of R. However, it follows from Theorem 2(b) that if
we can find a set of column vectors of R that forms a basis for the
column space of R, then the corresponding column vectors of A will
form a basis for the column space of A.
 Basis for a Column Space by
Row Reduction
Since the first, third, and fifth columns of R contain the leading 1’s of
the row vectors, then the following vectors
2 3 2 3 2 3 <latexit sha1_base64="bD0sPevH7pKL/uxIS/Oee1s4d2I=">AAAC83icjVJNb9QwEHXCVxu+tuXIxWKF4ACrZKGlHJBW4oI4FcG2ldbRynEmu1YdJ7UnqKsofwMOHECIK3+GG/+iP6HO7kot3apiJFtPb2be89hOSiUthuFfz792/cbNW2vrwe07d+/d72xs7tmiMgKGolCFOUi4BSU1DFGigoPSAM8TBfvJ4ds2v/8ZjJWF/oSzEuKcT7TMpODoqPGGt85yjtMkq0Uzjp7QNzRgCjIcBSyBidQ1N4bPmto0QUQZo+HZFjDQ6TIfMCMnU4yfBeyo4mlwTvTFlaIvW6nov0QpQzjGmuu0oSsuW1e6bLXaz/tnXpfZjDvdsBfOg66CaAm6g/cnm4n/8evuuPOHpYWoctAoFLd2FIUlxk4VpVDgdCsLJReHfAIjBzXPwcb1/M0a+tgxKc0K45ZGOmfPd9Q8t3aWJ66yndJezLXkZblRhdlOXEtdVghaLIyySlEsaPsBaCoNCFQzB7gw0p2Viik3XKD7JoG7hOjiyKtgr9+Ltnv9D1F38JosYo08JI/IUxKRV2RA3pFdMiTCK70v3nfvh1/53/yf/q9Fqe8tex6Qf8L/fQp6DelE</latexit>

1 4 5
6 0 7 6 1 7 6 2 7
c01 = 6
4 0 5
7 , c03 = 6
4 0 5
7 , and c05 = 6
4 1 5
7

0 0 0

form a basis for the column space of R. Thus, the corresponding

column vectors of A form a basis for the column space of A,
2 3 2 3 2 3
<latexit sha1_base64="YjL1vp68g19YysrLGPas/U9e//U=">AAAC8nicfVLLjtMwFHXCq4RXZ1iysaiQWDBVU6bzWCBVYoNYDYLOjFRHlePctNY4TrBvEFWUz0BILECILV/Djr/gE3Daahimo17JV0f3cY6vr+NCSYu93m/Pv3b9xs1brdvBnbv37j9ob20f27w0AkYiV7k5jbkFJTWMUKKC08IAz2IFJ/HZyyZ/8gGMlbl+h/MCooxPtUyl4OhCky2vxTKOszitRD0J6QsaMAUpjgMWw1TqihvD53Vl6iCkjNH+udsJAwY6WRUEzMjpDKNnAXtf8iS4QPp8E+luQ3V47nZ2N5BShvARK66Tmq6pDDapDBrug38qg6tUJu1Or9tbGF0H4Qp0hq//bMf+289Hk/YvluSizECjUNzacdgrMHKsKIUCx1taKLg441MYO6h5BjaqFiur6RMXSWiaG3c00kX0YkfFM2vnWewqmyHt5VwTvCo3LjE9iCqpixJBi6VQWiqKOW32TxNpQKCaO8CFke6uVMy44QLdLwncI4SXR14Hx/1uuNftvwk7w0OytBZ5RB6TpyQk+2RIXpEjMiLCy71P3lfvm4/+F/+7/2NZ6nurnofkP/N//gVIFelM</latexit>

1 4 5
6 2 7 6 9 7 6 8 7
c1 = 64 2 5
7 , c3 = 6
4 9 5
7 , and c5 = 6
4 9 5
7

1 4 5
 Row and Column Spaces Have
Equal Dimensions
In Examples 1 and 2, we found that the row and column spaces of the
matrix
2 3
<latexit sha1_base64="IYkztzBMM4FN5ZMOZW85YnmuDPM=">AAACknicbVHNbhMxEPZu+Snmp2nhxsUiAnFJtJuS/iABqXpBiEMRpK2UXUVeZzax6vWu7FmkaJXn4Bl4HW68BY+AvckB2o40o2/mmx97JquUtBhFv4Nw687de/e3H9CHjx4/2ens7p3bsjYCxqJUpbnMuAUlNYxRooLLygAvMgUX2dWp5y++g7Gy1N9wWUFa8LmWuRQcXWja+ZkUHBdZ3pys2DtGEwU5TmiSwVzqhhvDl6vGtLKiMXvFevvOvPFg4MzQOzRJqHd6B84ce+ATj5wObqc8OPRU6/mGPd+xTRy2Hk1AzzbjaWLkfIHptNON+lEr7CaIN6A7+vRnLwu//jibdn4ls1LUBWgUils7iaMKU9cVpVDg+tYWKi6u+BwmDmpegE2bdqUr9tJFZiwvjVONrI3+W9HwwtplkblMv0B7nfPB27hJjflR2khd1QharAfltWJYMn8fNpMGBKqlA1wY6d7KxIIbLtBdkbolxNe/fBOcD/rxQX/wJe6Ojslatslz8oK8JjE5JCPykZyRMRHBTjAM3gcfwmfh2/AkPF2nhsGm5in5T8LPfwH4jrXa</latexit>

1 3 4 2 5 4
6 2 6 9 1 8 2 7
A=6 4 2
7
6 9 1 9 7 5
1 3 4 2 5 4

both have three basis vectors and hence are both three-dimensional.
[The dimension of a nonzero vector space 𝒱 is the number of vectors
in a basis for 𝒱. ]
The fact that these spaces have the same dimension is not accidental,
but rather a consequence of the following theorem.
 Row and Column Spaces Have
Equal Dimensions
Theorem 3:
The row space and the column space of a matrix A have the same
dimension.

Elementary row operations do not change the dimension of the row

space or of the column space of a matrix. Thus, if R is any row
echelon form of A, it must be true that:
dim(row space of A) = dim(row space of R)
dim(column space of A) = dim(column space of R)
 Applications of Rank
One useful application of calculating the rank of a matrix is the
computation of the number of solutions of a system of linear
equations. According to the Rouché-Capelli theorem:
(1) Based on ranks of the augmented and coefficient matrices
- The system is inconsistent if the rank of the augmented
matrix is greater than the rank of the coefficient matrix.
- The system must have at least one solution if the ranks of
these two matrices are equal.
- The system has a unique solution if and only if the rank equals
the number of variables. *

* https://en.wikipedia.org/wiki/Rank_(linear_algebra
 Applications of Rank
(2) Based on ranks and the numbers of variables
- The system has a unique solution if and only if the rank equals the
number of variables.
- The system has infinitely many solutions if the general solution
has k free parameters where k is the difference between the
number of variables and the rank.*

• In control theory, the rank of a matrix can be used to determine

whether a linear system is controllable, or observable.
• In the field of communication complexity, the rank of the
communication matrix of a function gives bounds on the amount
of communication needed for two parties to compute the function.

* https://en.wikipedia.org/wiki/Rank_(Based onlinear_algebra
 The Rank Theorem
The rank of a matrix is the number of nonzero rows in its row
echelon form.

We will denote the rank of a matrix A by rank(A).

Example 3:
Determine the rank of the following matrix
2
<latexit sha1_base64="2y/m9gQKGZvEPEIkwp7kC3pZKjs=">AAACW3icbVFNb9MwGHZSoMVs0G7aiYtFBeJClQQJxmFSp152HNK6VmpC5bhvWmuOE9lvJlVRfwJ/jhMc+CsIpy0TbDySrcfP+2U/TkslLQbBD89vPXr8pN15Sp8dHD5/0e0dXduiMgLGolCFmabcgpIaxihRwbQ0wPNUwSS9GTXxyS0YKwt9hesSkpwvtcyk4OikedfEOcdVmtXnG3bGaKwgwxmNU1hKXXNj+HpTG4cNDdkb9u5ui2gc06g5RX+k9420ZXdZAY1BL/Z9aGzkcoXJvNsPBsEW7CEJ96Q/HJWHX75e9S7n3W/xohBVDhqF4tbOwqDExHVFKRS4vpWFkosbvoSZo5rnYJN6682GvXbKgmWFcUsj26p/V9Q8t3adpy6zccLejzXi/2KzCrPTpJa6rBC02A3KKsWwYI3RbCENCFRrR7gw0t2ViRU3XKD7DupMCO8/+SG5jgbhh0H0OewPP5EdOuQleUXekpB8JENyQS7JmAjynfzy2l7H++m3fOof7FJ9b19zTP6Bf/IbZoeszQ==</latexit>

3
1 1 1 2
A=4 2 2 1 3 5
1 1 1 0
 The Rank Theorem
Solution:
The row echelon form of matrix A is obtained from executing the
following row operations:
2 3 2 3
<latexit sha1_base64="UyqFcybindrscmUwYPv2VinO9dI=">AAACz3iclZLLbtQwFIadlEsxFKZlycZiBGLDKEklLruRumHBopU6baVxGDnOScaqY6e2QzUKU3XLgpdjxwvwHDiZaQUtCziSrd/fufj4ktVSWBdFP4Jw487de/c3H+CHj7YePxls7xxZ3RgOE66lNicZsyCFgokTTsJJbYBVmYTj7HSv8x9/BmOFVoduUUNasVKJQnDmPJoNflIJhZtimkEpVMuMYYtla7wtcUxektfXU4IpxUm3Sq7Qbod6dR0VYQoqX9fB1Ihy7lJMz84alhMqtSp75P36nKww/r8Wom6XKxL/YwezwTAaRb2R2yJei+F4r9769O1we382+E5zzZsKlOOSWTuNo9qlvqoTXIKv21ioGT9lJUy9VKwCm7b9eyzJC09yUmjjh3Kkp79ntKyydlFlPrJibm5v+jr4N9+0ccW7tBWqbhwovtqoaCRxmnSPS3JhgDu58IJxI3yvhM+ZYdz5L4D9JcQ3j3xbHCWj+M0oOYiH4/doZZvoGXqOXqEYvUVj9AHtowniwcfABG3wJTwIz8OL8HIVGgbrnKfoDwu//gJwcc//</latexit>

1 1 1 2 2R1 – R2 → R2 1 1 1 2
4 2 2 1 3 5 ! 4 0 0 1 1 5
1 1 1 0 1 1 1 0
2 3 2 3 <latexit sha1_base64="nkYk00O4+tVGTW16sOu6EvW+IxY=">AAACzXicpZLPb9MwFMedDNgwG3Rw5GJRMe1ClfTAtlulXRAXhrRuk+qscpyX1JpjZ7YDCqG7cuKf48adPwS36SZYufEkW1993g8/+zmtpLAuin4G4caDh482tx7jJ9s7T5/1dp+fWV0bDmOupTYXKbMghYKxE07CRWWAlamE8/TqeOE//wTGCq1OXVNBUrJCiVxw5jya9n5RCbmbYJpCIVTLjGHNvDXe5jgme+TN3TbElOLIi+iWxAvSqVsUYQoqW5XB1Ihi5hJMr69rlhEqtSqWyPv1Z9Jh/L8d3JFhF7PewLTXjwbR0si6iFeiPzqudi6/n+6eTHs/aKZ5XYJyXDJrJ3FUucRXdYJL8HVrCxXjV6yAiZeKlWCTdjmNOXntSUZybfxSjizpnxktK61tytRHlszN7H3fAv7LN6ldfpi0QlW1A8W7g/JaEqfJYrQkEwa4k40XjBvheyV8xgzjzn8A7B8hvn/ldXE2HMRvB8OPcX90hDrbQi/RK7SPYnSARugdOkFjxIP3QRU0wZfwQ1iHX8ObLjQMVjkv0F8WfvsNI/HPjA==</latexit>

1 1 1 2 R1 + R3 → R3 1 1 1 2
4 0 0 1 1 5 ! 4 0 0 1 1 5
1 1 1 0 0 0 2 2
2 3 2 3 <latexit sha1_base64="KKVq/88mIkGpHrOWMfrq//HmDJs=">AAACzHicnZFNb9QwEIad8NHWUNjCsReLFYgLq2QPQG8r9VIuqEjdttImrBxnkrXq2Kk9gUbRXrnx57hx5o/g3SyIthwQr2Tr1TPj8diT1Uo6jKLvQXjn7r37W9s79MHD3UePB3tPTp1prICpMMrY84w7UFLDFCUqOK8t8CpTcJZdHK7iZ5/AOmn0CbY1pBUvtSyk4OjRfPAjUVDgjCYZlFJ33FreLjvrtaQxe8Fe/d7GNElo5E30i8TXyLjPAZ1vqtDEynKBKU0uLxues0QZXa6Rj5vPrMf0/xro6b81MB8Mo1G0Frtt4o0ZTg7r3Y9fT/aO54NvSW5EU4FGobhzsziqMfVVUQoFvm7joObigpcw81bzClzarYexZM89yVlhrF8a2Zr+eaLjlXNtlfnMiuPC3Yyt4N9iswaLt2kndd0gaNFfVDSKoWGrybJcWhCoWm+4sNL3ysSCWy7Qz5/6T4hvPvm2OR2P4tej8Yd4ODkgvbbJPnlGXpKYvCETckSOyZSI4F1ggqugDd+HGHbhsk8Ng82Zp+Sawi8/AY1yz1Y=</latexit>

1 1 1 2 –1 × R2 → R2 1 1 1 2
4 0 0 1 1 5 ! 4 0 0 1 1 5
0 0 2 2 0 0 2 2
 The Rank Theorem
Solution:
and
2
<latexit sha1_base64="peyVgsbRi/c3t2rMJ1iW6s7kezo=">AAACy3icrVFNb9QwEHXCVzEUtnDkYrECcekq2UOht5V66QWpSN220iasHGeSterYqT1pWcIeOfLnuHHll+BNVqi0PfKksZ7emw/bk9VKOoyiX0F47/6Dh4+2HtMnT7efPR/svDhxprECpsIoY88y7kBJDVOUqOCstsCrTMFpdn6w9k8vwTpp9DEua0grXmpZSMHRS/PB70RBgTOaZFBK3XJr+XLVWo8Vjdlbtvv3GNMkoZEn6+jV68ruuM8BnW+60MTKcoEpTS4uGp6zRBlddpL3zRXrZfq/LtDFXfPng2E0ijqw2yTekOHkoN7+/ON452g++JnkRjQVaBSKOzeLoxpT3xWlUOD7Ng5qLs55CTNPNa/ApW23ixV745WcFcb60Mg69XpFyyvnllXmMyuOC3fTW4t3ebMGiw9pK3XdIGjRDyoaxdCw9WJZLi0IVEtPuLDS35WJBbdcoF8/9Z8Q33zybXIyHsV7o/GneDjZJz22yCvymrwjMXlPJuSQHJEpEcFhoIOr4Ev4MXTh1/BbnxoGm5qX5B+E3/8A35PPGw==</latexit>

3 2 3
1 1 1 2 2R2 + R3 → R3 1 1 1 2
4 0 0 1 1 5 ! 4 0 0 1 1 5
0 0 2 2 0 0 0 0

Thus, the rank of matrix A is 2.

 The Rank Theorem
Example 4:
Determine the rank of the following matrix
2 3 <latexit sha1_base64="G9LK7x7SqkAu2izHWlCfnrDgqq0=">AAACSnicbVBLT9tAEF4HWui2lECPXFZERb00so3E44AUxIUjlQggxSZab8bJivXa2h0jRVZ+Ar+LS0+98SN64QBCvXSd5MBrpFl9881r50sKJS36/p3XWFj88HFp+RP9/GXl62pzbf3M5qUR0BW5ys1Fwi0oqaGLEhVcFAZ4lig4T66O6vz5NRgrc32K4wLijA+1TKXg6Kh+k0cZx1GSVocTdsBopCDFHo0SGEpdcWP4eFIZYybUZ1ssdL5No4iG8yCog8CBn9MnpBHowbyNRkYORxj3my2/7U+NvQXBHLQ6R8XK5c3p2km/+Sca5KLMQKNQ3Npe4BcYu6kohQI3t7RQcHHFh9BzUPMMbFxNpZiw744ZsDQ3zjWyKfu8o+KZteMscZX14fZ1ribfy/VKTPfiSuqiRNBitigtFcOc1bqygTQgUI0d4MJI91cmRtxwgU596kQIXp/8FpyF7WCnHf4KWp19MrNlskE2yQ8SkF3SIcfkhHSJILfkL3kgj95v79578v7NShvevOcbeWGNxf91nq40</latexit>

0 2 3
A=4 2 2 1 5
1 1 2

Solution:
The row echelon form of matrix A is obtained from the following
row operations:
2 3 2 3
<latexit sha1_base64="sAR819lOTCBR/GtTuGhK6t/b00k=">AAACrnicdVHdbtMwFHbCz4Zh0MElNxYVCAlRJUHa4K7SbrjcpLWbiEPlOCepNcfObGeoivoIPNZeYHe8DW7ai62FIx3rO9/59Tl5I4V1UfQnCB89fvJ0b/8Zfv7i4OWrweHrqdWt4TDhWmpzmTMLUiiYOOEkXDYGWJ1LuMivTlb+ixswVmh17hYNZDWrlCgFZ85Ts8EtlVC6FNMcKqE6ZgxbLDtjzBJH5ANJvH7BlOJkY8QrI/bgc/8kmIIqNmmYGlHNXYbp9XXLCkKlVlVPeb/+RdY0/n/HB3W3et6bZrfjbDCMRlEvZBfEGzAcnzQHP3+fH57OBne00LytQTkumbVpHDUu81Wd4BJ83dZCw/gVqyD1ULEabNb1616S954pSKmNV+VIz97P6Fht7aLOfWTN3Nxu+1bkv3xp68qvWSdU0zpQfN2obCVxmqxuRwphgDu58IBxI/yshM+ZYdz5C2O/hHj7y7tgmozio1FyFg/H39Ba9tFb9A59RDE6RmP0HZ2iCeLBp+As+BGkYRROwyycrUPDYJPzBj2QcP4XbcLJFA==</latexit>

0 2 3 R1 ↔ R3 1 1 2
4 2 2 1 5 ! 4 2 2 1 5
1 1 2 0 2 3
 The Rank Theorem
Solution:
2 <latexit sha1_base64="T7vrnjQeHVVg4f5r9zRDNqyegTM=">AAACrnicjVHNbtQwEHbSAsVQ2JYjF6srEBJilSyihdtKvXBspe62Ig4rx5lkrTp2ajugVbSP0MfqC3Dr29TJ7gFaJBhprG++b37scVZLYV0U3Qbh1vajx092nuJnz3dfvBzs7c+sbgyHKddSm4uMWZBCwdQJJ+GiNsCqTMJ5dnnc6ec/wFih1Zlb1pBWrFSiEJw5T80HN1RC4RJMMyiFapkxbLlqjTErHJO35EN/jDGleOxR53EXRJvgI6ag8k0ZpkaUC5dienXVsJxQqVXZU17XP8maxv89sRvyqfN/TpwPhtEo6o08BPEGDCfH9e7367O9k/ngF801bypQjktmbRJHtUt9Vye4BN+3sVAzfslKSDxUrAKbtv26V+SNZ3JSaONdOdKzv1e0rLJ2WWU+s2JuYe9rHfk3LWlc8TlthaobB4qvBxWNJE6T7u9ILgxwJ5ceMG6EvyvhC2YYd/6HsV9CfP/JD8FsPIoPR+PTeDj5gta2g16jA/QOxegITdBXdIKmiAfvg9PgW5CEUTgL03C+Tg2DTc0r9IeFizt2TckZ</latexit>

3 2 3
1 1 2 2R1 − R2 → R2 1 1 2
4 2 2 1 5 ! 4 0 5 5 5
0 2 3 0 2 3
2<latexit sha1_base64="K4NmXF3ivloOJz32kRXxJSWV+Fk=">AAACrniclVHdatswFJa9v05r13S93I1oWCmMBTtjf3eB3uyyhSYts9wgy8eOqCy5krwRTB5hj7UX2F3fZrKTwdoOxg4c8Z3vOz/SUVZLYV0U3QThg4ePHj/Zeoqfbe883x3svZhZ3RgOU66lNhcZsyCFgqkTTsJFbYBVmYTz7Oq408+/grFCqzO3rCGtWKlEIThznpoPflAJhUswzaAUqmXGsOWqNcascEwOyZv+GGNKceTRu85/B2PvbzEFlW/KMDWiXLgU0+vrhuWESq3KnvK6/kbWNP6viV0U/3PifDCMRlFv5D6IN2A4Oa53Lr+f7Z3MBz9prnlTgXJcMmuTOKpd6rs6wSX4vo2FmvErVkLioWIV2LTt170irzyTk0Ib78qRnv2zomWVtcsq85kVcwt7V+vIv2lJ44qPaStU3ThQfD2oaCRxmnR/R3JhgDu59IBxI/xdCV8ww7jzP4z9EuK7T74PZuNR/H40Po2Hk09obVvoJTpARyhGH9AEfUYnaIp48Do4Db4ESRiFszAN5+vUMNjU7KNbFi5+AXOEyRY=</latexit>

3 2 3
1 1 2 1/5 × R2 → R2 1 1 2
4 0 5 5 5 ! 4 0 1 1 5
0 2 3 0 2 3
2 <latexit sha1_base64="NGwYqOz/Vi1rntLKmqQ3y8tiXUI=">AAACrnicnVHdbtMwFHbCgGEY6+CSG4uKaRKiSorEz12l3XC5SWs3EYfKcU5Sa46d2Q6oivoIPBYvsLu9DW5SpG3lakc61ne+7/zYx1kthXVRdBOEj3YeP3m6+ww/f7H3cn9w8GpmdWM4TLmW2lxkzIIUCqZOOAkXtQFWZRLOs8vjtX7+E4wVWp25ZQ1pxUolCsGZ89R88IdKKFyCaQalUC0zhi1XrTFmhWNySD50xxhTiiOP1lH8Lxh7/4gpqHxThqkR5cKlmF5dNSwnVGpVdpTX9S/S0/jhE6M+2J44HwyjUdQZ2QbxBgwnx/Xej99nByfzwTXNNW8qUI5LZm0SR7VLfVcnuATft7FQM37JSkg8VKwCm7bdulfknWdyUmjjXTnSsbcrWlZZu6wyn1kxt7D3tTX5Py1pXPElbYWqGweK94OKRhKnyfrvSC4McCeXHjBuhL8r4QtmGHf+h7FfQnz/ydtgNh7Fn0bj03g4+Yp620Vv0Ft0hGL0GU3QN3SCpogH74PT4HuQhFE4C9Nw3qeGwabmNbpj4eIvXFTJCg==</latexit>

3 2 3
1 1 2 2R2 − R3 → R3 1 1 2
4 0 1 1 5 ! 4 0 1 1 5
0 2 3 0 0 1

Thus, the rank of matrix A is 3.

 The Rank Theorem
Let A be the coefficient matrix of a system of linear equations with n
variables. If the system is consistent, then

number of free variables = n − rank(A)

Thus,
- in Example 3, where the system of linear equations are
w x y + 2z = 1
<latexit sha1_base64="ACOPUNk+jHAL+yZcnujnGSLeDTM=">AAACfHicbZFbS8MwGIbTeq6nqZdeGJyKIhttBQ8XwsAbLxWcCusYafZtC6ZpSVK1lv0K/5l3/hRvxHSroNMvvM3L+z1p0yRMOFPadd8te2p6ZnZufsFZXFpeWa2srd+qOJUUmjTmsbwPiQLOBDQ10xzuEwkkCjnchQ8XRf/uEaRisbjRWQLtiPQF6zFKtIk6ldcghD4TOZGSZMNc0nIMnSe8h2tGz+WcGR0a+S/mcW7kOUHg+N+YP8kdfXNHBVd7KuOf2F5J1AwColtuwulUqm7dHRX+a7zSVBsXCSrqqlN5C7oxTSMQmnKiVMtzE902r9OMchg6QaogIfSB9KFlrCARqHY+Orwh3jVJF/diaSQ0HqU/V+QkUiqLQkNGRA/UZK8I/+u1Ut07bedMJKkGQccf6qUc6xgXN4G7TALVPDOGUMnMXjEdEEmoNvdVHII3+ct/za1f947r/rVXbZyhcc2jTbSN9pGHTlADXaIr1EQUfVhb1r51YH3aO/ahXRujtlWu2UC/yj7+Ah43r0M=</latexit>

2w 2x y + 3z = 3
w + x y = 3

we have 4 − 2 = 2 free variables.

 The Rank Theorem
- in Example 4, where the system of linear equations are
2x2 + 3x3 = 8
<latexit sha1_base64="9sgw41cDOcx0WZgu+Wlynzn98d0=">AAACcXicbVHLattAFB2pSZoqL7fpppSEISYhYGIkhTy6KBiy6TKBOAlYRozG186Q0UjMjEKM8D7f111/opv+QK9k550zXO7hnnPncSfJpTDW9/847oe5+YWPi5+8peWV1bXG5y8XJis0hy7PZKavEmZACgVdK6yEq1wDSxMJl8nNSaVf3oI2IlPndpxDP2UjJYaCM4uluHEfJTASqmRas/Gk1LxeE2+H7tDwLg4xtTD27+J9TD8xjr0o8lAKHpUH05PnoPKgBeleLYQzFj559tAEajA72YsbTb/t16BvSTAjzc5JTiqcxo3f0SDjRQrKcsmM6QV+bvu4nRVcwsSLCgM54zdsBD2kiqVg+mU9sQndxsqADjONoSytq887SpYaM04TdKbMXpvXWlV8T+sVdnjcL4XKCwuKTw8aFpLajFbjpwOhgVs5RsK4FnhXyq+ZZtziJ1VDCF4/+S25CNvBYTs8C5qdH2SKRfKdbJFdEpAj0iG/yCnpEk7+Ol+dDWfT+ed+c6m7NbW6zqxnnbyA2/oPQl6uIw==</latexit>

2x1 + 3x2 + x3 = 5
x1 x2 2x3 = 5

we have 3 − 3 = 0 free variables.

If the system of linear equations have 0 free variables, it means the

linear system is consistent (it has a unique solution).
 Rank and Nullity
The common dimension of the row space and column space of a
matrix A is called the rank of A and is denoted by rank(A).
The dimension of the null space of A is called the nullity of A and is
denoted by nullity(A).

To find the nullity of matrix A, we must find the dimension of the

solution space of the linear system Ax = 0. This can be solved by
finding the reduced row echelon form of matrix A.
 Rank and Nullity of a 4 × 6 Matrix
Example 5:
Find the rank and nullity of the matrix
2
<latexit sha1_base64="E64rcC7Yc5838DvlcbpSMTIySME=">AAACj3icbVHdTtswFHayH5jHRmGXu7FWbdpNqqQUCtqYiriBXTFtBaQmqhz3pLVwnMh2JlVRn2NvwAPtjrfgEbDbIDHYkT7r8/edc2wfp6Xg2oThjec/e/7i5dr6K/x6483bzdbW9rkuKsVgyApRqMuUahBcwtBwI+CyVEDzVMBFenXs/IvfoDQv5C8zLyHJ6VTyjDNqrDRuXcc5NbM0q48W5JDgWEBmRjhOYcplTZWi80WtlrHAQUQ+ka5FaNGz2LUIdnAc4x3H+g9sl9pzjhOC3cZxRXvOdY7bBAeNE/Tulz6OQU6as3Gs+HRmknGrHXbCZZCnJGpIe/D9djv1f/45G7f+xpOCVTlIwwTVehSFpUlsV8OZANu30lBSdkWnMLJU0hx0Ui/nuSAfrTIhWaEspCFL9WFFTXOt53lqM9309GPPif/zRpXJ9pOay7IyINnqoKwSxBTEfQ6ZcAXMiLkllClu70rYjCrKjP1CbIcQPX7yU3Le7UR7ne6PqD04QKtYR+/RB/QZRaiPBugEnaEhYt6G1/W+eF/9Lb/vf/MHq1Tfa2reoX/CP70DKEa1Iw==</latexit>

3
1 2 0 4 5 3
6 3 7 2 0 1 4 7
A=4 6 7
2 5 2 4 6 1 5
4 9 2 4 4 7
Solution:
The reduced row echelon form of A is
2 <latexit sha1_base64="l4rG1Y4zEOfOm48MBF4U3/JaYxA=">AAACk3icfVHdatRAFJ6kVdv4l1a86s3gonjjktnqtiLiol4UQag/2xY2YZnMnuwOnUzCzImwhH0O36GP07u+hY/QSXYF7YoHzsfH+c7PzDlpqaTFKLry/I3NW7fvbG0Hd+/df/Aw3Nk9sUVlBAxFoQpzlnILSmoYokQFZ6UBnqcKTtPzD41++gOMlYX+jvMSkpxPtcyk4OhC4/AizjnO0qz+uqBvaRAryHAUxClMpa65MXy+qE1ri4DRZzRy/uJlA73DBvcPHLL9II6DRmKt0gBbYt/hq9/qmv9HAD1ZzQ9iI6czTMZhJ+pGrdF1wlakM/j0azf1v/08HoeX8aQQVQ4aheLWjlhUYuK6ohQKXN/KQsnFOZ/CyFHNc7BJ3e50QZ+6yIRmhXGukbbRPytqnls7z1OX2WzQ3tSa4L+0UYXZYVJLXVYIWiwHZZWiWNDmQHQiDQhUc0e4MNK9lYoZN1ygO2PglsBufnmdnPS6rN/tfWGdwWuytC2yR56Q54SRAzIgR+SYDInwQq/vvfMG/mP/jf/e/7hM9b1VzSPyl/mfrwF0fbX8</latexit>

3
1 0 4 28 37 13
6 0 1 2 12 16 5 7
R=6 4 0 0
7
0 0 0 0 5
0 0 0 0 0 0
 Rank and Nullity of a 4 × 6 Matrix
Solution:
Since this matrix has two leading 1’s, its row and column spaces are
two-dimensional and rank(A) = 2.
To find the nullity of A, we must find the dimension of the solution
space of the linear system Ax = 0.
This system can be solved by reducing its augmented matrix to
reduced row echelon form.

The resulting matrix will be identical to matrix R, except that it will

have an additional last column of zeros, and hence the corresponding
system of equations will be
x1 4x3 28x4 37x5 + 13x6 = 0
<latexit sha1_base64="xKc0DDwugLk1UOmpwhSJz7F+u/A=">AAACm3icbVFLa9tAEF6pr1R9OeklUApLTUuh1GjlxE4PKYYcGkoPKdRJwDJitR47S1YrsbsqNsJ/qj+lt976UzqyVVCTzjDwzevb2Zm0UNK6MPzl+Xfu3rv/YOdh8Ojxk6fPOrt75zYvjYCxyFVuLlNuQUkNYyedgsvCAM9SBRfp9Umdv/gOxspcf3OrAqYZX2g5l4I7DCWdH3EKC6krbgxfrSsjWroOlgmjbzb6Hu2ALpN+g6MjdA4apz9E5xDBOzTWR2eA4BgtDOI4qPuXSfS3s8XCohYLG7RYDtskNIhBz5oZg6TTDXvhRuhtwBrQHQ1/k1rOks7PeJaLMgPthOLWTlhYuCnSOSkUrIO4tFBwcc0XMEGoeQZ2Wm12u6avMTKj89ygaUc30XZHxTNrV1mKlRl3V/Zmrg7+Lzcp3fxoWkldlA602D40LxV1Oa0PRWfSgHBqhYALI3FWKq644cLhOeslsJtfvg3Oox4b9KKvrDv6QLayQ16QV+QtYWRIRuSUnJExEd6+99H75J36L/0T/7P/ZVvqe03Pc/KP+OM/YFq25g==</latexit>

x2 2x3 12x4 16x5 + 5x6 = 0

 Rank and Nullity of a 4 × 6 Matrix
Or <latexit sha1_base64="u/IynZ7KGQ4d+ITLrkW3R8NfsmE=">AAADGXicfVJNb9NAEF27fBQHSkqPXFZEIC4Eb9Km5YCUigvHIjVtpdiy1ptxsup6be2uUSMrf6MX/gqXHkAVRzjxTziytoNUmsBI8+Zp3s7s18S54Nr4/k/H3bhz9979zQde6+Gjrcft7ScnOisUgxHLRKbOYqpBcAkjw42As1wBTWMBp/H5u0o//QhK80wem3kOYUqnkiecUWNT0bbzOhCQmLEXxDDlsqRK0fmiVLUtPIJfYN/6q90KegcV9vctkr4XBF4lkVqpgDQ4sLj3R13x/wggJ8v9vUDx6cyE3trDsYV3EREcBPgi6jWh34TdJuw1YbC25dt/NvWrspuwrj5qd/yuXxteJWRJOsPjX1uHLdY6itrfg0nGihSkYYJqPSZ+bkLb1XAmwPYtNOSUndMpjC2VNAUdlvXPLvBzm5ngJFPWpcF19mZFSVOt52lsV6bUzPRtrUqu08aFSQ7Cksu8MCBZs1FSCGwyXI0JnnAFzIi5JZQpbs+K2YwqyowdJs8+Arl95VVy0uuSQbf3gXSGb1Bjm+gpeoZeIoL20RC9R0dohJhz6Xx2vjhf3U/ulXvtfmuWus6yZgf9Ze6P33G45go=</latexit>

2 3
2 3 x1 2 3
1 0 4 28 37 13 6 6 x2 7
7 0
6 0 1 2 12 16 5 76
7 x3 7 6 0 7
6 6 7=6 7
4 0 0 0 0 0 0 566 x4 7 4
7 0 5
0 0 0 0 0 0 4 x5 5 0
x6
Solving this system of equations, we obtain the general solution
x1 = 4r + 28s + 37t 13u
<latexit sha1_base64="gQERCa9tH98edvV48KkD94QgM2I=">AAAChHicbZHPb9MwFMedsI0RBpRx5GKtgiEBVZyu3TiAKnHZcUjrNqmpKsd97aw5TmS/oFVR/xL+K278JxxxGh/GtifZ+n7f+zz/zEolLcbxnyB8srW983T3WfR878XLV53X+xe2qIyAsShUYa4ybkFJDWOUqOCqNMDzTMFldvO9qV/+BGNloc9xVcI050stF1JwdKlZ51eawVLqmhvDV+vaCLWObmeMvqdf3Tgy9CNNTqyb+8dIP1PWr6I0dUTiiaQhWNIQbNgQAw/0PWBae+Stbe3AW2zt0FvXC3ruDxPNOt24F2+CPhTMi+7o/C9p4mzW+Z3OC1HloFEobu2ExSVO3XIohYJ1lFYWSi5u+BImTmqeg53Wm0dc03cuM6eLwrihkW6ydztqnlu7yjNH5hyv7f1ak3ysNqlwcTKtpS4rBC3ajRaVoljQ5kfoXBoQqFZOcGGkOysV19xwge7fmkdg96/8UFwkPTbsJT9Yd/SFtLFL3pID8oEwckxG5JSckTERQRAcBnHAwp3wU9gPBy0aBr7nDfkvwm//ADZossA=</latexit>

x2 = 2r + 12s + 16t 5u
x3 = r
x4 = s
x5 = t
x6 = u
 Rank and Nullity of a 4 × 6 Matrix
Or, in column vector form
2 3 2 3 2
<latexit sha1_base64="EEZmJDDZ6I9v6wqhuRtrnW1B1cE=">AAADb3ichZJNb9MwGMfdhJfhwtaNA4chZFEhgdCqOGPdOCAVceE4pHWb1ESR4zqtNceJbAetinrkC3LjO3DhxhHXqYB1LTyS/fz1vPz8oictBdcmCL61PP/O3Xv3tx7A9sNH2zud3b1zXVSKsiEtRKEuU6KZ4JINDTeCXZaKkTwV7CK9+rDIX3xmSvNCnplZyeKcTCTPOCXGhpLd1pdIsMyMYJSyCZc1UYrM5jWdw+sEoyhC10nYuMPGvWncUeP6MGJyvOyCkeKTqYnhO6jgJqzrd0iHD/5sa1Gvkd6ICk8cJvyNwP+FmY2ww2NH6N+8FP4XrFoPU3N4gN1vHRytPNEh19GSTjfoBc7QbYGXojs4+7n9vk3bp0nnazQuaJUzaaggWo9wUJrYUg2ngllupVlJ6BWZsJGVkuRMx7Wblzl6YSNjlBXKLmmQi/7dUZNc61me2sqcmKlezS2C63KjymQncc1lWRkmaXNQVglkCrQYPjTmilEjZlYQqri9K6JTogg1dkSh/QS8+uTb4jzs4X4v/IS7g7egsS2wD56DlwCDYzAAH8EpGALa+u7tefveU++H/8R/5qOm1Gstex6DG+a/+gWXrAlz</latexit>

3 2 3 2 3
x1 4 28 37 13
6 x2 7 6 2 7 6 12 7 6 16 7 6 5 7
6 7 6 7 6 7 6 7 6 7
6 x3 7 6 7 6 7 6 7 6 7
6 7 = r6 1 7 + s6 0 7 + t6 0 7 + u6 0 7
6 x4 7 6 0 7 6 1 7 6 0 7 6 0 7
6 7 6 7 6 7 6 7 6 7
4 x5 5 4 0 5 4 0 5 4 1 5 4 0 5
x6 0 0 0 1

Because the four vectors on the right side of equation above form a
basis for the solution space, nullity(A) = 4.
 Maximum Value for Rank
Consider an m × n matrix A. Then the following are true:
• the row vectors of A lie in ℝn and
• the column vectors of A are in ℝm
• the row space of A is at most n-dimensional
• the column space of A is at most m-dimensional.

Since the rank of A is the common dimension of its row and column
space, it follows that the rank is at most the smaller of m and n. We
denote this by writing
rank(A)  min(m, n)
<latexit sha1_base64="99NvaiDoOHte1n9ADMzvfpG3McU=">AAACFXicbVBNSxxBEK1RE3Xz4cacJJfGJbCCLDMeEnNbySVHBVeFnWXp6a3RZrt7xu4acRkG/A1e/Cu5eFAk14A3/016dj34kQcFj/eqqKqX5Eo6CsOHYG5+4c3bxaXlxrv3Hz6uND+tHrissAJ7IlOZPUq4QyUN9kiSwqPcIteJwsNk/LP2D8/QOpmZfZrkOND82MhUCk5eGjY3Y8JzKi0346oda04nSVruVBssVnjKZqaWpmrrTbMxbLbCTjgFe02iR9Lqrl1Ajd1h8z4eZaLQaEgo7lw/CnMalNySFAqrRlw4zLkY82Pse2q4Rjcop19V7KtXRizNrC9DbKo+nSi5dm6iE99Z3+1eerX4P69fULo9KKXJC0IjZovSQjHKWB0RG0mLgtTEEy6s9LcyccItF+SDbPgQopcvvyYHW53oW2drL2p1f8AMS/AF1qENEXyHLvyCXeiBgEv4DTdwG1wF18Fd8GfWOhc8znyGZwj+/gPKK5/n</latexit>

where min(m, n) is the minimum of m and n.

 Dimension Theorem for Matrices
If A is a matrix with n columns, then
<latexit sha1_base64="IDIR0nLVpgtIKtI7eB475fdGlGI=">AAACIXicbVBNSwMxFHxbv2r9qnoSL8EiKELZ7UHrQah48ahgq9AWyabZNjSbXZK3YlkK/hIv/hUvHhTxJv4Zs20Pah0IDDNvyHvjx1IYdN1PJzczOze/kF8sLC2vrK4V1zcaJko043UWyUjf+NRwKRSvo0DJb2LNaehLfu33zzL/+o5rIyJ1hYOYt0PaVSIQjKKVbovVFvJ7TDVV/eFeK6TY84P0dLhPDsjYUYmUAge/zRNioyW37I5Apok3IaXa1gNkuLgtfrQ6EUtCrpBJakzTc2Nsp1SjYJIPC63E8JiyPu3ypqWKhty009GFQ7JrlQ4JIm2fQjJSfyZSGhozCH07ma1p/nqZ+J/XTDCotlOh4gS5YuOPgkQSjEhWF+kIzRnKgSWUaWF3JaxHNWVoSy3YEry/J0+TRqXsHZYrl16pdgxj5GEbdmAPPDiCGpzDBdSBwSM8wyu8OU/Oi/PufIxHc84kswm/4Hx9A+X+pKQ=</latexit>

rank(A) + nullity(A) = n

Example 6:
The matrix
<latexit sha1_base64="E64rcC7Yc5838DvlcbpSMTIySME=">AAACj3icbVHdTtswFHayH5jHRmGXu7FWbdpNqqQUCtqYiriBXTFtBaQmqhz3pLVwnMh2JlVRn2NvwAPtjrfgEbDbIDHYkT7r8/edc2wfp6Xg2oThjec/e/7i5dr6K/x6483bzdbW9rkuKsVgyApRqMuUahBcwtBwI+CyVEDzVMBFenXs/IvfoDQv5C8zLyHJ6VTyjDNqrDRuXcc5NbM0q48W5JDgWEBmRjhOYcplTZWi80WtlrHAQUQ+ka5FaNGz2LUIdnAc4x3H+g9sl9pzjhOC3cZxRXvOdY7bBAeNE/Tulz6OQU6as3Gs+HRmknGrHXbCZZCnJGpIe/D9djv1f/45G7f+xpOCVTlIwwTVehSFpUlsV8OZANu30lBSdkWnMLJU0hx0Ui/nuSAfrTIhWaEspCFL9WFFTXOt53lqM9309GPPif/zRpXJ9pOay7IyINnqoKwSxBTEfQ6ZcAXMiLkllClu70rYjCrKjP1CbIcQPX7yU3Le7UR7ne6PqD04QKtYR+/RB/QZRaiPBugEnaEhYt6G1/W+eF/9Lb/vf/MHq1Tfa2reoX/CP70DKEa1Iw==</latexit>

2 3
1 2 0 4 5 3
6 3 7 2 0 1 4 7
A=6
4
7
2 5 2 4 6 1 5
4 9 2 4 4 7
<latexit sha1_base64="4bH2Q45+JaL/mEDpxNxds+QLRnI=">AAACIXicbVA9SwNBEJ2L3/EraiU2i0GICOEuRdRCiNhYRjAqJCHsbfbMkr29Y3dODEfAX2LjX7GxUCSd+GfcSyw0+mDg8d4MM/P8WAqDrvvh5GZm5+YXFpfyyyura+uFjc0rEyWa8QaLZKRvfGq4FIo3UKDkN7HmNPQlv/b7Z5l/fce1EZG6xEHM2yG9VSIQjKKVOoWjFvJ7TDVV/WGpFVLs+UF6OtwnB2TiqERKgYPf5gmpdgpFt+yOQf4S75sUa9sPkKHeKYxa3YglIVfIJDWm6bkxtlOqUTDJh/lWYnhMWZ/e8qaliobctNPxh0OyZ5UuCSJtSyEZqz8nUhoaMwh925mdaaa9TPzPayYYHLVToeIEuWKTRUEiCUYki4t0heYM5cASyrSwtxLWo5oytKHmbQje9Mt/yVWl7FXLlQuvWDuGCRZhB3ahBB4cQg3OoQ4NYPAIz/AKb86T8+K8O6NJa875ntmCX3A+vwCRHqRs</latexit>

has 6 columns, so: rank(A) + nullity(A) = 6 .

 Dimension Theorem for Matrices
From Example 5, we obtained rank(A) = 2. Hence,

nullity(A) = n – rank(A)
=6–2
=4
 Dimension Theorem for Matrices
Theorem 4:
If A is an m × n matrix, then
(a) rank(A) = the number of leading variables in the general solution
of Ax = 0.
(b) nullity(A) = the number of parameters in the general solution of
Ax = 0.

Example 7:
(1) Find the number of parameters in the general solution of Ax = 0
if A is a 5 × 7 matrix of rank 3.
(2) Find the rank of a 5 × 7 matrix A for which Ax = 0 has a two-
dimensional solution space.
 Dimension Theorem for Matrices
Solution:
(1) nullity(A) = n – rank(A) = 7 – 3 = 4. Thus, there are 4
parameters.
(2) The matrix A has nullity 2, hence
rank(A) = n – nullity(A) = 7 – 2 = 5.
 Dimension Theorem for Matrices
Theorem 5:
If A is an m × n matrix, then
rank(A) = rank(AT).
rank(A) + nullity(AT ) = m

where m is the number of columns of matrix A.

If rank(A) = r, then:
dim[row(A)] = r dim[col(A)] = r
dim[null(A)] = n − r dim[null(AT )] = m − r
End