Finite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system

Similar documents
Math "Matrix Approach to Solving Systems" Bibiana Lopez. November Crafton Hills College. (CHC) 6.3 November / 25

Section 1.1: Systems of Linear Equations

Matrices and RRE Form

Linear Algebra I Lecture 8

Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Math 1314 Week #14 Notes

MATH 54 - WORKSHEET 1 MONDAY 6/22

Pre-Calculus I. For example, the system. x y 2 z. may be represented by the augmented matrix

MAC1105-College Algebra. Chapter 5-Systems of Equations & Matrices

Systems of Linear Equations. By: Tri Atmojo Kusmayadi and Mardiyana Mathematics Education Sebelas Maret University

1 - Systems of Linear Equations

Linear Equations in Linear Algebra

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Lecture 1 Systems of Linear Equations and Matrices

PH1105 Lecture Notes on Linear Algebra.

Matrices. Chapter Definitions and Notations

Elementary maths for GMT

1 Last time: linear systems and row operations

Matrix Basic Concepts

System of Linear Equations

Math 360 Linear Algebra Fall Class Notes. a a a a a a. a a a

Section Gauss Elimination for Systems of Linear Equations

Matrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices

Exercise Sketch these lines and find their intersection.

Relationships Between Planes

7.3. Determinants. Introduction. Prerequisites. Learning Outcomes

Section Gaussian Elimination

Math 2331 Linear Algebra

Algebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

is a 3 4 matrix. It has 3 rows and 4 columns. The first row is the horizontal row [ ]

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Recall, we solved the system below in a previous section. Here, we learn another method. x + 4y = 14 5x + 3y = 2

Elementary Linear Algebra

n n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full

Homework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)

DM559 Linear and Integer Programming. Lecture 2 Systems of Linear Equations. Marco Chiarandini

22A-2 SUMMER 2014 LECTURE 5

MAC Module 1 Systems of Linear Equations and Matrices I

Lecture 7: Introduction to linear systems

Homework 1 Due: Wednesday, August 27. x + y + z = 1. x y = 3 x + y + z = c 2 2x + cz = 4

Linear Equations in Linear Algebra

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

Calculus II - Basic Matrix Operations

4 Elementary matrices, continued

Topics. Vectors (column matrices): Vector addition and scalar multiplication The matrix of a linear function y Ax The elements of a matrix A : A ij

REPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW

Matrices and Vectors

LECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS

System of Linear Equations. Slide for MA1203 Business Mathematics II Week 1 & 2

MATH 3511 Lecture 1. Solving Linear Systems 1

Lesson 1: Inverses of Functions Lesson 2: Graphs of Polynomial Functions Lesson 3: 3-Dimensional Space

Section 5.3 Systems of Linear Equations: Determinants

[ Here 21 is the dot product of (3, 1, 2, 5) with (2, 3, 1, 2), and 31 is the dot product of

1 Matrices and matrix algebra

3. Replace any row by the sum of that row and a constant multiple of any other row.

Linear Algebra V = T = ( 4 3 ).

Designing Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Notes on Row Reduction

Chapter 7. Tridiagonal linear systems. Solving tridiagonal systems of equations. and subdiagonal. E.g. a 21 a 22 a A =

Review of Linear Algebra

Matrix Solutions to Linear Equations

Definition. A matrix is a rectangular array of numbers enclosed by brackets (plural: matrices).

Elementary Row Operations on Matrices

Section 9.2: Matrices.. a m1 a m2 a mn

POLI270 - Linear Algebra

Math 210 Lecture Notes: Chapter Matrix Product Inverse Matrix

I&C 6N. Computational Linear Algebra

MATH2210 Notebook 2 Spring 2018

1300 Linear Algebra and Vector Geometry

Phys 201. Matrices and Determinants

x y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0

Lecture 4: Gaussian Elimination and Homogeneous Equations

4-1 Matrices and Data

Section 6.3. Matrices and Systems of Equations

Lectures on Linear Algebra for IT

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Section Gauss Elimination for Systems of Linear Equations

4 Elementary matrices, continued

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

7.5 Operations with Matrices. Copyright Cengage Learning. All rights reserved.

Section 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

MATRICES. a m,1 a m,n A =

Definition of Equality of Matrices. Example 1: Equality of Matrices. Consider the four matrices

CHAPTER 9: Systems of Equations and Matrices

Linear equations in linear algebra

MATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .

Chapter 1 Vector Spaces

Math 54 Homework 3 Solutions 9/

Math 3C Lecture 20. John Douglas Moore

Chapter 1: Systems of Linear Equations

Matrices and Systems of Equations

Chapter 4. Solving Systems of Equations. Chapter 4

Ack: 1. LD Garcia, MTH 199, Sam Houston State University 2. Linear Algebra and Its Applications - Gilbert Strang

Math Studio College Algebra

Transcription:

Finite Math - J-term 07 Lecture Notes - //07 Homework Section 4. - 9, 0, 5, 6, 9, 0,, 4, 6, 0, 50, 5, 54, 55, 56, 6, 65 Section 4. - Systems of Linear Equations in Two Variables Example. Solve the system x y = 4 x + y = 8 Solution. First, let s multiply the first equation by to get rid of the fraction x y = 8 x + y = 8 Now, if we add the two equations together, we get 0 = 0 which is always true. This means that the two equations are the same equation, just one is (maybe) multiplied by a constant. This is a consistent but dependent system of equations. If we let x = k, where k is any real number, then we get that y = k 8. So, for any k, (k, k 8) is a solution. In this case, the variable k is called a parameter. Section 4. - Systems of Linear Equations and Augmented Matrices Matrices. Definition (Matrix). A matrix is a rectangular array of numbers written within brackets. The entries in a matrix are called elements of the matrix. Some examples of matrices are A = 4 5 7 0 B = 4 5 4 0 8 0 9 0 7 9 0

Definition. A matrix is called an m n matrix if it has m rows and n columns. The expression m n is called the size of the matrix. The numbers m and n are called the dimensions of the matrix. If m = n, the matrix is called a square matrix. A matrix with only column is called a column matrix and a matrix with only row is called a row matrix. For example, the matrix A above is a matrix and the matrix B is a 4 4 matrix and so B is a square matrix. When we write an arbitrary matrix we use the double subscript notation, a ij, which is read as a sub i-j, for example, the element a is read as a sub two-three (not as a sub twenty-three ); sometimes we will drop sub and just say a two-three. Here is an example arbitrary m n matrix A = a a a n a a a n...... a m a m a mn The principal diagonal (or main diagonal) of a matrix is the diagonal formed by the elements a, a, a,... This diagonal always starts in the upper left corner, but it doesn t have to end in the bottom right. In the next examples, the principal diagonal is red. A = 4 5 7 0 B = 4 5 4 0 8 0 9 0 7 9 0 C = π 0 7 6 Augmented Matrices. In this section, we will stick with systems of equations. Given a system of equations a x + a x = k a x + a x = k we have two matrices that we can associate to it, the coefficient matrix a a and the constant matrix a a k. k We can also put these two matrices together and form an augmented matrix associated to the system a a k a a k

(the dashed line separates the coefficient matrix from the constant matrix). Example. Find the augmented matrix associated to the system x + 4y = x y = 7 Solution. 4 7 Notation. We will number the rows of a matrix from top to bottom and the columns of a matrix from left to right. When referring to the i th row of a matrix we write R i (for example R refers to the second row) and we use C j to refer to the j th column. Definition (Row Equivalent). We say that two augmented matrices are row equivalent if they are augmented matrices of equivalent linear systems. We write a between two augmented matrices which are row equivalent. This definition immediately leads to the following theorem Theorem. An augmented matrix is transformed into a row-equivalent matrix by performing any of the row operations: (a) Two rows are interchanged (R i R j ). (b) A row is multiplied by a nonzero constant (kr i R i ). (c) A constant multiple of one row is added to another row (kr j + R i R i ). The arrow is used to mean replaces. Solving Linear Systems Using Augmented Matrices. When solving linear systems using augmented matrices, the goal is to use row operations as needed to get a for every entry on the principal diagonal and zeros everywhere else on the left side of the augmented matrix. That is, the goal is to turn in into an augmented matrix of the form 0 m 0 n which corresponds to the system x = m y = n thus telling us that x = m and y = n.

4 Example. Solve the following system using an augmented matrix x + 4y = x y = 7 Solution. The augmented matrix for this system is 4 7 If we subtract times the second row from the first, we can get a zero in the top left: 4 7 R R R 0 0 0 7 Then we can make the second entry in the first row a by dividing the first row by 0: 0 0 0 R 0 R 0 7 7 Since that is in the second column, we actually want it in the second row, so switch the rows: 0 R R 7 7 0 Finally, we can get rid of the in the first row by adding times the second row to the first: 7 R +R R 0 0 0 So, this tells us that x = and y =. We can be a little more economical with how we write the solutions as well Example 4. Solve the system using an augmented matrix x x = 6 x + 4x =

Solution. Begin by writing the augmented matrix, then just write the equivalences at every step 6 R R 4 4 R +R R 0 7 7 So x = and x =. 7 R R R +R R 0 0 0 Example 5. Solve the system using an augmented matrix x y = 4 6x + y = Solution. Begin by writing the augmented matrix, then just write the equivalences at every step 4 R R 6 6 6R +R R 0 0 0 The bottom row contains all zeros. This means that the system is dependent and there are infinitely many solutions. Looking at the remaining equation x y = 5 we can solve for x and get x = y +. Setting y = t for a parameter t, we get x = t + and so the solutions to this problem are points ( t +, t ) for any real number t. Example 6. Solve the system using an augmented matrix x x = 7 x + x = 4

6 Solution. x =, x = Example 7. Solve the system using an augmented matrix 5x y = x + y = 5 Solution. x =, y = Example 8. Solve the system using an augmented matrix x + 6x = 6 x 9x = 9 Solution. For a parameter t, a solution is x = t, x = t. Example 9. Solve the system using an augmented matrix Solution. No solution x x = 6 4x x = Example 0. Solve the system using an augmented matrix Solution. x =, y = x + y = 4x y = 7 Remark. We mentioned above that the final form an augmented matrix with exactly one solution should look like 0 m 0 n If the system has infinitely many solutions, it takes the form m n 0 0 0 and if it has no solution, it takes the form m n 0 0 p where p 0.