Académique Documents
Professionnel Documents
Culture Documents
P. Maximality
i) S has (P)
and
Let T = {2, 3, 4, 7, 8, 10, 12, 13, 14, 15}. Then a maximal subset of T of consecutive
integers is S = {2, 3, 4}. Other maximal subsets are {7, 8}, {10}, {12, 13, 14, 15}. The
subset {12, 13} is not maximal. Why?
S V is called maximal lin.ind if
i) S is lin.ind
and
GJE: let A = ER, where R = rref(A). Let R(:, i1 ), . . . , R(:, ip ) be the pivotal columns.
Then {vi1 , . . . , vip } is a maximal lin.ind subset of S. !!
P. Dimension
if and only if
ls(S) = V. !!
Let V 6= {0} be a VS and S be a maximal lin.ind subset. We call |S| the (algebraic)
Let V 6= {0} be a VS. Then a maximal lin.ind subset of V is called the (Hamel) basis
subset of S spans V.
Th Let V 6= {0} be a vector space. TFAE:
Hence ls (S {x}) 6= V.
3)1): Since B spans V, for any x V \ B we have B {x} is lin.dep. Assume
P
that B is lin.dep. Then there exists v, v1 , . . . , vk B s.t. v =
i vi . In that case
ls(B \ {v}) = ls(B) = V, means B is not minimal spanning.
Th Let V have dimension n and S V be lin.ind. Then there exists a basis T S.
Po.
As A(i, :) =
Pm
j=1
row(A).
Th rank(A) = dim row(A).
Po.
GJE: R = F A. Nonzero rows of R are lin.ind due to the positions of pivots. Thus
Note: R(:, i1 ), . . . , R(:, ik ) are lin.ind and other columns in R are lin.comb of them.
So A(:, i1 ) . . . , A(:, ik ) are lin.ind (as F is invertible) and other columns in A are lin.comb
of them. So the columns A(:, i1 ) . . . , A(:, ik ) form a basis for col(A).
Th rank(A) = dim row(A) = dim col(A) = rank(At ).
Po.
First two equality follow from earlier result. As col(At ) = row(A), rank(A) =
In GJE we called the pivotal columns basic columns. Notice that they give us a
Yes. Form the matrix Anm (m n) using the vectors in S as columns. Apply
k.
Po.
has k basic columns. Delete the nonbasic ones. Call it B1 . Look at Ckk = B1t . It is a
submatrix of A of rank k. So det C 6= 0.
Take a submatrix Dk+1k+1 of A. Assume det D 6= 0. Then columns of D are lin.ind.
Extend each column of D (replace it with resp column of A). They still remain lin.ind.
But this means rank A > k.
A contradiction.
Cor rank(A) = rank(A ). !!
Consider the VS Fn over F. The basis {e1 , , en } is called the standard basis. Notice
that dim Fn = n.
Let V = R[x]. Then {1, x, x2 , } is a basis. !!
{1, x, x2 , , xn } is a basis for R[x; n]. So dim R[x; n] = n + 1.
Give a basis to show that dim Mm,n (R) is mn. !!
P. Rank-Nullity
Imagine solving Ax = 0 by GJE. Let xi1 , . . . , xik be the free variables. Put xi1 = 1,
1
0
X2
0
1
..
.
Xk
0
0