MA 106 Linear Algebra: Introduction

U. K. Anandavardhanan IIT Bombay

January 07, 2013

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Welcome!
Welcome aboard MA 106!

Well cover Linear Algebra in the next six weeks or so. Please refer to the information booklet for all the details regarding the ight. We expect a smooth journey, however keep your seatbelts fastened throughout, and not just when the fasten-the-seatbelt sign is illuminated (Feb 06 & Feb 18). This is a non-bunking ight; attendance in the lectures and tutorials is absolutely compulsory. In case you need any further assistance, please get in touch with me or one of your course associates; we are here to help you.
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

Linear Maps
MA 106 is the study of vector spaces and the right maps between them. For now, keep Rn as an example of a vector space. Essentially it means: you can add two vectors, and what you get is a vector; you can multiply a vector by a scalar, and what you get is a vector. What are the right maps between vector spaces? These should respect both addition and scalar multiplication; i.e., T (v + w ) = T (v ) + T (w ), T (c v ) = c T (v ). T : R R given by is not linear (why?); T (x) = cx, for a constant c, is linear (why?).
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

T (x) = x 2

Linear Maps
What are the linear maps from R2 to R? If T : R2 R is linear, then, T ((x, y )) = T (x (1, 0) + y (0, 1)) = x T ((1, 0)) + y T ((0, 1)) = ax + by , where a = T ((1, 0)) and b = T ((0, 1)). Note that this map is indeed linear. Thus, any linear map from R2 to R is necessarily of the form T ((x, y )) = ax + by , for some a, b R.

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Linear Maps

What about linear maps from R2 to R3 ? Such a T takes a pair (x, y ) to a triple. How do you want to denote this triple? (T1 (x, y ), T2 (x, y ), T3 (x, y )), where T1 , T2 , T3 are maps from R2 to R. Are these linear maps? Yes (why?). But the Ti s are given by Ti ((x, y )) = ai x + bi y , for some ai , bi R. Is there a better way of writing? Yes, a totally awesome way!

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Linear Maps
Write the row vector (x, y ) as the column vector x y ,

and write the row vector (T1 (x, y ), T2 (x, y ), T3 (x, y )) as the column vector T1 (x, y ) T2 (x, y ) , T3 (x, y ) and ask the question: what takes a1 x + b1 y x a2 x + b2 y ? y a3 x + b3 y

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Linear Maps

Answer: a1 b1 a2 b2 a3 b3 x y a1 x + b1 y = a2 x + b2 y . a3 x + b3 y

Remark: We prefer to multiply a vector by a matrix on the left. This is just our convention. If you want to multiply on the right, the matrix form would be x y a1 a2 a3 b1 b2 b3 = a1 x + b1 y a2 x + b2 y a3 x + b3 y .

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Linear Maps
Thus, a linear transformation T : Rn Rm can be represented by an m n matrix, and conversely, an m n matrix does give rise to a linear transformation T : Rn Rm . Remark: The above representation does depend on the fact that weve expanded a pair along {(1, 0), (0, 1)} on the left and a triple along {(1, 0, 0), (0, 1, 0), (0, 0, 1)} on the right. An important question to keep in mind: whats so special about these choices of vectors? Well return to this theme in a major way.
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

Matrices
How do you usually denote the entries of an m n matrix? The aadhaar of an entry is its row and column information; the entry at row i, column j is denoted by aij . Recall: 1 matrix addition: (a ) ij mn + (bij )mn = (aij + bij )mn . 2 scalar multiplication: c (a ) ij mn = (caij )mn .
p
3

matrix multiplication: (aij )mp (bij )pn = (

k=1

aik bkj )mn .

transpose: t (aij )mn = (bji )nm , where bji = aij . Recall:  additive identity ( ), additive inverse ( ), associativity of + ( ), commutativity of + ( )  mult. identity ( ), mult. inverse (?), associativity of ( ), commutativity of ()  distributive property ( )
4 U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

Matrices
Remark: Multiplicative inverse is dened only for a square matrix, and this need not exist. For instance, a b c d 1 1 1 1 = 1 0 0 1

for any choice of a, b, c, d R. However, if it exists, it is unique. Indeed, if AB = BA = I and AC = CA = I , then B = B I = B(AC ) = (BA)C = I C = C . Remark: Well prove later that AB = I automatically implies BA = I . Exercise: Prove that t (AB) = t B t A and t (A1 ) = (t A)1 .

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

the math course

When you try to model the real world, the modeling functions that we get may be quite complicated; the shape they dene may be intricate - a curve may be curved very funnily! Assume they are at least dierentiable as in MA 105. Do we understand the behaviour of such a function, a curve, a surface? MA 105 told you that you could understand the local behaviour around a given point fairly easily. A curve (or a surface) may be dicult, but at a point, the tangent line (or the tangent plane) tells us a lot about the behaviour of the curve (or the surface) at that point. If a dierentiable f : U Rn Rm is given, at a point a U, the total derivative Df (a) contains all the local information; i.e., information around a small neighbourhood of a. But what is Df (a)? fi , Df (a) = xj mn a linear transformation from Rn to Rm .
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

The punch line is . . .

locally, MA 105 is just MA 106! Youll see in the next half-sem that MA 108 rests on MA 106 as well.

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

Paging for passengers . . .

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

120010047 120070001 120010014 12D070038 120010040 12D070063 12D070008 12D070036 120070005 12D070055 120010010 120070026 120070003 12D070051 12D070012 120070036 12D070021 12D070023 12D070029 12D070026

VALLABHANENI JYOTHI SRIRAM SUVIGYA S CHANDRA HATKAR SHANTANU SUBHASH LAKSHAY KUMAR AMAN VERMA JAGRITI SINGH PAI SAGUN GURUDAS KRATI SETHI SANKAGIRI SURYANARAYANA SRINIVAS BEHERA DARSH JAIDIP SHAH SITU KUMAR GUPTA RIDDHISH BHALODIA ASHISH GOYAL ADITYA NAMBIAR BAVISETTY VENKATA SAI NARAYANA PASAD ANKITA JITESH PATIL ASHLESHA HARSHADIP NIKLESH LALWANI ABHISHEK VISHWA

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

Let A, B, C , D, E be 5 webpages. Lets track the links and form the array: A B C D E A 0 1/2 1/2 1/4 0 B 1/3 0 1/2 1/4 0 C 0 0 0 1/4 1 D 1/3 1/2 0 0 0 E 1/3 0 0 1/4 0

1.25 1.08 1.25 0.83 0.58

If every webpage had the same weight, the ranking is A = C > B > D > E.

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

But in real life, you value a link more if it is from a more prestigious webpage. Thus, a link from a more prestigious page should have more of a weight in the rank computation. But then, how to determine which one is a more prestigious page? Let x1 , x2 , x3 , x4 , x5 be the weights of A, B, C , D, E . A B C D E A 0 1/2 1/2 1/4 0 B 1/3 0 1/2 1/4 0 C 0 0 0 1/4 1 D 1/3 1/2 0 0 0 E 1/3 0 0 1/4 0 1.25 1.08 1.25 0.83 0.58
1 2 x2 1 3 x1 1 1 + 2 x3 + 4 x4 1 1 + 2 x3 + 4 x4 1 4 x4 + x5 1 1 3 x1 + 2 x2 1 1 3 x1 + 4 x4

If we know the weights, we know the weighted ranking! But we dont know the weights! Any ideas?
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

Declare the weighted points that a page gets as its weight! We get: 1 x2 + 2 1 x1 + 3 1 1 x3 + x4 2 4 1 1 x3 + x4 2 4 1 x4 + x5 4 1 1 x1 + x2 3 2 1 1 x1 + x4 3 4 = x1 = x2 = x3 = x4 = x5

Questions to ask: Does this system have a solution (non-trivial)? If Yes, is it unique (up to scalars)? (Why should we ask these questions?)
U. K. Anandavardhanan IIT Bombay MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

In other words, is there a unique to 0 1/2 1/2 1/4 1/3 0 1/2 1/4 0 0 0 1/4 1/3 1/2 0 0 1/3 0 0 1/4

(up to scalars) non-trivial solution x1 x1 0 0 x2 x2 1 x3 = x3 ? 0 x4 x4 x5 x5 0

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

And MA 106 makes you rich!

A unique solution is guaranteed by results from MA 106 provided you perturb the system a little bit using a damping factor. If we follow Googles algorithm, we get: A B C D E A 0 1/2 1/2 1/4 0 B 1/3 0 1/2 1/4 0 C 0 0 0 1/4 1 D 1/3 1/2 0 0 0 E 1/3 0 0 1/4 0

1.25 1.08 1.25 0.83 0.58

1.2395766185 1.1163137447 0.9597953736 0.9756351179 0.7086791453

Notice how C slips from 1st to 4th; indeed the full 1 point that C gets from E does not count much because E doesnt carry much weight!

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction

From tomorrow onwards . . .

. . . well systematically start attacking the question of solving systems of linear equations. Keep the seatbelts fastened, and sit back, relax, and enjoy the ight!

U. K. Anandavardhanan IIT Bombay

MA 106 Linear Algebra: Introduction