Bases for Vector Spaces


 Natalie Ross
 4 years ago
 Views:
Transcription
1 Bses for Vector Spces A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything in the vector spce s liner comintions of vectors in the set Putting these two ides together, sis is n independent spnning set: A set with no redundncy out of which you cn uild everything Definition Let V e n Fvector spce A suset B of V is sis if it is linerly independent nd spns V The numer of elements in sis for V is clled the dimension of V, nd is denoted dimv Someone could oject t this point tht I don t know tht two ses for V might not hve different numers of elements in which cse the dimension of V wouldn t mke sense I ll show lter tht this cn t hppen Exmple Consider the stndrd sis for R 3 :,, As the nme implies, this set is sis I oserved erlier tht this set is independent Moreover, c + +c Therefore, every vector in R 3 cn e written s liner comintion of the vectors, so the set lso spns Hence Exmple The following set is sis for R 3 over R:,, Mke mtrix with the vectors s columns nd row reduce: A = Since A row reduces to the identity, it is invertile,nd there re numer of conditions which re equivlent to A eing invertile First, since A is invertile the following system hs unique solution for every (,,c): x y z c
2 But this mtrix eqution cn e written s x +y +z In other words, ny vector (,,c) R 3 cn e written s liner comintion of the given vectors: The given vectors spn R 3 Second, since A is invertile, the following system hs only x =, y =, z = s solution: x y z c This mtrix eqution cn e written s x +y +z Since the only solution is x =, y =, z =, the vectors re independent Hence, the given set of vectors is sis for R 3 The following result is cler from the lst exmple Proposition Let F e field {v,v 2,,v n } is sis for F n if nd only if A = v v 2 v n is invertile Note tht y erlier results on invertiility, this is equivlent to the following conditions (mong others): A row reduces to the identity 2 deta Thus, if you hve n vectors in F n, this gives you severl wys of checking whether or not the set is sis A sis for V is spnning set for V, so every vector in V cn e written s liner comintion of sis elements The next result sys tht such liner comintion is unique Lemm Let {v,v 2,,v n } e sis for vector spce V Every v V cn e written in exctly one wy s v = v + 2 v n v n, i F Proof Let v V Since {v,v 2,,v n } spns V, there re sclrs, 2,, n such tht Suppose tht there is nother wy to do this: v = v + 2 v n v n v = v + 2 v n v n Then v + 2 v n v n = v + 2 v n v n 2
3 Hence, Since {v,v 2,,v n } is independent, Therefore, ( )v +( 2 2 )v 2 + +( n n )v n = =, 2 2 =,, n n = =, 2 = 2,, n = n Tht is, the two liner comintions were ctully the sme This proves tht there s only one wy to write v s liner comintion of the v i s I wnt to show tht two ses for vector spce must hve the sme numer of elements I need some preliminry results, which re importnt in their own right Lemm If A is n m n mtrix with m < n, the system Ax = hs nontrivil solutions Proof Write A = 2 n n m m2 mn The condition m < n mens tht the following system hs more vriles thn equtions: 2 n n m m2 mn x x 2 x n If A row reduces to row reduced echelon mtrix R, then R cn hve t most m leding coefficients Therefore, some of the vriles x, x 2,, x n will e free vriles (prmeters); if I ssign nonzero vlues to the free vriles (eg y setting ll of them equl to ), the resulting solution will e nontrivil Theorem Let {v,v 2,,v n } e sis for vector spce V () Any suset of V with more thn n elements is dependent () Any suset of V with fewer thn n elements cnnot spn Proof () Suppose {w,w 2,,w m } is suset of V, nd tht m > n I wnt to show tht {w,w 2,,w m } is dependent Write ech w s liner comintion of the v s: w = v + 2 v n v n w 2 = 2 v + 22 v n v n w m = m v + m2 v mn v n This cn e represented s the following mtrix eqution: w w 2 w m 2 m v v 2 v n 2 22 m2 n 2n mn 3
4 Since m > n, the mtrix of s hs more columns thn rows Therefore, the following system hs nontrivil solution x =, x 2 = 2, x m = m : 2 m x 2 22 m2 x 2 n 2n mn x m Tht is, not ll the s re, ut 2 m 2 22 m2 2 n 2n mn m But then 2 m w w 2 w m 2 v v 2 v n 2 22 m2 2 n 2n mn m Therefore, In eqution form, m w w 2 w m 2 m w + 2 w m w m = This is nontrivil liner comintion of the w s which dds up to, so the w s re dependent () Suppose tht {w,w 2,,w m } is set of vectors in V nd m < n I wnt to show tht {w,w 2,,w m } does not spn V Suppose on the contrry tht the w s spn V Then ech v cn e written s liner comintion of the w s: v = w + 2 w m w m v 2 = 2 w + 22 w m w m v n = n w + n2 w nm w m In mtrix form, this is 2 n v v 2 v n w w 2 w m 2 22 n2 m 2m nm Since n > m, the coefficient mtrix hs more columns thn rows Hence, the following system hs nontrivil solution x =, x 2 = 2, x n = n : 2 n x 2 22 n2 x 2 m 2m nm x n 4
5 Thus, 2 n 2 22 n2 2 m 2m nm n Multiplying the v nd w eqution on the right y the vector gives v v 2 v n 2 2 n w w 2 w m 2 22 n2 2 m 2m nm n n Hence, In eqution form, this is v v 2 v n 2 n v + 2 v n v n = Since not ll the s re, this is nontrivil liner comintion of the v s which dds up to contrdicting the independence of the v s This contrdiction mens tht the w s cn t spn fter ll Exmple The stndrd sis for R 3 contins 3 vectors Hence, the following set of four vectors cn t e independent:, 2 3,, 7 Likewise, the following set of two vectors cn t spn R 3 : 2, Corollry If {v,,v n } is sis for vector spce V, then every sis for V hs n elements Proof If {w,,w m } is nother sis for V, then m cn t e less thn n or {w,,w m } couldn t spn Likewise, m cn t e greter thn n or {w,,w m } couldn t e independent Therefore, m = n The Corollry shows tht the dimension of finitedimensionl vector spce is welldefined tht is, in finitedimensionl vector spce, ny two ses hve the sme numer of elements This is true in generl; I ll stte the relevnt results without proof () Every vector spce hs sis The proof requires settheoretic result clled Zorn s Lemm () Two ses for ny vector spce hve the sme numer of elements Specificlly, if B nd C re ses for vector spce V, there is ijective function f : B C 5
6 I ve lredy given one exmple of n infinite sis: {,x,x 2,x 3,} This set is sis for the vector spce R[x] of polynomils with rel coefficients over the field of rel numers The next result shows tht, in principle, you cn construct sis y: () Strting with n independent set nd dding vectors () Strting with spnning set nd removing vectors Theorem Let V e vector spce () Any set of independent vectors is suset of sis for V () Any spnning set for V contins suset which is sis Prt () mens tht if S is n independent set, then there is sis T such tht S T (If S ws sis to egin with, then S = T) Prt () mens tht if S is spnning set, then there is sis T such tht T S Proof I ll only give the proof in the cse where V hs finite dimension n, though it is true for ny vector spce () Let {v,,v m } e independent If this set spns V, it s sis, nd I m done Otherwise, there is vector v V which is not in the spn of {v,,v m } I clim tht {v,v,,v m } is independent Suppose Suppose Then I cn write v + v + + m v m = v = ( v + + m v m ) Since v hs een expressed s liner comintion of the v k s, it s in the spn of the v k s, contrry to ssumption Therefore, this cse is ruled out The only other possiility is = Then v + + m v m =, so independence of the v k s implies = = m = Therefore, {v,v,,v m } is independent I cn continue dding vectors in this wy until I get set which is independent nd spns sis The process must terminte, since no independent set in V cn hve more thn n elements () Suppose {v,,v m } spns V I wnt to show tht some suset of {v,,v m } is sis If {v,,v m } is independent, it s sis, nd I m done Otherwise, there is nontrivil liner comintion v + + m v m = Assume without loss of generlity tht Then v = ( 2 v m v m ) Since v is liner comintion of the other v s, I cn remove it nd still hve set which spns V: V = (v 2,,v m ) I continue throwing out vectors in this wy until I rech set which spns nd is independent sis The process must terminte, ecuse no set contining fewer thn n vectors cn spn V 6
7 It s possile to crry out the dding vectors nd removing vectors procedures in some specific cses The lgorithms re relted to those for finding ses for the row spce nd column spce of mtrix, which I ll discuss lter Suppose you know sis should hve n elements, nd you hve set S with n elements ( the right numer ) To show S is sis, you only need to check either tht it is independent or tht it spns not oth I ll justify this sttement, then show y exmple how you cn use it I need preliminry result Proposition Let V e finite dimensionl vector spce over field F, nd let W e suspce of V If dimw = dimv, then V = W Proof Suppose dimw = dimv = n, ut V W I ll show tht this leds to contrdiction Let {x,x 2,,x n } e sis for W Suppose this is not sis for V Since it s n independent set, the previous result shows tht I cn dd vectors y, y 2, y m to mke sis for V: {x,x 2,,x n,y,y 2,y m } But this is sis for V with more thn n elements, which is impossile Therefore, {x,x 2,,x n } is lso sis for V Let x V Since {x,x 2,,x n } spns V, I cn write x s liner comintion of the elements of {x,x 2,,x n }: x = x + 2 x n x n, i F But since x, x 2, x n re in W nd W is suspce, ny liner comintion of x, x 2, x n must e in W Thus, x W Since x ws n ritrry element of V, I get V W, so W = V You might e thinking tht this result is ovious: W nd V hve the sme dimension, nd you cn t hve one thing inside nother, with oth things hving the sme size, unless the things re equl This is intuitively wht is going on here, ut this kind of intuitive resoning doesn t lwys work For exmple, the even integers re suset of the integers nd, s infinite sets, oth re of the sme order of infinity (crdinlity) But the even integers ren t ll of the integers: There re odd integers s well Corollry Let S e set of n vectors in n ndimensionl vector spce V () If S is independent, then S is sis for V () If S spns V, then S is sis for V Proof () Suppose S is independent Consider W, the spn of S Then S is independent nd spns W, so S is sis for W Since S hs n elements, dimw = n But W V nd dimv = n By the preceding result, V = W Hence, S spns V, nd S is sis for V () Suppose S spns V Suppose S is not independent By n erlier result, I cn remove some elements of S to get set T which is sis for V But now I hve sis T for V with fewer thn n elements (since I removed elements from S, which hd n elements) This is contrdiction, nd hence S must e independent Exmple Show tht the following set is sis for R 3 :,, 2 7
8 Since I hve 3 vectors in R 3 (which hs dimension 3), I only need to show tht the set is independent So suppose x +y +z 2 This gives the mtrix eqution 2 x y z Solve the system y rowreduction: 2 The solution is x =, y =, nd z = Hence, the set is independent, nd the preceding result shows tht it s sis Note: You could lterntively show tht the set spns To do this, you d show tht for n ritrry (,,c) R 3, you cn solve the following system for x, y, nd z in terms of,, nd c: x +y +z 2 c You cn see it s lmost the sme thing, ut this will e little messier thn checking independence c 25 y Bruce Ikeng 8
Lecture 2e Orthogonal Complement (pages )
Lecture 2e Orthogonl Complement (pges ) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationpadic Egyptian Fractions
padic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Setup 3 4 pgreedy Algorithm 5 5 pegyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More information308K. 1 Section 3.2. Zelaya Eufemia. 1. Example 1: Multiplication of Matrices: X Y Z R S R S X Y Z. By associativity we have to choices:
8K Zely Eufemi Section 2 Exmple : Multipliction of Mtrices: X Y Z T c e d f 2 R S X Y Z 2 c e d f 2 R S 2 By ssocitivity we hve to choices: OR: X Y Z R S cr ds er fs X cy ez X dy fz 2 R S 2 Suggestion
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationElementary Linear Algebra
Elementry Liner Algebr Anton & Rorres, 1 th Edition Lecture Set 5 Chpter 4: Prt II Generl Vector Spces 163 คณ ตศาสตร ว ศวกรรม 3 สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา 1/2555 163 คณตศาสตรวศวกรรม 3 สาขาวชาวศวกรรมคอมพวเตอร
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationThings to Memorize: A Partial List. January 27, 2017
Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors  Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3dimensional vectors:
Vectors 1232018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2dimensionl vectors: (2, 3), ( )
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationMatrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24
Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4305 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationMath Lecture 23
Mth 8  Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville  D. Keffer, 5/9/98 (updted /) Lecture 8  Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More informationLecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities RentHep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationMatrices and Determinants
Nme Chpter 8 Mtrices nd Determinnts Section 8.1 Mtrices nd Systems of Equtions Objective: In this lesson you lerned how to use mtrices, Gussin elimintion, nd GussJordn elimintion to solve systems of liner
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationalong the vector 5 a) Find the plane s coordinate after 1 hour. b) Find the plane s coordinate after 2 hours. c) Find the plane s coordinate
L8 VECTOR EQUATIONS OF LINES HL Mth  Sntowski Vector eqution of line 1 A plne strts journey t the point (4,1) moves ech hour long the vector. ) Find the plne s coordinte fter 1 hour. b) Find the plne
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationRudimentary Matrix Algebra
Rudimentry Mtrix Alger Mrk Sullivn Decemer 4, 217 i Contents 1 Preliminries 1 1.1 Why does this document exist?.................... 1 1.2 Why does nyone cre out mtrices?................ 1 1.3 Wht is mtrix?...........................
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationGeneralized Fano and nonfano networks
Generlized Fno nd nonfno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for contextfree grmmrs
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More informationChapter 2. Determinants
Chpter Determinnts The Determinnt Function Recll tht the X mtrix A c b d is invertible if dbc0. The expression dbc occurs so frequently tht it hs nme; it is clled the determinnt of the mtrix A nd is
More informationDEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.
398 CHAPTER 11 ORTHOGONAL FUNCTIONS AND FOURIER SERIES 11.1 ORTHOGONAL FUNCTIONS REVIEW MATERIAL The notions of generlized vectors nd vector spces cn e found in ny liner lger text. INTRODUCTION The concepts
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationFinite Automatacont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automtcont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationFirst Midterm Examination
2425 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More informationHere we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.
Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous
More informationCM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationChapter 6 Techniques of Integration
MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationDefinite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls 5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the lefthnd
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationPARTIAL FRACTION DECOMPOSITION
PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion
More informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationHomework Solution  Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution  et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte nonfinl.
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2 elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationDesigning Information Devices and Systems I Spring 2018 Homework 7
EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Selfgrdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationQuadratic reciprocity
Qudrtic recirocity Frncisc Bozgn Los Angeles Mth Circle Octoer 8, 01 1 Qudrtic Recirocity nd Legendre Symol In the eginning of this lecture, we recll some sic knowledge out modulr rithmetic: Definition
More informationName Ima Sample ASU ID
Nme Im Smple ASU ID 2468024680 CSE 355 Test 1, Fll 2016 30 Septemer 2016, 8:359:25.m., LSA 191 Regrding of Midterms If you elieve tht your grde hs not een dded up correctly, return the entire pper to
More informationAP Calculus Multiple Choice: BC Edition Solutions
AP Clculus Multiple Choice: BC Edition Solutions J. Slon Mrch 8, 04 ) 0 dx ( x) is A) B) C) D) E) Divergent This function inside the integrl hs verticl symptotes t x =, nd the integrl bounds contin this
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
More informationOrthogonal Polynomials
Mth 4401 Gussin Qudrture Pge 1 Orthogonl Polynomils Orthogonl polynomils rise from series solutions to differentil equtions, lthough they cn be rrived t in vriety of different mnners. Orthogonl polynomils
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums  1 Riemnn
More informationThe area under the graph of f and above the xaxis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the xxis etween nd is denoted y f(x) dx nd clled the
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 25pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More informationSection 4: Integration ECO4112F 2011
Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic
More informationIntroduction To Matrices MCV 4UI Assignment #1
Introduction To Mtrices MCV UI Assignment # INTRODUCTION: A mtrix plurl: mtrices) is rectngulr rry of numbers rrnged in rows nd columns Exmples: ) b) c) [ ] d) Ech number ppering in the rry is sid to be
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors PreChpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X Section 4.4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether  is root of 0. Show
More informationDeterminants Chapter 3
Determinnts hpter Specil se : x Mtrix Definition : the determinnt is sclr quntity defined for ny squre n x n mtrix nd denoted y or det(). x se ecll : this expression ppers in the formul for x mtrix inverse!
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More information