Type a command or search the notes. Tab cycles completions. Up and down recall history when blank. Escape dismisses, then leaves the prompt.
MATH
[1251]

Proofs from Linear independence

All proofs from Linear independence.

Back to Linear independence

If the coefficients in the displayed representation of vv are unique, suppose a non-zero relation

c1u1+⋯+cnun=0c_1u_1+\cdots+c_nu_n=0

exists. Then

v=(λ1+c1)u1+⋯+(λn+cn)unv=(\lambda_1+c_1)u_1+\cdots+(\lambda_n+c_n)u_n

is another representation of vv. Since some cj≠0c_j\neq0, the two representations are different, a contradiction. Thus the set is linearly independent. Conversely, suppose

v=λ1u1+⋯+λnun=α1u1+⋯+αnun.v=\lambda_1u_1+\cdots+\lambda_nu_n =\alpha_1u_1+\cdots+\alpha_nu_n.

Subtracting gives

(λ1−α1)u1+⋯+(λn−αn)un=0.(\lambda_1-\alpha_1)u_1+\cdots+(\lambda_n-\alpha_n)u_n=0.

Independence forces λj−αj=0\lambda_j-\alpha_j=0 for every jj, so the two representations are the same.

Write S={u1,…,un}S=\{u_1,\ldots,u_n\}. Suppose

λ1u1+⋯+λnun+μv=0.\lambda_1u_1+\cdots+\lambda_nu_n+\mu v=0.

If μ≠0\mu\neq0, then vv is a linear combination of the vectors in SS, contradicting v∉span⁡(S)v\notin\operatorname{span}(S). Hence μ=0\mu=0 and the independence of SS forces λ1=⋯=λn=0\lambda_1=\cdots=\lambda_n=0. Therefore S∪{v}S\cup\{v\} is linearly independent.