HOMOLOGICAL ALGEBRA 1. LEFT AND RIGHT MODULES

Size: px
Start display at page:

Download "HOMOLOGICAL ALGEBRA 1. LEFT AND RIGHT MODULES"

Transcription

1 HOMOLOGICAL ALGEBRA ALLEN KNUTSON CONTENTS. Left nd right modules 2. Exct functors 2 3. Projective nd injective modules 4 4. Complexes nd homology 5 5. Mpping resolutions 7 6. Derived functors 8 7. Ext groups 8. Interlude: filtrtions on rings nd modules 3 9. Filtered complexes 3. The Grothendieck spectrl sequence 5 Fix commuttive bse ring k (the miniml choice being k = Z). Then k-lgebr R is ring with unit, plus mp k Z(R). In prticulr the bidditive multipliction R R R fctors through the tensor product R k R R. Herefter will denote k.. LEFT AND RIGHT MODULES Unless otherwise noted, R is noncommuttive ring with unit, nd we indicte left nd right R-modules by R M, M R. We cn mke ny left R-module into right R op -module. The lest structure our objects will hve is being k-module, i.e. being n belin group if k = Z. An (R, S)-bimodule R M S possesses two commuting ctions, or equivlently, is module over R S op. As such ny left R-module is nturlly (R, k)-bimodule... Hom. There is nturl left S-module structure on Hom R ( R M S, R N): (s f)(m) := f(ms) First we check tht s f is gin in Hom R (M, N): Then tht the ction of S is left ction: Dte: April 2, 27. (s f)(rm) = f(rms) = r f(ms) = r (s f)(m) (s t f)(m) = (t f)(ms) = f(mst) = (st f)(m)

2 2 ALLEN KNUTSON In prticulr, if M S is only right S-module, we write M := Hom k (M, k) nd get left S-module. The nturl mp M M is not usully : or onto. The mnemonic, for when k is field, is tht Hom R (M, N) is something like M N, nd the dul of right module is left module. Of course we re used to hving inner products on vector spces, nd now tht looks impossible. So we sk for n ntiutomorphism : R R i.e. n isomorphism R R op. Then we cn mke M into left R-module, nd consider homomorphisms M M. If we wnt the nturl function M M to be R-liner, then should be n ntiïnvolution. Of course the most fmilir cse is R commuttive nd the identity. Fun cse: k = C, = complex conjugtion, nd then these homomorphisms give sesquiliner forms. This extends to the quternionic cse in wy tht = Id doesn t. Another is g g for k[g]. If N = R N T is n (R, T)-bimodule, then the hom-spce is lso right module. If R is commuttive, we cn soup up ny R M to R M R, hence Hom R (M, N) is gin (left or right) R-module. But if we try to use n ntiinvolution, the ctions of R nd R op my not commute, so my not mke M into bimodule..2.. The most generl nturl tensor is R M S S S N T, which is then (R, T)-bimodule. Of course common cse is to strt with R commuttive nd R M, R N. A fun 2-ctegory: rings, bimodules, bimodule homomorphisms..3. Adjointness. Theorem.. Let R M S be bimodule, so we hve functors Then these re djoint. M S : Mod S Mod R : Hom R (M, ) Proof. Let A, B be left R-, S-modules respectively. Then we need to show Hom S (B, Hom R (M, A)) = HomR (M B, A) ( ( )) f m b f(b) m is bijective, nd nturl in A, B. 2. EXACT FUNCTORS An dditive ctegory is ctegory object in the monoidl ctegory of belin groups, i.e. the homsets re belin groups nd composition is bidditive. We ll ctully wnt better thing, tht ll homsets re k-modules. Let A B C be short exct sequence of some kind of modules, nd T n dditive functor from their module ctegory to nother (gin respecting the dditive structure so e.g. not Schur functors). Then T is left exct resp. right exct if T(A) T(B) T(C) is exct t T(A), T(B) resp. T(B), T(C), nd exct if both. Proposition 2.. An exct functor preserves exctness of rbitrry exct sequences (not just short exct).

3 HOMOLOGICAL ALGEBRA 3 Proof. Let A f B g C be prt of n exct sequence, nd T n exct functor. We cn fctor it s A A B C C, where A B C is short exct. Apply T to tht sequence to get T(A) T(A ) T(B) T(C ) T(C) since T preserves : ness nd ontoness. Now the kernel of T(B) T(C) is the kernel of T(B) T(C ), which is the imge of T(A ) T(B) by exctness t B. But T(A) T(A ) sys tht it s the sme s the imge of T(A) T(B). Lemm 2.2. Hom(Z, ) is left exct. Proof. We pply Hom(Z, ) to A B C, or relly to A B B/A, obtining Hom(Z, A) Hom(Z, B) Hom(Z, B/A) Since A B, the first mp is :. If φ : Z B is in the kernel of the second mp, tht mens Z B B/A is zero, i.e. the imge of Z lies in A. So we obtin n element of Hom(Z, A). The min exmples re Hom R (M, ) nd M S, s follows from the next theorem. We need the definition of n object X Obj(C) representing covrint functor F : C Set, nmely F = Hom C (X, ). Theorem 2.3. Let C hve n object R tht represents the forgetful functor. Then if L : C D : R re djoint functors, then the left djoint is right exct nd vice vers. Proof. We hve bijections Hom(X, Z) = Hom(X 2, Z) tht re nturl in Z. For Z = X the left side hs the identity, giving us n element of Hom(X 2, X ), nd for Z = X 2 the RHS does, giving us n element of Hom(X 2, X ); these turn out to be inverses. Corollry 2.4. If Hom(Z, A) Hom(Z, B) Hom(Z, C) is exct for ll Z, then A B C ws exct. Proof tht djointness = exctness. Strt with n exct sequence A B C in D (the is unimportnt). Apply R to get R(A) R(B) R(C) in C. To mke use of djointness, we need to mp into this, so Hom C out of Z to get Hom C (Z, R(A)) Hom C (Z, R(B)) Hom C (Z, R(C)) Adjointness sys tht we hve commuting digrm Hom D (L(Z), A) Hom D (L(Z), B) Hom D (L(Z), C) Hom C (Z, R(A)) Hom C (Z, R(B)) Hom C (Z, R(C)) with verticl isomorphisms. We lredy proved tht the top sequence is exct, hence the bottom one is, for ll Z. Tking the cse Z = R, we get A B C is exct. In fct using the Yoned lemm, Lemm 2.5 (Yoned). If two objects represent the sme functor, they re cnoniclly isomorphic. one cn dispense with the object representing the forgetful functor.

4 4 ALLEN KNUTSON 3. PROJECTIVE AND INJECTIVE MODULES Even though Hom(M, ) isn t left-exct for ll R M, it is for some, e.g. for R itself, nd more generlly for free modules. Similrly M is exct for M free. However, free is difficult property to mintin. One result we hve in this direction derives from Theorem 3.. Let M be finitely generted module over PID R. Then M is direct sum of cyclic modules R/r i R. nmely Corollry 3.2. If R is PID, then finitely generted submodule of R n is free. but more generlly, we will work with projective modules P: if given M N nd P N, there lwys exists lift P M, then P is projective. Theorem 3.3. () Free modules re projective. (2) If P = Q R, then the direct summnds Q, R re projective. (Even this lredy is flse for free modules: try M = R = Z/6.) (3) Any SES A B P with P projective, splits. I.e. ny mp B P must be projection A P P. (4) P is projective iff it s direct summnd of free module. (5) If every SES onto P splits, then P is projective. Proof. () The genertors of P go somewhere in N. By the ontoness, we cn lift those to M, obtining mp P M. (2) Given mp Q N we cn extend it to P (by on R), lift to P M, restrict to Q M. (3) Tke N = P i.e. P N the identity. Lift to get mp P B. Now check tht B is the sum of the imges of A nd P. (4) = Pick genertors of P to get surjection F P. Now pply the previous to ker F P. = (2). (5) If every mp B P splits, then tke B free, nd use (4). Another reson people like projectivity is tht it cn be checked loclly, i.e. fter M is projective R-module iff R[ ] R M is projective R[ ]-module for enough, but the sme sttement doesn t work with free. A free resolution of module M is n exct sequence F 3 F 2 F F M where the F i re free; we could tke F to be freely generted by M, then F freely by the kernel of F M, nd so on. Exmple. Let R = C[, b, c]/ b 2 c, nd M = R/, b. Then we hve free resolution R 2 [c] [ b] R 2 [] [b] R 2 [c] [ b] [ b] 2 R M

5 HOMOLOGICAL ALGEBRA 5 Theorem 3.4 (Hilbert bsis theorem). If M is module over F[x,..., x n ], then M hs free resolution with F i = i > n. Proof. Use Gröbner bsis for the module, nd... More generlly though, we ll use projective resolutions, which look the sme but F i need only be projective. 3.. Injective modules. All these notions cn be dulized by reversing the rrows, but they cn get kind of weird. Wht would n injective Z-module I be? Given ny M M, nd M I, there should be n extension M I. A Z-module M is divisible if for every m M nd there exists m with m = m. The principl exmple is Q/Z s Z-module. Theorem 3.5. () Injective modules re divisible. (2) If M is torsion-free nd divisible, it is injective. Proof. () Consider the mps R R m M, where the first is injective by. Then injectivity sys tht this should complete to R M, with m. (2)... this is rel pin, nd uses Zorn s lemm. In prticulr, it s much less obvious (but true) tht R Mod hs enough injectives to mke n injective resolution of ny module. φ n 4. COMPLEXES AND HOMOLOGY φ n φ A complex A n An A is sequence of mps, the differentils, in n dditive ctegory such tht ll composites φ i φ i+ =. Then (ssuming the ctegory hs quotients, s in module ctegories) we cn define the homology s H i := ker φ i /imge(φ i+ ). Under this definition, n exct sequence is complex with vnishing homology. There re obvious definitions of direct sums, subcomplexes, nd isomorphisms of complexes ( sequence of mps giving commuting squres). The two bsic kinds of complexes re complexes concentrted in single degree (with trivil differentil, thus isomorphic to their homology) nd two-step complexes k k with no homology. Theorem 4.. Let (A i ) be finite complex of finite-dimensionl vector spces over k. Then (A i ) is isomorphic to the direct sum of its homology (with trivil differentil) nd bunch of two-step complexes. Proof. If the lst mp is not onto, split A into imge(φ ) nd complement, then use induction on totl dimension of the complex. Now sy it is onto. Consider the subspces imge(φ 2 ) ker(φ ) A. Pick complements H nd T, nd split A A into ( A 2 imge(φ 2 ) ) ( H ) ( T = A )

6 6 ALLEN KNUTSON nd use induction on the length of the complex. Very often we will only cre bout the homology of complex, becuse the complex involves choices but the homology does not. So we wnt wy to prove tht two complexes hve the sme homology. Before defining isomorphisms, we define morphism of complexes s digrm A 2 A A = = B 2 B B Theorem 4.2. A morphism of complexes induces mp on homology. Proof. The mp A B tkes imge(a 2 A ) to imge(a 2 B ) through B 2 by the left squre, so lnds inside imge(b 2 B ). It s only well-defined up to ker(a A ), which lies inside ker(a B ), which mps to ker(b B ). So s long s we kill tht in the trget, we get well-defined mp H (A) H (B). We my s well do this here: Theorem 4.3. A SES of complexes induces long exct sequence on homology. Proof. A 2 A A B 2 b B b B C 2 c C c C We lredy hve the mps H i (A) H i (B) H i (C), nd need the mp H i (C) H i (A), sy i = in the bove. Strt with c C C. Then B C so b c, mpping to b B. Then by the commuting squre, b C. Hence it the imge of unique A. Wht if the originl c were the imge of some c 2 C 2? Then we could lift tht c 2 to b 2, whose imge b B would go the sme plce s b does (nmely c ). Hence b = b + for some unique. Now b b b, since b 2 b horizontlly. But is the unique element mpping to b, so must be the imge of. I.e. if we lift imge elements, we lnd inside imge elements, giving well-defined mp on homology. We would like nturl reson tht two complexes (A i ), (B i ) would hve the sme homology. More generlly, we would like nturl reson tht two mps f, g : (A i ) (B i ) would induce the sme mp on homology. Define chin homotopy from f to g to be collection of mps h i : A i B i+ (not mp of complexes) such tht f g = d B h + hd A.

7 HOMOLOGICAL ALGEBRA 7 (The RHS is something like commuttor; note tht the d nd h opertions re both odd degree, so it is nturl to hve + insted of in their commuttor ). Proposition 4.4. If f, g : (A i ) (B i ) hve chin homotopy h relting them, then they induce the sme mp on homology. Proof. Let i ker(a i A i ). We need to show tht imge(b i+ B i ) (f g)( i ) = (d B h + hd A )( i ) = d B (h( i )) + h(d A ( i )) = d B (h( i )) +. In topology, nturl source of such hs is from mps [, ] A B. Sometimes we hve mps (A i ) (B i ) (A i ), where one composite is the identity nd the other composite is only chin homotopic to the identity, e.g. in topology from the inclusion of deformtion retrct. Then the bove sys tht the homologies re isomorphic. 5. MAPPING RESOLUTIONS Sy we hve mp M N nd resolutions (i.e. exct complexes) of M, N: A 2 A A M b B b 2 B B N Proposition 5.. If (A i ) is projective resolution, then we cn extend the bove to mp of complexes, uniquely up to chin homotopy. Proof. Since B N nd A M N nd A projective, there exists mp f : A B mking commuting squre. We cn obviously replce A with imge(a A ) whose mp to M is the zero mp (since the top row is complex), nd replce M with, but we wnt to lso replce B with imge(b B ) nd N with. To do tht sfely, we need to know tht f(imge(a A )) imge(b B ). If we lredy hd the mp A B, we could use tht. Insted we use imge(a A ) = ker(a M) ker(a N) f ker(b N) = imge(b B ) Now we cn indeed rip off tht lst column nd repet the rgument. To see the uniqueness, let f, g be two such mps. Strt with h := (the mp M B ). Assume we hve h,..., h i stisfying f g = d B h+hd A, nd now we wnt h i : A i B i+ solving b i h i = g i f i h i i. A 2 A A M b B b 2 B B N Obviously we ll use projectivity to construct desired mps, which mens we need to know tht A i mps vi the RHS into the imge of B i+ B i = ker(b i B i ). So we

8 8 ALLEN KNUTSON compute: b i (g i f i h i i ) = b i g i b i f i b i h i i = b i g i b i f i (g i f i h i 2 i 2 ) i = b i g i b i f i g i i + f i i = (b i g i g i i ) (b i f i f i i ) = = 6. DERIVED FUNCTORS Let (A i ), (B i ) two resolutions of the sme object M. Then we get mps between the resolutions, unique up to chin homotopies A 2 A A M B 2 b B b B M A 2 A A M which would induce mps on homologies, except tht s silly. It s worth noting tht the composite mps nd identity mps must be chin homotopic to one nother (which would induce isomorphism of homologies, except tht s sillier). Now ditch the M, nd pply covrint right exct functor T : C D (soon, X ) everywhere: T(A 2 ) T( ) T(A ) T( ) T(A ) T(B 2 ) T(b ) T(B ) T(b ) T(B ) T(A 2 ) T( ) T(A ) T( ) T(A ) The result is two complexes no longer exct with morphisms between them, ech composite chin homotopic to the identity. Hence their homologies re isomorphic. To get n ctul cnonicl definition, we cn use the cnonicl free resolution of M (use every element to generte, etc.), even though it s enormous. (We ll just never compute tht wy.) Given A 2 A k M M b B b 2 B k N N the cnonicl free resolutions, we get nturl mp k M k N. Then since tht squre commutes, the mp tkes ker(k M M) ker(k N N), with which we cn define the next mp, nd so on. This shows tht the cnonicl free resolution is functoril, nd from there, tht the homology of the complex T(A 2 ) T( ) T(A ) T( ) T(A )

9 HOMOLOGICAL ALGEBRA 9 is functoril in M. These re clled the left derived functors L i T of the right exct functor T. Wht does right exctness get us? The complex T(A ) T(A ) T(M) is still exct t T(A ), i.e. T(A ) T(A ) isn t; its homology is T(M). So L T = T. Exmple. Let T = Z n : Ab Ab, where Ab = Z Mod denotes finitely generted belin groups. Let g = gcd(m, n). Then we cn resolve Z n s the th homology of Z m Z whose T is Z n m Z n with kernels Z n/g Z n nd imges Z n/g giving homology Z n/g Z g Define Tor i (M, N) := H i (M projective resolution of N). With this definition, it s quite nonobvious tht Tor i (M, N) = Tor i (N, M). The long exct sequence. Let T be right exct, nd A B C SES. Then the covrint functors L i T give us complexes (L i T)(A) (L i T)(B) (L i T)(C) but now we clim tht there is nturl mp (L i T)(C) (L i T)(A) gluing them together into long exct sequence. We know how to get those from short exct sequences of complexes. The L i T come from T(projective resolution). So we wnt to replce A B C by short exct sequence A B C of projective resolutions, then pply T, then get the LES. Such SES would necessrily split by the projectivity of the C. Tht s why to build it, we first pick projective resolutions (A i ) of A nd (C i ) of C, nd dd them together, giving us A 2 2 A A A A 2 C 2 A C A C B C 2 c 2 C c C c C [ n The middle line hs projective elements, nd some obvious mps c n ], but doesn t yet hve the mp A C B. We cn build tht mp from A A B, nd the projectivity of C C B. But if we just bng this cnonicl nd non-cnonicl choice together, the rightmost two squres won t commute.

10 ALLEN KNUTSON We ll need to spoil the block digonlity of build it, consider the sequences C 2 C C C A A B C [ ] n, with mp A c i to or from C i. To n We clim the second one is exct. (Since A i B is :, the kernel of A B is the sme s tht of A A. Since A A is onto, the imge of A B is the sme s tht of A B.) Now use proposition 5. to crete verticl mps (t i ) mking ll squres commute. Then if our middle sequence is defined s n ( ) n t n [ ] c n i t A n C n A n C n, A C B we get everything we wnt. (The ( ) n re becuse the t i re constructed s degree mps, but we use them s degree mps.) T contrvrint. Everything works the sme if we pply contrvrint functor T, except tht our complexes re now bckwrds, which flips our definition of chin homotopies. To help keep trck, we cll the homology of the complex cohomology, but the kernel mod imge definition is the sme. Now left exct functor T like Hom(A, ) gets right derived functors R i T. T left exct. Use n injective resolution insted. 7. Ext GROUPS 7.. Using projective resolution. Define Ext i (C, A) := (L i Hom(, A))(C), i.e. using projective resolution of C nd the contrvrint right exct functor Hom(, A). Stupid cse: C is projective, so hs resolution C C. Then we Hom(, A) the complex C nd find out Ext i> (C, A) =. Consider the ctegory of SES A B C with fixed A, C, nd chin isomorphisms of SES. To such n SES, we look t the Ext i (, A) functors, getting LES Hom(C, A) Hom(B, A) Hom(A, A) Ext (C, A) Then A mps to n element of Ext (C, A). In prticulr, tht element is iff Hom(B, A) Hom(A, A) hs A in the imge, iff the SES is split. So we might hope tht the element of Ext (C, A) mesures the nonsplitness in some more generl sense. Theorem 7.. The mp from isomorphism clsses of extensions of C by A to Ext (C, A) is welldefined nd bijective. Proof. First, well-defined. Given two isomorphic SES, pply Ext s bove. The third nd fourth verticl mps come from the third nd first in the SES, which re equlities, so we get commuting squre with verticl equlities. Hence the horizontl mps re the sme.

11 HOMOLOGICAL ALGEBRA For onto, let g Ext (C, A), nd mke SES K κ F C where F is free. It gives the Ext(, A)s Hom(K, A) Ext (C, A) Ext (F, A) = i.e. g is the imge of some ḡ Hom(K, A). Define B := (A F) / ([ ḡ κ ] K ) Then we clim tht A B C is exct, nd induces g Ext (C, A). The best wy to show injectivity is to sy tht we re defining different R-module structures on the set A C, nd figure out how to mke those into n belin group so tht the mp to Ext (C, A) is group homomorphism. Then we lredy figured out tht the kernel is. Exmple. There re two extensions of Z p by Z p : the trivil one nd Z p 2. Consider SES Z p p Z p 2 b Z p These, b live in Z p. By scling by b, we cn reduce to b =. But then we still hve Z p different extensions (with the sme group in the middle) Computing Ext groups of finitely generted Z-modules. If C or A is direct sum, then the Hom groups nd mps will lso be direct sums, so the result will be direct sum. The indecomposble options re Z nd Z p k, but we cn hndle Z m just s esily. C = Z. This ws the stupid projective cse from before. So Hom(C, A) = A nd Ext (C, A) =. C = Z m, with projective resolution Z m Z. A = Z. After Homming, the sequence is Z m Z, with homology groups Hom(Z m, Z) =, Ext (Z m, Z) = Z m. m A = Z n. After Homming, the sequence is Z n Z n. Both Ext groups re Z gcd(m,n) Using n injective resolution. Define Ext i (A, B) := (R i Hom(A, ))(B), from Hom(A, ) being covrint left exct. To compute it, we strt with n injective resolution then nd look t B b b B b 2 B B2 Hom(A, B ) Hom(A, B ) Hom(A, B 2 ) / Ext (A, B) := {φ : A B b φ = } b {φ : A B }... Given SES A B C, pick function σ : C B splitting B C. Then we get symmetric mp (c, c 2 ) σ(c + c 2 ) σ(c ) σ(c 2 ) ker(b C) = A from C C A, mking no reference to B....

12 2 ALLEN KNUTSON 7.3. Universl coefficient theorems. This is usully the first ppliction of Ext groups. Let (C, d ) be complex of free belin groups to which we pply Hom(, A). Then we cn compute the homology of the first, denoted H i (C), nd the homology of the second, denoted H i (C; A) nd clled cohomology. We get nturl mp H i (C; A) Hom(H i (C); A) nd the theorem is tht () it fits into cnonicl SES Ext (H n (C), A) H i (C; A) Hom(H i (C); A) which (2) noncnoniclly splits (this uses the freeness). The rel reson tht we only need Ext s is tht this is bout Z-modules, which hve very short resolutions; things re much more complicted over rings requiring longer projective resolutions. This tkes while to prove (see e.g. coefficient+theorem) so let s look t slightly simpler cse, computing homology of C A in terms of tht of C. Then the nturl mp () fits into the SES H i (C) A H i (C A) H i (C) A H i (C A) Tor(H i (C), A) where Tor(, A) = Tor (, A) is the first derived functor of A, nd (2) this sequence noncnoniclly splits The proof. Here s trick: from C we consider the subcomplexes Z, B of kernels nd imges, on ech of which the differentil restricts (to ). Then we get two SES of complexes: B Z H (C) ll boundries trivil nd Z C B where the ltter splits row-wise (but not with commuting squres) if ech C i is free. Hence it still splits row-wise if we pply some covrint (sy) functor T, so we gin hve SES T(Z ) T(C ) T(B ), inducing LES T(B i ) T(Z i ) H i (TC) T(B i ) which mkes it look like it cme from SES B Z C, though it doesn t. (These shifts show up in the derived ctegory picture.) This breks into SES coker ( T(B i ) T(Z i ) ) H i (TC) ker ( T(B i ) T(Z i ) ) To understnd the first term, when T is right exct (e.g. A), pply it to the first SES obtining n exct sequence letting us identify the first with T(H i (C)). For the third term, we wnt to get T(B i ) T(Z i ) T(H i (C)) L T(Z i ) L T(H i (C)) T(B i ) T(Z i )

13 HOMOLOGICAL ALGEBRA 3 nd hve the first group vnish... so we obtin... H i (C) A H i (C A) Tor(H i (C), A) 8. INTERLUDE: FILTRATIONS ON RINGS AND MODULES Let R be ring. A grdtion by n belin group A is direct sum decomposition R = A R such tht R R b R +b. If R is vector spce over n infinite field F R, then this is the sme dt s n ction of the group Hom(A, F ) on R by ring utomorphisms. A grded module M is one with M = A M, where R M b M +b. If A contins submonoid A + we might be more interested in A + -grdings, the most common cse being N-grdings. One nice thing bout N-grded rings R is tht there is mp R R, not just R R. The nturls re ordered, nd the reverse order is not isomorphic, llowing for two distinct notions: decresing filtrtion on ring R is n N-filtrtion R = F F F 2. One often dds the requirement tht i F i = {}. Note tht ech F i is n idel, nd one obvious wy to mke decresing filtrtion is to define F k = I k for some idel I; this is clled the I-dic filtrtion. From n N-grdtion one cn construct decresing filtrtion, F i := k i R k. Conversely, from decresing filtrtion one cn construct the ssocited grded ring i (F i /F i+ ). One composite is the identity, but the other usully is not. All these definitions extend nturlly to modules. If R = R is just field, then the ssocited grded of module is unnturlly isomorphic to the originl module. Similrly we cn define incresing filtrtions E E... nd perhps sk tht i E i = R. In prticulr E is subring, nd we cn gin spek of the ssocited grded. One reson to work with filtrtions is tht ny sub or quotient ring of filtered ring is gin filtered (unlike the grded cse). For exmple, TV is grded hence Ug is filtered. Then the PBW theorem is tht gr Ug = Sym g. Given n incresing filtrtion E on R, define the Rees ring E[t] s the R [t]-sublgebr of R[t] given by i N R it i. Then for λ R, E[t]/ t λ = R, wheres E[t]/ t = gr R. Geometriclly, one should consider R [t] s the ring of functions on line, nd its grdedness s n ction of the multiplictive group. Then ll the fibers re isomorphic except for the centrl one, which is different. There is version for decresing filtrtions s well. Let F[t] be the R[t]-sublgebr of R[t, t ] given by i Z F it i, where F i := F = R. Once gin, F[t]/ t λ is R for λ unit, nd gr R for λ = (s long s one gives t degree ). Finlly, there s version i N F it i clled the blowup lgebr for its use in lgebric geometry (most often considered for I-dic filtrtions). 9. FILTERED COMPLEXES Let R = k[d]/ d 2, considered s Z-grded lgebr with deg d =. Then grded module M is exctly complex, nd nn d (M)/dM its homology. Wht if, unrelted to this, M hs 2-step filtrtion M M, where M is submodule (i.e. subcomplex)? (We ll keep the subscripts for M s being complex.)

14 4 ALLEN KNUTSON If M were ctully grded (M = M M ), then we could compute its homology in ech degree nd dd them together. Question. Wht s the reltion between H(M) nd H(gr M)? Obviously if M = M k, then H(M) = M k but H(gr M) = gr M k, so we cn t compute H(M) from H(gr M), only t best some sort of gr H(M). Things cn be much worse though. Exmple: let ech M i hve bsis t i, dt i, with M i spnned by just dt i. Then M is exct, but M nd M/M ech hve trivil differentil nd -D homology in every degree. The bsic picture, if we ssume k is field so tht we cn split M s M M where M is not subcomplex, is where ll two-step composites give. M i M i M i 2 M i M i M i 2 The bottom row is complex in itself, with homology H(M ). If we mod it out, we only see the top row, with homology H(gr M). Wht we ve forgotten is the digonl mp. Proposition 9.. There s nturl mp d : H (M/M ) H (M ), nd filtrtion on H(M) such tht gr H(M) = ker d coker d. Proof. Let m + M i (M/M ) i be in ker d. Then dm, priori in M i, is ctully in M i. Since d(dm) =, dm ker d. Then it remins to check tht if we chnge m by dding dm, it doesn t chnge dm. The filtrtion on H(M) is derived from the filtrtion on M. It is then tiresome to correspond the two spces. Question. Wht if M hs longer filtrtion? Sy, M M M 2. Now in ddition to M i M i M i 2 M i M i M i 2 M 2 i M 2 i M 2 i 2 we d hve knight s-moves mps to the SSE. One cn gin define the Southest mp d, but now it is only differentil on H(gr M), so insted of ker coker one should tke its homology, H(H(gr M), d ). But we re not done: the SSE mps give us nother differentil d on there. Then the sttement is tht for some filtrtion on H(M). H(H(H(gr M), d ), d ) = gr H(M) You cn now imgine mthemticl object, clled pge of spectrl sequence, where we hve grid of modules nd collection of semi-southest differentils, whose homology gives the next pge.

15 HOMOLOGICAL ALGEBRA Double complexes. Consider commuting grid of modules, where every row nd column is complex, nd cll this double complex. Then we cn long the digonls (which will be finite sums if this grid is supported in the correct qudrnt, in cse we cre), but to mke the result complex, we hve to introduce signs on every other row. Now, however, this resulting single complex comes with filtrtions, by either the rows or the columns of the originl double complex. One nturl wy to obtin such double complex is to strt with single complex, nd resolve every element (sy, projectively). Proposition 9.2. Let M, be double complex whose verticl homology is supported in the th row, i.e. is the complex (H, ). Consider H s (rther trivil) double complex too, so the mp M H gives n isomorphism of verticl cohomology. Then the flttening of M lso hs mp to H, now inducing n isomorphism of horizontl cohomology.. THE GROTHENDIECK SPECTRAL SEQUENCE Let M be module nd S, T two right exct covrint functors (there re mny other versions of course). Then S T is lso right exct, nd we should be ble to compute L (S T)(M). Strt with projective resolution M M whose only homology is H = M. Apply T to obtin complex. Wht we wnt to do now is pply S s well, then tke the homology, giving L (S T)(M). But insted we resolve the complex T(M ) to double complex, whose flttening would give the sme homology, nmely (L T)(M). Now pply S, obtining double complex whose flttening would give the thing we wnt (L S T)(M). The benefit of hving done this in two steps is tht the double complex comes filtered. So if we tke verticl cohomology obtining (L S)(L T)(M) first, we cn use the filtered story from before to continue tking homologies, in the limit obtining gr of L (S T)(M).

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

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

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

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

Lecture 3: Equivalence Relations

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

More information

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

More information

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a). The Fundmentl Theorems of Clculus Mth 4, Section 0, Spring 009 We now know enough bout definite integrls to give precise formultions of the Fundmentl Theorems of Clculus. We will lso look t some bsic emples

More information

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

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Chapter 14. Matrix Representations of Linear Transformations

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

More information

Infinite Geometric Series

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

More information

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?

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

More information

Math 61CM - Solutions to homework 9

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 δ

More information

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

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),

More information

MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1

MATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1 MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further

More information

Math Lecture 23

Math Lecture 23 Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of

More information

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

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

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

Lecture 2: Fields, Formally

Lecture 2: Fields, Formally Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of

More information

Theoretical foundations of Gaussian quadrature

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

More information

The Regulated and Riemann Integrals

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

More information

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

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

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

REPRESENTATION THEORY OF PSL 2 (q)

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

More information

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

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)

More information

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

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

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties

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

Introduction to Group Theory

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

More information

A recursive construction of efficiently decodable list-disjunct matrices

A recursive construction of efficiently decodable list-disjunct matrices CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

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

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

More information

Review of basic calculus

Review of basic calculus Review of bsic clculus This brief review reclls some of the most importnt concepts, definitions, nd theorems from bsic clculus. It is not intended to tech bsic clculus from scrtch. If ny of the items below

More information

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

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

More information

Riemann Sums and Riemann Integrals

Riemann Sums and Riemann Integrals Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Bases for Vector Spaces

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

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Chapter 3. Vector Spaces

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

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

Main topics for the First Midterm

Main topics for the First Midterm Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the

More information

7.2 The Definite Integral

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

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

and that at t = 0 the object is at position 5. Find the position of the object at t = 2.

and that at t = 0 the object is at position 5. Find the position of the object at t = 2. 7.2 The Fundmentl Theorem of Clculus 49 re mny, mny problems tht pper much different on the surfce but tht turn out to be the sme s these problems, in the sense tht when we try to pproimte solutions we

More information

Things to Memorize: A Partial List. January 27, 2017

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

More information

Math Solutions to homework 1

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

More information

Vyacheslav Telnin. Search for New Numbers.

Vyacheslav Telnin. Search for New Numbers. Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils

More information

HW3, Math 307. CSUF. Spring 2007.

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

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

Lecture 2e Orthogonal Complement (pages )

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

More information

Are Deligne-Lusztig representations Deligne-Lusztig? Except when they are complex?

Are Deligne-Lusztig representations Deligne-Lusztig? Except when they are complex? Are Deligne-Lusztig representtions Deligne-Lusztig? Except when they re complex?. Representtion theory Let K be (connected) compct Lie group, nd let π n irreducible representtion of K. This mens tht π

More information

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

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

More information

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

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

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below.

Duality # Second iteration for HW problem. Recall our LP example problem we have been working on, in equality form, is given below. Dulity #. Second itertion for HW problem Recll our LP emple problem we hve been working on, in equlity form, is given below.,,,, 8 m F which, when written in slightly different form, is 8 F Recll tht we

More information

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

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

More information

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?

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 out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

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 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy

More information

Linear Algebra 1A - solutions of ex.4

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

More information

STURM-LIOUVILLE BOUNDARY VALUE PROBLEMS

STURM-LIOUVILLE BOUNDARY VALUE PROBLEMS STURM-LIOUVILLE BOUNDARY VALUE PROBLEMS Throughout, we let [, b] be bounded intervl in R. C 2 ([, b]) denotes the spce of functions with derivtives of second order continuous up to the endpoints. Cc 2

More information

Improper Integrals, and Differential Equations

Improper Integrals, and Differential Equations Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted

More information

CH 9 INTRO TO EQUATIONS

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

More information

5.7 Improper Integrals

5.7 Improper Integrals 458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the

More information

arxiv: v1 [math.ra] 1 Nov 2014

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,

More information

MAA 4212 Improper Integrals

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

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

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

More information

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

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

More information

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

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007 A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H Thoms Shores Deprtment of Mthemtics University of Nebrsk Spring 2007 Contents Rtes of Chnge nd Derivtives 1 Dierentils 4 Are nd Integrls 5 Multivrite Clculus

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More 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

PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS

PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS To strt on tensor clculus, we need to define differentition on mnifold.a good question to sk is if the prtil derivtive of tensor tensor on mnifold?

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

p(t) dt + i 1 re it ireit dt =

p(t) dt + i 1 re it ireit dt = Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)

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 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of

More information

Math 32B Discussion Session Session 7 Notes August 28, 2018

Math 32B Discussion Session Session 7 Notes August 28, 2018 Mth 32B iscussion ession ession 7 Notes August 28, 28 In tody s discussion we ll tlk bout surfce integrls both of sclr functions nd of vector fields nd we ll try to relte these to the mny other integrls

More information

Abstract inner product spaces

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 information

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

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

More information

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

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

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system. Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous

More 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

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

1 The Lagrange interpolation formula

1 The Lagrange interpolation formula Notes on Qudrture 1 The Lgrnge interpoltion formul We briefly recll the Lgrnge interpoltion formul. The strting point is collection of N + 1 rel points (x 0, y 0 ), (x 1, y 1 ),..., (x N, y N ), with x

More information

STUDY GUIDE FOR BASIC EXAM

STUDY GUIDE FOR BASIC EXAM STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There

More information

Riemann Integrals and the Fundamental Theorem of Calculus

Riemann Integrals and the Fundamental Theorem of Calculus Riemnn Integrls nd the Fundmentl Theorem of Clculus Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University September 16, 2013 Outline Grphing Riemnn Sums

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

How to simulate Turing machines by invertible one-dimensional cellular automata

How to simulate Turing machines by invertible one-dimensional cellular automata How to simulte Turing mchines by invertible one-dimensionl cellulr utomt Jen-Christophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex

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

arxiv: v1 [math.gt] 10 Sep 2007

arxiv: v1 [math.gt] 10 Sep 2007 SURGERY DESCRIPTION OF COLORED KNOTS R.A. LITHERLAND AND STEVEN D. WALLACE rxiv:0709.1507v1 [mth.gt] 10 Sep 2007 Abstrct. The pir (K, ρ) consisting of knot K S 3 nd surjective mp ρ from the knot group

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

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1

a < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1 Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given 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

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

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

More information

Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6.1 INTRO to LAPLACE TRANSFORMS Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

More information

Anti-derivatives/Indefinite Integrals of Basic Functions

Anti-derivatives/Indefinite Integrals of Basic Functions Anti-derivtives/Indefinite Integrls of Bsic Functions Power Rule: In prticulr, this mens tht x n+ x n n + + C, dx = ln x + C, if n if n = x 0 dx = dx = dx = x + C nd x (lthough you won t use the second

More information