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

Size: px
Start display at page:

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.

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

Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

### (e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

### Coalgebra, 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

### f = ae b e , i.e., ru + P = (r + P )(u + P ) = (s + P )(t + P ) = st + P. Then since ru st P and su P we conclude that r s t u = ru st

Mth 662 Spring 204 Homewor 2 Drew Armstrong Problem 0. (Drwing Pictures) The eqution y 2 = x 3 x defines curve in the complex plne C 2. Wht does it loo lie? Unfortuntely we cn only see rel things, so we

### The Regulated and Riemann Integrals

Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

### PARTIAL FRACTION DECOMPOSITION

PARTIAL FRACTION DECOMPOSITION LARRY SUSANKA 1. Fcts bout Polynomils nd Nottion We must ssemble some tools nd nottion to prove the existence of the stndrd prtil frction decomposition, used s n integrtion

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

### UNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3

UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,

### Bases 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

### THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

### 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

### Results on Planar Near Rings

Interntionl Mthemticl Forum, Vol. 9, 2014, no. 23, 1139-1147 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/10.12988/imf.2014.4593 Results on Plnr Ner Rings Edurd Domi Deprtment of Mthemtics, University

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

### Infinite Geometric Series

Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

### Chapter 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

### 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

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

### Theoretical foundations of Gaussian quadrature

Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

### 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.

### Minimal DFA. minimal DFA for L starting from any other

Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

### REPRESENTATION THEORY OF PSL 2 (q)

REPRESENTATION THEORY OF PSL (q) YAQIAO LI Following re notes from book [1]. The im is to show the qusirndomness of PSL (q), i.e., the group hs no low dimensionl representtion. 1. Representtion Theory

### arxiv: v1 [math.ra] 1 Nov 2014

CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,

### Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

### set is not closed under matrix [ multiplication, ] and does not form a group.

Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

### Free groups, Lecture 2, part 1

Free groups, Lecture 2, prt 1 Olg Khrlmpovich NYC, Sep. 2 1 / 22 Theorem Every sugroup H F of free group F is free. Given finite numer of genertors of H we cn compute its sis. 2 / 22 Schreir s grph The

### Introduction to Group Theory

Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

### 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

### Linear Algebra 1A - solutions of ex.4

Liner Algebr A - solutions of ex.4 For ech of the following, nd the inverse mtrix (mtritz hofkhit if it exists - ( 6 6 A, B (, C 3, D, 4 4 ( E i, F (inverse over C for F. i Also, pick n invertible mtrix

### Math 426: Probability Final Exam Practice

Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by

### 1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...

Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................

### ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI

Mth. J. Okym Univ. 44(2002), 51 56 ON THE NILPOTENCY INDEX OF THE RADICAL OF A GROUP ALGEBRA. XI Koru MOTOSE Let t(g) be the nilpotency index of the rdicl J(KG) of group lgebr KG of finite p-solvble group

### W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

### Chapter 3. Vector Spaces

3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce

### Math Solutions to homework 1

Mth 75 - Solutions to homework Cédric De Groote October 5, 07 Problem, prt : This problem explores the reltionship between norms nd inner products Let X be rel vector spce ) Suppose tht is norm on X tht

### Numerical Linear Algebra Assignment 008

Numericl Liner Algebr Assignment 008 Nguyen Qun B Hong Students t Fculty of Mth nd Computer Science, Ho Chi Minh University of Science, Vietnm emil. nguyenqunbhong@gmil.com blog. http://hongnguyenqunb.wordpress.com

### CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

### 1 Structural induction

Discrete Structures Prelim 2 smple questions Solutions CS2800 Questions selected for Spring 2018 1 Structurl induction 1. We define set S of functions from Z to Z inductively s follows: Rule 1. For ny

Mth 452 - Advnced Clculus II Line Integrls nd Green s Theorem The min gol of this chpter is to prove Stoke s theorem, which is the multivrible version of the fundmentl theorem of clculus. We will be focused

### Lecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)

Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of

### Is there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!

PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For

### SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

### Math 61CM - Solutions to homework 9

Mth 61CM - Solutions to homework 9 Cédric De Groote November 30 th, 2018 Problem 1: Recll tht the left limit of function f t point c is defined s follows: lim f(x) = l x c if for ny > 0 there exists δ

### Let S be a numerical semigroup generated by a generalized arithmetic sequence,

Abstrct We give closed form for the ctenry degree of ny element in numericl monoid generted by generlized rithmetic sequence in embedding dimension three. While it is known in generl tht the lrgest nd

### 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:

### 1. On some properties of definite integrals. We prove

This short collection of notes is intended to complement the textbook Anlisi Mtemtic 2 by Crl Mdern, published by Città Studi Editore, [M]. We refer to [M] for nottion nd the logicl stremline of the rguments.

### Geometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.

Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number

### 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

### Simple Gamma Rings With Involutions.

IOSR Journl of Mthemtics (IOSR-JM) ISSN: 2278-5728. Volume 4, Issue (Nov. - Dec. 2012), PP 40-48 Simple Gmm Rings With Involutions. 1 A.C. Pul nd 2 Md. Sbur Uddin 1 Deprtment of Mthemtics University of

### 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

### Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

### Things 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

### 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

### Assignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages

Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd

### 5.2 Exponent Properties Involving Quotients

5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use

### SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL (1 + µ(f n )) f(x) =. But we don t need the exact bound.) Set

SOLUTIONS FOR ANALYSIS QUALIFYING EXAM, FALL 28 Nottion: N {, 2, 3,...}. (Tht is, N.. Let (X, M be mesurble spce with σ-finite positive mesure µ. Prove tht there is finite positive mesure ν on (X, M such

### ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b

### Review: set theoretic definition of the numbers. Natural numbers:

Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies

### 440-2 Geometry/Topology: Differentiable Manifolds Northwestern University Solutions of Practice Problems for Final Exam

440-2 Geometry/Topology: Differentible Mnifolds Northwestern University Solutions of Prctice Problems for Finl Exm 1) Using the cnonicl covering of RP n by {U α } 0 α n, where U α = {[x 0 : : x n ] RP

### How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4

### CH 9 INTRO TO EQUATIONS

CH 9 INTRO TO EQUATIONS INTRODUCTION I m thinking of number. If I dd 10 to the number, the result is 5. Wht number ws I thinking of? R emember this question from Chpter 1? Now we re redy to formlize the

### On the free product of ordered groups

rxiv:703.0578v [mth.gr] 6 Mr 207 On the free product of ordered groups A. A. Vinogrdov One of the fundmentl questions of the theory of ordered groups is wht bstrct groups re orderble. E. P. Shimbirev [2]

### Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More

### The Algebra (al-jabr) of Matrices

Section : Mtri lgebr nd Clculus Wshkewicz College of Engineering he lgebr (l-jbr) of Mtrices lgebr s brnch of mthemtics is much broder thn elementry lgebr ll of us studied in our high school dys. In sense

### Heat flux and total heat

Het flux nd totl het John McCun Mrch 14, 2017 1 Introduction Yesterdy (if I remember correctly) Ms. Prsd sked me question bout the condition of insulted boundry for the 1D het eqution, nd (bsed on glnce

### QUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN

QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The

### Theory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38

Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control

### HW3, Math 307. CSUF. Spring 2007.

HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem

### Week 10: Line Integrals

Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.

### Riemann is the Mann! (But Lebesgue may besgue to differ.)

Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >

### 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

### MAT 215: Analysis in a single variable Course notes, Fall Michael Damron

MAT 215: Anlysis in single vrible Course notes, Fll 2012 Michel Dmron Compiled from lectures nd exercises designed with Mrk McConnell following Principles of Mthemticl Anlysis, Rudin Princeton University

### MTH 5102 Linear Algebra Practice Exam 1 - Solutions Feb. 9, 2016

Nme (Lst nme, First nme): MTH 502 Liner Algebr Prctice Exm - Solutions Feb 9, 206 Exm Instructions: You hve hour & 0 minutes to complete the exm There re totl of 6 problems You must show your work Prtil

### DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either

### fractions Let s Learn to

5 simple lgebric frctions corne lens pupil retin Norml vision light focused on the retin concve lens Shortsightedness (myopi) light focused in front of the retin Corrected myopi light focused on the retin

### Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

### Theory of Computation Regular Languages

Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of

### N 0 completions on partial matrices

N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

### 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.

### Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution

### f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

### Abstract inner product spaces

WEEK 4 Abstrct inner product spces Definition An inner product spce is vector spce V over the rel field R equipped with rule for multiplying vectors, such tht the product of two vectors is sclr, nd the

### MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

### 8 Laplace s Method and Local Limit Theorems

8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

### MAA 4212 Improper Integrals

Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

### Presentation Problems 5

Presenttion Problems 5 21-355 A For these problems, ssume ll sets re subsets of R unless otherwise specified. 1. Let P nd Q be prtitions of [, b] such tht P Q. Then U(f, P ) U(f, Q) nd L(f, P ) L(f, Q).

### Math 130 Midterm Review

Mth 130 Midterm Review April 6, 2013 1 Topic Outline: The following outline contins ll of the mjor topics tht you will need to know for the exm. Any topic tht we ve discussed in clss so fr my pper on the

### LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP

Clss Field Theory Study Seminr Jnury 25 2017 LECTURE 2: ARTIN SYMBOL, ARTIN MAP, ARTIN RECIPROCITY LAW AND FINITENESS OF GENERALIZED IDEAL CLASS GROUP YIFAN WU Plese send typos nd comments to wuyifn@umich.edu

### 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

### 378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

### In words: Let be the relation on Z given by a b if a b. (Note that we use language like in definitions, where if actually means if and only if.

Reltions A binry reltion on set A is subset R Ñ A ˆ A, where elements p, bq re written s b. Exmple: A Z nd R t b bu. In words: Let be the reltion on Z given by b if b. (Note tht we use lnguge like in definitions,

### The graphs of Rational Functions

Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior

### 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.

### Lecture 2e Orthogonal Complement (pages )

Lecture 2e Orthogonl Complement (pges -) We hve now seen tht n orthonorml sis is nice wy to descrie suspce, ut knowing tht we wnt n orthonorml sis doesn t mke one fll into our lp. In theory, the process

### Problem Set 4: Solutions Math 201A: Fall 2016

Problem Set 4: s Mth 20A: Fll 206 Problem. Let f : X Y be one-to-one, onto mp between metric spces X, Y. () If f is continuous nd X is compct, prove tht f is homeomorphism. Does this result remin true

### 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

### ODE: Existence and Uniqueness of a Solution

Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

### 7.2 The Definite Integral

7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

### 5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.

Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.