MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35"

Transcription

1 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 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. The proof will be in stges. On the first dy I decomposed module into torsion nd torsion-free prt. The presenttion ws little disorgnized so tht the steps do not follow one fter the other but rther the other wy round, i.e., to prove (1) we need to prove (2) nd to prove (2) we need to prove (3), etc. I cll this the motivtionl order. At the end we will go over the lemms nd put them in correct logicl order torsion nd torsion-free. Suppose tht R is PID nd M is finitely generted R-module. The min exmple I tlked bout ws R = Z in which cse M = G is f.g. belin group. Definition 9.1. M is torsion-free if nn(x) = 0 for ll x 0 in M. Definition 9.2. M is torsion if nn(x) 0 for ll x 0 in M. For exmple, R itself is torsion-free nd R/() is torsion. In the cse R = Z, Z n nd Q re torsion-free dditive groups. However, Q is not finitely generted. The finitely generted torsion belin groups re exctly the finite belin groups. The first decomposition theorem is the following. Theorem 9.3. Every f.g. module over PID is direct summnd of torsion module nd torsion-free module: M = tm fm where tm is torsion nd fm is torsion free. The second theorem tells us wht the torsion-free prt looks like: Theorem 9.4. A f.g. module over PID is torsion-free if nd only if it is free: fm = R n torsion submodule. I used two lemms to show tht the second theorem implies the first theorem. During the clss we decided tht these two lemms hold over ny domin. First I need definition. Definition 9.5. Suppose tht M is module over domin R. Then the torsion submodule of M is defined to be the set of ll elements of M with nonzero nnihiltor idel: tm := {x M nn(x) 0}

2 36 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES Lemm 9.6. tm is submodule of M provided tht R is domin. Proof. We need to show tht tm contins 0 nd is closed under ddition nd sclr multipliction. (1) 0 tm since nn(0) = R. (2) If x, y tm then there re nonzero elements, b R so tht x = by = 0. Then b(x + y) = 0. So, x + y tm. (3) If x tm nd r R then nn(rx) nn(x) is nonzero. In the second step we need to know tht b 0. Lemm 9.7. The quotient M/tM is torsion-free provided tht R is domin. Proof. Suppose not. Then there is nonzero element x + tm in M/tM nd 0 in R so tht x + tm is zero, i.e., x tm. But this mens there is nonzero element b R so tht bx = 0. But b 0. So, x tm which is contrdiction. It ws in this proof tht I mentioned the frction nottion: (tm : x) := { R x tm}. Next, I showed tht the second theorem (Theorem 9.4) implies the first (Theorem 9.3). Proof of Theorem 9.4. Let fm = M/tM. Since this is free, there is section s : fm M of the projection mp M M/tM. Then j s : tm fm M is n isomorphism where j : tm M is the inclusion mp. Next, we need to prove tht f.g. torsion-free modules re free nd tht f.g. torsion modules re direct sums of cyclic modules. I intend to use purity to do both pure submodules. Definition 9.8. We sy tht submodule N M is pure if whenever x M nd R with x N there exists z N so tht z = x. In other words: If n element of N is divisible by R in M then it is divisible by in N. The point is tht pure submodules re direct summnds in f.g. modules over PID s. However, using this fct is little tricky s we sw the next dy.

3 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 37 On the second dy I pointed out tht if P is pure submodule of f.g. module M over PID, then P is direct summnd. However, we cnnot use this fct to prove the min theorem becuse it uses the min theorem, nmely tht f.g. modules re direct sums of cyclic modules. However, we use the min theorem on module with fewer number of genertors thn M. So, this cn be used in n inductive proof of the min theorem. The theorem is: Theorem 9.9. Suppose tht P is pure submodule of f.g. module M over PID R nd M/P is direct sum of cyclic modules. Then P is direct summnd of M. Proof. Suppose tht M/P is direct summnd of cyclic modules. Then ech summnd is generted by some element x i + P with nnihiltor ( i ). This mens tht (x i : P ) = ( i ). In other words, i x i P. Since P is pure, there is n element z i P so tht i z i = i x i. But then x i + P = (x i z i ) + P nd i (x i z i ) = 0. So s i (x i +P ) = x i z i gives lifting s i : R/( i ) M of the direct summnd R/( i ) of M/P to M nd, together, these give n isomorphism ( si ) j : R/( i ) P M where j : P M is the inclusion mp. To find the pure submodule, I need to tke mximl cyclic submodule of M. This exists becuse M is Noetherin. So tht is next submodules of free modules. Theorem Suppose tht M = R n is free R-module with n genertors where R is PID. Then ny submodule of M is free with n or fewer genertors. Proof. This is by induction on n. If n = 1 then M = R nd the submodules re either R or n idel Rx. But R is domin. So, either x = 0 or nn(x) = 0. So, Rx is free with 0 or 1 genertor. Now suppose tht n 2 nd N is submodule of R n. Then we wnt to show tht N = R m where m n. Let e 1,, e n be the free genertors of M = R n. Let R n 1 denote the free submodule of M generted by e 1,, e n 1. Then, by induction on n, we hve: N R n 1 = R m 1

4 38 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES where m n. If N = N R n 1 we re done. Otherwise, let J be the set of ll e n coordintes of ll elements of N. I.e., { } n 1 J = R ( x N) x = e n + i e i We get t lest one nonzero element in J since N is not contined in R n 1. Then it is esy to see tht J is n idel (or ll of R) since it is closed under ddition nd sclr multipliction nd is nonempty. Therefore, J = (b) is generted by one element b 0. (So, every J hs the form = rb where r R is unique.) By definition, there is n element x 0 N so tht n 1 x 0 = be n + i e i. This cn be used to define homomorphism φ : (N R n 1 ) R N by φ(y, r) = y + rx 0. I clim tht φ is n isomorphism. To see tht φ is onto, tke ny element x N. Then x = e n + (some element of R n 1 ) where = rb. So, x rx 0 N R n 1 nd x = φ(x rx 0, r). To see tht φ is 1-1 suppose tht φ(y, r) = 0. Then y = rx 0. Looking t the lst coordinte this gives rb = 0 r = 0 y = 0. Therefore φ is n isomorphism. Its inverse gives: N = (N R n 1 ) R = R m 1 R = R m where m n. Corollry If M is n R-module generted by n elements then every submodule of M is generted by n elements. In prticulr, M is Noetherin. Proof. If M is generted by x 1,, x n then we hve n epimorphism φ : R n M given by φ( 1,, n ) = i x i. If N M then N is quotient of φ 1 N which is free on n genertors by the theorem.

5 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES mximl cyclic submodules. Since f.g. modules re Noetherin, they hve mximl cyclic submodules. This is becuse ny sequence of cyclic submodules: Rx 1 Rx 2 Rx 3 M must eventully stop. (If there were no mximl cyclic submodule, I could keep going forever.) Lemm Suppose tht M is torsion-free nd Rx M is mximl cyclic submodule. Then x / M for ny nonunit R. (I.e., x = z is unit.) Proof. Suppose tht x = z. Then Rx Rz. Since Rx is mximl cyclic, Rx = Rz which implies tht z = bx for some b R. So, x = z = bx which implies (b 1)x = 0. Since M is torsion-free, this implies tht b = 1, i.e., is unit. Lemm Every mximl cyclic submodule of torsion-free module is pure. Proof. Suppose tht Rx M is mximl cyclic submodule. Suppose there re elements y M, R so tht y Rx. Then y = bx. We need to show tht this is times n element of Rx. In other words, we wnt to show tht b ( divides b). This is the sme s sying tht b R. At this point I explined this equivlent formultion of divisibility. Since R is domin, it is contined in its field of frctions: R Q(R). The frction b is n element of Q(R). If b, then b = r for some r R nd b = r 1 R nd conversely. So, b b R. Let c R be the gretest common divisor of, b. I.e., (, b) = (c). Then c nd c b. I.e.,, b R nd c c c y = b c x since M is torsion-free. (c times the difference is zero. So, the difference is zero.) But (, b ) = (1), i.e., there exist s, t R so tht c c This implies tht 1 = c s + b c t. x = c sx + b c tx = c sx + c ty = (sx + ty) c

6 40 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES since bx = y. By the previous lemm, this implies tht c i.e., c R. So b = b c c R s desired. We need one more lemm. is unit, Lemm If P is pure submodule of torsion-free module M then M/P is torsion-free. Proof. Suppose not. Then there is nonzero element x + P M/P so tht (x + P ) = 0 + P. I.e., x P. But P is pure. So, there is z P so tht z = x. Then (x z) = 0 in M which implies tht x = z since M is torsion free. So, x + P = z + P = P is the zero element of M/P which is contrdiction. Now I m redy to prove Theorem 9.4: Finitely generted torsionfree modules over PID s re free, completing the proof tht M = tm fm = tm R n. Proof of Theorem 9.4. The proof is by induction on the number of genertors. If M hs one genertor x then M = Rx = R is free. So, suppose M hs n genertors x 1,, x n where n 2. Since Rx 1 is cyclic submodule of M it is contined in mximl cyclic submodule Rx. By Lemm 9.13, Rx is pure. By Lemm 9.14, this implies tht M/Rx is torsion-free. But M/Rx is generted by n 1 elements (the imges of the genertors x 2,, x n ). So, it is free, sy, M/Rx = R m. But this implies tht is lso free. M = Rx R m = R R m It remins to show tht the torsion submodule tm is lso direct sum of cyclic modules. I wnt to do the sme proof, nmely, since M is Noetherin, we cn find mximl cyclic submodule Rx. Since M/Rx will be generted by n 1 elements, it is sum of cyclic modules. After some stumbling, I decided I need more precise construction of mximl cyclic submodule. I took genertor with miniml nnihiltor. And this works the best for p-primry modules.

7 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES p-primry decomposition. p-primry modules re generliztions of belin p-groups. We showed tht finite nilpotent groups re products of their p-sylow subgroups. For finite belin groups nd, more generlly, for torsion modules over PID s, this is very esy to prove. It follows from the unique fctoriztion theorem. (I.e., every PID is UFD.) Definition An element x M is clled p-primry if it hs nnihiltor nn(x) = (p n ) for some n 0 where p R is irreducible. A module M is clled p- primry if every element is p-primry. (Note tht 0 M is p-primry for every p.) I should hve prove the following lemm first: Lemm If p n x = 0 where n 0 then x is p-primry. Proof. Suppose nn(x) = (). Then p n x = 0 implies tht p n = b for some b R. By unique fctoriztion this implies tht = up k where u is unit in R nd k n. But then nn(x) = (up k ) = (p k ). For modules over PID, the Sylow theorems re very esy to prove: Lemm The set of p-primry elements of ny module M over PID is submodule. Definition If p R is irreducible, let M p be the submodule of M consisting of ll p-primry elements of M. Proof. If x, y re nonzero p-primry elements of M then p n x = 0 nd p m y = 0. Then p n rx = 0 for ny r R nd p n+m (x+y) = 0. Therefore, rx nd x + y re p-primry by the lemm. Theorem Every torsion module M over PID is direct sum of p-primry modules: M = M p. p Proof. First choose irreducible elements p i so tht every irreducible element of R is up i for some unit u nd some unique p i. By the lemm, for ech of these irreducibles we hve submodule M pi M. By the universl property this gives homomorphism φ : M pi M I clim tht this is n isomorphism.

8 42 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES It follows from unique fctoriztion tht this mp is onto: Suppose x 0 M with nnihiltor nn(x) = (). Since M is torsion, 0. So = u where u is unit. Then, for ech i, i k i = up n 1 1 i p n k k R. There is no irreducible element of R which divides ech of these elements. This implies tht there re elements r i R so tht Apply this to x to get: where x = 1 = k r i k i r i x i = x = i i x. k r i x i is p i -primry since i x i = x = 0. This shows tht x = φ(r i x i ) i is in the imge of φ nd therefore φ is onto. To show tht φ is 1-1 suppose tht (x i ) i is in the kernel of φ. Then k x i = 0 where x i is p i -primry. Thus sum is finite since the direct sum is equl to the wek product. Suppose tht nn(x i ) = ( i ). Then the product p n 2 2 p n k k nnihiltes x 2,, x k nd therefore nnihiltes their sum x x k = x 1 This implies tht p n 2 2 p n k k (p n 1 1 ), i.e., p n 2 2 p n k k = p n 1 1 for some R. By unique fctoriztion this is only possible if n 1 = 0, i.e., x 1 = 0. The sme rgument shows tht x i = 0 for ll i. So, φ is monomorphism nd thus n isomorphism s climed.

9 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES decomposition of p-primry modules. Now we come to the finl step in the proof of the min theorem, nmely, I will prove tht every f.g. p-primry module is direct sum of cyclic modules. But first some lemms. Lemm Any quotient of p-primry module is p-primry. Proof. This is obvious. If x M then p n x = 0 for some n. But then p n (x + N) = 0 in M/N. So, M/N is p-primry. Lemm Suppose M is f.g. p-primry module nd R so tht p /. Then, there is b R so tht multipliction by b is the identity on M. Proof. Let x 1,, x k be genertors for M nd suppose tht nn(x i ) =. Let n = mx(n i ). Then p n M = 0. Since / (p), (, p n ) = (1). So, there exist b, c R so tht b + p n c = 1 But p n = 0 on M. So, b = 1 on M. Theorem If M is f.g. p-primry module over PID R then M is direct sum of cyclic p-primry modules. Proof. Let x 1,, x k be genertors for M where k is miniml. Then we will show by induction on k tht M is direct sum of k or fewer cyclic summnds. Since M/Rx 1 is generted by k 1 elements, it is direct sum of k 1cyclic p-primry modules by induction. So, it suffices to show tht Rx 1 is pure submodule of M. Let nn(x i ) = nd let n = mx(n i ). We will ssume tht n = n 1. Then p n M = 0 nd p n 1 x 1 0. Clim Rx 1 is pure submodule of M. proof : Suppose tht y M nd R so tht y Rx 1. If y = 0 then y = 0 Rx 1. So, we my ssume tht y 0. Then y = bx 1 for some b R. Write, b s = p k s, b = p m t where s, t re not divisible by p. The condition y = p m tx 1 0 mens tht m < n. So, n m 1 0. By the lemm, there is n element r R so tht sr = 1 on M. This gives: (9.1) y = p k sy = p m tx 1 = p m srtx 1 So, it suffices to show tht k m since this would give y = (p m k rtx 1 ). To prove tht k m multiply both sides of Eqution (9.1) by p n m 1.

10 44 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES This gives p k+(n m 1) sy = p m+(n m 1) tx 1 = p n 1 tx 1 0 since p n 1 x 1 0 nd multipliction by t is n isomorphism on M. But this implies tht the left hnd side is lso nonzero. Since p n M = 0 this implies tht k + n m 1 < n In other words, k < m + 1 or k m. This proves the clim nd the theorem.

11 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES Structure theorem for f.g. modules over PID. Now we hve the complete proof of the following existence theorem. Theorem Every f.g. module over PID is direct sum of cyclic primry modules M = R r R/( i ). Proof. Here is n outline of the entire proof. (1) First, we defined the torsion submodule tm of M. This exists since R is domin. (2) The quotient M/tM is torsion-free. Agin this holds over ny domin. (3) Since R is PID, every submodule of f.g. free module is f.g. free. This implies: () M is Noetherin (ll submodules re finitely generted) nd (b) Every f.g. torsion-free module is free. (4) The conclusion ws tht M is direct sum of tm nd f.g. free module: M = tm R r (5) If p R is irreducible, the set of p-primry elements of ny module forms submodule M p. (6) It follows from unique fctoriztion tht every torsion module is direct sum of p-primry modules: tm = M pi (7) In p-primry module M, genertor with miniml nnihiltor genertes pure cyclic submodule. Then we use the lemm: (8) If N is pure submodule of M nd M/N is direct sum of cyclic modules then N is direct summnd of M. (9) Every f.g. p-primry module is direct sum of cyclic p-primry modules. The structure theorem for finitely generted modules over PID lso sys the decomposition is unique: Theorem For ny f.g. module M over PID, the numbers r nd the sequence of pirs (p i, n i ) re uniquely determined up to permuttion of indices. We will prove this lter using tensor products. The number r = rk(m) is clled the rnk of M. It is the dimension of Q(R) M.

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey 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 information

Quadratic reciprocity

Quadratic 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 information

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that

UniversitaireWiskundeCompetitie. Problem 2005/4-A We have k=1. Show that for every q Q satisfying 0 < q < 1, there exists a finite subset K N so that Problemen/UWC NAW 5/7 nr juni 006 47 Problemen/UWC UniversitireWiskundeCompetitie Edition 005/4 For Session 005/4 we received submissions from Peter Vndendriessche, Vldislv Frnk, Arne Smeets, Jn vn de

More information

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year

USA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year 1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.

More information

20 MATHEMATICS POLYNOMIALS

20 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 information

Semigroup of generalized inverses of matrices

Semigroup of generalized inverses of matrices Semigroup of generlized inverses of mtrices Hnif Zekroui nd Sid Guedjib Abstrct. The pper is divided into two principl prts. In the first one, we give the set of generlized inverses of mtrix A structure

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

MTH 505: Number Theory Spring 2017

MTH 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 information

Math 360: A primitive integral and elementary functions

Math 360: A primitive integral and elementary functions Mth 360: A primitive integrl nd elementry functions D. DeTurck University of Pennsylvni October 16, 2017 D. DeTurck Mth 360 001 2017C: Integrl/functions 1 / 32 Setup for the integrl prtitions Definition:

More information

Homework Solution - Set 5 Due: Friday 10/03/08

Homework 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 non-finl.

More information

Convex Sets and Functions

Convex Sets and Functions B Convex Sets nd Functions Definition B1 Let L, +, ) be rel liner spce nd let C be subset of L The set C is convex if, for ll x,y C nd ll [, 1], we hve 1 )x+y C In other words, every point on the line

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 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 information

ECON 331 Lecture Notes: Ch 4 and Ch 5

ECON 331 Lecture Notes: Ch 4 and Ch 5 Mtrix Algebr ECON 33 Lecture Notes: Ch 4 nd Ch 5. Gives us shorthnd wy of writing lrge system of equtions.. Allows us to test for the existnce of solutions to simultneous systems. 3. Allows us to solve

More information

MATH STUDENT BOOK. 10th Grade Unit 5

MATH STUDENT BOOK. 10th Grade Unit 5 MATH STUDENT BOOK 10th Grde Unit 5 Unit 5 Similr Polygons MATH 1005 Similr Polygons INTRODUCTION 3 1. PRINCIPLES OF ALGEBRA 5 RATIOS AND PROPORTIONS 5 PROPERTIES OF PROPORTIONS 11 SELF TEST 1 16 2. SIMILARITY

More information

Improper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:

Improper 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 information

State Minimization for DFAs

State Minimization for DFAs Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid

More information

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS

13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS 33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

CSCI FOUNDATIONS OF COMPUTER SCIENCE

CSCI FOUNDATIONS OF COMPUTER SCIENCE 1 CSCI- 2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 My 7, 2015 2 Announcements Homework 9 is due now. Some finl exm review problems will be posted on the web site tody. These re prcqce problems not

More information

Math 554 Integration

Math 554 Integration Mth 554 Integrtion Hndout #9 4/12/96 Defn. A collection of n + 1 distinct points of the intervl [, b] P := {x 0 = < x 1 < < x i 1 < x i < < b =: x n } is clled prtition of the intervl. In this cse, we

More information

1 From NFA to regular expression

1 From NFA to regular expression Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work

More information

MATH 174A: PROBLEM SET 5. Suggested Solution

MATH 174A: PROBLEM SET 5. Suggested Solution MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous rel-vlued function on I), nd let L 1 (I) denote the completion

More information

Homework 3 Solutions

Homework 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 information

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY

Chapter 3 MATRIX. In this chapter: 3.1 MATRIX NOTATION AND TERMINOLOGY Chpter 3 MTRIX In this chpter: Definition nd terms Specil Mtrices Mtrix Opertion: Trnspose, Equlity, Sum, Difference, Sclr Multipliction, Mtrix Multipliction, Determinnt, Inverse ppliction of Mtrix in

More information

Numerical integration

Numerical integration 2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter

More information

Recursively Enumerable and Recursive. Languages

Recursively Enumerable and Recursive. Languages Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings

More information

Boolean Algebra. Boolean Algebra

Boolean Algebra. Boolean Algebra Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd

More information

The Bernoulli Numbers John C. Baez, December 23, x k. x e x 1 = n 0. B k n = n 2 (n + 1) 2

The Bernoulli Numbers John C. Baez, December 23, x k. x e x 1 = n 0. B k n = n 2 (n + 1) 2 The Bernoulli Numbers John C. Bez, December 23, 2003 The numbers re defined by the eqution e 1 n 0 k. They re clled the Bernoulli numbers becuse they were first studied by Johnn Fulhber in book published

More information

1.3 Regular Expressions

1.3 Regular Expressions 56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,

More information

42nd International Mathematical Olympiad

42nd International Mathematical Olympiad nd Interntionl Mthemticl Olympid Wshington, DC, United Sttes of Americ July 8 9, 001 Problems Ech problem is worth seven points. Problem 1 Let ABC be n cute-ngled tringle with circumcentre O. Let P on

More information

Integrals along Curves.

Integrals along Curves. Integrls long Curves. 1. Pth integrls. Let : [, b] R n be continuous function nd let be the imge ([, b]) of. We refer to both nd s curve. If we need to distinguish between the two we cll the function the

More information

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages 5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive

More information

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230

Polynomial Approximations for the Natural Logarithm and Arctangent Functions. Math 230 Polynomil Approimtions for the Nturl Logrithm nd Arctngent Functions Mth 23 You recll from first semester clculus how one cn use the derivtive to find n eqution for the tngent line to function t given

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

Problem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:

Problem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are: (x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one

More information

Section 14.3 Arc Length and Curvature

Section 14.3 Arc Length and Curvature Section 4.3 Arc Length nd Curvture Clculus on Curves in Spce In this section, we ly the foundtions for describing the movement of n object in spce.. Vector Function Bsics In Clc, formul for rc length in

More information

The Wave Equation I. MA 436 Kurt Bryan

The Wave Equation I. MA 436 Kurt Bryan 1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string

More information

Problem Set 3

Problem Set 3 14.102 Problem Set 3 Due Tuesdy, October 18, in clss 1. Lecture Notes Exercise 208: Find R b log(t)dt,where0

More information

Lecture 3. Limits of Functions and Continuity

Lecture 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 information

MA Handout 2: Notation and Background Concepts from Analysis

MA Handout 2: Notation and Background Concepts from Analysis MA350059 Hndout 2: Nottion nd Bckground Concepts from Anlysis This hndout summrises some nottion we will use nd lso gives recp of some concepts from other units (MA20023: PDEs nd CM, MA20218: Anlysis 2A,

More information

Homework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama

Homework 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 information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

Automata and Languages

Automata and Languages Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive

More information

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C. Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex

More information

Anonymous Math 361: Homework 5. x i = 1 (1 u i )

Anonymous Math 361: Homework 5. x i = 1 (1 u i ) Anonymous Mth 36: Homewor 5 Rudin. Let I be the set of ll u (u,..., u ) R with u i for ll i; let Q be the set of ll x (x,..., x ) R with x i, x i. (I is the unit cube; Q is the stndrd simplex in R ). Define

More information

M3P14 EXAMPLE SHEET 1 SOLUTIONS

M3P14 EXAMPLE SHEET 1 SOLUTIONS M3P14 EXAMPLE SHEET 1 SOLUTIONS 1. Show tht for, b, d itegers, we hve (d, db) = d(, b). Sice (, b) divides both d b, d(, b) divides both d d db, d hece divides (d, db). O the other hd, there exist m d

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams

Chapter 4 Contravariance, Covariance, and Spacetime Diagrams Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz

More information

Mapping the delta function and other Radon measures

Mapping the delta function and other Radon measures Mpping the delt function nd other Rdon mesures Notes for Mth583A, Fll 2008 November 25, 2008 Rdon mesures Consider continuous function f on the rel line with sclr vlues. It is sid to hve bounded support

More information

Matrices and Determinants

Matrices 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 Guss-Jordn elimintion to solve systems of liner

More information

MATH 423 Linear Algebra II Lecture 28: Inner product spaces.

MATH 423 Linear Algebra II Lecture 28: Inner product spaces. MATH 423 Liner Algebr II Lecture 28: Inner product spces. Norm The notion of norm generlizes the notion of length of vector in R 3. Definition. Let V be vector spce over F, where F = R or C. A function

More information

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between

More information

Matrix Eigenvalues and Eigenvectors September 13, 2017

Matrix Eigenvalues and Eigenvectors September 13, 2017 Mtri Eigenvlues nd Eigenvectors September, 7 Mtri Eigenvlues nd Eigenvectors Lrry Cretto Mechnicl Engineering 5A Seminr in Engineering Anlysis September, 7 Outline Review lst lecture Definition of eigenvlues

More information

ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS. Don Coppersmith IDACCR. John Steinberger UC Davis

ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS. Don Coppersmith IDACCR. John Steinberger UC Davis INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A26 ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS Don Coppersmith IDACCR John Steinberger UC Dvis Received: 3/29/05, Revised: 0/8/06, Accepted:

More information

Practice final exam solutions

Practice final exam solutions University of Pennsylvni Deprtment of Mthemtics Mth 26 Honors Clculus II Spring Semester 29 Prof. Grssi, T.A. Asher Auel Prctice finl exm solutions 1. Let F : 2 2 be defined by F (x, y (x + y, x y. If

More information

STRAND B: NUMBER THEORY

STRAND B: NUMBER THEORY Mthemtics SKE, Strnd B UNIT B Indices nd Fctors: Tet STRAND B: NUMBER THEORY B Indices nd Fctors Tet Contents Section B. Squres, Cubes, Squre Roots nd Cube Roots B. Inde Nottion B. Fctors B. Prime Fctors,

More information

Line Integrals. Partitioning the Curve. Estimating the Mass

Line Integrals. Partitioning the Curve. Estimating the Mass Line Integrls Suppose we hve curve in the xy plne nd ssocite density δ(p ) = δ(x, y) t ech point on the curve. urves, of course, do not hve density or mss, but it my sometimes be convenient or useful to

More information

Best Approximation. Chapter The General Case

Best Approximation. Chapter The General Case Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given

More information

Surface Integrals of Vector Fields

Surface Integrals of Vector Fields Mth 32B iscussion ession Week 7 Notes Februry 21 nd 23, 2017 In lst week s notes we introduced surfce integrls, integrting sclr-vlued functions over prmetrized surfces. As with our previous integrls, we

More information

Power Series, Taylor Series

Power Series, Taylor Series CHAPTER 5 Power Series, Tylor Series In Chpter 4, we evluted complex integrls directly by using Cuchy s integrl formul, which ws derived from the fmous Cuchy integrl theorem. We now shift from the pproch

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

M597K: Solution to Homework Assignment 7

M597K: Solution to Homework Assignment 7 M597K: Solution to Homework Assignment 7 The following problems re on the specified pges of the text book by Keener (2nd Edition, i.e., revised nd updted version) Problems 3 nd 4 of Section 2.1 on p.94;

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 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 information

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics

SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics SCHOOL OF ENGINEERING & BUIL ENVIRONMEN Mthemtics An Introduction to Mtrices Definition of Mtri Size of Mtri Rows nd Columns of Mtri Mtri Addition Sclr Multipliction of Mtri Mtri Multipliction 7 rnspose

More information

MTH 122 Fall 2008 Essex County College Division of Mathematics Handout Version 10 1 October 14, 2008

MTH 122 Fall 2008 Essex County College Division of Mathematics Handout Version 10 1 October 14, 2008 MTH 22 Fll 28 Essex County College Division of Mthemtics Hndout Version October 4, 28 Arc Length Everyone should be fmilir with the distnce formul tht ws introduced in elementry lgebr. It is bsic formul

More information

DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS

DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS 3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive

More information

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants.

a a a a a a a a a a a a a a a a a a a a a a a a In this section, we introduce a general formula for computing determinants. Section 9 The Lplce Expnsion In the lst section, we defined the determinnt of (3 3) mtrix A 12 to be 22 12 21 22 2231 22 12 21. In this section, we introduce generl formul for computing determinnts. Rewriting

More information

3 Regular expressions

3 Regular expressions 3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll

More information

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q. 1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

More information

Arithmetic & Algebra. NCTM National Conference, 2017

Arithmetic & Algebra. NCTM National Conference, 2017 NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible

More information

The Dirac distribution

The Dirac distribution A DIRAC DISTRIBUTION A The Dirc distribution A Definition of the Dirc distribution The Dirc distribution δx cn be introduced by three equivlent wys Dirc [] defined it by reltions δx dx, δx if x The distribution

More information

Non-deterministic Finite Automata

Non-deterministic Finite Automata Non-deterministic Finite Automt From Regulr Expressions to NFA- Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion

More information

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below

approaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below . Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.

More information

2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ).

2 b. , a. area is S= 2π xds. Again, understand where these formulas came from (pages ). AP Clculus BC Review Chpter 8 Prt nd Chpter 9 Things to Know nd Be Ale to Do Know everything from the first prt of Chpter 8 Given n integrnd figure out how to ntidifferentite it using ny of the following

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 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 information

1 i n x i x i 1. Note that kqk kp k. In addition, if P and Q are partition of [a, b], P Q is finer than both P and Q.

1 i n x i x i 1. Note that kqk kp k. In addition, if P and Q are partition of [a, b], P Q is finer than both P and Q. Chpter 6 Integrtion In this chpter we define the integrl. Intuitively, it should be the re under curve. Not surprisingly, fter mny exmples, counter exmples, exceptions, generliztions, the concept of the

More information

On the degree of regularity of generalized van der Waerden triples

On the degree of regularity of generalized van der Waerden triples On the degree of regulrity of generlized vn der Werden triples Jcob Fox Msschusetts Institute of Technology, Cmbridge, MA 02139, USA Rdoš Rdoičić Deprtment of Mthemtics, Rutgers, The Stte University of

More information

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1 3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =

More information

Lecture 7 notes Nodal Analysis

Lecture 7 notes Nodal Analysis Lecture 7 notes Nodl Anlysis Generl Network Anlysis In mny cses you hve multiple unknowns in circuit, sy the voltges cross multiple resistors. Network nlysis is systemtic wy to generte multiple equtions

More information

Lecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature

Lecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature Lecture notes on Vritionl nd Approximte Methods in Applied Mthemtics - A Peirce UBC Lecture 6: Singulr Integrls, Open Qudrture rules, nd Guss Qudrture (Compiled 6 August 7) In this lecture we discuss the

More information

Chapter 2. Determinants

Chapter 2. Determinants Chpter Determinnts The Determinnt Function Recll tht the X mtrix A c b d is invertible if d-bc0. The expression d-bc occurs so frequently tht it hs nme; it is clled the determinnt of the mtrix A nd is

More information

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010

CS 311 Homework 3 due 16:30, Thursday, 14 th October 2010 CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w

More information

MATH 409 Advanced Calculus I Lecture 19: Riemann sums. Properties of integrals.

MATH 409 Advanced Calculus I Lecture 19: Riemann sums. Properties of integrals. MATH 409 Advnced Clculus I Lecture 19: Riemnn sums. Properties of integrls. Drboux sums Let P = {x 0,x 1,...,x n } be prtition of n intervl [,b], where x 0 = < x 1 < < x n = b. Let f : [,b] R be bounded

More information

Lesson Notes: Week 40-Vectors

Lesson Notes: Week 40-Vectors Lesson Notes: Week 40-Vectors Vectors nd Sclrs vector is quntity tht hs size (mgnitude) nd direction. Exmples of vectors re displcement nd velocity. sclr is quntity tht hs size but no direction. Exmples

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Counting intersections of spirals on a torus

Counting intersections of spirals on a torus Counting intersections of spirls on torus 1 The problem Consider unit squre with opposite sides identified. For emple, if we leve the centre of the squre trveling long line of slope 2 (s shown in the first

More information

7 - Continuous random variables

7 - Continuous random variables 7-1 Continuous rndom vribles S. Lll, Stnford 2011.01.25.01 7 - Continuous rndom vribles Continuous rndom vribles The cumultive distribution function The uniform rndom vrible Gussin rndom vribles The Gussin

More information

PART 1 MULTIPLE CHOICE Circle the appropriate response to each of the questions below. Each question has a value of 1 point.

PART 1 MULTIPLE CHOICE Circle the appropriate response to each of the questions below. Each question has a value of 1 point. PART MULTIPLE CHOICE Circle the pproprite response to ech of the questions below. Ech question hs vlue of point.. If in sequence the second level difference is constnt, thn the sequence is:. rithmetic

More information

GRADE 4. Division WORKSHEETS

GRADE 4. Division WORKSHEETS GRADE Division WORKSHEETS Division division is shring nd grouping Division cn men shring or grouping. There re cndies shred mong kids. How mny re in ech shre? = 3 There re 6 pples nd go into ech bsket.

More information

Nondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA

Nondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn

More information

Parallel Projection Theorem (Midpoint Connector Theorem):

Parallel Projection Theorem (Midpoint Connector Theorem): rllel rojection Theorem (Midpoint onnector Theorem): The segment joining the midpoints of two sides of tringle is prllel to the third side nd hs length one-hlf the third side. onversely, If line isects

More information

Acta Universitatis Carolinae. Mathematica et Physica

Acta Universitatis Carolinae. Mathematica et Physica Act Universittis Croline. Mthemtic et Physic Thoms N. Vougiouklis Cyclicity in specil clss of hypergroups Act Universittis Croline. Mthemtic et Physic, Vol. 22 (1981), No. 1, 3--6 Persistent URL: http://dml.cz/dmlcz/142458

More information

Math 324 Course Notes: Brief description

Math 324 Course Notes: Brief description Brief description These re notes for Mth 324, n introductory course in Mesure nd Integrtion. Students re dvised to go through ll sections in detil nd ttempt ll problems. These notes will be modified nd

More information

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi

More information

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60. Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

More information

Matrix & Vector Basic Linear Algebra & Calculus

Matrix & Vector Basic Linear Algebra & Calculus Mtrix & Vector Bsic Liner lgebr & lculus Wht is mtrix? rectngulr rry of numbers (we will concentrte on rel numbers). nxm mtrix hs n rows n m columns M x4 M M M M M M M M M M M M 4 4 4 First row Secon row

More information

Line and Surface Integrals: An Intuitive Understanding

Line and Surface Integrals: An Intuitive Understanding Line nd Surfce Integrls: An Intuitive Understnding Joseph Breen Introduction Multivrible clculus is ll bout bstrcting the ides of differentition nd integrtion from the fmilir single vrible cse to tht of

More information

Math 4200: Homework Problems

Math 4200: Homework Problems Mth 4200: Homework Problems Gregor Kovčič 1. Prove the following properties of the binomil coefficients ( n ) ( n ) (i) 1 + + + + 1 2 ( n ) (ii) 1 ( n ) ( n ) + 2 + 3 + + n 2 3 ( ) n ( n + = 2 n 1 n) n,

More information