Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
|
|
- Robert Hill
- 5 years ago
- Views:
Transcription
1 Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner lger, we study suh sets nd develop tools to nlyze them. We will ll these sets vetor spes. 3.1 Imges nd Imge Arithmeti We noted in Chpter 2 tht if you dd two imges, you get new imge, nd tht if you multiply n imge y slr, you get new imge. We sw tht retngulr pixelted imge n e represented s n rry of vlues, or equivlently, s retngulr rry of grysle pthes. This is very nturl ide in the ontext of digitl photogrphy. Rell the definition of n imge given in Chpter 2. We repet it here, nd follow the definition y some exmples of imges with different geometri rrngements. Definition An imge is finite ordered list of rel vlues with n ssoited geometri rrngement. Four exmples of rrys long with n index system speifying the order of pthes n e seen in Figure 3.1. As n imge, eh pth would lso hve numeril vlue inditing the rightness of the pth (not shown in the figure). The first is regulr pixel rry ommonly used for digitl photogrphy. The seond is hexgon pttern whih lso niely tiles plne. 33
2 34 CHAPTER 3. VECTOR SPACES The third is mp of the Afrin ontinent nd Mdgsr sudivided y ountry. The fourth is squre pixel set with enhned resolution towrd the enter of the field of interest. It should e ler from the definition tht imges re not mtries. Only the first exmple might e onfused with mtrix. We first fix prtiulr geometri rrngement of pixels (nd let n denote the numer of pixels in the rrngement). Then n imge is preisely desried y its (ordered) intensity vlues. With this determined, we formlize the notions of slr multiplition nd ddition on imges tht were developed in the previous hpter. Definition Given two imges x nd y with (ordered) intensity vlues (x 1, x 2,, x n ) nd (y 1, y 2,, y n ), respetively, nd the sme geometry; the imge sum, written z x + y is the imge with intensity vlues z i x i + y i for ll i {1, 2,, n}, nd the sme geometry. Hene, the sum of two imges is the imge tht results from pixel-wise ddition of intensity vlues. Put nother wy, the sum of two imges is the imge tht results from dding orresponding vlues of their ordered lists. Definition Given slr α nd imge x with (ordered) intensity vlues (x 1, x 2,, x n ), the slr produt, written z αx is the imge with intensity vlues z i αx i for ll i {1, 2,, n}, nd the sme geometry. A slr times n imge is the imge tht results from pixel-wise slr multiplition. Tht is, slr times n imge is the imge whih results from multiplition of eh of the vlues in the ordered list y tht slr. We found tht these si rithmeti opertions on imges led to key property: ny omintion of rithmeti opertions on imges results in n imge of the sme onfigurtion. In other words, dding two imges lwys yields n imge, nd multiplying n imge y slr lwys yields n imge. We formlize this notion with the onept of losure:
3 3.1. IMAGES AND IMAGE ARITHMETIC 35 Figure 3.1: Exmples of imge rrys. Numers indite exmple pixel ordering.
4 36 CHAPTER 3. VECTOR SPACES Definition Consider set of ojets X with slrs tken from R, nd opertions of ddition (+) nd slr multiplition ( ) defined on X. We sy tht X is losed under ddition if x + y X for ll x, y X. We sy tht X is losed under slr multiplition if α x X for eh x X nd eh α R. Let I m n denote the set of ll m n retngulr imges. We see tht the set I 4 4 (imges used in Chpter 2) is losed under ddition nd slr multiplition. This rithmeti with imges in I 4 4 lso stisfies numer of other nturl properties: (Commuttivity of imge ddition.) If I A nd I B re imges in I 4 4, then I A + I B I B + I A. For exmple, + +. Imge A Imge B Imge B Imge A (Assoitivity of imge ddition.) If I A, I B, nd I C re imges in I 4 4, then (I A + I B ) + I C I A + (I B + I C ). For exmple, Imge A Imge B Imge C Imge A Imge B Imge C (Assoitivity of slr multiplition.) If α, β R nd I I 4 4, then α (β I) (αβ) I, e.g., Imge A Imge A (Distriutivity of Slr Multiplition over Imge Addition) If α R nd I A, I B I 4 4, then α (I A + I B ) α I A + α I B, e.g., Imge A Imge B Imge A Imge B
5 3.2. VECTORS AND VECTOR SPACES 37 (Additive identity imge.) There is zero imge in I 4 4 the imge tht hs every pixel intensity equl to zero. The sum of the zero imge nd ny other imge I is just I. (Additive inverses.) For every imge I I 4 4, there is n imge J so tht the sum I +J is just the zero imge. (Rell tht the set of imges inlude those tht n e ptured y your mer, ut there re mny more, some with negtive pixel intensities s well.) (Multiplitive identity.) For ny imge I I 4 4 the slr produt 1 I I. The ft tht the spe I 4 4 of 4 4 hs these properties will enle us to develop tools for working with imges. In ft, we will e le to develop tools for ny set (nd field of slrs) tht stisfies these properties. We will ll suh sets vetor spes. 3.2 Vetors nd Vetor Spes In the lst setion, we sw tht the set of 4 4 imges, together with rel slrs, stisfies severl nturl properties. There re in ft mny other sets of ojets tht lso hve these properties. One lss of ojets with these properties re the vetors tht you my hve seen in ourse in multivrile lulus or physis. In those ourses, vetors re ojets with fixed numer, sy n, of vlues put together into n ordered tuple. Tht is, the word vetor my ring to mind something tht looks like,,,,, or 1, 2,..., n. Mye you ve even seen things like ny of the following (, ), (,, ), ( 1, 2,..., n ), lled vetors s well. In this setion, we generlize the notion of vetor. In prtiulr, we will understnd tht imges nd other lsses of ojets n e vetors in n pproprite ontext. When we onsider ojets like rin imges, rdiogrphs or het stte signtures, it is often useful to understnd them s,, 1 2. n, 1 2. n
6 38 CHAPTER 3. VECTOR SPACES olletions hving ertin nturl mthemtil properties. Indeed, we will develop mthemtil tools tht n e used on ll suh sets, nd these tools will e instrumentl in omplishing our pplition tsks. We hven t yet mde the definition of vetor spe (or even vetor) rigorous. We still hve some more setup to do. In this text, we will use two slr fields 1 :R nd Z 2. Z 2 is the two element (or inry) set {0, 1} with ddition nd multiplition omputed modulo 2. Here, ddition omputed modulo 2, mens tht: , , nd Multiplition modulo 2 works s we expet: 0 0 0, , nd We n think of the two elements s on nd off nd the opertions s inry opertions. If we dd 1, we flip the swith nd if we dd 0, we do nothing. Notie tht Z 2 is losed under slr multiplition nd vetor ddition. 1 The definition of field n e found in Appendix F. The importnt thing to rememer out fields (for this liner lger ourse) is tht there re two opertions (typilly ddition nd multiplition) tht stisfy properties we usully see with rel numers.
7 3.2. VECTORS AND VECTOR SPACES 39 Definition Consider set V over field F (either R or Z 2 ) with given definitions for ddition (+) nd slr multiplition ( ). V with + nd is lled vetor spe over F if for ll u, v, w V nd for ll α, β F, the following ten properties hold. (P1) Closure Property for Addition u + v V. (P2) Closure Property for Slr Multiplition α v V. (P3) Commuttive Property for Addition u + v v + u. (P4) Assoitive Property for Addition (u+v)+w u+(v +w). (P5) Assoitive Property for Slr Multiplition α (β v) (αβ) v. (P6) Distriutive Property of Slr Multiplition Over Vetor Addition α (u + v) α u + α v. (P7) Distriutive Property of Slr Multiplition Over Slr Addition (α + β) v α v + β v. (P8) Additive Identity Property V ontins the dditive identity, denoted 0 so tht 0 + v v + 0 v. (P9) Additive Inverse Property V ontins dditive inverses z so tht v + z 0. (P10) Multiplitive Identity Property for Slrs The slr set F hs n identity element, denoted 1, for slr multiplition tht hs the property 1 v v. Note: In Definition 3.2.1, we lel the properties s (P1)-(P10). It should e noted tht though we use this leling in other ples in this text, these lels re not stndrd. This mens tht the reder should fous more on the property desription nd nme rther thn the leling.
8 40 CHAPTER 3. VECTOR SPACES Definition Given vetor spe (V, +, ) over F. We sy tht v V is vetor. Tht is, elements of vetor spe re lled vetors. Note: In this text, we will use ontext to indite vetors with letter, suh s v or x. In some ourses nd textooks, vetors re denoted with n rrow over the nme, v, or with old type, v. We will disuss mny vetor spes for whih there re opertions nd fields tht re typilly used. For exmple, the set of rel numers R is set for whih we hve ommon understnding out wht it mens to dd nd multiply. For these vetor spes, we ll the opertions the stndrd opertions nd the field is lled the stndrd field. So, we might typilly sy tht R, with the stndrd opertions, is vetor spe over itself. Wth Your Lnguge! Notie tht the lnguge used to speify vetor spe requires tht we stte the set V, the two opertions + nd, nd the field F. We mke this ler with nottion nd/or in words. Two wys to ommunite this re (V, +, ) is vetor spe over F. or V with the opertions + nd is vetor spe over the field F. We should not sy (unless miguity hs een removed) V is vetor spe. Definition is so importnt nd hs so mny piees tht we will tke the time to present mny exmples in this hpter nd the next hpter. As we do so, onsider the following. The identity element for slr multiplition need not e the numer 1. The zero vetor need not e (nd in generl is not) the numer 0. The elements of vetor spe re lled vetors ut need not look like the vetors presented ove.
9 3.2. VECTORS AND VECTOR SPACES 41 Exmple The set of 4 4 imges I 4 4 stisfies properties (P1)-(P10) of vetor spe. Exmple Let us onsider the set 1 R 3 2 1, 2, 3 R. 3 This mens tht R 3 is the set of ll ordered triples where eh entry in the triple is rel numer. We n show tht R 3 is lso vetor spe over R with ddition nd slr multiplition defined omponent-wise. This mens tht, for,,, d, f, g, α R, + d f g + d + f + g nd α α α α We show this y verifying tht eh of the ten properties of vetor spe re true for R 3 with ddition nd slr multiplition defined this wy. Proof. Let u, v, w R 3 nd let α, β R.,,, d, f, g, h, k, nd l so tht u, v d f g. Then, there re rel numers, nd w We will show tht properties (P1)-(P10) from Definition hold. We first show the two losure properties. (P1) Now sine R is losed under ddition, we n sy tht + d, + f, nd + g re rel numers. So, u + v + Thus, R 3 is losed under ddition. d f g + d + f + g h k l. R 3.
10 42 CHAPTER 3. VECTOR SPACES (P2) Sine R is losed under slr multiplition, we n sy tht α, α, nd α re rel numers. So α α v α α R 3. α Thus, R 3 is losed under slr multiplition. (P3) Now, we show tht the ommuttive property of ddition holds in R 3. Using the ft tht ddition on R is ommuttive, we see tht d + d d + u + v + f + f f + v + u. g + g g + Therefore, ddition on R 3 is ommuttive. (P4) Using the ssoitive property of ddition on R, we show tht ddition on R 3 is lso ssoitive. Indeed, we hve ( + d) + h + (d + h) (u + v) + w ( + f) + k + (f + k) u + (v + w). ( + g) + l + (g + l) So, ddition on R 3 is ssoitive. (P5) Sine slr multiplition on R is ssoitive, we see tht α (β ) (αβ) α (β v) α (β ) (αβ) (αβ) v. α (β ) (αβ) Thus, slr multiplition on R 3 is ssoitive. (P6) Sine property (P6) holds for R, we hve tht α ( + d) α + α d α (u + v) α ( + f) α + α f α ( + g) α + α g α u + α v. Thus, slr multiplition distriutes over vetor ddition for R 3.
11 3.2. VECTORS AND VECTOR SPACES 43 (P7) Next, using the ft tht (P7) is true on R, we get (α + β) α + β (α + β) v (α + β) (α + β) α + β α + β α v + β v. This mens tht, slr multiplition distriutes over slr ddition for R 3 s well. (P8) Using the dditive identity 0 R, we form the vetor R 3 0. This element is the dditive identity in R 3. Indeed, v Therefore property (P8) holds for R 3. (P9) We know tht,, nd re the dditive inverses in R of,, nd, respetively. Using these, we n form the vetor w R 3. We see tht w is the dditive inverse of v s + ( ) 0 v + w + ( ) + ( ) 0 0 Thus, property (P9) is true for R (P10) Finlly, we use the multiplitive identity, 1 R. Indeed, 1 1 v 1 v. 1 d
12 44 CHAPTER 3. VECTOR SPACES Now, euse ll ten properties from Definition hold true for R 3, we know tht R 3 with omponent-wise ddition nd slr multiplition, is vetor spe over R. Notie tht in the ove proof, mny of the properties esily followed from the properties on R nd did not depend on the requirement tht vetors in R 3 were mde of ordered triples. In most ses person would not go through the exruiting detil tht we did in this proof. Beuse the opertions re omponent-wise defined nd the omponents re elements of vetor spe, we n shorten this proof to the following proof. Alternte Proof (for Exmple 3.2.2). Suppose R 3 is defined s ove with ddition nd slr multiplition defined omponent-wise. By definition of the opertions on R 3, the losure properties (P1) nd (P2) hold true. Notie tht ll opertions our in the omponents of eh vetor nd re the stndrd opertions on R. Therefore, sine R with the stndrd opertions is vetor spe over itself, properties (P3)-(P10) re ll inherited from R. Thus R 3 with omponent-wise ddition nd slr multiplition is vetor spe over R. In this proof, we sid,...properties (P3)-(P10) re ll inherited from R to indite tht the justifition for eh vetor spe property for R 3 is just repeted use (in eh omponent) of the orresponding property for R. Exmple Beuse neither proof relied on the requirement tht elements of R 3 re ordered triples, we see tht very similr proof would show tht for ny n N, R n is vetor spe over the slr field R. Here R n is the set of ordered n-tuples. Cution: There re instnes where vetor spe hs omponents tht re elements of vetor spe, ut not ll elements of this vetor spe re llowed s omponent nd the lternte proof does not work. Exmple Let T { R 0}. Now, onsider the set 1 T 3 2 1, 2, 3 T 3
13 3.2. VECTORS AND VECTOR SPACES 45 with ddition nd slr multiplition defined omponent-wise. Notie tht ll omponents of T 3 re rel numers euse ll elements of T re rel numers. But T does not inlude the rel numer 0 nd this mens T 3 is not vetor spe over the field R. Whih property fils? Exerise 3 sks you to nswer this question. Exmple does not simplify the story either. Cn you think of vetor spe over R, mde of ordered n-tuples, with ddition nd slr multiplition defined omponent wise, whose omponents re in R, nd there re restritions on how the omponents n e hosen? Exerise 7 sks you to explore this nd determine whether or not it is possile. The opertions re themselves very importnt in the definition of vetor spe. Notie tht if we define different opertions on set, the struture of the vetor spe, inluding identity nd inverse elements n e different. Exmple Let us onsider gin the set of rel numers, R, ut with different opertions. Define the opertion ( ) to e multiplition (u v uv) nd defined to e exponentition (α u u α ). Notie tht is ommuttive ut is not. We show tht (R,, ) is not vetor spe over R. (P1) We know tht when we multiply two rel numers, we get rel numer, thus R is losed under nd this property holds. (P2) However, R is not losed under. For exmple, (1/2) ( 1) ( 1) 1/2 1 is not rel numer. Sine property (P2) does not hold, we do not need to ontinue heking the remining eight properties. To emphsize how the definition of the opertions n hnge vetor spe, we offer more exmples. Exmple Let V R 2. Let ( nd ) e ( defined ) s inry opertions on V in the following wy. If u, v V nd α R (the d slr set), then u v ( d 1 Then, (v,, ) is vetor spe over R. ) nd α u ( α + 1 α α + 1 α ).
14 46 CHAPTER 3. VECTOR SPACES k Proof. Let u, v, w V nd α, β R nd d l define nd s ove. We will show tht ll 10 properties given in Definition re true. We egin with the losure properties. (P1) Notie tht sine,,, d R then + 1, + d 1 R. u v R 3. Thus, R 3 is losed under ddition,. So, (P2) Notie lso tht α + 1 α, α + 1 β R, mking α u V. So, V is losed under slr multiplition,. Next, we show the ssoitive nd ommuttive properties. (P3) Notie tht + 1 u v + d d + 1 v u. Thus, is ommuttive opertion. (P4) We show the ssoitive property of, using the ssoitivity nd ommuttivity of ddition in R, s follows: + 1 k (u v) w + d 1 l ( + 1) + k 1 ( + d 1) + l 1 + ( + k 1) 1 + (d + l 1) 1 + k 1 u d + l 1 u (v w).
15 3.2. VECTORS AND VECTOR SPACES 47 (P5) Agin, using severl vetor spe properties for (R, +, ) (n you nme them?) we see tht β + 1 β α (β u) α β + 1 β α(β + 1 β) + 1 α α(β + 1 β) + 1 α αβ + 1 αβ αβ + 1 αβ (αβ) u. Therefore, slr multiplition ( ) is n ssoitive opertion. Using distriutive, ssoitive, nd ommuttive lws for (R, +, ), we show tht the distriutive lws hold true for (V,, ).. (P6) Indeed, notie tht + 1 α (u v) α + d 1 α( + 1) + 1 α α( + d 1) + 1 α α + 1 α + α + 1 α 1 αα + 1 α + αd + 1 α 1 α + 1 α α + 1 α α + 1 α αd + 1 α α u α v. Therefore distriutes over. (P7) Notie, lso, tht (α + β) + 1 (α + β) (α + β) u (α + β) + 1 (α + β) α + β + 1 α β α + β + 1 α β α + 1 α + β β α + 1 α + β β + 1 1
16 48 CHAPTER 3. VECTOR SPACES ( α + 1 α α + 1 α α u β u. ) Thus, distriutes over slr ddition. ( β β + 1 β β + 1 Finlly, we prove the existene of inverses nd identities. (P8) We will find the element z V so tht u z u for every u V. 1 Suppose we let z V. We will show tht z is the dditive 1 identity. Indeed, 1 u z. 1 Thus the dditive identity is, in ft, z. Therefore, property (P8) holds true. (P9) Now, sine u V, we ( will find ) the dditive inverse, ll it ũ so tht 2 u ũ z. Let ũ. We will show tht ũ is the dditive 2 inverse of u. Notie tht u ũ Therefore, u ũ z. Thus, every element of V hs n dditive inverse. (P10) Here, we will show tht 1 R is the multiplitive identity. Indeed, u Therefore, property (P10) holds for (V,, ). Beuse ll 10 properties from Definition hold true for (V,, ), we know tht (V,, ) is vetor spe over R. Exmple Let V R n nd z fixed element of V. For ritrry elements x nd y in V nd ritrry slr α in R, define vetor ddition ( ) nd slr multiplition ( ) s follows: x y x + y z, nd α x α(x z) + z. The set with inry opertions (V,, ) is vetor spe over R (see Exerise 2). )
17 3.3. THE GEOMETRY OF THE VECTOR SPACE R 3 49 Exmple Consider the set V R 2. Let ( 1, 2 ) nd ( 1, 2 ) e in V nd α in R. Define vetor ddition nd slr multiplition s follows: ( 1, 2 ) + ( 1, 2 ) ( 1 + 1, 0), nd α ( 1, 2 ) (α 1, α 2 ). Then V with these opertions is not vetor spe (see Exerise 5). 3.3 The Geometry of the Vetor Spe R 3 We n visulize the vetor spe R 3, with the stndrd opertions nd field, in 3D spe. This mens tht we n represent vetor in R 3 with n rrow. For exmple, the vetor v n e represented y the rrow pointing from the origin (the 0 vetor) to the point (,, ) s on the left in Figure 3.2. It n lso e represented s n rrow strting from ny other vetor in R 3 nd pointing towrd point units in the x diretion, units in the y diretion, nd units in the z diretion wy from the strt. (See Figure 3.2 (right).) The nturl question rises: Wht do the v d f g v (d +, f +, g + ) Figure 3.2: Visulizing vetor in R 3 vetor spe properties men in the geometri ontext? In this setion, we will disuss the geometry of some of the vetor spe properties. The rest, we leve for the exerises. Note The geometry we disuss here trnsltes niely to the vetor spe R n (for ny n N) with stndrd opertions nd field.
18 50 CHAPTER 3. VECTOR SPACES (P1) The Geometry of Closure under Addition To understnd wht it mens geometrilly tht R 3 is losed under ddition, we need to egin y understnding ddition geometrilly. Using the definition of ddition, we know tht if d v nd u f g then v + u + d f + g +. Tht is, v + u is the vetor tht n e represented y n rrow strting t 0 nd pointing towrd the point (d +, f +, g + ). Geometrilly, this is the sme s representing u s n rrow strting t 0 nd the vetor v s n rrow strting t the end of u. We n see in Figure 3.3 tht the sum is the vetor tht strts t 0 (the strt of u) nd points to the end of v. Some desrie this s drwing tip to til euse the tip of u is touhing the til of v. (d +, f +, g + ) v v + u u Figure 3.3: Geometri representtion of vetor ddition in R 3 We see geometrilly tht if we trnslte vetor v long the vetor u, we n form new vetor tht ends t the point to where the tip of v trnslted.
19 3.3. THE GEOMETRY OF THE VECTOR SPACE R 3 51 (P2) The Geometry of Closure under Slr Multiplition e slr, then α α v α. α Let α Tht is, α v n e represented y n rrow strting t 0 nd ending t the point (α, α, α ). Now, if α > 1, this vetor points in the sme diretion s v, ut is longer. If α < 1, then α v still points in the sme diretion s v, ut is now shorter. Finlly, if α 1, it is the multiplitive identity nd α v v. These n e seen in Figure 5.3. β v v v α v Figure 3.4: Geometri representtion of vetor multiplition in R 3 (0 < α < 1 nd β > 1) Notie tht ny slr multiple of v is represented y n rrow tht points long the line pssing through the rrow representing v. Property (P2) sys tht R 3 ontins the entire line tht psses through the origin nd prllel to v. (P3) The Geometry of the Commuttive Property Notie tht if we trnslte v long the vetor u (see Figure 3.3) or we trnslte u long the vetor v (see Figure 3.5), the vetor formed will point towrd the sme point in R 3. Thus, the ommuttive property shows us tht geometrilly, it doesn t mtter in whih order we trverse the two vetors, we will still end t the sme terminl point. The remining seven vetor spes properties n lso e displyed through similr figures. We leve these remining interprettions in Exerise 6.
20 52 CHAPTER 3. VECTOR SPACES (d +, f +, g + ) v + u u g v f d Figure 3.5: Geometri representtion of the ommuttive property when ompring to Figure Properties of Vetor Spes We next present importnt nd interesting properties of vetor spes. These new ides will help guide our further explortions nd provide dditionl tools for distinguishing vetor spes from more generl sets. As you red through these properties, think out wht they men in the ontext of, sy, the vetor spe of imges, or ny of the vetor spes from the previous setion. Theorem If x, y, nd z re vetors in vetor spe (V, +, ) nd x + z y + z, then x y. Proof. Let x, y, nd z e vetors in vetor spe. Assume x + z y + z. We note tht there exists n dditive inverse of z, ll it z. We will show tht the properties given in Definition imply tht x y. Indeed, x x + 0 (P8) x + (z + ( z)) (P9) (x + z) + ( z) (P4) (y + z) + ( z) (ssumption) y + (z + ( z)) (P4)
21 3.4. PROPERTIES OF VECTOR SPACES 53 y + 0 (P9) y. (P8) Eh step in the preeding proof is justified y either the use of our initil ssumption or known property of vetor spe. The theorem lso leds us to the following orollry. Corollry The zero vetor in vetor spe is unique. Also, every vetor in vetor spe hs unique dditive inverse. Proof. We show tht the zero vetor is unique nd leve the reminder s Exerise 10. We onsider two ritrry zero vetors, 0 nd 0, nd show tht 0 0. We know tht 0+x x 0 +x. By Theorem 3.4.1, we now onlude tht 0 0. Therefore, the zero vetor is unique. The next two theorems stte tht whenever we multiply y zero (either the slr zero or the zero vetor), the result is lwys the zero vetor. Theorem Let (V, +, ) e vetor spe over F. 0 x 0 for eh vetor x V. Proof. Let (V, +, ) e vetor spe over the field F. Suppose x V. In Exerise 11, we show tht 0 x is the dditive identity in V. Theorem Let (V, +, ) e vetor spe over R. α 0 0 for eh slr α R. Proof. Assume (V, +, ) is vetor spe over R. Let α R e slr nd let 0 denote the zero vetor. To omplete this proof, we must show tht α 0 is the dditive identity. See exerise 12.
22 54 CHAPTER 3. VECTOR SPACES Theorem Let (V, +, ) e vetor spe over F. ( α) x (α x) α ( x) for eh α F nd eh x V. In this theorem it is importnt to note tht indites n dditive inverse, not to e onfused with negtive sign. Over the set of rel (or omplex) numers, the dditive inverse tully is the negtive vlue, while for vetor spes over other fields (inluding Z 2 ) this is not neessrily the se. The theorem sttes the equivlene of three vetors: 1. A vetor x multiplied y the dditive inverse of slr α, ( α) x, 2. The dditive inverse of the produt of slr α nd vetor x, (α x), nd 3. The dditive inverse of vetor x multiplied y slr α, α ( x). While these equivlenes my seem ovious in the ontext of rel numers, we must e reful to verify these properties using only the estlished properties of vetor spes. Proof. Let (V, +, ) e vetor spe over F. Let α F nd x V. We egin y showing ( α) x (α x). Notie tht ( α) x ( α) x + 0 (P8) ( α) x + (α x) + ( (α x)) (P9) ( α + α) x + ( (α x)) (P7) 0 x + ( (α x)) slr ddition 0 + ( (α x)) (Theorem 3.4.2) (α x) (P8) Therefore, ( α) x (α x). Exerise 13 gives us tht (α x) α ( x). Using trnsitivity of equlity, we know tht ( α) x (α x) α ( x). Of prtiulr interest is the speil se of α 1. We see tht ( 1) x x. Tht is, the dditive inverse of ny vetor x is otined y multiplying the dditive inverse of the multiplitive identity slr y the vetor x. 3.5 Exerises Skills Prtie
23 3.5. EXERCISES Let nd e defined on R so tht if, R nd + 1. Is (R,, ) vetor spe over R? Justify. 2. Show tht (V,, ) of Exmple is vetor spe over R. 3. In Exmple 3.2.4, we stted tht T 3 is not vetor spe. List ll properties tht fil to e true. Justify your ssertions. 4. Define nd on R so tht if, R, nd +. Is (R,, ) vetor spe over R? Justify. 5. Show tht the set V of Exmple is not vetor spe. 6. Drw similr geometri interprettions for the remining seven vetor spe properties not disussed in Setion 3.3. Additionl Exerises 7. Find vetor spe over R, mde of ordered n-tuples (you hoose n), with ddition nd slr multiplition defined omponent wise, whose omponents re in R, ut there re restritions on how the omponents n e hosen? 8. Consider the set R. Define vetor ddition nd slr multiplition so tht vetor spe property (P3) is true, ut property (P6) is flse. 9. Consider the set R. Define vetor ddition nd slr multiplition so tht vetor spe property (P6) is true, ut property (P7) is flse. 10. Prove tht every vetor in vetor spe hs unique dditive inverse to omplete the proof of Corollry Given tht (V, +, ) is vetor spe over F, show tht if x V then 0 x is the dditive identity in V. Hint: Strtegilly hoose vetor to dd to 0 x nd then use one of the distriutive properties. 12. Complete the proof of Theorem y proving the following sttement nd then employing Theorem from this hpter. Let (V, +, ) e vetor spe over R nd let 0 denote the dditive identity in V, then α 0 is the dditive identity for V.
24 56 CHAPTER 3. VECTOR SPACES 13. Complete the proof of Theorem y writing proof of the needed result. 14. Consider the set of grysle imges on the mp of Afri in Figure 3.1. Crete plusile senrio desriing the mening of pixel intensity. Imge ddition nd slr multiplition should hve resonle interprettion in your senrio. Desrie these interprettions.
1 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 information1.3 SCALARS AND VECTORS
Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd
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 informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
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 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 informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 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 2-dimensionl vectors: (2, 3), ( )
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More information5. Every rational number have either terminating or repeating (recurring) decimal representation.
CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationVectors. a Write down the vector AB as a column vector ( x y ). A (3, 2) x point C such that BC = 3. . Go to a OA = a
Streth lesson: Vetors Streth ojetives efore you strt this hpter, mrk how onfident you feel out eh of the sttements elow: I n lulte using olumn vetors nd represent the sum nd differene of two vetors grphilly.
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationPolynomials. Polynomials. Curriculum Ready ACMNA:
Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
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 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 informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More information12.4 Similarity in Right Triangles
Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right
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 informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationPre-Lie algebras, rooted trees and related algebraic structures
Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationINTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable
INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationLesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.
27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 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
More informationFigure 1. The left-handed and right-handed trefoils
The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationMath 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)
Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion
More informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationMaintaining Mathematical Proficiency
Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationFunctions. mjarrar Watch this lecture and download the slides
9/6/7 Mustf Jrrr: Leture Notes in Disrete Mthemtis. Birzeit University Plestine 05 Funtions 7.. Introdution to Funtions 7. One-to-One Onto Inverse funtions mjrrr 05 Wth this leture nd downlod the slides
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationPYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:
PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles
More informationLine Integrals and Entire Functions
Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series
More informationFor a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then
Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:
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 informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
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 informationLecture 1 - Introduction and Basic Facts about PDEs
* 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationGreen s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e
Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationSpacetime and the Quantum World Questions Fall 2010
Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationSection 3.6. Definite Integrals
The Clulus of Funtions of Severl Vribles Setion.6 efinite Integrls We will first define the definite integrl for funtion f : R R nd lter indite how the definition my be extended to funtions of three or
More informationInstructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.
ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s
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 informationBravais lattices and crystal systems
3 Brvis ltties nd rystl systems 3. Introdution The definitions of the motif, the repeting unit of pttern, nd the lttie, n rry of points in spe in whih eh point hs n identil environment, hold in three dimensions
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationCS241 Week 6 Tutorial Solutions
241 Week 6 Tutoril olutions Lnguges: nning & ontext-free Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend--- HEXINT 0xe I nd ER -- MINU - 3. 1234-120x INT 1234 INT -120 I x 4.
More informationVectors. Chapter14. Syllabus reference: 4.1, 4.2, 4.5 Contents:
hpter Vetors Syllus referene:.,.,.5 ontents: D E F G H I J K Vetors nd slrs Geometri opertions with vetors Vetors in the plne The mgnitude of vetor Opertions with plne vetors The vetor etween two points
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationVECTOR ALGEBRA. Syllabus :
MV VECTOR ALGEBRA Syllus : Vetors nd Slrs, ddition of vetors, omponent of vetor, omponents of vetor in two dimensions nd three dimensionl spe, slr nd vetor produts, slr nd vetor triple produt. Einstein
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More information2.4 Theoretical Foundations
2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level
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 informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
More informationCh. 2.3 Counting Sample Points. Cardinality of a Set
Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of
More informationTrigonometry Revision Sheet Q5 of Paper 2
Trigonometry Revision Sheet Q of Pper The Bsis - The Trigonometry setion is ll out tringles. We will normlly e given some of the sides or ngles of tringle nd we use formule nd rules to find the others.
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 informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationProportions: A ratio is the quotient of two numbers. For example, 2 3
Proportions: rtio is the quotient of two numers. For exmple, 2 3 is rtio of 2 n 3. n equlity of two rtios is proportion. For exmple, 3 7 = 15 is proportion. 45 If two sets of numers (none of whih is 0)
More informationLESSON 11: TRIANGLE FORMULAE
. THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.
More informationLecture 2: Fields, Formally
Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More information1.2 What is a vector? (Section 2.2) Two properties (attributes) of a vector are and.
Homework 1. Chpters 2. Bsis independent vectors nd their properties Show work except for fill-in-lnks-prolems (print.pdf from www.motiongenesis.com Textooks Resources). 1.1 Solving prolems wht engineers
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
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 informationHybrid Systems Modeling, Analysis and Control
Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More information