Ask your own question, for FREE!
Mathematics 12 Online
OpenStudy (anonymous):

1

ganeshie8 (ganeshie8):

\[\large \textbf{ b}_1 = \left( \begin{array} \\ r\\0\end{array}\right) ; \textbf{ b}_2 = \left( \begin{array} \\ 0\\s\end{array}\right) \]

ganeshie8 (ganeshie8):

One way to figure this out is by noticing that both vectors are pointing in DIFFERENT directions - \(\textbf{b}_1\) has no component along y direction but \(\textbf{b}_2\) has some nonzero component. So they're independent and thus span entire plane

ganeshie8 (ganeshie8):

The standard way is to find the rank of matrix with these vectors - the vectors are independent if you get a full column rank

OpenStudy (anonymous):

@ganeshie8 iy intuitively makes sense but not mathematically....i m stuck with solving it

ganeshie8 (ganeshie8):

\[\large \left[ \begin{array} \\ r&0\\0&s\end{array}\right] \] whats the rank of this matrix ?

OpenStudy (anonymous):

2?

ganeshie8 (ganeshie8):

and you have got 2 column vectors in the matrix - full column rank => column vectors are independent

ganeshie8 (ganeshie8):

independent vectors => they form a basis

OpenStudy (anonymous):

honestly, today is my first day doing linearly independence so it does not make sense to me. Sorry about that

ganeshie8 (ganeshie8):

we say vectors are linearly independent when there is no solution for : \[\large c_1\mathbb{x_1} + c_3\mathbb{x_2} + c_3\mathbb{x_3} + \cdots + c_n\mathbb{x_n} = 0 \]

OpenStudy (anonymous):

i.e. all c's are 0

ganeshie8 (ganeshie8):

it always has a trivial solution when all c's are 0, so the definition excludes this trivial solution

ganeshie8 (ganeshie8):

there should not be any OTHER solution to above ^^

ganeshie8 (ganeshie8):

then only the vectors are independent

ganeshie8 (ganeshie8):

thats the definition of independence, does that make sense ?

OpenStudy (anonymous):

yes it does, thank you but how do you calculate bases, span and stuff like that

ganeshie8 (ganeshie8):

those are just definitions : 1) the given set of vectors "span" a space means : you can can reach every point in the space using linear combinations of the given vectors 2) basis : if the set of vectors "span" the space and if they are independent, they form basis of that space

ganeshie8 (ganeshie8):

consider previous example to get a feeling of these terms

OpenStudy (anonymous):

lemme get another example to make it clear, if you don't mind.

ganeshie8 (ganeshie8):

okie

OpenStudy (anonymous):

b1 = (1,1,-2)^T b2 = (1,-2,1)^T

ganeshie8 (ganeshie8):

and your first goal is to figure out whether they are independent or not, right ?

OpenStudy (anonymous):

agree

ganeshie8 (ganeshie8):

Sticking to the definition, you need to find out wherther there is a nontrivial solution to below : \[\large c_1 \mathbb{b_1} + c_2\mathbb{b_2} = 0\]

ganeshie8 (ganeshie8):

Ofcourse as you said earlier, a trivial solution always exists when all c's are 0 but we are not interested in this, we want to see if there is any OTHER solution

ganeshie8 (ganeshie8):

non-zero solution

OpenStudy (anonymous):

uhhh how do we check that

ganeshie8 (ganeshie8):

\[\large c_1 \mathbb{b_1} + c_2\mathbb{b_2} = 0\] can be expressed as \[\large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = 0\]

ganeshie8 (ganeshie8):

yes ?

OpenStudy (anonymous):

yep

ganeshie8 (ganeshie8):

solve \(c_1\) and \(c_2\)

ganeshie8 (ganeshie8):

below is more accurate representation : \[\large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = \left(\begin{array} \\ 0 \\0 \end{array}\right) \]

OpenStudy (anonymous):

c1=c2=0?

OpenStudy (anonymous):

no c1=c2=1?

ganeshie8 (ganeshie8):

the column vectors will be `independent` if the `only solution` is c1=c2=0

ganeshie8 (ganeshie8):

how c1=c2=1 ? add both the columns, do u get 0 ?

ganeshie8 (ganeshie8):

1+1 = ? 1-2 = ? -2+1 = ?

OpenStudy (anonymous):

2 -1 1

OpenStudy (anonymous):

ya i solved it in a wrong way oops

ganeshie8 (ganeshie8):

and why are you guessing ? you can row reduce the matrix, find out number of pivots and find out the solution right ?

OpenStudy (anonymous):

not guessing, just confused

ganeshie8 (ganeshie8):

\[\large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = \left(\begin{array} \\ 0 \\0 \\0 \end{array}\right)\]

ganeshie8 (ganeshie8):

do you know how to solve above system ?

OpenStudy (anonymous):

c1+c2=0 c1-2c2=0 -2c1+c2=0 right

ganeshie8 (ganeshie8):

yes thats the system, but i want you solve it in matrix form so that we can **see** the relation between "rank" and "independednce"

OpenStudy (anonymous):

oh then I don't, i can solve it linearly not matrox system way

ganeshie8 (ganeshie8):

Ohk, never did gaussian elimination before ?

OpenStudy (anonymous):

dont thin so

ganeshie8 (ganeshie8):

how about row operations ?

OpenStudy (anonymous):

yah i have done that

ganeshie8 (ganeshie8):

echeleon form /triangular form ? heard these before ?

OpenStudy (anonymous):

no lol don't embarass me

ganeshie8 (ganeshie8):

you need to know below stuff before touching basis/span : 1) row operations/gaussian elimination 2) upper triangular form/echeleon form

ganeshie8 (ganeshie8):

the whole linear algebra is about solving linear equations using matrices, you should know how to solve a system in matrix form first

OpenStudy (anonymous):

okay, I guess my teacher will go over it soon

ganeshie8 (ganeshie8):

\[ \large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = \left(\begin{array} \\ 0 \\0 \\0 \end{array}\right) \]

ganeshie8 (ganeshie8):

it should be taught first, basis/independence/subspaces make no sense w/o knowing how to solve above system in matrix form

ganeshie8 (ganeshie8):

\[\large Ax = b\]

ganeshie8 (ganeshie8):

you must know how to find the solution \(\large x\) before starting subspaces

OpenStudy (anonymous):

ya i know that Ax = b

ganeshie8 (ganeshie8):

\[ \large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = \left(\begin{array} \\ 0 \\0 \\0 \end{array}\right) \] is same as \[\large Ax = b\]

ganeshie8 (ganeshie8):

\[ \large A = \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \\~\\\large x = \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) \\~\\\large b = \left(\begin{array} \\ 0 \\0 \\0 \end{array}\right) \]

OpenStudy (anonymous):

ohhhh lol should have told before i know how to do it

ganeshie8 (ganeshie8):

i knw you knw :) ok so tell me how do you go about solving \(Ax = b\) ?

ganeshie8 (ganeshie8):

using elimination ofcourse

OpenStudy (anonymous):

ya wait it will take me a little as i am novice

OpenStudy (anonymous):

c1 + c2 = 0 c1 - 2c2 = 0 -2c2 + c2 =0 1 2 1 -2 -2 1 is it correct or did i mess up?

ganeshie8 (ganeshie8):

\[\large \left[\begin{array}{cc}1&1\\1&-2\\-2&1 \end{array}\right] \left(\begin{array} \\ c_1 \\c_2 \end{array}\right) = \left(\begin{array} \\ 0 \\0 \\0 \end{array}\right)\] the augmented matrix is \[\large \left[\begin{array}{|cc|c}1&1&0\\1&-2&0\\-2&1&0 \end{array}\right] \]

ganeshie8 (ganeshie8):

again, we want to solve it in matrix form using elimination

OpenStudy (anonymous):

oh crap i know i know but forgot need a startup

OpenStudy (anonymous):

my teacher already went over this

ganeshie8 (ganeshie8):

the augmented matrix is \[\large {\begin{align} \\ &\left[\begin{array}{|cc|c}1&1&0\\1&-2&0\\-2&1&0 \end{array}\right] \\ ~\\ R2-R1 ~&\left[\begin{array}{|cc|c}1&1&0\\0&-3&0\\-2&1&0 \end{array}\right] \\ ~\\ R3+2R1 ~&\left[\begin{array}{|cc|c}1&1&0\\0&-3&0\\0 &3&0 \end{array}\right] \\ ~\\ R3+R2 ~&\left[\begin{array}{|cc|c}1&1&0\\0&-3&0\\0 &0&0 \end{array}\right] \end{align}} \]

ganeshie8 (ganeshie8):

so the solution is : -3c2 = 0 c1 + c2 = 0 solving it gives you : c1=c2=0

ganeshie8 (ganeshie8):

thats the only solution ^^ that proves us that the column vectors of \(\large A\) are linearly independent

ganeshie8 (ganeshie8):

In general, for a \(\large m \times n\) matrix : rank = \(\large n\) means the column vectors are linearly independent

ganeshie8 (ganeshie8):

So you don't need to actually solve the system - you can simply find the rank of matrix with given vectors

ganeshie8 (ganeshie8):

rank tells you about independence

OpenStudy (anonymous):

whoooo too much work, i will still need to watch a video how you eliminated stuff as my teacher didnt explan it well.... Thanks a lot Ganesh :)

ganeshie8 (ganeshie8):

row elimination works the same way as elimination method with system of equations : you can add linear combinations of other rows to a row

ganeshie8 (ganeshie8):

i think its too much information for you one shot

OpenStudy (anonymous):

i know haha, but i am in college i gettaa take all info in or ill miss

ganeshie8 (ganeshie8):

atleast i hope you got what "independence" means and how it is realted to "rank" of a matrix

OpenStudy (anonymous):

oh yes i did understand it, and the credit for that goes to you. Thank you

ganeshie8 (ganeshie8):

thats the only important thing, basis and span are just definitions based on independence

ganeshie8 (ganeshie8):

"k" independent vectors can span a "k" dimensional space

ganeshie8 (ganeshie8):

basis is just a "set of independent vectors" with which u can "span" a particular space.

ganeshie8 (ganeshie8):

\[\large \left[\begin{array}{cc} 1&0 \\ 0 & 1 \end{array}\right] \] the column vectors in this matrix form a "basis" for "2" dimensional vector space because : 1) the column vectors are independent 2) the column vectros span the 2 dimensional space

ganeshie8 (ganeshie8):

as you can see they are just definitions based on independent vectors

ganeshie8 (ganeshie8):

can you cook up an example set of vectors that CANNOT be a basis ?

OpenStudy (anonymous):

1 1 1 1

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!