# Chapter 4: Binary Operations and Relations

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 c Dr Oksana Shatalov, Fall Chapter 4: Binary Operations and Relations 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition, subtraction, multiplication are binary operations on Z. Addition is a binary operation on Q because Division is NOT a binary operation on Z because Division is a binary operation on Classification of binary operations by their properties Associative and Commutative Laws DEFINITION 2. A binary operation on A is associative if a, b, c A, (a b) c = a (b c). A binary operation on A is commutative if Identities a, b A, a b = b a. DEFINITION 3. If is a binary operation on A, an element e A is an identity element of A w.r.t if a A, a e = e a = a. EXAMPLE 4. 1 is an identity element for Z, Q and R w.r.t. multiplication. 0 is an identity element for Z, Q and R w.r.t. addition.

2 c Dr Oksana Shatalov, Fall Inverses DEFINITION 5. Let be a binary operation on A with identity e, and let a A. We say that a is invertible w.r.t. if there exists b A such that a b = b a = e. If f exists, we say that b is an inverse of a w.r.t. and write b = a 1. Note, inverses may or may not exist. EXAMPLE 6. Every x Z has inverse w.r.t. addition because x Z, x + ( x) = ( x) + x = 0. However, very few elements in Z have multiplicative inverses. Namely, EXAMPLE 7. Let be a binary operation on Z defined by (a) Prove that the operation is binary. a, b Z, a b = a + 3b 1. (b) Determine whether the operation is associative and/or commutative. Prove your answers. (c) Determine whether the operation has identities. (d) Discuss inverses.

3 c Dr Oksana Shatalov, Fall EXAMPLE 8. Let be a binary operation on the power set P (A) defined by (a) Prove that the operation is binary. X, Y P (A), X Y = X Y. (b) Determine whether the operation is associative and/or commutative. Prove your answers. (c) Determine whether the operation has identities. (d) Discuss inverses. EXAMPLE 9. Let be a binary operation on F (A) defined by (a) Prove that the operation is binary. f, g F (A), f g = f g. (b) Determine whether the operation is associative and/or commutative. Prove your answers.

4 c Dr Oksana Shatalov, Fall (c) Determine whether the operation has identities. (d) Discuss inverses. EXAMPLE Let be a binary operation on the set M 2 (R) of all 2 2 matrices defined by (a) Prove that the operation is binary. A 1, A 2 M 2 (R), A 1 A 2 = A 1 + A 2. (b) Determine whether the operation is associative and/or commutative. Prove your answers. 1 se Appendix at the end of the Chapter.

5 c Dr Oksana Shatalov, Fall (c) Determine whether the operation has identities. (d) Discuss inverses. EXAMPLE 11. Let be a binary operation on the set M 2 (R) of all 2 2 matrices defined by (a) Prove that the operation is binary. A 1, A 2 M 2 (R), A 1 A 2 = A 1 A 2. (b) Determine whether the operation is associative and/or commutative. Prove your answers.

6 c Dr Oksana Shatalov, Fall (c) Show that the matrix I = ( ) is an identity element w.r.t.. (d) Discuss inverses (Use the following FACT: A matrix is invertible if and only if its derminant does not equal to zero ). PROPOSITION 12. Let be a binary operation on a nonempty set A. If e is an identity element on A then e is unique. Proof. PROPOSITION 13. Let be an associative binary operation on a nonempty set A with the identity e, and if a A has an inverse element w.r.t., then this inverse element is unique. Proof. See Exercise 12.

7 c Dr Oksana Shatalov, Fall Closure DEFINITION 14. Let be a binary operation on a nonempty set A, and suppose that X A. If is also a binary operation on X then we say that X is closed in A under. EXAMPLE 15. Determine whether the following subsets of Z are closed in Z under addition and multiplication. (a) Z + (b) E (c) O EXAMPLE 16. Determine whether the following subsets of M 2 (R) is closed in M 2 (R) under matrix addition and multiplication: {( ) } a b S = M c d 2 (R) a = d.

8 c Dr Oksana Shatalov, Fall : Equivalence Relations DEFINITION 17. A relation R on a set A is a subset of A A. If (a, b) R, we write arb. EXAMPLE 18. On the set R one can define arb by a < b. Then, for example, EXAMPLE 19. On the power set P (Z) one can define R by ARB if A = B. Properties of Relations DEFINITION 20. Let R be a relation on a set A. We say: 1. R is reflexive if ara, a A. 2. R is symmetric if a, b A, if arb then bra. 3. R is transitive if a, b, c A, if arb and brc, then arc. 4. R is antisymmetric if a, b A, if arb and bra, ten a = b.. DEFINITION 21. A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. EXAMPLE 22. Let R be the relation on Z defined by arb if a b. Determine whether it is reflexive, symmetric, transitive, or antisymmetric.

9 c Dr Oksana Shatalov, Fall EXAMPLE 23. Let R be the relation on R defined by arb if a b 1 (that is a is related to b if the distance between a and b is at most 1.) Determine whether it is reflexive, symmetric, transitive, or antisymmetric. EXAMPLE 24. Let R be the relation on Z defined by arb if a + 3b E. Show that R is an equivalence relation. REMARK 25. When R is an equivalence relation, it is common to write a b instead of arb, read a is equivalent to b.

10 c Dr Oksana Shatalov, Fall EXAMPLE 26. Let n Z +. Define arb on Z by n a b. (In particular, if n = 2 the arb means a b is ). Show that R is an equivalence relation. REMARK 27. The above relation is called congruence mod n, and usually written a b (mod n)

11 c Dr Oksana Shatalov, Fall Equivalence Classes DEFINITION 28. If R is an equivalence relation on a set A, and a A, then the set [a] = {x A x a} is called the equivalence class of a. Elements of the same class are said to be equivalent. EXAMPLE 29. Define arb on Z by 2 a b. (In other words, R is the relation of congruence mod 2 on Z.) (a) What integers are in the equivalence class of 6? (b) What integers are in the equivalence class of 25? (c) How many distinct equivalence classes there? What are they? EXAMPLE 30. Define arb on Z by n a b. (In other words, R is the relation of congruence mod n on Z.) (a) How many distinct equivalence classes there? What are they?

12 c Dr Oksana Shatalov, Fall (b) Show that the set of these equivalence classes forms a partition of Z. THEOREM 31. If R is an equivalence relation on a nonempty set A, then the set of equivalence classes on R forms a partition on A. Proof. So, any equivalence relation on a set A leads to a partition of A. In addition, any partition of A gives rise to an equivalence relation on A.

13 c Dr Oksana Shatalov, Fall THEOREM 32. Let R be a partition of a nonempty set A. Define a relation R 1 on A by ar 1 b if a and b are in the same element of the partition R. Then R 1 is an equivalence relation on A. Proof. Conclusion: Theorems 31 and 32 imply that there is a bijection between the set of all equivalence relations of A and the set of all partitions on A. EXAMPLE 33. Let R be the relation on Z defined by arb if a + 3b E. By one of the above examples, R is an equivalence relation. Determine all equivalence classes for R.

14 c Dr Oksana Shatalov, Fall Partial and linear ordering Recall that arb defined by a b, a, b R, is not an equivalence relation. Why? DEFINITION 34. A relation R on a set A is called a partial ordering on A if R is reflexive, transitive and antisymmetric. If A is a set and there exists a partial ordering on A, then we say that A is a partially ordered set. EXAMPLE 35. For all X, Y P (A) define R by X Y. Then R is a partial ordering of P (A). DEFINITION 36. Let A be a set and R be a partial ordering on A. We say that R is a linear ordering on A if for all a, b A either arb, or bra. EXAMPLE 37. is a linear ordering of R EXAMPLE 38. Discuss when the relation from Example 35 is a linear ordering.

15 c Dr Oksana Shatalov, Fall EXAMPLE 39. (cf. Example 17(c).) Let R be a relation on a set A. If R is both symmetric and antisymmetric, does it follow that R is reflexive?

16 c Dr Oksana Shatalov, Fall Appendix: Matrices and Matrix Multiplication 1. An m n (this is often called the size or dimension of the matrix) matrix is a table with m rows and n columns and the entry in the i-th row and j-th column is denoted by a ij : a 11 a a 1n a 21 a a 2n.... a m1 a m2... a mn 2. A matrix is usually denoted by a capital letter and its elements by small letters : a ij = entry in the ith row and jth column of A. 3. Two matrices are said to be equal if they are the same size and each corresponding entry is equal. 4. Special Matrices: A square matrix is any matrix whose size (or dimension) is n n (i.e. it has the same number of rows as columns.) In a square matrix the diagonal that starts in the upper left and ends in the lower right is often called the main diagonal. The zero matrix is a matrix all of whose entries are zeroes. The identity matrix is a square n n matrix, denoted I n, whose main diagonal consists of all 1 s and all the other elements are zero: I n = The diagonal matrix is a square n n matrix of the following form λ λ λ n Column matrix (=column vector) and the row matrix (=row vector) are those matrices that consist of a single column or a single row respectively: x 1 x 2 X =., Y = ( y 1 y 2... ) y n x n Note that an n-dimensional column vector is an n 1 matrix, and an n-dimensional row vector is an 1 n matrix. Transpose of a Matrix: If A is an m n matrix with entries a ij, then A T is the n m matrix with entries a ji. A T is obtained by interchanging rows and columns of A.

17 c Dr Oksana Shatalov, Fall Matrix Arithmetic The sum or difference of two matrices of the same size is a new matrix of identical size whose entries are the sum or difference of the corresponding entries from the original two matrices. Note that we cant add or subtract entries with different sizes. The scalar multiplication multiplied by that constant. If A, B, and C are matrices of the same size, then (a) A + B = B + A (Commutative Law) (b) (A + B) + C = A + (B + C) (Associative Law) by a constant gives a new matrix whose entries have all been Matrix multiplication: If Y is a row matrix of size 1 n and X is a column matrix of size n 1 (see above), then the matrix product of Y and X is defined by x 1 Y X = ( y 1 y 2 y 3 ) x 2 y n x 3 = y 1 x 1 + y 2 x 2 + y 3 x y n x n. x n If A is an m p matrix and matrix B is p n, then the product AB is an m n matrix, and its element in the ith row and jth column is the product of the ith row of A and the jth column of B. RULE for multiplying matrices: The column of the 1st matrix must be the same size as the row of the 2nd matrix. 6. Example. (a) Given Compute A 2B A = 3 4, B = (b) Let A = ( ) and B = ( ). Find BA T.

18 c Dr Oksana Shatalov, Fall (c) Example. Given 1 2 A = 3 4, B = 1 2 Compute AB and BA when it is possible. ( ) (d) Compute FACTS and LAWS FOR MATRIX MULTIPLICATION: If the size requirements are met for matrices A, B and C, then AB BA (NOT always Commutative) 2 A(B + C) = AB + AC (always Distributive) (AB)C = A(BC) (always Associative) AB = 0 does not imply that A = 0 or B = 0. AB = AC does not imply that B = C. I n A = AI n = A for any square matrix A of size n. Determinant 8. Determinant of a matrix is a function that takes a square matrix and converts it into a number. 9. Determinant of 2 2 matrix: a c b d = ad bc 10. Matrix Inverse. Let A be a square matrix of size n. A square matrix, A 1, of size n, such that AA 1 = I n (or, equivalently, A 1 A = I n ) is called an inverse matrix. ( ) 11. A 1 a11 a in the case n = 2: If A = 12 then a 21 a 22 A 1 = 1 ( ) a22 a 12 deta a 21 a FACT: A 1 exists if and only if det A 0. 2 Since the multiplication of matrices is NOT commutative, you MUST multiply left to right.

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

### Lecture 2 Matrix Operations

Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

### B such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix

Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.

### 2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

### 2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### 1 Introduction to Matrices

1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Helpsheet. Giblin Eunson Library MATRIX ALGEBRA. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:

Helpsheet Giblin Eunson Library ATRIX ALGEBRA Use this sheet to help you: Understand the basic concepts and definitions of matrix algebra Express a set of linear equations in matrix notation Evaluate determinants

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices. A Biswas, IT, BESU SHIBPUR

Mathematics of Cryptography Modular Arithmetic, Congruence, and Matrices A Biswas, IT, BESU SHIBPUR McGraw-Hill The McGraw-Hill Companies, Inc., 2000 Set of Integers The set of integers, denoted by Z,

### Math 312 Homework 1 Solutions

Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please

### Matrix Algebra and Applications

Matrix Algebra and Applications Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 1 / 49 EC2040 Topic 2 - Matrices and Matrix Algebra Reading 1 Chapters

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

### Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### 8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

### Matrices, Determinants and Linear Systems

September 21, 2014 Matrices A matrix A m n is an array of numbers in rows and columns a 11 a 12 a 1n r 1 a 21 a 22 a 2n r 2....... a m1 a m2 a mn r m c 1 c 2 c n We say that the dimension of A is m n (we

### EC9A0: Pre-sessional Advanced Mathematics Course

University of Warwick, EC9A0: Pre-sessional Advanced Mathematics Course Peter J. Hammond & Pablo F. Beker 1 of 55 EC9A0: Pre-sessional Advanced Mathematics Course Slides 1: Matrix Algebra Peter J. Hammond

### Matrices Worksheet. Adding the results together, using the matrices, gives

Matrices Worksheet This worksheet is designed to help you increase your confidence in handling MATRICES. This worksheet contains both theory and exercises which cover. Introduction. Order, Addition and

### Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6

Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a

### NOTES on LINEAR ALGEBRA 1

School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura

### Orthogonal Diagonalization of Symmetric Matrices

MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

### 4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows

### The Inverse of a Matrix

The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### Introduction to Matrix Algebra I

Appendix A Introduction to Matrix Algebra I Today we will begin the course with a discussion of matrix algebra. Why are we studying this? We will use matrix algebra to derive the linear regression model

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Cofactor Expansion: Cramer s Rule

Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating

### We know a formula for and some properties of the determinant. Now we see how the determinant can be used.

Cramer s rule, inverse matrix, and volume We know a formula for and some properties of the determinant. Now we see how the determinant can be used. Formula for A We know: a b d b =. c d ad bc c a Can we

### Name: Section Registered In:

Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### 13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

### The Inverse of a Square Matrix

These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

### Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

### Lecture Notes: Matrix Inverse. 1 Inverse Definition

Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### Sec 4.1 Vector Spaces and Subspaces

Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common

### MAT188H1S Lec0101 Burbulla

Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

### Section 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj

Section 5. l j v j = [ u u j u m ] l jj = l jj u j + + l mj u m. l mj Section 5. 5.. Not orthogonal, the column vectors fail to be perpendicular to each other. 5..2 his matrix is orthogonal. Check that

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses

University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 57 Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses Peter J. Hammond email: p.j.hammond@warwick.ac.uk Autumn 2012,

### Introduction to Matrix Algebra

Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

### Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

### MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### Introduction to Matrices for Engineers

Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11

### L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014

L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014 Unfortunately, no one can be told what the Matrix is. You have to see it for yourself. -- Morpheus Primary concepts:

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### Linear Algebra Review. Vectors

Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

### [1] Diagonal factorization

8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

### Matrix Differentiation

1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have

The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would

### 9 MATRICES AND TRANSFORMATIONS

9 MATRICES AND TRANSFORMATIONS Chapter 9 Matrices and Transformations Objectives After studying this chapter you should be able to handle matrix (and vector) algebra with confidence, and understand the

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### 2.1 Functions. 2.1 J.A.Beachy 1. from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair

2.1 J.A.Beachy 1 2.1 Functions from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 21. The Vertical Line Test from calculus says that a curve in the xy-plane

### Inner products on R n, and more

Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

### Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

### Chapter 10. Abstract algebra

Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and

### Math 313 Lecture #10 2.2: The Inverse of a Matrix

Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Unit 18 Determinants

Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### The basic unit in matrix algebra is a matrix, generally expressed as: a 11 a 12. a 13 A = a 21 a 22 a 23

(copyright by Scott M Lynch, February 2003) Brief Matrix Algebra Review (Soc 504) Matrix algebra is a form of mathematics that allows compact notation for, and mathematical manipulation of, high-dimensional

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Properties of Real Numbers

16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should

### 5.3 Determinants and Cramer s Rule

290 5.3 Determinants and Cramer s Rule Unique Solution of a 2 2 System The 2 2 system (1) ax + by = e, cx + dy = f, has a unique solution provided = ad bc is nonzero, in which case the solution is given

### Elementary Matrices and The LU Factorization

lementary Matrices and The LU Factorization Definition: ny matrix obtained by performing a single elementary row operation (RO) on the identity (unit) matrix is called an elementary matrix. There are three

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Notes on Linear Algebra. Peter J. Cameron

Notes on Linear Algebra Peter J. Cameron ii Preface Linear algebra has two aspects. Abstractly, it is the study of vector spaces over fields, and their linear maps and bilinear forms. Concretely, it is

### Solution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.

Solutions to Math 30 Take-home prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### MA 242 LINEAR ALGEBRA C1, Solutions to Second Midterm Exam

MA 4 LINEAR ALGEBRA C, Solutions to Second Midterm Exam Prof. Nikola Popovic, November 9, 6, 9:3am - :5am Problem (5 points). Let the matrix A be given by 5 6 5 4 5 (a) Find the inverse A of A, if it exists.

### The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

### Chapter 6. Orthogonality

6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

### Notes on Algebraic Structures. Peter J. Cameron

Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### Subspaces of R n LECTURE 7. 1. Subspaces

LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r

### 5.1 Commutative rings; Integral Domains

5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following