FORMALITY QUANTIZATION OF LIE BIALGEBRAS FROM E 2
|
|
- Clarissa Dina Dickerson
- 7 years ago
- Views:
Transcription
1 QUANTIZATION OF LIE BIALGEBRAS FROM E 2 FORMALITY PAVEL SAFRONOV 1. Outlie 1.1. Statemet. Let k be a field of characteristic zero. The goal of this talk is to prove the followig statemet: Theorem. Let C be a k-liear symmetric mooidal category. The there is a equivalece betwee coilpotet Lie bialgebras ad coilpotet Hopf algebras i C. Recall that a Lie bialgebra g is coilpotet if for every x g we have δ (x) = 0 for large eough. Similarly, a uital ad couital bialgebra A is coilpotet if for every x A such that ɛ(a) = 0 we have ( ) (x) = 0 for large eough, where (x) = (x) x 1 1 x. Let us explai how we get the Etigof-Kazhda quatizatio theorem. Start with a Lie bialgebra g over k. The g := g[ ]/ is a coilpotet Lie bialgebra, where the bracket is liearly exteded from the oe o g ad the cobracket is δ g = δ g. Q(g ) is a coilipotet Hopf algebra i k[ ]/ -modules ad the iverse limit of the system gives a QUE algebra with classical limit g.... Q(g ) Q(g 1 )... Remark. It is easy to see that coilpotet Lie bialgebras are classical versios of coilpotet bialgebras: by the Cartier-Milor-Moore theorem a cocommutative coilpotet bialgebra is a uiversal evelopig algebra of some Lie algebra g. The co-poisso structure o the classical limit gives the Lie bialgebra structure o g. Remark. A coilpotet bialgebra has a uique atipode, so we will just talk about bialgebras Uiversal reformulatio. We will use the laguage of PROPs to give a uiversal statemet. Thus, we have PROPs BA ad LBA of o-uital o-couital bialgebras ad Lie bialgebras. Remark. Uless otherwise oted, from ow o we will oly cosider o-uital algebras ad o-couital coalgebras. Oe would expect a uiversal quatizatio statemet to be a fuctor of PROPs BA LBA. The, give a Lie algebra i C, i.e. a fuctor LBA C, we get a bialgebra BA LBA C i C. However, this does t happe for the followig reaso: a fuctor BA LBA is a bialgebra i LBA. As a algebra we simply expect the uiversal evelopig algebra which is costructed usig direct sums. But we do t have ay direct sums i LBA. 1
2 2 PAVEL SAFRONOV Thus, let s freely complete our category: for a liear category C we defie C to be the category of liear fuctors C op Vect fd. The category C has fiite direct sums ad fuctors C D commutig with fiite direct sums are the same as fuctors C D. It is hard to get a hadle o C, so let C pro be the idempotet completio of the subcategory of C spaed by direct sums of represetable objects. As we have oly added fiite direct sums, we also eed to restrict the (Lie) bialgebras we cosider; this is doe as follows. Let BA (LBA ) be the PROP of (Lie) bialgebras where we declare that is a zero object. The a algebra over BA is a bialgebra A with the coditio that A = 0. I particular, it is automatically coilpotet (the caoical filtratio has fiite legth). Let BA be the iverse limit of the categories BA ad let BA pro be the iverse limit of BA pro. Similar otatios will be used for Lie bialgebras. The we have the followig propositio: Propositio. Assume C is a liear abelia symmetric mooidal category. The direct sum preservig fuctors BA pro C are the same as coilpotet bialgebras. Similarly, direct sum preservig fuctors LBA pro C are the same as coilpotet Lie bialgebras. Thus we ca reformulate our origial theorem i the followig uiversal way: Theorem. There is a equivalece Q : BA LBA of k-liear categories. It restricts to a equivalece BA pro LBA pro, which, as we have explaied, gives the Etigof-Kazhda quatizatio theorem Strategy of the proof. The mai idea of the proof is to use Koszul duality betwee bialgebras ad brace algebras ad duality betwee Lie bialgebras ad Gerstehaber algebras to reduce the theorem to a equivalece betwee brace ad Gerstehaber algebras, which is provided by the formality of the E 2 operad. Let BRACES be the PROP of brace algebras, GER the PROP of Gerstehaber algebras ad HOGER the PROP of homotopy Gerstehaber algebras. The operad of homotopy Gerstehaber algebras is a cofibrat replacemet of the operad of Gerstehaber algebras; explicitly this meas that we replace the commutative product by a E product, the Poisso bracket by a L bracket ad add homotopies expressig compatibilities betwee these structures. As explaied i the previous talk, formality of the E 2 operad gives a equivalece betwee Gerstehaber ad brace algebras, i.e. we have a zig-zag of equivaleces of PROPs BRACES HOGER GER. For a dg category C let C proj (ote the differece from C pro which was defied for a o-dg category!) be the idempotet completio of the subcategory of fuctors C op Ch b k spaed by fiite sums ad shifts of represetable objects. The the quatizatio fuctor is obtaied
3 from the followig diagram: QUANTIZATION OF LIE BIALGEBRAS FROM E 2 FORMALITY 3 BA proj Q LBA proj cobar bar BRACES proj formality Harr HOGER proj W GER proj Every arrow i this diagram is a weak equivalece of symmetric mooidal dg categories. Vertical arrows are Koszul dualities that will be explaied i the ext sectio. This diagram is compatible with projectio fuctors BA +1 BA, so we get a correspodig diagram for the iverse limits. Hece, we get a weak equivalece Q : BA proj LBA proj. This is ot yet the statemet that we wat sice it ivolves dg categories ad ot BA pro or BA. The fial step is to put a t-structure o each dg category, show that the hearts of BA proj ad LBA proj are BA ad LBA ad show that each fuctor i the diagram is t-exact. This is doe i the last sectio. Note that this is ot a tautological step as Koszul duality ivolves shifts. 2. Koszul duality 2.1. Geeral picture. Recall that a bialgebra A is the same as a mooidal category A mod together with the forgetful fuctor F : A mod Vect. The bialgebra A ca be recovered as the space of atural trasformatios Ed(F ). O the other had, we also have the fuctor T : Vect A mod give by sedig a vector space to the correspodig trivial A-module. What is Ed(T )? First of all, we ca idetify Ed(T ) = Ed A (k) =:! A. O! A we have two commutig multiplicatios: oe comig from the compositio of edomorphisms ad the other oe comig from the mooidal structure. Therefore,! A is a E 1 E 1 -algebra, i.e. a brace algebra (as will be explaied later). This is a example of Koszul duality: the brace algebra! A is Koszul dual to the bialgebra A Basic istaces. There are basic Koszul duality costructios betwee the followig objects: associative algebras ad coassociative coalgebras, commutative algebras ad Lie coalgebras Associative algebras. Let A be a vector space ad cosider the reduced tesor coalgebra A! := T (A[1]) (A[1]). A differetial o A! is uiquely determied by the maps m : (A[1]) A[2]. Apart from m 2 : A A A, all these maps have the wrog degree, so they must be zero. The fact that d 2 = 0 the traslates ito the associativity coditio o m 2. I other words, differetials o A! are the same as (o-uital) associative algebra structures o A. Remark. If oe istead starts with a complex A, the a differetial o A! would be the same as a (o-uital) A structure o A. =1 CE
4 4 PAVEL SAFRONOV Give a associative algebra A, the complex A! is called the reduced bar complex. We ca do a dual versio of this costructio. Let A agai be a vector space ad cosider the reduced tesor algebra! A := T (A[ 1]) (A[ 1]). As before, a differetial o! A is equivalet to a (o-couital) coassociative coalgebra structure o A. The complex! A for a give coalgebra is called the reduced cobar complex Lie ad commutative algebras. Now let s repeat these costructios for commutative ad Lie algebras. Let g be a vector space ad cosider the free commutative algebra CE(g) := Sym (g[ 1]) Sym (g[ 1]). A differetial o CE(g) is uiquely determied by the map δ : g[ 1] Sym(g[ 1])[1] whose oly otrivial compoet is δ 2 : g 2 g. The square-zero coditio is equivalet to the Jacobi idetity for δ 2, i.e. g is a Lie coalgebra. I other words, differetials o CE(g) are equivalet to Lie coalgebra structures o g. Give a Lie coalgebra g, the complex CE(g) is called the Chevalley-Eileberg cochai complex. Fially, give a vector space A, we ca form a cofree Lie coalgebra =1 =1 Harr(A) := cofr(a[1]). A differetial o Harr(A) is the same as a commutative product o A. The complex Harr(A) for a give commutative algebra is called the Harriso chai complex (aka the cotaget complex) Duality for bialgebras. So far we have described Koszul duality for basic structures cotrolled by (co)operads. We will ow use these basic dualities to costruct dualities betwee more complicated structures cotrolled by PROPs, such as: brace algebras ad bialgebras, Gerstehaber algebras ad Lie bialgebras Brace algebras. Cosider a E 1 E 1 -algebra A. That is, we have a complex A together with two commutig operatios: oe of them is a A product ad the other oe we assume to be strictly associative. Let us try to uderstad what kid of operatios A has more explicitly. Let A! be the bar complex of A with respect to the A product. We have a lax mooidal structure o the tesor coalgebra fuctor give by the shuffle product. T (V ) T (W ) T (V W ) Remark. Note that the ordiary cocateatio map v 1... v w1... w m v 1... v w 1... w m
5 QUANTIZATION OF LIE BIALGEBRAS FROM E 2 FORMALITY 5 does ot respect the coalgebra structure. To get a bialgebra structure o T (V ), oe has to either cosider the shuffle product ad decocateatio coproduct or vice versa, the cocateatio product ad shuffle coproduct. Usig the lax mooidal structure we obtai that A! is a algebra i dg coalgebras. I other words, it is a dg bialgebra. A product T (A[1]) T (A[1]) T (A[1]) is uiquely determied by the maps m k,l : T (A[1]) T (A[1]) A[1]. Let us assume that m k,l = 0 for k 1. The we recover the structure of a brace algebra o A: it is a A algebra together with a collectio of brace operatios A A A of degree satisfyig certai compatibilities [GV94]. We will deote x{x 1,..., x } := m 1, (x, x 1,..., x ). Now let s go back. Let A be a bialgebra ad cosider! A, the cobar complex of A with respect to the coproduct. We already have a dg algebra structure o! A. The brace operatios are uiquely characterized by the followig: x{y 1,..., y m } = 0, m > 1 x{y 1... y k } = k (x) (y 1... y k ). Therefore, for a bialgebra A the complex! A is a brace algebra (with a strictly associative multiplicatio) Gerstehaber algebras. Let A be a P 2 -algebra (aka a Gerstehaber algebra). This is a commutative dg algebra with a Poisso bracket {, } of degree 1. We ca cosider the Harriso complex Harr(A) of A regarded as a commutative dg algebra. Let us defie a Lie bracket o the Harriso complex i the followig way. A Lie bracket is uiquely determied by the map which we defie to be Harr(A) Harr(A) A[1] Harr(A) Harr(A) A[1] A[1] {,} A[1]. It is clearly a Lie bracket ad it uiquely exteds to the Harriso complex sice it is cofree. Therefore, the Harriso complex of a P 2 algebra is a dg Lie bialgebra. Coversely, suppose g is a Lie bialgebra ad cosider the Chevalley-Eileberg complex C (g) of g with respect to the cobracket. We get a Poisso bracket uiquely determied by the map Sym(g[ 1]) Sym(g[ 1]) Sym(g[ 1])[ 1] g[ 1] g[ 1] Sym(g[ 1])[ 1], which we defie to be give by the Lie bracket o g. Remark. If g is a (dg) Lie algebra, the space Sym(g[ 1]) is the free P 2 algebra o g.
6 6 PAVEL SAFRONOV 2.4. Uiversal Koszul duality. Let 1 BA be the uiversal bialgebra. We deote by h 1 BA proj the fuctor represeted by 1. The cobar complex! h 1 does ot make sese i BA proj as it ivolves ifiite direct sums ad ifiite shifts. This is why we cosider istead the cobar complex! h 1 i BA proj. As we have explaied, the cobar complex of a bialgebra is a brace algebra, so we get a symmetric mooidal fuctor BRACES BA proj. This iduces a symmetric mooidal fuctor BRACES proj BA proj. Similarly, we have h 1 BRACES proj represetig the uiversal brace algebra. The bar complex of h 1 is a well-defied elemet h! 1 BRACESproj, so we get a fuctor which iduces a fuctor BA BRACES proj, BA proj Theorem. The bar ad cobar fuctors BA proj BRACES proj. BRACES proj are weak equivaleces. Oe similarly has a pair of fuctors betwee Lie bialgebras ad Gerstehaber algebras, which gives a uiversal pair of fuctors LBA proj GER proj. Theorem. The Harriso ad Chevalley-Eileberg fuctors LBA proj equivaleces. GER proj are weak The equivaleces i the theorems are compatible with the projectios BA proj +1 BA proj, so we also have a statemet o the level of iverse limits BA proj. 3. t-structures 3.1. t-structures o (Lie) bialgebras. We have obvious t-structures o the categories BA proj ad LBA proj defied as follows. We defie the subcategory D 0 BA proj BA proj of objects of degree 0 to cosists of fuctors havig cohomology i oegative degrees. Similarly, D 0 BA proj BA proj cosists of fuctors havig cohomology i opositive degrees. The heart of this t-structure is BA. Oe similarly defies a t-structure o LBA proj with heart LBA t-structures o Gerstehaber ad brace algebras. We will defie the t-structure o GER proj motivated by Koszul duality. That is, we wat the Harriso fuctor LBA GER proj 1 Harr(h 1 ) to be exact. I particular, X = Harr(h 1 ) should be i degree 0 with respect to the t- structure. We have the followig property: the cohomology H j (X( i )) is zero uless j i. This uses the fact that the operad of Gerstehaber algebras is geerated by a degree 1
7 QUANTIZATION OF LIE BIALGEBRAS FROM E 2 FORMALITY 7 operatio of arity 2. Let s defie D 0 GER proj to cosist of those fuctors whose cohomology is cocetrated i degrees i whe evaluated o i. We ca defie D 0 GER proj as a complemet: it cosists of all objects X, such that Hom(X, Y ) is cocetrated i oegative degrees for alll Y D 0 GER proj. A similar t-structure exists o BRACES proj. Theorem. The Koszul duality fuctors are exact fuctors with respect to these t-structures. Therefore, we obtai that Q is exact, hece seds BA to LBA. Refereces [EE03] B. Eriquez, P. Etigof, O the ivertibility of quatizatio fuctors, arxiv:math/ [GV94] M. Gerstehaber, A. Voroov, Homotopy G-algebras ad moduli space operad, arxiv:hepth/ [Tam07] D. Tamarki, Quatizatio of Lie bialgebras via the formality of the operad of little disks.
In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More information2 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS
2 MATH 101B: ALGEBRA II, PART D: REPRESENTATIONS OF GROUPS 1. The group rig k[g] The mai idea is that represetatios of a group G over a field k are the same as modules over the group rig k[g]. First I
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationLecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationI. Chi-squared Distributions
1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationMathematical goals. Starting points. Materials required. Time needed
Level A1 of challege: C A1 Mathematical goals Startig poits Materials required Time eeded Iterpretig algebraic expressios To help learers to: traslate betwee words, symbols, tables, ad area represetatios
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationLesson 15 ANOVA (analysis of variance)
Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More information1. C. The formula for the confidence interval for a population mean is: x t, which was
s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationEkkehart Schlicht: Economic Surplus and Derived Demand
Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationMultiplexers and Demultiplexers
I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see
More informationPermutations, the Parity Theorem, and Determinants
1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationCHAPTER 7: Central Limit Theorem: CLT for Averages (Means)
CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More information3 Basic Definitions of Probability Theory
3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio
More informationAnalysis Notes (only a draft, and the first one!)
Aalysis Notes (oly a draft, ad the first oe!) Ali Nesi Mathematics Departmet Istabul Bilgi Uiversity Kuştepe Şişli Istabul Turkey aesi@bilgi.edu.tr Jue 22, 2004 2 Cotets 1 Prelimiaries 9 1.1 Biary Operatio...........................
More informationCooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these
More informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More informationTHE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationNotes on exponential generating functions and structures.
Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the
More information3. Greatest Common Divisor - Least Common Multiple
3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More information5.3. Generalized Permutations and Combinations
53 GENERALIZED PERMUTATIONS AND COMBINATIONS 73 53 Geeralized Permutatios ad Combiatios 53 Permutatios with Repeated Elemets Assume that we have a alphabet with letters ad we wat to write all possible
More informationMetric, Normed, and Topological Spaces
Chapter 13 Metric, Normed, ad Topological Spaces A metric space is a set X that has a otio of the distace d(x, y) betwee every pair of poits x, y X. A fudametal example is R with the absolute-value metric
More informationConfidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.
Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).
More informationCHAPTER 3 DIGITAL CODING OF SIGNALS
CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity
More informationHow To Solve The Homewor Problem Beautifully
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationSEQUENCES AND SERIES
Chapter 9 SEQUENCES AND SERIES Natural umbers are the product of huma spirit. DEDEKIND 9.1 Itroductio I mathematics, the word, sequece is used i much the same way as it is i ordiary Eglish. Whe we say
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationChapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More information2. Degree Sequences. 2.1 Degree Sequences
2. Degree Sequeces The cocept of degrees i graphs has provided a framewor for the study of various structural properties of graphs ad has therefore attracted the attetio of may graph theorists. Here we
More information4.3. The Integral and Comparison Tests
4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece
More informationINFINITE SERIES KEITH CONRAD
INFINITE SERIES KEITH CONRAD. Itroductio The two basic cocepts of calculus, differetiatio ad itegratio, are defied i terms of limits (Newto quotiets ad Riema sums). I additio to these is a third fudametal
More informationElementary Theory of Russian Roulette
Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some
More informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular
More informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) -types of data -scatter plots -measure of directio -measure of stregth Computatio -covariatio of X ad Y -uique variatio i X ad Y -measurig
More informationHow To Solve An Old Japanese Geometry Problem
116 Taget circles i the ratio 2 : 1 Hiroshi Okumura ad Masayuki Wataabe I this article we cosider the followig old Japaese geometry problem (see Figure 1), whose statemet i [1, p. 39] is missig the coditio
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutios ad vertices of polyhedra Due to the fudametal theorem of Liear Programmig, to solve ay LP it suffices to cosider the vertices (fiitely may) of the polyhedro P of the feasible
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
More informationA PRESENTATION THEOREM FOR CONTINUOUS LOGIC AND METRIC ABSTRACT ELEMENTARY CLASSES
A PRESENTATION THEOREM FOR CONTINUOUS LOGIC AND METRIC ABSTRACT ELEMENTARY CLASSES WILL BONEY Cotets 1. Itroductio 1 2. Models ad Theories 3 3. Elemetary Substructure 11 4. Types ad Saturatio 13 5. T dese
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationOur aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationNATIONAL SENIOR CERTIFICATE GRADE 11
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours This questio paper cosists of pages, 4 diagram sheets ad a -page formula sheet. Please tur over Mathematics/P DoE/Exemplar
More informationFast Fourier Transform
18.310 lecture otes November 18, 2013 Fast Fourier Trasform Lecturer: Michel Goemas I these otes we defie the Discrete Fourier Trasform, ad give a method for computig it fast: the Fast Fourier Trasform.
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationPerfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing
SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More informationA RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY
J. Appl. Prob. 45, 060 070 2008 Prited i Eglad Applied Probability Trust 2008 A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY MARK BROWN, The City College of New York EROL A. PEKÖZ, Bosto Uiversity SHELDON
More informationOverview on S-Box Design Principles
Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea
More informationHow To Understand The Theory Of Coectedess
35 Chapter 1: Fudametal Cocepts Sectio 1.3: Vertex Degrees ad Coutig 36 its eighbor o P. Note that P has at least three vertices. If G x v is coected, let y = v. Otherwise, a compoet cut off from P x v
More informationChapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationRamsey-type theorems with forbidden subgraphs
Ramsey-type theorems with forbidde subgraphs Noga Alo Jáos Pach József Solymosi Abstract A graph is called H-free if it cotais o iduced copy of H. We discuss the followig questio raised by Erdős ad Hajal.
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationTHE HEIGHT OF q-binary SEARCH TREES
THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More informationDescriptive Statistics
Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More informationFOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10
FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10 [C] Commuicatio Measuremet A1. Solve problems that ivolve liear measuremet, usig: SI ad imperial uits of measure estimatio strategies measuremet strategies.
More information