The Lie bialgebra of loops on surfaces of Goldman and Turaev
|
|
- Virgil Ward
- 6 years ago
- Views:
Transcription
1 The Lie bilgebr of loops on surfces of Goldmn nd Turev Consider ny surfce F.Letˆπ be the set of free homotopy clsses of loops on F.LetZ be the vector spce with bsis ˆπ \{null} where null is the homotopy clss of the null loop. We consider the null loop to be 0 in Z. For ny two loops α, β in generl position on F,letα β denote the set of (simple) intersections of α nd β. We cn give Z Lie lgebr structure by tking two loops, nd summing over their intersections of the loop obtined by removing the intersection nd smoothing. Precisely, we get the formul [, b ] = ɛ(q; α, β) α q β q (0.1) q α β where ɛ(q; α, β) =±1 s determined by the figure q q α β β α ε = 1 ε = 1 nd α q β q is the product of the loops α, β bsed t q. Tht is, α q β q = γ where γ is the smoothed version q α β γ The coproduct is given by summing over self-intersections nd removing the intersection point, nd smoothing to obtin two pths. Precisely, let α denote the set of self-intersections of α (ssuming α is in generl position). The coproduct is then given by summing over selfintersections nd removing the intersection point, nd smoothing to obtin two pths. Then δ( α ) = q α α q 1 α q ( b := b b ) (0.) where α 1 q,α q re the two pieces of α determined by cutting α t q s follows:
2 q α α 1 q α q
3 Anlogue: the necklce Lie lgebr of Ginzburg, Bocklndt, nd Le Bruyn This is essentilly replcing the surfce with the double of quiver. Tke quiver Q ( collection of vertices nd directed edges between them, where multiple edges with the sme endpoints re llowed) nd consider, insted of ˆπ, the set of loops in the double quiver Q = Q Q (here Q replces every edge e Q with the reverse edge e, reversing orienttion). As vector spce, our Lie lgebr L hssbsisthissetofloops(withoutpreferred choice of initil rrow). More precisely, let Q be quiver, which we consider the set of rrows, nd let I be the set of vertices. Let Q be the double quiver (for ech e Q, e is the reversed edge). Let E Q be the vector spce with bsis Q. Let B = C I be the semisimple ring with the set I s idempotents. We give E Q B-bimodule structure s follows: for ech rrow e let e s be the strting vertex, nd e t be the terminl vertex. Then we set e s e = e = ee t for ech e Q, while ve =0=ew for ny v e s,w e t.letp be the pth lgebr in Q, i.e. P = T B E Q. Then the Lie lgebr L := P/[P, P]where[P, P] is the commuttor in the ssocitive lgebr P. Note tht ny pth which is not loop is killed in this quotient, nd loops lose their choice of initil rrow. Now we define the Lie brcket structure s follows. Insted of intersections of two pths, we consider pirs of edges e in one of the loops nd e in the other, nd consider tht n intersection. Then we join the two pths together s before by creting γ which smooths thetwo,inthiscsebyremovingthee nd e nd joining the edges. If we consider the e nd e beds tht we cut the two necklces t, nd then join the corresponding ends to form new necklce, we get the picture which gives this Lie lgebr its nme: α e e* β summnd of [ α, β]
4 Precisely, we hve [ 1 k,b 1 b b l ]= [ i, j ]( i ) t i+1 i 1 b j+1 b j 1, (0.3) i,j 1 j =( i ), i Q [ i, j ]= 1 i =( j ), j Q (0.4) 0 otherwise The coproduct is given s follows. Agin, insted of self-intersections, we consider pirs of rrows e, e in pth, nd we then smooth by removing these two rrows, creting two pths which re wedged together: e Precisely, we hve e* α summnd of δ (α) δ( 1 n )= i<j [ i, j ]( j ) t j+1 i 1 ( i ) t i+1 j 1 (0.5)
5 Turev s quntiztion of the Lie bilgebr of loops The quntiztion of Z is bsed on skein lgebr which is closely tied to the Jones polynomil. Tke three-mnifold M. Define Conwy triple to be triple of links (L +,L,L 0 ) in M where ll three links re identicl outside of bll, nd inside the bll the three look like L+ L L 0 Then we let A be the C[h]-module generted by the set of isotopy clsses of links L modulo isotopy clsses of unlinked nullhomotopic loops, nd modulo the reltions L + L h ɛ L 0 (0.6) for ny Conwy triple (L +,L,L 0 ), with ɛ set s follows: { 0 #(L 0 )=#(L + ) 1=#(L ) 1, ɛ = 1 #(L 0 )=#(L + )+1=#(L )+1. This gives skein C[h]-module. (0.7) Now, to define bilgebr, we need to restrict to the cse M = F [0, 1] where F is surfce. Then we get LL = {(, t) F [0, 1] t 1 nd (, t 1) L, or t 1 nd (, t) L }, (0.8) tht is, we stck L on top of L. To define the coproduct, we need to define colorings. Given link L, we mke link digrm of link isotopic to L with only simple crossings. Then, we color L with two colors, 1 nd, such tht ny segment between crossings hs single color, nd t ech crossing q we hve d c c d q q s(q) = 1 b b s(q) = 1
6 where either = c, b = d (ech strnd hs solid color), or else = d>b= c. In the ltter cse the intersection is clled color-cutting intersection. Let f be the number of colorcutting intersections, nd let f be the number of color-cutting intersections of negtive sign s(q). Let L i be the subset of L of color i for i {1, }; L i is lso link. Here we smooth the color-cutting intersections by chnging from n L + /L type crossing to n L 0 -type one. Finlly, let N =#(L) #(L 1 ) #(L ). Now, the coproduct is defined by (L) = colorings ( 1) f h f+n L 1 L. (0.9) The cossocitivity property follows redily from showing tht (1 ) = ( 1) =, where is defined similrly to but with three colors. Well-definition follows from cseby-cse nlysis t n intersection. The bilgebr condition follows by seeing tht colorings of the product of two links must be the product of colorings on ech one (becuse of the coloring rule). I do not know whether there is n ntipode or whether the PBW property is stisfied for this lgebr (I hve not given it gret del of thought nd I didn t see it in Turev s pper).
7 The quntiztion of the necklce Lie lgebr We define Hopf lgebr emulting Turev s construction, using our dictionry between loops on surfces nd loops in quivers, between simple crossings nd pirs of n rrow in Q nd its reverse in Q. Following is digrm of quntum element: Quntum object X: * v b Clssicl Projection: X expressed lgebriclly: Incidence reltions: u * * b* b v b* (,3)(b,4)(b*,1)(*,) & (,6)(*,5) & v u= v= =b w=b s t s w t We will mod out by reltions of the following form, where ɛ {0, 1}: * = * + h ε Precisely, consider the spce of rrows with heights, AH := Q N. LetE Q,h = C AH be the vector spce with bsis AH. This cn lso be viewed s B-module by e s (e, h) =(e, h) = (e, h)e t,ndv(e, h) =0=(e, h)w for ny v e s,w e t.letlh:=t B E Q,h /[TE Q,h,TE Q,h ] to be the spce of cyclic words in AH which form pths once heights re forgotten. There is cnonicl projection LH L given by forgetting the heights. Let SLH[h] be the symmetric lgebr in LH[h] (this is not over B). A monomil here hs the form ( 1,1,h 1,1 ) ( 1,l1,h 1,l1 )&(,1,h,1 ) (,l,h,l )& &( k,1,h k,1 ) ( k,lk,h k,lk )&v 1 & &v m, (0.10) with i,j Q, v i I B. Letà be the subquotient obtined by only considering monomils where every rrow is t distinct height (ll h i,j re distinct), nd so tht we don t cre wht the ctul heights re, only the order in which they pper. (So we think of this s creting link by putting ech rrow t discrete height, connected together by verticl segments).
8 We mod out by the reltions X X i,j,i,j hδ i,i X i,j,i,j, where i i,h i,j <h i,j, nd (i,j )withh i,j <h i,j <h i,j (0.11) wherewethinkofx s the opposite crossing, nd X s the smoothing nlgous to the smoothing we did in Turev s bilgebr. Precisely, when i i, X i,j,i,j is the sme s X but with the heights h i,j nd h i,j interchnged, nd X i,j,i,j replces the components ( i,1,h i,1 ) ( i,li,h i,li )nd( i,1,h i,1) ( i,l i,h i,l i ) with the single component [ i,j, i,j ]( i,j) t ( i,j+1,h i,j+1 ) ( i,j 1,h i,j 1 )( i,j +1,h i,j +1) ( i,j 1,h i,j 1). (0.1) Similrly, X i,j,i,j isthesmesx but with the heights h i,j nd h i,j interchnged, nd X i,j,i,j is given by replcing the component ( i,1,h i,1 ) ( i,li,h i,li ) with the two components [ i,j, i,j ]( i,j ) t ( i,j +1,h i,j +1) ( i,j 1,h i,j 1 )&( i,j ) t ( i,j+1,h i,j+1 ) ( i,j 1,h i,j 1). (0.13) Our quntiztion A of L is given, s module, by quotienting à by the reltions (0.11). The product is gin given by putting one loop on top of the other. Tht is, XX hs the heights of X followed by the heights of X, which re ll greter thn the heights of X but both re in the sme order. The identity is the empty loop, i.e. the one coming from 1 SLH. The coproduct is given gin by colorings: we sum over ll wys of picking rrow nd reversed-rrow pirs to be color-cutting intersections, nd we smooth ech color-cutting intersection by removing the reversed rrow pirs, while multiplying in n pproprite sign nd powers of h. Then the color-1 prt is tensored by the color- prt with the forementioned coefficient. Following is n exmple: 1 Let P := {(i, j) 1 i k, 1 j l i } be our set of pirs, which hs ddition defined by (i, j)+j := (i, j + j ):=(i, j ), where 1 j l i nd j + j j (mod l i ). (0.14) We lso use the nottion (i,j) := i,j nd h (i,j) := h i,j.now,wechoosesetofpirsi P together with self-piring φ : I I tht is involutive nd hs no fixed points, nd which stisfies the condition: For ny (i, j) I where φ(i, j) =(i,j ), we hve l i,l j > 0nd i,j = i,j. Also, let V = {1,...,m} correspond to the vertex idempotents in (0.10). Then, coloring of X with (I,φ)-cutting pirs is mpping c : P V {1, } stisfying the conditions:
9 (1) For ech (i, j) P \ I, wehvec(i, j) =c(i, j + 1); () for ech (i, j) I, wehve c(i, j) =c(φ(i, j)+1) c(i, j +1) = c(φ(i, j)), nd we hve c(i, j) >c(φ(i, j)) iff h i,j >h φ(i,j). Given coloring (I,φ,c), we define mp f : P P by f(i, j) =(i, j)+1if(i, j) / I nd f(i, j) =φ(i, j) + 1 otherwise. Note tht in the ltter cse, i,j = φ(i,j)+1.notelsothtf is invertible by f 1 (i, j) =(i, j) 1if(i, j) 1 / I nd f 1 (i, j) =φ((i, j) 1) otherwise. Then we cn prtition P into orbits under f, P = P 1 P q. Also, note tht ech orbit P i is monochrome: c(p i )={t} for some 1 t n. For ech orbit P i we define corresponding element Y i of A s follows: Suppose P i = {x 1,...,x p } P for f(x i )=x i+1 nd f(x p )=x 1. Then, for ech x i we let y i =( xi,h xi )ifx i / I nd y i =( xi ) s otherwise. Then we set Y i = y 1 y p LH A. Let us suppose tht the Y i re rrnged so tht Y 1,...,Y r hve color 1 nd Y r+1,...,y q hve color. Also suppose tht we order V so tht v 1,...,v u hve color 1 nd v u+1,...,v m hve color. To define the sign, prtition I into I Q = {(i, j) I i,j Q} nd I Q = {(i, j) I i,j Q },sothtφ(i Q )=I Q nd vice-vers. For ech (i, j) I Q set s i,j =1ifh i,j <h φ(i,j) nd s i,j = 1 otherwise. Now, define the sign s(i,φ,c) s follows: Reclling k from (0.10), we set n 1 (X) = n colorings(i,φ,c) s(i,φ,c)= (i,j) I Q s i,j. (0.15) N = k q, (0.16) s(i,φ,c)h #(I)/4+N / X 1 I,φ,c Xn I,φ,c, (0.17) extending it C[h]-linerly to ll of A. Herenotetht#(I)/4 is the sme s hlf the number of color-cutting intersections, nd N = k q = k u (r u) is the nlogue to the previous N. As before, cossocitivity is proved by defining colorings on three colors:
10 well-definition is proved by nlysis t n intersection, nd the bilgebr condition is proved by showing tht colorings of XX come from products of colorings on X with colorings on X. By discreteness, it is esy to define n ntipode (becuse color-cutting intersections in coproducts decrese the number of rrows). We lso hve the PBW property: Theorem 0.1. A is isomorphic s C[h]-module to UL = SL, by descending the forgetful mp à SL. I proved PBW using detiled combintoril rgument bsed on Bergmn s Dimond Lemm.
11 References [Ber78] George M. Bergmn, The dimond lemm for ring theory, Adv. in Mth. 9 (1978), no., [BLB0] Rf Bocklndt nd Lieven Le Bruyn, Necklce lie lgebrs nd noncommuttive symplectic geometry, Mth.Z.40 (00), no. 1, [Gin01] Victor Ginzburg, Non-commuttive symplectic geometry, quiver vrieties, nd operds, Mth. Res. Lett. 8 (001), no. 3, [Kon93] Mxim Kontsevich, Forml (non)commuttive symplectic geometry, TheGelfnd Mthemticl Seminrs, , Birkhäuser Boston, Boston, MA, 1993, pp [Sch04] [Tur91] Trvis Schedler, A Hopf lgebr quntizing necklce Lie lgebr cnoniclly ssocited to quiver, mth.qa/ (004). Vldimir G. Turev, Skein quntiztion of poisson lgebrs of loops on surfces, Ann. Sci. École Norm. Sup. (4) 4 (1991), no. 6,
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 informationNote 16. Stokes theorem Differential Geometry, 2005
Note 16. Stokes theorem ifferentil Geometry, 2005 Stokes theorem is the centrl result in the theory of integrtion on mnifolds. It gives the reltion between exterior differentition (see Note 14) nd integrtion
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationAdvanced 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 informationTHE 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 informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationIs 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 informationNotes on length and conformal metrics
Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationChapter 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 informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)
10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.
More informationLine Integrals. Partitioning the Curve. Estimating the Mass
Line Integrls Suppose we hve curve in the xy plne nd ssocite density δ(p ) = δ(x, y) t ech point on the curve. urves, of course, do not hve density or mss, but it my sometimes be convenient or useful to
More informationRiemann 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 informationMath 6455 Oct 10, Differential Geometry I Fall 2006, Georgia Tech
Mth 6455 Oct 10, 2006 1 Differentil Geometry I Fll 2006, Georgi Tech Lecture Notes 12 Riemnnin Metrics 0.1 Definition If M is smooth mnifold then by Riemnnin metric g on M we men smooth ssignment of n
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationRiemann 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 informationFinite 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 informationExam 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
More information1 Linear Least Squares
Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving
More informationMATH 174A: PROBLEM SET 5. Suggested Solution
MATH 174A: PROBLEM SET 5 Suggested Solution Problem 1. Suppose tht I [, b] is n intervl. Let f 1 b f() d for f C(I; R) (i.e. f is continuous rel-vlued function on I), nd let L 1 (I) denote the completion
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationPhysics 9 Fall 2011 Homework 2 - Solutions Friday September 2, 2011
Physics 9 Fll 0 Homework - s Fridy September, 0 Mke sure your nme is on your homework, nd plese box your finl nswer. Becuse we will be giving prtil credit, be sure to ttempt ll the problems, even if you
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More informationARITHMETIC 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 informationMAA 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 informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationAPPLICATIONS OF THE DEFINITE INTEGRAL
APPLICATIONS OF THE DEFINITE INTEGRAL. Volume: Slicing, disks nd wshers.. Volumes by Slicing. Suppose solid object hs boundries extending from x =, to x = b, nd tht its cross-section in plne pssing through
More informationSTURM-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 informationTHE 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 informationRiemann 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 informationECON 331 Lecture Notes: Ch 4 and Ch 5
Mtrix Algebr ECON 33 Lecture Notes: Ch 4 nd Ch 5. Gives us shorthnd wy of writing lrge system of equtions.. Allows us to test for the existnce of solutions to simultneous systems. 3. Allows us to solve
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationIN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,
More informationarxiv: 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 informationThe mth Ratio Convergence Test and Other Unconventional Convergence Tests
The mth Rtio Convergence Test nd Other Unconventionl Convergence Tests Kyle Blckburn My 14, 2012 Contents 1 Introduction 2 2 Definitions, Lemms, nd Theorems 2 2.1 Defintions.............................
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationMath 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 informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationAnalytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.
1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples
More informationOrthogonal Polynomials
Mth 4401 Gussin Qudrture Pge 1 Orthogonl Polynomils Orthogonl polynomils rise from series solutions to differentil equtions, lthough they cn be rrived t in vriety of different mnners. Orthogonl polynomils
More informationMain 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 informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationThe final exam will take place on Friday May 11th from 8am 11am in Evans room 60.
Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23
More informationf = 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
More informationMath 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of
More information7.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 informationLecture 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
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More information440-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
More informationRiemann 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 informationTheory of the Integral
Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationPhysics 116C Solution of inhomogeneous ordinary differential equations using Green s functions
Physics 6C Solution of inhomogeneous ordinry differentil equtions using Green s functions Peter Young November 5, 29 Homogeneous Equtions We hve studied, especilly in long HW problem, second order liner
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationChapter 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 informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationThe Banach algebra of functions of bounded variation and the pointwise Helly selection theorem
The Bnch lgebr of functions of bounded vrition nd the pointwise Helly selection theorem Jordn Bell jordn.bell@gmil.com Deprtment of Mthemtics, University of Toronto Jnury, 015 1 BV [, b] Let < b. For f
More informationZero-Sum Magic Graphs and Their Null Sets
Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More information13.3 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS
33 CLASSICAL STRAIGHTEDGE AND COMPASS CONSTRUCTIONS As simple ppliction of the results we hve obtined on lgebric extensions, nd in prticulr on the multiplictivity of extension degrees, we cn nswer (in
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationThe 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
More informationSemigroup 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 informationOperations 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 informationIn 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,
More informationUSA 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 informationSpanning tree congestion of some product graphs
Spnning tree congestion of some product grphs Hiu-Fi Lw Mthemticl Institute Oxford University 4-9 St Giles Oxford, OX1 3LB, United Kingdom e-mil: lwh@mths.ox.c.uk nd Mikhil I. Ostrovskii Deprtment of Mthemtics
More information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
More informationand 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 informationN 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
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationIntegration Techniques
Integrtion Techniques. Integrtion of Trigonometric Functions Exmple. Evlute cos x. Recll tht cos x = cos x. Hence, cos x Exmple. Evlute = ( + cos x) = (x + sin x) + C = x + 4 sin x + C. cos 3 x. Let u
More informationAlgebra Of Matrices & Determinants
lgebr Of Mtrices & Determinnts Importnt erms Definitions & Formule 0 Mtrix - bsic introduction: mtrix hving m rows nd n columns is clled mtrix of order m n (red s m b n mtrix) nd mtrix of order lso in
More informationPavel Rytí. November 22, 2011 Discrete Math Seminar - Simon Fraser University
Geometric representtions of liner codes Pvel Rytí Deprtment of Applied Mthemtics Chrles University in Prgue Advisor: Mrtin Loebl November, 011 Discrete Mth Seminr - Simon Frser University Bckground Liner
More information3.4 Numerical integration
3.4. Numericl integrtion 63 3.4 Numericl integrtion In mny economic pplictions it is necessry to compute the definite integrl of relvlued function f with respect to "weight" function w over n intervl [,
More informationII. Integration and Cauchy s Theorem
MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.
More information1.3 Regular Expressions
56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationCM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
More informationInner-product spaces
Inner-product spces Definition: Let V be rel or complex liner spce over F (here R or C). An inner product is n opertion between two elements of V which results in sclr. It is denoted by u, v nd stisfies:
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.6.: Push Down Automt Remrk: This mteril is no longer tught nd not directly exm relevnt Anton Setzer (Bsed
More information