Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
Download

kevinlui's site

7239 views

October 9

Announcements

  • Section 2.1, 2.2 due this Thursday

  • Section 2.3, 3.1 due next Thursday

  • Midterm next Wednesday in class

    • 1.1 - 3.1 (maybe 3.2)

  • Worksheet 1 solutions has been posted

  • Worksheet 2 has been posted, due this Friday

  • Wednesday office hours to be held in classroom?

Homogenous Systems

Let AA be a matrix. Then A(x+y)=Ax+AxA(x+y)=Ax+Ax and A(xy)=AxAyA(x-y)=Ax-Ay.

Example: Find a general solution for the linear system ParseError: KaTeX parse error: {align} can be used only in display mode. Using row reduction, we see that a general solution is of the form x=(1,0,5,0)+s1(3,1,0,0)+s2(2,0,4,1)x=(1,0,-5,0)+s_1(3,1,0,0)+s_2(-2,0,4,1).

The solution to the homogenous system is x=s1(3,1,0,0)+s2(2,0,4,1)x=s_1(3,1,0,0)+s_2(-2,0,4,1).

Let xpx_p be a particular solution Ax=bAx=b. Then solutions have the form xg=xp+xhx_g=x_p+x_h, where xpx_p is a particular solution and xhx_h is the general solution to the homogenous equations.

Linear Indepedence and Span

Theorem: Let A=[ai]A=[a_i] and bb be a vector in Rn\mathbb{R}^n. Then the following are equivalent (if one is true then they are all true, if one is false then they are all false).

  • The set {a1,,am}\{a_1,\ldots,a_m\} are linearly independent.

  • The vector equation x1a1+x2a2++xmam=bx_1a_1+x_2a_2+\ldots+x_ma_m=b has at most one solution.

  • The linear system [a1  a2    amb][a_1\;a_2\;\ldots\;a_m | b] has at most one solution.

  • The equation Ax=bAx=b has at most 1 solution.

Example: Consider the vectors a1=(1,7,2)a_1=(1,7,-2), a2=(3,0,1)a_2=(3,0,1), and a3=(5,2,6)a_3=(5,2,6). Set A=[ai]A=[a_i]. Show that the columns of AA are linearly independent and that Ax=bAx=b has a unique solution for every bb in R3\mathbb{R}^3.

Example: Let u1=(1,1,2),u2=(2,1,2),u3=(2,5,10),u4=(3,4,8)u_1=(1,-1,2), u_2=(2,-1,2), u_3=(-2,5,-10), u_4=(3,-4,8). The associated matrix has reduced echelon form: [122301310000] \begin{bmatrix} 1 & 2 & -2 & 3 \\ 0 & 1 & 3 & -1 \\ 0 & 0 & 0 & 0 \end{bmatrix} Is {u1,,u4}\{u_1,\ldots,u_4\} linearly independent? Can we write u1u_1 as a linear combination of u2,,u4u_2,\ldots,u_4?

If a set of vectors is not linearly indepedent, can every vector be written as a linear combination of the other vectors? In other words, is every vector in the span of the other vectors?

Section 3.1 Linear Transformations

We can write linear equations as Ax=bAx=b. We can think of it as AA sending xx to bb.

Definition: A function T:RmRnT:\mathbb{R}^m \to \mathbb{R}^n is a linear transformation if for all vectors u,vRmu,v\in \mathbb{R}^m and all scalars rr, we have

  • T(u+v) = T(u) + T(v)

  • T(ru) = rT(u).

Examples:

  • What are some examples of functions that aren't linear transforms? quadratic, ax+b

  • Consider the function given by T(x1,x2)=(3x1x2,2x1+5x2)T(x_1, x_2) = (3x_1-x_2, 2x_1+5x_2). What is T(1,2)T(1,2)? Show that this is a linear transformation. Is it associated to a matrix?

  • Projections are linear transforms.

  • Let AA be some matrix. Then T(x)=AxT(x)=Ax is a linear transform. Make up some example in class.

A matrix, AA, is said to be an n×mn\times m matrix if it has nn rows and mm columns. If m=nm=n, then AA is a sqaure matrix.

Theorem: Let AA be an n×mn\times m matrix, and define T(x)=AxT(x)=Ax. Then T:RmRnT:\mathbb{R}^m \to \mathbb{R}^n is a linear transform. Moreover, all linear transform are of this form.

Example: Consider the linear transform with matrix A=[124305]. A= \begin{bmatrix} 1 & -2 & 4 \\ 3 & 0 & 5 \end{bmatrix}. Is (3,4)(3,4) in the range of AA?

Theorem: Let A=[a1  a2    amA=[a_1\; a_2\; \ldots\; a_m be a n×mn\times m matrix, and let T:RmRnT:\mathbb{R}^m\to\mathbb{R}^n with T(x)=AxT(x) = Ax be a linear transformation. Then

  • A vector ww is in the range of TT if and only if Ax=wAx=w is a consistent linear system.

  • The range of TT is the span of the columns (this is also called the column space).

If time, talk about 1-1 and onto