Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

kevinlui's site

7239 views

Plan

  • 1.3

  • 1.4

1.3

  • Definition: A subset WW of a vector space VV over a field FF is called a subspace of VV if WW is a vector space over FF with the operations of addition and scalar multiplication defined on VV.

  • Problem: Normally, there are 8 properties you need to check. But it turns out you only need to check 4 of them. Which 4? Why?

  • Problem: (Theorem 1.3) Let VV be a vector space and WW and subset of VV. Then WW is a subspace of VV if and only if the following three conditions hold for the operations defined in VV.

    1. 0W0\in W.

    2. x+yWx+y\in W whenever xWx\in W and yWy\in W.

    3. cxWcx\in W whenever cFc\in F and xWx\in W.

  • Problem: Same problem as before, but replace conditions 2 and 3 with

    • cx+yWcx+y\in W whenever, x,yWx,y\in W and cFc\in F.

  • Problem: Give an example of a vector space VV and a subset WW of VV such that, WW is a vector space but WW is not a subspace of VV.

  • Problem: Show that the intersection of 2 subspaces is a subspace.

1.4

  • Definition: Let VV be a vector space and SS a nonempty subset of VV. A vector vVv\in V is called a linear combination of vectors of SS if there exists a finite number of vectors u1,,unu_1,\ldots,u_n in SS and scalars a1,,ana_1,\ldots,a_n in FF such that v=a1u1++anunv=a_1u_1+\cdots+a_nu_n.

  • Problem: We denote the set of all linear combinations of SS by spanS\mathrm{span} S. By convention, we define the span of the empty set to be the trivial subspace {0}\{0\}. Prove that span(S)\mathrm{span}(S) is always a subspace.

  • Problem: Let STS\subseteq T be sets inside of a vector space VV. Prove that span(S)\mathrm{span}(S) is a subspace of span(T)\mathrm{span}(T).

  • Problem: Prove that span(S)\mathrm{span}(S) is a the smallest subspace containing SS. (This gives an alternative definition of span(S)\mathrm{span}(S) that turns out to be quite useful!)