Answer to Question #205404 in Linear Algebra for sabelo Zwelakhe Xu

Question #205404

show that any g€l(v, c) and u€v with g(u) not equal to 0 v=null g i{£u:£€c


1
Expert's answer
2021-10-07T14:08:28-0400

To show that V = null g ⊕ {λ\lambdau | λ\lambda ∈ C}, we need to show that V = null g + {λ\lambdau | λ\lambda ∈ C} and that null g ∩ {λ\lambdau | λ\lambda ∈ C} = {0}.

First we show that V = null g + {λ\lambdau | λ\lambda ∈ C}. Let vVv\isin V. We need to find nnull gn\isin null\ g and

ww\isin {λ\lambdau | λ\lambda ∈ C} for which v=n+w.  Suppose g(v)=λCg(v)=\lambda\isin C, and that g(u)=μCg(u)=\mu\isin C. We know that μ0\mu \neq 0 because u is not in null g. Thus, μ\mu has an inverse in C. Let α=λμ1C\alpha=\lambda \mu^{-1}\isin C. Note that this means α\alpha times μ\mu gives back λ\lambda . So,

g(αu)=αg(u)=αμ=λg(\alpha u)=\alpha g(u)=\alpha\mu=\lambda

Thus, g(αu)=g(v)g(\alpha u)=g(v). Let n=vαun=v-\alpha u. Then g(n)=g(v)g(αu)=0g(n)=g(v)-g(\alpha u)=0. Therefore, n ∈ null g. Set w = α\alphau. Then ww\isin {λ\lambdau | λ\lambda ∈ C}, and v = n + w. So we can write v as the sum of elements of null g and {λ\lambdau | λ\lambda ∈ C}. Therefore, V = null g + {λ\lambdau | λ\lambda ∈ C}.

Next we show that null g ∩ {λ\lambdau | λ\lambda ∈ C} = {0}.  Suppose vv\isin null g ∩ {λ\lambdau | λ\lambda ∈ C}. Then

vv\isin {λ\lambdau | λ\lambda ∈ C}, so v=λuv=\lambda u for some λC\lambda\isin C.

Since v ∈ null g, g(v) = 0. So g(λ\lambdau) = 0. But g(λ\lambdau) = λ\lambdag(u). Since λ\lambdag(u) = 0, either λ\lambda = 0 or g(u) = 0. But u is not in null g, so g(u) \neq 0. This means λ\lambda must equal 0. So v = λ\lambdau implies that v = 0. Therefore, null g ∩ {λ\lambdau | λ\lambda ∈ C} = {0}. Since V = null g + {λ\lambdau | λ\lambda ∈ C} and that

null g ∩ {λ\lambdau | λ\lambda ∈ C} = {0}, we have that V = null g ⊕ {λ\lambdau | λ\lambda ∈ C}.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment