# 2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b

Size: px
Start display at page:

Download "2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b"

Transcription

1 . FINITE-DIMENSIONAL VECTOR SPACES.. Fields By now you ll have acquired a fair knowledge of matrices. These are a concrete embodiment of something rather more abstract. Sometimes it is easier to use matrices, but at other times the abstract approach allows us more freedom. Recall that a field is a mathematical system having two operations + and, where we write the composition of two elements a, b as a + b and ab respectively. There are field axioms that must be satisfied. For addition we have the closure law, the associative law, the commutative law and the existence of an identity,, and inverses, a. We have the corresponding five axioms for multiplication, but note that there are subtle changes when it comes to the existence of identity,, and inverses a. We insist that and are distinct and we only insist on multiplicative inverses for all non-zero elements. Finally there s the distributive law to hold both structures together. A field underlies every vector space and the elements of that field are called scalars. Example : The following are examples of fields: Q, the set of rational numbers. R, the set of real numbers. C, the set of complex numbers. Q[ ] = {a + b a, b Q}. The associative, commutative and distributive laws hold throughout the system of complex numbers, so the only axioms that need to be checked are the closure, identity and inverse laws. For Q, R and C these are obvious. Let us check them for Q[ ]. (a + b ) + (c + d ) = (a + c) + (b + d), so Q[ ] is closed under addition. (a + b )(c + d ) = (ac + bd) + (ad + bc), so Q[ ] is closed under addition. Q[ ] clearly contain both and so the identity laws hold. (a + b ) = (a) + (b) and a + b = a b a a b = a b + b a b so Q[ ] is closed under both additive and multiplicative inverses. There are certain properties of field that are consequences of these axioms. For example there is no axiom that says that x =. However if we consider that x = ( + )x = x + x we reach this conclusion (with the help of the additive identity axiom and the distributive law). The cancellation law that we constantly use in basic algebra is not one of the axioms but is a consequence of them. If ab = then a = or b =. For if a then a exists and a (ab) = a = and so b =. Theorem : If p is prime then Z p = {,,,, p } is a field under addition and multiplication modulo p (where we add and multiply normally but then take the remainder on dividing by p). Proof: All the field axioms are obvious except for inverses under multiplication. Suppose x is a non-zero element of Z p. Regarding x as an integer this means that x is not divisible by p. In other words, x is coprime to p. This means that ax + bp = for some integers a, b. Now, interpreting this modulo p this becomes ax =, so x has an inverse under multiplication.

2 Example : In Z 7 the following table gives the inverses under addition and multiplication for the non-zero elements. x x x Integers that are plus a multiple of 7 include 8,,, 69, 86, and. So, for example, = mod 7 and so and 7 are inverses of one another. Then, since 7 =, 7 = = =. If p is not prime, however, Z p is not a field because, if p = ab for some integers a, b where < a, b < p, then modulo p we would have ab = while a and b. So the only systems of integers modulo p that give fields are those where p is prime. But these are not the only finite fields. For every prime power p n there exists a field with p n elements (and for no other sizes). But the field of order p n (there is only one) is not Z p n, unless n =. Example : The following are the addition and multiplication tables for the field with elements: +.. Vector Spaces A vector space V, over a field F, is a set, together with two operations, addition (u + v) and scalar multiplication (λv) such that the following properties (called the vector space axioms) hold. () (Closure under addition) For all u, v V, u + v V; () (Closure under scalar multiplication) For all λ F and all v V, λv V; () (Associative law under addition) For all u, v, w V, u + (v + w) = (u + v) + w; () (Commutative law under addition) For all u, v V, u + v = v + u; () (Identity under addition) There exists V such that for all v V, v + = v; (6) (Inverses under addition) For all v V there exists v V such that v + (v) = ; (7) (Distributive) For all λ F and all u, v V, λ(u + v) = λu + λv; (8) (Distributive) For all λ, µ F and all v V, (λ + µ)v = λv + µv; (9) (Associative under scalar multiplication) For all λ, µ F and all v V, (λµ)v = λ(µv); () (Identity under scalar multiplication) For all v V, v = v. You may wonder why we haven t printed the vectors u, v, w in bold type. That is a practice when you first learn about vectors so that you can see clearly which are vectors and which are scalars. So we would write λv to emphasise that λ is a scalar and v is a vector. However there is nothing in the set of axioms for a vector space that sys that vectors and scalars are different things. There are examples where some F is a subset of V and where there are elements that are both vectors and scalars. Example : C is a vector space over R. Here the real numbers are scalars, and the complex numbers are the vectors. But because every real number is also a complex number, they are both scalars and vectors. 6

3 This situation occurs whenever you have a subfield of a larger field. If you go through the axioms, in the situation where F is a subfield of V, and you will find that the vector space axioms are direct consequences of the field axioms. In the area of mathematics that studies fields (Galois Theory) the theory of vector spaces plays an important role. Example : For any field F, F n is the set of all n-tuples (x, x,, x n ) where each x i F and where addition and scalar multiplication are defined in the usual way. It is easily seen to be a vector space over F. Example 6: Consider -dimensional Euclidean space. This is a vector space over R as follows. The vectors are the directed line segments from the origin to a point. The scalars are the real numbers. Addition is defined by completing a parallelogram. v O Multiplying a non-zero vector v by a positive scalar λ produces a vector with the same direction as v but with λ times the length. Multiplying by a negative scalar magnifies the length and reverses the direction. And, of course v = = λ for all vectors v and scalars λ. Clearly this is essentially the same as R. We will make the concept of essentially the same precise in a later chapter. Example 7: For any field F, F is the set of all infinite sequences (x, x, ) with each x i F and with addition and multiplication defined in the obvious way. Example 8: For any field F, F[x] is the set of all polynomials a n x n + a n x n + + a x + a where each x i F and n is any non-negative integer. Addition and scalar multiplication are defined in the obvious way. F[x] is clearly a vector space over F. Note that we could write the polynomial as an infinite sequence (a, a, ), but F[x] differs from F in that here all the components from some point on are zero. Example 9: For any field F, M n (F) is the set of all n n matrices with the usual addition and scalar multiplication. This is clearly a vector space over F. Up to this point the vector spaces have had recognisable components. In the next example this is not the case. Example : Diff(R) is the set of all differentiable functions from the reals to the reals. The sum of two differentiable functions f(x) and g(x) is the differentiable function f(x) + g(x) and the scalar multiple of the differentiable function f(x) by the scalar λ is the differentiable function λf(x). Thus the closure laws hold. The remaining axioms are just as obvious. The function f(x) = x belongs to Diff(R). But what are its components? Spaces of functions are very important in the deeper study of analysis. u u + v 7

4 .. Elementary Properties of Vector Spaces There are a number of additional properties that vector spaces satisfy. However these are not included in the list of axioms because they are consequences of them. Theorem : If V is a vector space over the field F then for all u, v V and all λ, µ F: () v = ; () ()v = v; () λ =. () λv = implies that λ = or v =. () λu = λv and λ implies that u = v. (6) λv = µv and v implies that λ = µ. Proof: () v = ( + )v = v + v, so the result follows by subtraction. () = v = ( + )v = ()v + v. () λ = λ( + ) = λ + λ, so the result follows by subtraction. () If λ then λ exists. Hence if λv = then v = v = (λ λ)v = λ (λv) = λ = by (). () If λu = λv then λ(u v) =, so if λ then u v. (6) If λv = µv then (λ µ)v =, so if v then λ µ =... Subspaces A subspace of a vector space is a non-empty subset that is closed under addition and scalar multiplication. The fact that v = ()v guarantees that a subspace is also closed under inverse. Note too that if V is any vector space {} is a subspace of V, as is V itself. If U is a subspace of V we write U V. Every vector space is a subspace of itself, but if we want to emphasise that U is not the same as V we can write U < V and say that U is a proper subspace of V. Examples : () {(x, y, z) R z = x + y} is a subspace of R. () {(x, y, z) R x + y + z = and 7x y + z = } R. () A plane that passes through the origin is a subspace of -dimensional space. () The set of differentiable functions from R to R is a subspace of the set of continuous functions from R to R, which in turn is a subspace of the set of all functions from R to R. () The set of convergent sequences is a subspace of R. (6) The set of diagonal n n matrices is a subspace of the s[ace of all n n matrices. (7) Q R C. (8) In Example, Z is a subspace of the field with elements. (9) For any vector space V {} V. There are axioms for a vector space, but axioms (), (), (7), (8), (9) and () will automatically be inherited by any subset. If the subset is non-empty we can dispense with () and (6) as well. Theorem : If a non-empty subset is closed under addition and scalar multiplication then it is a subspace. Proof: Closure under inverses follows from closure under scalar multiplication and the fact that: v = ()v. Closure under zero follows from the fact that v =, provided the subset is nonempty. 8

5 But note that the empty set is (vacuously) closed under addition, inverses and scalar multiplication, but it is not a subspace. If U and V are subspaces of W there are two other subspaces that can be formed from them (though in special cases these may coincide with U or V). The intersection U V is a subspace, as is the sum, U + V, which is defined to be {u + v u U, v V}. Theorem : If U, V are subspaces of W (a vector space over F) then so are: () U V and () U + V. Proof: () Since U V, it is non-empty. Let u, v U V and λ F. Then u, v U and λv, for all scalars λ, belong to U. Similarly they both belong to V and so belong to U V. () Since = + U + W, it is non-empty. Let w = u + v and w = u + v belong to U + V, with u, u U and v, v V. Then w + w = (u + v ) + (u + v ) = (u + u ) + (v + v ) U + V. Let λ F and w = u + v where u U and v V. Then λw = λ(u + v) = λu + λv U + V. Example : If U, V are distinct lines through the origin (in -dimensional space) U V is {} and U + V is the plane that passes through both lines. If U, V are distinct planes through the origin then U V is the line where the planes intersect and U + V is the -dimensional space... Finite-Dimensional Vector Spaces and Their Bases A linear combination of v, v, v n V is any vector of the form λ v + λ v + + λ n v n. The span of v, v, v n is the subspace v, v,, v n, which is the set of all linear combinations of them. The space spanned by the empty set is defined to be {}. So the span of a finite set is the smallest subspace that contains it. If this is the space V we say that v, v,, v n span V. Examples : () v is the set of all scalar multiples of v; () (,, ), (,, ) and (,, ) span R since (x, y, z) = (y z)(,, ) + (x + z y)(,, ) + z(,, ). () (,, ), (,, ) and (,, ) span the plane {(x, y, z) x + z = y}, not the whole of R. Clearly v, v,, v n = v + v + + v n. Theorem : If u v, v,, v n then u, v, v,, v n = v, v,, v n. Proof: Suppose u v, v, v n and let u = x v + x v + + x n v n. Clearly v, v,, v n u, v, v,, v n. Since λu + λ v + λ v + + λ n v n = (λx + λ )v + (λx + λ )v + + (λx n + λ n )v n the inequality holds in reverse. The vectors v, v,, v n are defined to be linearly independent if λ v + λ v + + λ n v n = implies that λ = λ = = λ n =. If they are not linearly independent they are said to be linearly dependent. Example : In -dimensional space two vectors are linearly dependent if they are in the same line. Three vectors are linearly dependent if they are in the same plane. 9

6 Example : Are (,,, ), (,, 7, ), (,, 8, 6), (,, 6, ) linearly independent? Solution: Suppose λ (,,, ) + λ (,, 7, ) + λ (,, 8, 6) + λ (,, 6, ) = (,,, ) We solve the resulting system of equations by reducing the coefficient matrix to echelon form so there is a non-zero solution and hence the vectors are linearly dependent. Solving the system of equations we obtain the non-zero solution λ = 9, λ = 6, λ =, λ =. So (,, 7, ) + 9(,, 6, ) = 6(,, 8, 6) + (,,, ). A basis for a finite-dimensional vector space V is a linearly independent set that spans V. Example 6: The set {(,,,,, ), (,,,,, ),, (,,,,, )} is a basis for F n, where F is any field. This is called the standard basis. We often denote it by {e, e,, e n }. A minimal spanning set for V is a set of vectors that spans V and has smallest size of any spanning set. Theorem 6: If V has a spanning set of size m and a linearly independent set of size n then m n. Proof: Let A be a spanning set for V and let B be a linearly independent subset of V. Suppose #A = m and #B = n. Let b B. Since A spans V, b is a linear combination of the vectors in A. Now some of the vectors in A might also be in B. But since B is linearly independent the coefficient of some element a A B must be non-zero. Then a can be expressed as a linear combination of A {a} + {b} and so this set spans V. In other words, we can replace a by b and the resulting set still spans V. Continuing in this way we can transfer all the vectors from B into A, displacing an equal number of vectors. Hence m n. Corollary: All bases for a finite-dimensional vector space have the same number of elements. Proof: If two bases have m and n elements respectively then m n and n m. The unique number of vectors in a basis of a finite-dimensional vector space V is called the dimension of V and is denoted by dim(v). A set of vectors in V whose size exceeds dim(v) is always linearly dependent. A set of vectors whose size is less than dim(v) cannot span V. Examples 7: () dim F n = n because the vectors (,,,, ), (,,,, ), (,,,,, ) form a basis (called the standard basis). () The dimension of three dimensional Euclidean space is, of course! () dimm n (F) = n. The standard basis consists of the matrices E ij which have a in the i-j position and s elsewhere. () dim C (as a vector space over R) is, with {, i} as an obvious basis. () The space Diff(R) is infinite dimensional. (6) The dimension of the zero subspace is.

7 .6. Sums and Direct Sums Recall that the sum of two subspaces U, V is U + V = {u + v u U, v V} and their intersection is U V = {v v U and v V}. The sum U + V is called a direct sum whenever U V =. (Here we are writing the zero subspace as, instead of {}). If W is the direct sum of U and V we write W = U V. Example 8: In R, if U, V are two distinct planes through the origin then U + V = R. The sum is not direct, however, because U V will be a line through the origin. On the other hand if U is a plane through the origin and V is a line through the origin that doesn t lie in the plane, then U + V = R as before, but this time U V =. We can therefore write R = U V. Theorem 7: If W = U V then every element of W can be expressed uniquely as u + v for u U and v V. Proof: The only part that isn t immediately obvious is the directness of the sum. Suppose u + v = u + v where u, u U and v, v V. Then u u = v v U V =. Hence u = u and v = v. The converse also holds. If every element of W can be expressed uniquely as u + v for u U and v V then W = U V. The dimension of U V can be expressed in terms of the dimensions of U, V and U + V. Theorem 8: If U, V are subspaces of W then dim(u + V) = dim(u) + dim(v) dim(u V). Proof: Let m = dim(u), n = dim(v) and r = dim(u V). Take a basis w, w,,w r for U V. Extend this to a basis w, w,,w r, u, u,, u mr for U. Now extend the basis for U V to a basis w, w,,w r, v, v,, v nr for V. We shall show that v, v,, v r, u, u,, u mr, v, v,,v nr is a basis for U + V. They span V: Let u + v U + V where u U and v V. Then u = α w + +α r w r + β u + + β mr u mr for some α i s and β i s F and v = γ w + + γ r w r + δ v + + δ nr v nr for some γ I s and δ I s F. Hence u + v = [α w + +α r w r + β u + + β mr u mr ] + [γ w + + γ r w r + δ v + + δ nr v nr ] = (α + γ )w + + (α r + γ r )w r + β u + + β mr u mr + δ v + + δ nr v nr. They are linearly independent: Suppose α w + +α r w r + β u + + β mr u mr + δ v + + δ nr v nr =.. (*) Then δ v + + δ nr v nr = α w α r w r β u β mr u mr U V =. Hence δ v + + δ nr v nr = and α w + + α r w r + β u + + β mr u mr =. Since v v nr are linearly independent (they are a basis for V) it follows that δ = = δ nr = =. Since w, w r, u u mr are linearly independent (they are a basis for V) it follows that α = = α r = β,, β mr =. Hence dim(u + V) = r + (m r) + (n r) = m + n r. We can generalise a sum to a sum of any finite number of terms. The sum of U,, U k is U + + U k, the set of all vectors of the form u + + u k where u r U r for each r. The above sum is a direct sum if, whenever u + + u k =, with each u r U r, implies that each u r =.

8 EXERCISES FOR CHAPTER Exercise : Prove that the set of all real symmetric matrices is a vector space over R. Exercise : Prove that for functions of a real variable a(x), b(x), c(x) the solutions to the differential equation a(x) d y dx + b(x) dy dx + c(x)y = form a subspace of the space of all differentiable functions of x. Exercise : Prove that the set of bounded sequences of real numbers is a vector space over R. Exercise : Show that the set S of all real sequences (a n ) where lim a = ± is NOT a vector space. n n Exercise : If U = {(x, y, z) x y + z = } and V = {(x, y, z) x y + z = } find U V and U + V. Exercise 6: Show that (,, ), (,, 6), (7, 8, 9) are linearly dependent. Exercise 7: If u = (,, ) and v = (,, ) show that (,, ) u, v. Exercise 8: Show that {(,, ), (,, ), (,, )} are linearly independent. Exercise 9: Is {(,, 7), (,, ), (6,, 8), (,, )} linearly dependent or independent. Exercise : Find the dimension of the space of all symmetric matrices. Exercise : Suppose U, V are subspaces of R 7 with dimensions and respectively. Suppose too that U + V = R 7. Find dim(u V). SOLUTIONS FOR CHAPTER Exercise : Closure under +: Suppose A, B are real symmetric matrices. Then A T = A and B T = B. Hence (A + B) T = A T + B T = A + B, so A + B is symmetric. Closure under scalar : For any scalar k, (ka) T = ka T = ka so the set is closed under scalar multiplication. Hence the set is a subspace. Exercise : Closure under +: Suppose f(x), g(x) are solutions to the differential equation. Then a(x) d f(x) dx + b(x)df(x) dx + c(x)f(x) = and a(x) d g(x) dx + b(x)dg(x) dx + c(x)g(x) =. Hence a(x) d (f(x) + g(x)) + g(x)) dx + b(x)d(f(x) dx + c(x)(f(x) + g(x)) = a(x) d f(x) dx + d g(x) dx + b(x) df(x) dx + dg(x) dx + c(x)f(x) + c(x)g(x) = a(x) d f(x) dx + b(x)df(x) dx + c(x)f(x) + a(x) d g(x) dx + b(x)dg(x) dx + c(x)g(x) =.

9 Closure under scalar multiplication: For any real number k a(x) d (kf(x)) dx + b(x)d(kf(x)) dx + c(x)kf(x) = ka(x) d f(x) dx + b(x)df(x) dx + c(x)f(x) = Exercise : Closure under +: Suppose (a n ) and (b n ) are bounded sequences. Then, there exist K, L such that for all n a n K and b n L. Now a n + b n a n + b n K + L for all n. Hence the sequence (a n ) + (b n ) = (a n + b n ) is bounded. Closure under scalar multiplication: For any real number k, ka n = k. a n k.k. k(a n ) = (ka n ) is bounded. Hence the set is a subspace. Exercise : It isn t closed under addition. If a n = n and b n = n then both (a n ) and (b n ) belong to S. But (a n ) + (b n ) does not. Exercise : U V = {(x, y, z) x y + z = and x y + z = }. We solve the homogeneous system.. Let z = k. Then y = k and x = k. So U V = {k(,, ) k R}. Now dim(u + V) = dim(u) + dim(v) dim(u V) = + = so U + V = R. Exercise 6: (,, ) + (7, 8, 9) = (,, 6). Exercise 7: Suppose (,, ) = k(,, ) + h(,, ). We attempt to solve the system k + h = k + h = k h = So h =, k = 9() =. So (,, ) = (,, ) (,, ) u, v. Exercise 8: Suppose a(,, ) + b(,, ) + c(,, ) = (,, ). We solve the homogeneous system a + b = a + b + c = a + b + c = a = b = c = and so the vectors are linearly independent.

10 Alternatively we can evaluate the determinant = ( 6) ( ) =. Since this is non-zero the vectors are linearly independent. WARNING: This second method only works for n vectors in an n-dimensional vector space. Exercise 9: Linearly dependent. Whenever you have more vectors than the dimension of the vector space from which they come, they must be linearly dependent. Exercise : A symmetric matrix has the form c f e f b d e d a. Clearly,,,,, is a basis so the dimension is 6. Exercise : dim(u V) = dim(u) + dim(v) dim(u + V) = + 7 =.

### Chapter 1 Vector Spaces

Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field

### August 23, 2017 Let us measure everything that is measurable, and make measurable everything that is not yet so. Galileo Galilei. 1.

August 23, 2017 Let us measure everything that is measurable, and make measurable everything that is not yet so. Galileo Galilei 1. Vector spaces 1.1. Notations. x S denotes the fact that the element x

### Abstract Vector Spaces

CHAPTER 1 Abstract Vector Spaces 1.1 Vector Spaces Let K be a field, i.e. a number system where you can add, subtract, multiply and divide. In this course we will take K to be R, C or Q. Definition 1.1.

### Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur

Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Lecture No. # 02 Vector Spaces, Subspaces, linearly Dependent/Independent of

### 0.2 Vector spaces. J.A.Beachy 1

J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a

### Rings. EE 387, Notes 7, Handout #10

Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for

### Prelims Linear Algebra I Michaelmas Term 2014

Prelims Linear Algebra I Michaelmas Term 2014 1 Systems of linear equations and matrices Let m,n be positive integers. An m n matrix is a rectangular array, with nm numbers, arranged in m rows and n columns.

### Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

### Vector Spaces. Addition : R n R n R n Scalar multiplication : R R n R n.

Vector Spaces Definition: The usual addition and scalar multiplication of n-tuples x = (x 1,..., x n ) R n (also called vectors) are the addition and scalar multiplication operations defined component-wise:

### The following definition is fundamental.

1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic

### MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.

MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.

### Abstract Vector Spaces and Concrete Examples

LECTURE 18 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.

### Commutative Rings and Fields

Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

### Math 115A: Linear Algebra

Math 115A: Linear Algebra Michael Andrews UCLA Mathematics Department February 9, 218 Contents 1 January 8: a little about sets 4 2 January 9 (discussion) 5 2.1 Some definitions: union, intersection, set

### a (b + c) = a b + a c

Chapter 1 Vector spaces In the Linear Algebra I module, we encountered two kinds of vector space, namely real and complex. The real numbers and the complex numbers are both examples of an algebraic structure

### Chapter 1: Introduction to Vectors (based on Ian Doust s notes)

Chapter 1: Introduction to Vectors (based on Ian Doust s notes) Daniel Chan UNSW Semester 1 2018 Daniel Chan (UNSW) Chapter 1: Introduction to Vectors Semester 1 2018 1 / 38 A typical problem Chewie points

### MAT 242 CHAPTER 4: SUBSPACES OF R n

MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)

### EXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)

EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily

### Math 4310 Solutions to homework 1 Due 9/1/16

Math 0 Solutions to homework Due 9//6. An element [a] Z/nZ is idempotent if [a] 2 [a]. Find all idempotent elements in Z/0Z and in Z/Z. Solution. First note we clearly have [0] 2 [0] so [0] is idempotent

### Math 341: Convex Geometry. Xi Chen

Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry

### MA106 Linear Algebra lecture notes

MA106 Linear Algebra lecture notes Lecturers: Diane Maclagan and Damiano Testa 2017-18 Term 2 Contents 1 Introduction 3 2 Matrix review 3 3 Gaussian Elimination 5 3.1 Linear equations and matrices.......................

### Linear Algebra (Math-324) Lecture Notes

Linear Algebra (Math-324) Lecture Notes Dr. Ali Koam and Dr. Azeem Haider September 24, 2017 c 2017,, Jazan All Rights Reserved 1 Contents 1 Real Vector Spaces 6 2 Subspaces 11 3 Linear Combination and

### ENGINEERING MATH 1 Fall 2009 VECTOR SPACES

ENGINEERING MATH 1 Fall 2009 VECTOR SPACES A vector space, more specifically, a real vector space (as opposed to a complex one or some even stranger ones) is any set that is closed under an operation of

### MATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005

MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all

### SYMBOL EXPLANATION EXAMPLE

MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the

### Chapter 3. Vector spaces

Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say

### Rings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.

Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary

### NOTES (1) FOR MATH 375, FALL 2012

NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =

### Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:

### Lecture 17: Section 4.2

Lecture 17: Section 4.2 Shuanglin Shao November 4, 2013 Subspaces We will discuss subspaces of vector spaces. Subspaces Definition. A subset W is a vector space V is called a subspace of V if W is itself

### Chapter 5: The Integers

c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition

### The definition of a vector space (V, +, )

The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element

### Linear Equations in Linear Algebra

1 Linear Equations in Linear Algebra 1.7 LINEAR INDEPENDENCE LINEAR INDEPENDENCE Definition: An indexed set of vectors {v 1,, v p } in n is said to be linearly independent if the vector equation x x x

### Moreover this binary operation satisfies the following properties

Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................

### Chapter 2: Linear Independence and Bases

MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space

### Linear Algebra. Linear Algebra. Chih-Wei Yi. Dept. of Computer Science National Chiao Tung University. November 12, 2008

Linear Algebra Chih-Wei Yi Dept. of Computer Science National Chiao Tung University November, 008 Section De nition and Examples Section De nition and Examples Section De nition and Examples De nition

### MATH 240 Spring, Chapter 1: Linear Equations and Matrices

MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear

### Study Guide for Linear Algebra Exam 2

Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real

### Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

### MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

### ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.

ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add

### Introduction to Topology

Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

### Math 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:

Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =

### Math 309 Notes and Homework for Days 4-6

Math 309 Notes and Homework for Days 4-6 Day 4 Read Section 1.2 and the notes below. The following is the main definition of the course. Definition. A vector space is a set V (whose elements are called

### Row Space, Column Space, and Nullspace

Row Space, Column Space, and Nullspace MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Every matrix has associated with it three vector spaces: row space

### CSL361 Problem set 4: Basic linear algebra

CSL361 Problem set 4: Basic linear algebra February 21, 2017 [Note:] If the numerical matrix computations turn out to be tedious, you may use the function rref in Matlab. 1 Row-reduced echelon matrices

### OHSx XM511 Linear Algebra: Solutions to Online True/False Exercises

This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)

### Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

### Linear Algebra. Min Yan

Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

### Lecture notes - Math 110 Lec 002, Summer The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition.

Lecture notes - Math 110 Lec 002, Summer 2016 BW The reference [LADR] stands for Axler s Linear Algebra Done Right, 3rd edition. 1 Contents 1 Sets and fields - 6/20 5 1.1 Set notation.................................

### AFFINE AND PROJECTIVE GEOMETRY, E. Rosado & S.L. Rueda 4. BASES AND DIMENSION

4. BASES AND DIMENSION Definition Let u 1,..., u n be n vectors in V. The vectors u 1,..., u n are linearly independent if the only linear combination of them equal to the zero vector has only zero scalars;

### Math 550 Notes. Chapter 2. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010

Math 550 Notes Chapter 2 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 2 Fall 2010 1 / 20 Linear algebra deals with finite dimensional

### Kevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings

MTHSC 412 Section 3.1 Definition and Examples of Rings A ring R is a nonempty set R together with two binary operations (usually written as addition and multiplication) that satisfy the following axioms.

### Abstract & Applied Linear Algebra (Chapters 1-2) James A. Bernhard University of Puget Sound

Abstract & Applied Linear Algebra (Chapters 1-2) James A. Bernhard University of Puget Sound Copyright 2018 by James A. Bernhard Contents 1 Vector spaces 3 1.1 Definitions and basic properties.................

### ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,

### 6. The scalar multiple of u by c, denoted by c u is (also) in V. (closure under scalar multiplication)

Definition: A subspace of a vector space V is a subset H of V which is itself a vector space with respect to the addition and scalar multiplication in V. As soon as one verifies a), b), c) below for H,

### Linear Algebra, Summer 2011, pt. 2

Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................

### (a) Let F be a field, and E F a subfield. Then F can be regarded as a vector space over E (with + and the field operations).

Sample True/False To demonstrate in class (a) If f(x) is an even function, then so i Presentation Math 4310problem 1. Determine whether Prelim the following I Solutions statements (10/09/2015) are (always)

### Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

### Linear Algebra Practice Problems

Linear Algebra Practice Problems Math 24 Calculus III Summer 25, Session II. Determine whether the given set is a vector space. If not, give at least one axiom that is not satisfied. Unless otherwise stated,

### Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational

### Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

### 3 - Vector Spaces Definition vector space linear space u, v,

3 - Vector Spaces Vectors in R and R 3 are essentially matrices. They can be vieed either as column vectors (matrices of size and 3, respectively) or ro vectors ( and 3 matrices). The addition and scalar

### Vector Spaces 4.5 Basis and Dimension

Vector Spaces 4.5 and Dimension Summer 2017 Vector Spaces 4.5 and Dimension Goals Discuss two related important concepts: Define of a Vectors Space V. Define Dimension dim(v ) of a Vectors Space V. Vector

### 4 Vector Spaces. 4.1 Basic Definition and Examples. Lecture 10

Lecture 10 4 Vector Spaces 4.1 Basic Definition and Examples Throughout mathematics we come across many types objects which can be added and multiplied by scalars to arrive at similar types of objects.

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 994, 28. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### Lecture Summaries for Linear Algebra M51A

These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

### LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS

LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in

### Linear Algebra Highlights

Linear Algebra Highlights Chapter 1 A linear equation in n variables is of the form a 1 x 1 + a 2 x 2 + + a n x n. We can have m equations in n variables, a system of linear equations, which we want to

### 9. Integral Ring Extensions

80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications

### Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

### NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

### Math Linear Algebra

Math 39 - Linear Algebra A simple description of the subject of (finite dimensional Linear Algebra might be the study of matrices and vectors Matrices are arrays that are (usually filled with real or complex

### Linear Algebra. Chapter 5

Chapter 5 Linear Algebra The guiding theme in linear algebra is the interplay between algebraic manipulations and geometric interpretations. This dual representation is what makes linear algebra a fruitful

### Linear Algebra. Paul Yiu. Department of Mathematics Florida Atlantic University. Fall 2011

Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 1A: Vector spaces Fields

### 3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions

A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence

### 2.3. VECTOR SPACES 25

2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous

### Supplementary Material for MTH 299 Online Edition

Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think

### Problem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that

Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume

### 1 Last time: inverses

MATH Linear algebra (Fall 8) Lecture 8 Last time: inverses The following all mean the same thing for a function f : X Y : f is invertible f is one-to-one and onto 3 For each b Y there is exactly one a

### 1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by

Seminar 1 1. Which ones of the usual symbols of addition, subtraction, multiplication and division define an operation (composition law) on the numerical sets N, Z, Q, R, C? 2. Let A = {a 1, a 2, a 3 }.

### chapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS

chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader

### Problems in Linear Algebra and Representation Theory

Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific

### Vector spaces. EE 387, Notes 8, Handout #12

Vector spaces EE 387, Notes 8, Handout #12 A vector space V of vectors over a field F of scalars is a set with a binary operator + on V and a scalar-vector product satisfying these axioms: 1. (V, +) is

### Exercises Chapter II.

Page 64 Exercises Chapter II. 5. Let A = (1, 2) and B = ( 2, 6). Sketch vectors of the form X = c 1 A + c 2 B for various values of c 1 and c 2. Which vectors in R 2 can be written in this manner? B y

### 1 Basics of vector space

Linear Algebra- Review And Beyond Lecture 1 In this lecture, we will talk about the most basic and important concept of linear algebra vector space. After the basics of vector space, I will introduce dual

### Vector Spaces. Chapter Two

Chapter Two Vector Spaces The first chapter began by introducing Gauss method and finished with a fair understanding, keyed on the Linear Combination Lemma, of how it finds the solution set of a linear

### Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

### Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases

Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases November 18, 2013 1 Spanning and linear independence I will outline a slightly different approach to the material in Chapter 2 of Axler

### Math Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88

Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant

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

Chapter 1 LINEAR EQUATIONS 11 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 real

### 88 CHAPTER 3. SYMMETRIES

88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars

### Math 346 Notes on Linear Algebra

Math 346 Notes on Linear Algebra Ethan Akin Mathematics Department Fall, 2014 1 Vector Spaces Anton Chapter 4, Section 4.1 You should recall the definition of a vector as an object with magnitude and direction

### A Do It Yourself Guide to Linear Algebra

A Do It Yourself Guide to Linear Algebra Lecture Notes based on REUs, 2001-2010 Instructor: László Babai Notes compiled by Howard Liu 6-30-2010 1 Vector Spaces 1.1 Basics Definition 1.1.1. A vector space

### Notes on Linear Algebra I. # 1

Notes on Linear Algebra I. # 1 Oussama Moutaoikil Contents 1 Introduction 1 2 On Vector Spaces 5 2.1 Vectors................................... 5 2.2 Vector Spaces................................ 7 2.3

### GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations

### Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter

### Lecture 1: Systems of linear equations and their solutions

Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications