a(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
|
|
- Zoe Andrews
- 5 years ago
- Views:
Transcription
1 4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X is open. Exmple 4.. (Collpsing subspce) Let A X be subspce. We define reltion on X s follows: x y if both re points in A or if neither is in A nd x = y. Here, we hve one equivlence clss for the subset A, nd every point outside of A is its own equivlence clss. Stndrd nottion for the set X/ of equivlence clsses under this reltion is X/A. The universl property cn be summed up s sying tht ny mp on X which is constnt on A fctors through the quotient X/A. For exmple, we considered lst time the exmple R/(, 0] = [0, ). Exmple 4.2. I. The exponentil mp e : I! S is constnt so we get n induced continuous mp ' : I/@I! S, which is esily seen to be bijection. In fct, it is homeomorphism. Once we lern bout compctness, it will be esy to see tht this is closed mp. We show insted tht it is open. A bsis for I/@I is given by q(, b) with0<<b< nd by q([0,) [ (b, ]) with gin 0 <<b<. It is cler tht both re tken to bsis elements for the subspce topology on S. It follows tht ' is homeomorphism. Exmple 4.3. Generlizing the previous exmple, for ny closed bll D n R n+, we cn consider the quotient D n /@D n. On your homework this week, you re sked to provide continuous bijection D n /@D n! S n. Agin, we will see lter tht this must be homeomorphism D n /@D n = S n. Exmple 4.4. On S n we impose the equivlence reltion x x. The resulting quotient spce is known s n-dimensionl rel projective spce nd is denoted RP n. Consider the cse n =. We hve the hemisphere inclusion I,! S given by x 7! e ix. Then the composition I,! S RP is quotient mp tht simply identifies the to point. In other words, this is exmple 4. from bove, nd we conclude tht RP = S. However, the higher-dimensionl versions of these spces re certinly not homeomorphic. Exmple 4.5. Consider S 2n s subspce of C n. We then hve the coordinte-wise multipliction by elements of S = U() on C n. This multipliction restricts to multipliction on the subspce S 2n, nd we impose n equivlence reltion (z,...,z n ) ( z 0,..., z n ) for ll 2 S. The resulting quotient spce is the complex projective spce CP n. Exmple 4.6. On I I, we impose the reltion (0,y) (,y) nd lso the reltion (x, 0) (x, ). The resulting quotient spce is the torus T 2 = S S. We recognize this s the product of two copies of exmple 4., but bewre tht in generl product of quotient mps need not be quotient mp. torus We discussed lst time the fct tht quotient mp need not be open. Nevertheless, there is clss of open sets tht re lwys crried to open sets. Definition 4.7. Let q : X! Y be continuous surjection. We sy subset A X is sturted (with respect to q) if it is of the form q (V ) for some subset V Y. It follows tht A is sturted if nd only if q (q(a)) = A. Recll tht fiber of mp q : X! Y is the preimge of single point. Then nother description is tht A is sturted if nd only if it contins ll fibers tht it meets. Proposition 4.8. A continuous surjection q : X Y is quotient mp if nd only if it tkes sturted open sets to sturted open sets. 26
2 Proof. Exercise. A number of the exmples bove hve secretly been exmples of more generl construction, nmely the quotient under the ction of group. Definition 4.9. A topologicl group is bsed spce (G, e) with continuous multipliction m : G G! G nd inverse i : G! G stisfying ll of the usul xioms for group. Remrk 4.0. Munkres requires ll topologicl groups to stisfy the condition tht points re closed. We will not mke this restriction, though the exmples we will consider will ll stisfy this. 5. Wed, Oct. 2 Lst time, we introduced the ide of topologicl group, which is simultneously group nd spce, where the multipliction nd inverse re required to be continuous. Exmple 5.. () Any group G cn be considered s topologicl group equipped with the discrete topology. For instnce, we hve the cyclic groups Z nd C n = Z/nZ. (2) The rel line R is group under ddition, This is topologicl group becuse ddition nd multipliction by re both continuous. Note tht here Z is t the sme time both subspce nd subgroup. It is thus topologicl subgroup. (3) If we remove zero, we get the multiplictive group R = R \{0} of rel numbers. (4) Inside R, we hve the subgroup {, } of order two. (5) R n is lso topologicl group under ddition. In the cse n = 2, we often think of this s C. (6) Agin removing zero, we get the multiplictive group C = C \{0} of complex numbers. (7) Inside C we hve the subgroup of complex numbers of norm, k the circle group S = U() = SO(2). (8) This lst exmple suggests tht mtrix groups in generl re good cndidtes. For instnce, we hve the topologicl group Gl n (R). This is subspce of M n (R) = R n2. The determinnt mpping det : M n (R)! R is polynomil in the coe cients nd therefore continuous. The generl liner group is the complement of det (0). It follows tht Gl n (R) is n open subspce of R n2. (9) Inside Gl n (R), we hve the closed subgroups Sl n (R), O(n), SO(n). Let G be topologicl group nd fix some h 2 G. DefineL h : G! G by L h (g) =hg. Thisis left multipliction by h. The definition of topologicl group implies tht this is continuous, s L h is the composition G (h,id)! G G m! G. Moreover, L h is clerly inverse to L h nd continuous by the sme rgument, so we conclude tht ech L h is homeomorphism. Since L h (e) =h, we conclude tht neighborhoods round h look like neighborhoods round e. Since h ws rbitrry, we conclude tht neighborhoods round one point look like neighborhoods round ny other point. This implies tht spce like the unoin of the coordinte xes in R 2 cnnot be given the structure of topologicl group, s neighborhoods round the origin do not resemble neighborhoods round other points. The min reson for studying topologicl groups is to consider their ctions on spces. Definition 5.2. Let G be topologicl group nd X spce. A left ction of G on X is mp : G X! X which is ssocitive nd unitl. This mens tht (g, (h, x)) = (gh, x) nd 27
3 (e, x) = x. Digrmmticlly, this is encoded s the following commuttive digrms G G X id / G X X e,id / G X m id G X It is common to write g x or simply gx rther thn (g, x). / X id # Given n ction of G on spce X, we define reltion on X by x y if y = g x for some g. The equivlence clsses re known s orbits of G in X, nd the quotient of X by this reltion is typiclly written s X/G. Relly, the nottion X/G should be reserved for the quotient by right ction of G on X, nd the quotient by left ction should be G\X. Exmple 5.3. () For ny G, left multipliction gives n ction of G on itself! This is trnsitive ction, mening tht there is only one orbit, nd the quotient G/G is just point. Note tht we sw bove tht, for ech h 2 G, the mp L h : G! G is homeomorphism. This generlizes to ny ction. For ech g 2 G, the mp (g, ):X! X is homeomorphism. (2) For ny (topologicl) subgroup H pple G, left multipliction by elements of H gives left ction of H on G. Note tht n orbit here is precisely right coset Hg. The quotient is H\G, the set of right cosets of H in G. (3) Consider the subgroup Z pple R. SinceR is belin, we don t need to worry bout bout left vs. right ctions or left vs. right cosets. We then hve the quotient R/Z, which is gin topologicl group (gin, R is belin, so Z is norml). Wht is this group? Once gin, consider the exponentil mp exp : R! S given by exp(x) =e 2 ix. This is surjective, nd it is homomorphism since exp(x + y) =exp(x)exp(y). The First Isomorphism Theorem in group theory tells us tht S = R/ ker(exp), t lest s group. The kernel is precisely Z pple R, nd it follows tht S = R/Z s group. To see tht this is lso homeomorphism, we need to know tht exp : R! S is quotient mp, but this follows from our erlier verifiction tht I! S is quotient. (4) Similrly, we cn think of Z n cting on R n, nd the quotient is R n /Z n = (S ) n = T n. (5) The group Gl(n) cts on R n (just multiply mtrix with vector), but this is not terribly interesting, s there re only two orbits: the origin is closed orbit, nd the complement is n open orbit. Thus the quotient spce consists of closed point nd n open point. (6) More interesting is the ction of the subgroup O(n) on R n. Using the fct tht orthogonl mtrices preserve norms, it is not di cult to see tht the orbits re precisely the spheres round the origin. We clim tht the quotient is the spce [0, ) (thought of s subspce of R). To see this, consider the continuous surjection : R n! [0, ). By considering how this cts on open blls, you cn show tht this is n open mp nd therefore quotient. But the fibers of this mp re precisely the spheres, so it follows tht this is the quotient induced by the bove ction of O(n). 6. Fri, Oct. 4 At the end of clss lst time, we were looking t the exmple of O(n) cting on R n, nd we climed tht the quotient ws [0, ). We sw tht the reltion coming from the O(n)-ction ws the sme s tht coming from the surjection R n! [0, ). Nmely, we identify points if nd 28 X.
4 only if they hve the sme norm. To see tht the quotient by the O(n)-ction is homeomorphic to [0, ), it remins to show tht the norm mp R n! [0, ) is quotient mp. We know lredy tht it is continuous surjection, nd by considering bsis elements (open blls) in R n, we cn see tht it is open s well. We leve this verifiction to the industrious student! Why does the bove rgument show tht the quotient R n /O(n) is homeomorphic to [0, ). We now hve two quotient mps out of R n, nd they re defined using the sme equivlence reltion on R n. By the universl property of quotients, the two spces re homeomorphic! Let s get on with more exmples. Exmple 6.. () Let R ct on R n vi sclr multipliction. This ction preserves lines, nd within ech line there re two orbits, one of which is the origin. Note tht the only sturted open set contining 0 is R n, so the only neighborhood of 0 in the quotient is the entire spce. (2) Switching from n to n + for convenience, we cn remove tht troublesome 0 nd let R ct on X n+ = R n+ \{0}. Here the orbits re precisely the lines (with origin removed). The quotient is RP n. To see this, recll tht we defined RP n s the quotient of S n by the reltion x x. This is precisely the reltion tht rises from the ction of the subgroup C 2 = {, } ppler on S n R n+. Now notice tht the mp R n+ \{0}! S n R >0 given by x 7! x kxk, kxk is homeomorphism. Next, note tht we hve n isomorphism R = C 2 R >0. Thus the quotient (R n+ \{0})/R cn be viewed s the two step quotient (S n R >0 )/R >0 ) /C 2. But (R n R >0 )/R >0 = S n, so we re done. We cn think of RP n in yet nother wy. Consider the following digrm: D n / S n / R n+ \{0} D n / / S n /C 2 / R n+ \{0}/R The mp D n! S n is the inclusion of hemisphere. The reltion on D n is the reltion x x, but only llowed on the n. All mps on the bottom re continuous bijections, nd gin we will see lter tht they re necessrily homeomorphisms. Note tht the reltion we imposed on D n does not come from n ction of C 2 on D n. Let us write C 2 = h i. We cn try defining x x 2 Int(D x = n ) x x n ), where here the interior nd boundry re tken in S n. But this is not continuous, s the convergent sequence r r! n, 0,...,0,! (, 0,...,0) n is tken by to convergent sequence, but the new limit is not (, 0,...,0) = (, 0,...,0). (3) We hve similr story for CP n. There is n ction of C on C n+ \{0}, nd the orbits re the punctured complex lines. We clim tht the quotient is CP n. We defined CP n s quotient of n S -ction on S 2n+. We lso hve homeomorphism C n+ \{0} = S 2n+ R >0 nd n isomorphism C = S R >0. We cn then describe CPn 29
5 s the two-step quotient C n+ \{0} /C = (S 2n+ R >0 )/R >0 /S = S 2n+ /S = CP n. 30
MA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationBasic Geometry and Topology
Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology 1 1.1 Metric spces................................... 1 1.2 Topologicl spces................................ 5 1.3 Constructions
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
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 informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationSubtracting Fractions
Lerning Enhncement Tem Model Answers: Adding nd Subtrcting Frctions Adding nd Subtrcting Frctions study guide. When the frctions both hve the sme denomintor (bottom) you cn do them using just simple dding
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationIntegration. September 28, 2017
Integrtion September 8, 7 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my
More informationMath 35 Review Sheet, Spring 2014
Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationIntegration. October 25, 2016
Integrtion October 5, 6 Introduction We hve lerned in previous chpter on how to do the differentition. It is conventionl in mthemtics tht we re supposed to lern bout the integrtion s well. As you my hve
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes by disks: volume prt ii 6 6 Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem 6) nd the ccumultion process is to determine so-clled volumes
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More information9 4. CISC - Curriculum & Instruction Steering Committee. California County Superintendents Educational Services Association
9. CISC - Curriculum & Instruction Steering Committee The Winning EQUATION A HIGH QUALITY MATHEMATICS PROFESSIONAL DEVELOPMENT PROGRAM FOR TEACHERS IN GRADES THROUGH ALGEBRA II STRAND: NUMBER SENSE: Rtionl
More informationImproper Integrals. October 4, 2017
Improper Integrls October 4, 7 Introduction We hve seen how to clculte definite integrl when the it is rel number. However, there re times when we re interested to compute the integrl sy for emple 3. Here
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More informationMath 142, Exam 1 Information.
Mth 14, Exm 1 Informtion. 9/14/10, LC 41, 9:30-10:45. Exm 1 will be bsed on: Sections 7.1-7.5. The corresponding ssigned homework problems (see http://www.mth.sc.edu/ boyln/sccourses/14f10/14.html) At
More informationMATH 2530: WORKSHEET 7. x 2 y dz dy dx =
MATH 253: WORKSHT 7 () Wrm-up: () Review: polr coordintes, integrls involving polr coordintes, triple Riemnn sums, triple integrls, the pplictions of triple integrls (especilly to volume), nd cylindricl
More informationA GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES. b y HAROLD G. LAWRENCE A THESIS OREGON STATE UNIVERSITY MASTER OF ARTS
A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES b y HAROLD G. LAWRENCE A THESIS submitted to OREGON STATE UNIVERSITY in prtil fulfillment of the requirements for the degree of MASTER OF ARTS June
More informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationON THE DEHN COMPLEX OF VIRTUAL LINKS
ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd
More informationarxiv: v2 [math.ho] 4 Jun 2012
Volumes of olids of Revolution. Unified pproch Jorge Mrtín-Morles nd ntonio M. Oller-Mrcén jorge@unizr.es, oller@unizr.es rxiv:5.v [mth.ho] Jun Centro Universitrio de l Defens - IUM. cdemi Generl Militr,
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More information9 Graph Cutting Procedures
9 Grph Cutting Procedures Lst clss we begn looking t how to embed rbitrry metrics into distributions of trees, nd proved the following theorem due to Brtl (1996): Theorem 9.1 (Brtl (1996)) Given metric
More informationGeometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More informationRay surface intersections
Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationUNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationHomework. Context Free Languages III. Languages. Plan for today. Context Free Languages. CFLs and Regular Languages. Homework #5 (due 10/22)
Homework Context Free Lnguges III Prse Trees nd Homework #5 (due 10/22) From textbook 6.4,b 6.5b 6.9b,c 6.13 6.22 Pln for tody Context Free Lnguges Next clss of lnguges in our quest! Lnguges Recll. Wht
More informationSolutions to Math 41 Final Exam December 12, 2011
Solutions to Mth Finl Em December,. ( points) Find ech of the following its, with justifiction. If there is n infinite it, then eplin whether it is or. ( ) / ln() () (5 points) First we compute the it:
More informationIf f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.
Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationMath 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012
Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl
More informationa < 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 informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More information! B be a covering, where B is a connected graph. Then E is also a
26. Mon, Mar. 24 The next application is the computation of the fundamental group of any graph. We start by specifying what we mean by a graph. Recall that S 0 R is usually defined to be the set S 0 =
More informationCS201 Discussion 10 DRAWTREE + TRIES
CS201 Discussion 10 DRAWTREE + TRIES DrwTree First instinct: recursion As very generic structure, we could tckle this problem s follows: drw(): Find the root drw(root) drw(root): Write the line for the
More informationThe Basic Properties of the Integral
The Bsic Properties of the Integrl When we compute the derivtive of complicted function, like + sin, we usull use differentition rules, like d [f()+g()] d f()+ d g(), to reduce the computtion d d d to
More informationWhat do all those bits mean now? Number Systems and Arithmetic. Introduction to Binary Numbers. Questions About Numbers
Wht do ll those bits men now? bits (...) Number Systems nd Arithmetic or Computers go to elementry school instruction R-formt I-formt... integer dt number text chrs... floting point signed unsigned single
More information2 Surface Topology. 2.1 Topological Type. Computational Topology Surface Topology Afra Zomorodian
Klein ottle for rent inquire ithin. Anonymous 2 Surfce Topology Lst lecture, e spent considerle mount of effort defining mnifolds. We like mnifolds ecuse they re loclly Eucliden. So, een though it is hrd
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationMidterm 2 Sample solution
Nme: Instructions Midterm 2 Smple solution CMSC 430 Introduction to Compilers Fll 2012 November 28, 2012 This exm contins 9 pges, including this one. Mke sure you hve ll the pges. Write your nme on the
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
More informationQuestions About Numbers. Number Systems and Arithmetic. Introduction to Binary Numbers. Negative Numbers?
Questions About Numbers Number Systems nd Arithmetic or Computers go to elementry school How do you represent negtive numbers? frctions? relly lrge numbers? relly smll numbers? How do you do rithmetic?
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationZZ - Advanced Math Review 2017
ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More informationThe Fundamental Theorem of Calculus
MATH 6 The Fundmentl Theorem of Clculus The Fundmentl Theorem of Clculus (FTC) gives method of finding the signed re etween the grph of f nd the x-xis on the intervl [, ]. The theorem is: FTC: If f is
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationCPSC (T1) 2nd Midterm Exam
Signture: Fire Alrm Code: CPSC 44 2-2 (T) 2nd Midterm Exm Deprtment of Computer Science University of British Columbi K. Booth & R. Schrein Exm Instructions (Red Crefully). Sign the first pge of the exm
More informationFrom Indexing Data Structures to de Bruijn Graphs
From Indexing Dt Structures to de Bruijn Grphs Bstien Czux, Thierry Lecroq, Eric Rivls LIRMM & IBC, Montpellier - LITIS Rouen June 1, 201 Czux, Lecroq, Rivls (LIRMM) Generlized Suffix Tree & DBG June 1,
More informationResearch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES
Volume 2, 1977 Pges 349 353 http://topology.uburn.edu/tp/ Reserch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES by J. A. Guthrie, H. E. Stone, nd M. L. Wge Topology Proceedings Web: http://topology.uburn.edu/tp/
More information9.1 apply the distance and midpoint formulas
9.1 pply the distnce nd midpoint formuls DISTANCE FORMULA MIDPOINT FORMULA To find the midpoint between two points x, y nd x y 1 1,, we Exmple 1: Find the distnce between the two points. Then, find the
More informationConstrained Optimization. February 29
Constrined Optimiztion Februry 9 Generl Problem min f( ) ( NLP) s.. t g ( ) i E i g ( ) i I i Modeling nd Constrints Adding constrints let s us model fr more richer set of problems. For our purpose we
More informationNotes on point set topology, Fall 2010
Notes on point set topology, Fall 2010 Stephan Stolz September 3, 2010 Contents 1 Pointset Topology 1 1.1 Metric spaces and topological spaces...................... 1 1.2 Constructions with topological
More informationarxiv:math/ v2 [math.co] 28 Feb 2006
Chord Digrms nd Guss Codes for Grphs rxiv:mth/0508269v2 [mth.co] 28 Feb 2006 Thoms Fleming Deprtment of Mthemtics University of Cliforni, Sn Diego L Joll, C 92093-0112 tfleming@mth.ucsd.edu bstrct lke
More informationTREE-LIKE CONTINUA AND SIMPLE BONDING MAPS
Voume 7, 198 Pges 181 190 http://topoogy.uburn.edu/tp/ TREE-LIKE CONTINUA AND SIMPLE BONDING MAPS by Sm W. Young Topoogy Proceedings Web: http://topoogy.uburn.edu/tp/ Mi: Topoogy Proceedings Deprtment
More informationECE 468/573 Midterm 1 September 28, 2012
ECE 468/573 Midterm 1 September 28, 2012 Nme:! Purdue emil:! Plese sign the following: I ffirm tht the nswers given on this test re mine nd mine lone. I did not receive help from ny person or mteril (other
More informationIntroduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationDefinition and Examples
56 Chpter 1 The Fundmentl Group We come now to the second min topic of this chpter, covering spces. We hve in fct lredy encountered one exmple of covering spce in our clcultion of π 1 (S 1 ). This ws the
More informationProperties of Tree Convex Constraints 1,2
Properties of Tree Convex Constrints 1,2 Yunlin Zhng, Eugene C Freuder b Deprtment of Computer Science, Texs Tech University, Lubbock, USA b Cork Constrint Computtion Center, University College Cork, Irelnd
More informationAssignment 4. Due 09/18/17
Assignment 4. ue 09/18/17 1. ). Write regulr expressions tht define the strings recognized by the following finite utomt: b d b b b c c b) Write FA tht recognizes the tokens defined by the following regulr
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationCHAPTER 8 Quasi-interpolation methods
CHAPTER 8 Qusi-interpoltion methods In Chpter 5 we considered number of methods for computing spline pproximtions. The strting point for the pproximtion methods is dt set tht is usully discrete nd in the
More informationCHAPTER 5 Spline Approximation of Functions and Data
CHAPTER 5 Spline Approximtion of Functions nd Dt This chpter introduces number of methods for obtining spline pproximtions to given functions, or more precisely, to dt obtined by smpling function. In Section
More informationSurfaces. Differential Geometry Lia Vas
Differentil Geometry Li Vs Surfces When studying curves, we studied how the curve twisted nd turned in spce. We now turn to surfces, two-dimensionl objects in three-dimensionl spce nd exmine how the concept
More informationDetermining Single Connectivity in Directed Graphs
Determining Single Connectivity in Directed Grphs Adm L. Buchsbum 1 Mrtin C. Crlisle 2 Reserch Report CS-TR-390-92 September 1992 Abstrct In this pper, we consider the problem of determining whether or
More informationThis notebook investigates the properties of non-integer differential operators using Fourier analysis.
Frctionl erivtives.nb Frctionl erivtives by Fourier ecomposition by Eric Thrne 4/9/6 This notebook investigtes the properties of non-integer differentil opertors using Fourier nlysis. In[]:=
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationSome necessary and sufficient conditions for two variable orthogonal designs in order 44
University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Some necessry n sufficient conitions for two vrile orthogonl esigns in orer
More informationSpring 2018 Midterm Exam 1 March 1, You may not use any books, notes, or electronic devices during this exam.
15-112 Spring 2018 Midterm Exm 1 Mrch 1, 2018 Nme: Andrew ID: Recittion Section: You my not use ny books, notes, or electronic devices during this exm. You my not sk questions bout the exm except for lnguge
More informationReducing Costs with Duck Typing. Structural
Reducing Costs with Duck Typing Structurl 1 Duck Typing In computer progrmming with object-oriented progrmming lnguges, duck typing is lyer of progrmming lnguge nd design rules on top of typing. Typing
More informationApproximation by NURBS with free knots
pproximtion by NURBS with free knots M Rndrinrivony G Brunnett echnicl University of Chemnitz Fculty of Computer Science Computer Grphics nd Visuliztion Strße der Ntionen 6 97 Chemnitz Germny Emil: mhrvo@informtiktu-chemnitzde
More informationfraction arithmetic. For example, consider this problem the 1995 TIMSS Trends in International Mathematics and Science Study:
Brringer Fll Mth Cmp November, 06 Introduction In recent yers, mthemtics eductors hve begun to relize tht understnding frctions nd frctionl rithmetic is the gtewy to dvnced high school mthemtics Yet, US
More informationΕΠΛ323 - Θεωρία και Πρακτική Μεταγλωττιστών
ΕΠΛ323 - Θωρία και Πρακτική Μταγλωττιστών Lecture 3 Lexicl Anlysis Elis Athnsopoulos elisthn@cs.ucy.c.cy Recognition of Tokens if expressions nd reltionl opertors if è if then è then else è else relop
More informationMIPS I/O and Interrupt
MIPS I/O nd Interrupt Review Floting point instructions re crried out on seprte chip clled coprocessor 1 You hve to move dt to/from coprocessor 1 to do most common opertions such s printing, clling functions,
More information