A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES. b y HAROLD G. LAWRENCE A THESIS OREGON STATE UNIVERSITY MASTER OF ARTS
|
|
- Melinda Isabel Poole
- 5 years ago
- Views:
Transcription
1 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 1963
2 APPROVED: L I ' V L Professor of Mti'l'i'(mt'ic s In Chrge of Mjor vn1rmn or 1V11:nemucs ~runent Chirmn of SchUGrdu&' Committ;;"""' / Den of Grdute School Dte thesis is presented August 3, 1962 Typed by Crol Bker
3 ACKNOWLEDGEMENT The uthor is indebted to Dr. B. H. Arnold for the suggestion of the subje ct of this pper nd for his helpful comments C.ur ing its writing.
4 TABLE OF CONTENTS CHAPTER Pge I. INTRODUCTION 1 II. ORIGIN OF PROBLEM 2 III. PRODUCT AND QUOTIENT SPACES 4 IV. GENERALIZED PROCEDURE 14 V. EXAMPLES 22 BIBLIOGRAPHY 26
5 A GENERALIZED PROCEDURE FOR DEFINING QUOTIENT SPACES Chpter I INTRODUCTION In the study of ny concept one my ttempt to generlize the concept so tht for specil cse of the gener.:...lizlon the originl concept is obtined. This is done with the hope tht the generliztion will led to some interesting results. It is the object here to generlize the procedure for defining the quotient topology nd quotient spce. In chpter two the problem will be outlined nd in chpter three those definitions nd theorems will be given which will be needed in chpter four in giving the generlized definitions. Finlly, some exmples will be given.
6 2 Chpter II ORIGIN OF PROBLEM Let X nd Y be sets nd f: X-7 Y be trnsformtion. From topology for X topology for Y my be defined reltive to f nd from topology for Y topology for X my be defined reltive to. The detils re presented in Chpter III. The cse of defining topology on the crtesin product ~S of fmily of topologicl spces {s} indexed by set A, reltive to the projection mppings p : II s ---7 sb b A nse s in the definition of product spce nd is treted in Chpter III of J. L. Kelley's, "Generl Topology" (2, p }. In forming the product spce there is given fmily of trnsformtions p with common domin, II S. Ech p is mde A continuous by giving the domin II S the pproprite topology. A The quotient topology hs been defined on set Y reltive to topologicl spce X nd single trnsformtion f: X----7Y
7 3 so tht Y hs the lrgest topology such tht f is continuous. The following questions, which re not treted by Kelley, rise. Given fmily {s) of topologicl spces nd fmily of trnsformtions onto common rnge Y for ech in n index set A, cn Y be topologized with the lrgest topology such tht ll the f continuous? 1 so, is this procedure then generliztion of the procedure for defining the quotient topology? Is it possible to obtin from the fmily {s} of topologicl spces single topologicl spce X together with single trnsformtion f, obtined from the fmily (f} of trnsformtions, which determines exctly tht sme topology for Y tht mkes ll the f continuous? re It is the purpose of this pper to generlize the procedure for defining the quotient topology by showing how set Y my be topologized with the lrgest topology such tht, given the collections {f} nd {s}. ech of the trnsformtions f is continuous nd to nswer the bove questions.
8 4 Chpter III PRODUCT AND QUOTIENT SPACES In this chpter the concepts of product nd quotient spce will be defined nd those definitions nd theorems which will be needed in the following chpters will be given. Definition 1. A topology is fmily T of subsets of set S. The members of T re clled open sets nd stisfy the xioms: 0 1 The u nion of ny number of open sets is n open set. n open set. 0 The intersectior: of ny finite number of open sets is 2 0 Both Snd the empty set, (/J, re open. 3 The set S is clled the spce of the topology T nd the pir (S, T) is clled topologicl spce. Where the topology is understood, we my spek of the topologicl s pce S. Definition 2. A collection of subsets { B ) of given spce S is bsis for topology in S provided tht
9 5 1. UB =Snd, 2. If p is point of B nb, then there is n element B b ~ c of {B) which contins p nd is contined in BnBb. The topology for which { B } is bsis is obtined by letting s et be open in S if nd C' n] y if.it i ueion. of ele ments of Definition 3. A collection { U } of subsets of spce S is clled subbsis for topology in S provided tht the fmily of ll finite intersections of members of { U } is bsis for topology in S. Definition 4. A trnsformtion f of topologicl spce X into topologicl spce Y is continuous if nd only if for U open in Y, C 1 (U) is open in X. Definition 5. A home 0morphism is continuous one-to-one trnsformtion f of topologicl spce X onto topologicl spce Y such tht f - l is lso continuous. Given fmily ( S } of topologicl spces indexed by
10 set A, the crtesin product IIAS is the set of ll functions f on A 6 such tht f () is in S for ech in A. The set ITAS is the spce of the topologicl spce known s the product spce. In order to give the topology of the product spce, the projection mpping is defined by rr s ~s P b A b p (f) ::.: f(b). b - 1 The fmily of ll sets of the form pb (U) for b in A nd U open in S is then tken s subbsis for topology in II S According b A to Definition 3, the fmily B - { 0 l 0 is finite intersection of sets of the form must stisfy the conditions of Definition 2 to be bsis for topology in IIAS is stisfied, let U = S, then To see tht the first condition tht UB = II S A but for every f in 1'I S, ccording to d e finition, p (f) =f () where A f() is ins. Hence, since
11 p (U) =p (S ) = II S A is in B, UB = II S Let 0 nd 0 be in B, 0 n0 is lso finite A intersection; hence, 0 no is in Bnd it follows tht the s econdcon 1 2 clition i s stisfied nd tht B is bsis for topology for TI S. A Definition 6. Given fmily of spces { S ) indexed by set A, the product spce is the crtesin product II S A with the topology for which subbsis is the collection of ll sets of the form pb -l (U), u open in sb. topology. The topology of the product spce is clled the product Definition 7. The quotient topology for the rnge Y of trnsformtion f defined on topologicl spce X is the fmily Q = { U I U is subset of Y such tht C 1 (U) is open in X}. Tht the fmily Q is topology follows from the fct tht the inverse of union of n rbitrry fmily F of subsets of Q is the union of the inverses of the members of F nd since the union
12 of the inverses of the members off is open in X, the union of the members of F is open in Y. Thus the fmily Q stisfies xiom 0 1 Since the inverse of n intersection of members of fmily F of subsets of Q is the intersection of the inverses of the members of F, iff hs finite number of members, the intersection of the 8 inverses of the members off is open in X nd hence the intersection of the members of F is open in Y. Thus the fmily Q stisfies xiom 0 Since f-l (Y) = X which is open in X, Y is 2 member of Q. The empty set is open in Y since the set of ll x in X such tht f (x} is in the empty set is empty nd hence open in X. Thus 0 3 is stisfied nd Q is topology. Let the rnge Y of trnsformtion f, defined on topologicl spce X, hve the quotient topology Q nd consider the fmily { f- 1 (y )) for y in Y of disjoint subsets of X. Now the union of the members of { r l(y)} is X. Let ~ = {d -1 } I d = f (y}' for some y in Y, then~ is decomposition of X into disjoint sets which cover X. Theorem l. If the projection mpping p :. X--~~ is defined by
13 -1 P (x) = f (f (x)) nd Ll is given the quotient topology reltive to P nd X, 9 then the topologicl spce.:lis homeomorphic to the topologicl spce (Y, Q). A homeomorphism is given by -1 g (y) =f (y). Proof: l. Let d be ny member of Ll. Then - l d ::.: f (y) for some y in Y. For tht y, - l g (y) = f (y) = d 0 Therefore g is mpping onto Ll. 2. Let y nd y be in Y with y =l-y Since f is single vlued, - l -1 g (y l) = f (y l ) {; f (y 2) = g (y 2) Tht is g(y )-/; g(y ). 1 2 (Y, Q) onto Ll. Therefore g is one-to--one mpping of 3. Let U be open in Ll. -1 g (U) = ( y j g (y) is in U} = ( y I f-l (y)is contined in p-l (U)} -1 l but P (U) is open in X nd hence g- (U) is open in Y. Therefore g is continuous.
14 4. Let U be open Y, then g (U) :::: f-l (U) is open in X nd 10-1 hence is open in~ lso. Therefore g is continuous nd g is homeomorphism. Definition 8. The topologicl spce A is. clled the quotient spce reltive to P nd X. The term decomposition spce is sometimes used 1n plce of quotient spce. The concept of disjoint union of topologicl spces to be defined now will be needed. Definition 9. Given fmily {s} of topologicl spces, indexed by some set A, disjoint union of the fmily {S} is the spce UAT where for ech, T is homeomorphic to S nd for :/: b, T nt is empty. The spce U T b A is topologized by tking s bsis the union of the topologies for the topologicl spces T Tht the collection B = { u I U is open 1n some T ) is bsis follows from the fct tht T is open in the topologicl
15 spce T for e ch nd hence the union of ll the members of B is equl to U T 'A nd the first condition of Definition 2 is fulfilled. If U nd V re ny two members of B, then unv is empty unless U nd V re subsets of the sme spce T In this cse unv is open 11 by xiom 0 2 nd it follows tht condition 2 is fulfilled. Hence, B is bsis for topology in U T A Definition 10. The topology for UAT dete rmined by the bsis B is clled the disjoint union topology. If the given fmily {S} is lredy disjoint fmily, then for ech, T my be just S. If, on the other hnd, the fmily {s} is not disjoint, the fmily ( T )my be obtined by the following proce dure. For ech, {} is topologicl spce in which the only open sets re the empty set nd {). The cross product of S nd {). denoted by sx {}' yields fmily of topologicl spces SX {} = T for which, if does not equl b, T ntb is empty. It is seen tht for ech, T is homeomorphic to S Thus if set U is open ins, the set UX {} is open in T nd conversely.
16 Tht the union of n rbitrry fmily { S ) of topologicl spces, mking set open if it is the union of sets ech open in some S, is not necessrily topologicl spce is seen in the following 12 exmple. Let S 1 be the open intervl (0, 2} with the indiscrete topology (S nd the empty set re the only open sets) nd s be the 1 2 open intervl (1, 3) lso with the indiscrete topology. Then (0, 2)n(l, 3):: (1, 2) which is not open in (0, 2)U(l, 3) nd hence xiom 0 2 fils to be stisfied. Another theorem which will be needed is the following. Theorem 2. The intersection of ny number of topologies for spce S is topology for S. Proof: For ech in A, let 0 be topology for the spce S. Consider the intersection n 0. A l. The union of n rbitrry collection C of members of n 0 ~ is member of the intersection since the members of the collection C re present in ech 0 members of C is member of ech 0. nd hence the union of the 2. The intersection of finite collection C of members of
17 nao is member of nao since the members of C re present 13 in ech 0 nd hence the finite intersection of the members of C is member of ech 0 3. S nd the empty set re in ech 0 ; hence, S nd the empty set re in n 0 A definition. We re now in position to proceed with the generlized
18 14 Chpter IV GENERALIZED PROCEDURE Let collection { S ) of topologicl spces indexed by set A be g~ven 3.nd for e.c L in A, t rnsformticm S ---7Y from S onto the common rnge Y. If G denotes the quotient topology for Y reltive to f nd S, then by Theorem 2, G = n G A is topology for Y. Thus (Y, G) is topologic 2. l spce. Since G is the lrgest topology (hs the most open sets) for Y s uc h tht f is continuous function from S onto Y, it follows tht G is the lrgest topology for Y such tht ech of the functions f 1s continuous function. In this sense one might think of G s being the quotient topology reltive to the fmilies {s) nd{). Certinly if {S) nd {f} re singletons, then G is the quotient topology s previously defined. Thus we mke the following de inition. Definition 11. Let f S Y be trnsformtion nd G the quotient
19 topology on Y reltive to f nd the topologicl spce S for ech in the index set A, then the ~G is clled the quotient topology reltive to the fmilies {f) nd {s) 15 Theorem 3. Let J be the colle ction of ll sets of the form f -l (O) where 0 is in G, then J is topology for the spce S. Proof: If { ub) is n rbitrry collection of sets of the form f -l (Ob), Ob in G, then is open in (Y' G), U{ob) is open lll (Y' G). Hence - 1 is set of the form f (0), 0 in G, nd is therefore If { U,.., U } is finite collection of sets where 1 n - 1 U. = f (0.), 0. n element of G, then the n n u = n. n f - 1 (0.) i =1 i 1= 1 1 = f - 1 ( n. n (0 ) ). 1= 1 i Since 0 is open in (Y, G) for i = 1,..., n, the nn (0.) is open in i i= l 1
20 16 (Y,G) nd hence then n U is in J. S i= 1 i nd the empty set re m J. S is in J since Y is in G nd f - l (Y) = S. The empty set is - 1 in J since it is in G nd f of the empty set is empty. It is thus seen tht the collection of sets J stisfies the three xioms 0, 1 Definition 12. The topology J is clled the G-dependent topology for S. It might be noted lso tht not only is J topology for S, but it is subtopology of the given topology for S, for if 0 is open - l in Y, f (0) is open in S with the originl topology since f is c ontinuous. Let us form the disjoint union over A of the fmily {(s, J )) of topologicl spces nd let T then the collection of ll sets ux{) such tht U is in J is bsis for topology T, Mle disjoint union topology, in U T A While the procedure for obtining the quotient topology G reltive to the fmilies {f) nd {s) is new, tht sme topology might be obtined from the trnsformtion
21 17 defined by f (x, ) = f (x). The motivtion for using the disjoint union is gin seen through the mnner in which the function f is defined on U T. A For not equl to b, S nd Sb might hve some point s in common, where f (s) = y nd fb (s) = y nd y does not equl y. The use of the disjoint union gurntees tht f is single vlued, since (s, ) nd (s, b) re distinct points in U T, for t. A lest the second elements of the ordered pirs re different. Theorem 4. If Y is given the quotient topology Q reltive to f nd ( UAT, T), the topologicl spces (Y,Q) nd (Y,G) re ctully the sme spce. Proof: - 1 Let U be open in (Y, G). f (U) is open in (S, J ) for ech in A. Thus the U (f -l (U)X {}) is open in U T. Since A A U (f - 1 (U)X {)), A U is open in (Y, Q) nd therefore, G is subset of Q. -1 Secondly, let U be open in (Y, Q), then f (U) is open m U T A nd
22 18 for some subset B of A nd V ope n in (S, J ); tht is, C 1 (U) is union of bsis sets in the disjoi n t union. Since f is mpping onto Y, f ( U (V X {) )) = U. B But UBf (V ). - l V, being in (S, J ), is set of the form f (O) where 0 is - 1 member of G. Hence f (f (0)) = 0 is in G; t ht is, f (V ) is in G for ech in B nd consequently U f (V ) = U is in G. Q is therefore B subset of G nd the topologic l sp c es (Y, G) nd (Y, Q) re identicl. Consider the fmily ~ = { dj d = U A ( - l(y)x{}) for yin Y). Now~ is fmily of disjoint s ubsets of UAT which cover UAT. These sub sets re tken s the points in the spce ~ nd~ is given the quotient topology r e ltive to the projection p' U T-'-4 ~ A
23 19 defined by In cse T - 1 tht d = U f (y} for y in Y. A 1 P'(x,} = U (f- (f (x}}xf$). A = S, we could tke!:::j. 1 s the set of ll d such Definition 13. The topologicl spce A' is clled the quotient spce reltive to the fmily of trnsformtions f S Y. Theorem 5. If!:;,. is the quotient spce reltive to the trnsformtion f: U T ~ Y, then A is the sme topologicl spce s A'. A Proof: Since A is the quotient spce reltive to the trnsformtion f: UAT Y, ~hs the quotient topology reltive to the projection defined by P: U T---?A A P (x, ) = f- 1 (f (x, ) ) A set U is open in A if nd only if P-l (U) is open m UA T ' P(x,}:::; C 1 (f(x,)}isin l~. A set U is open in A 1 if nd only if P'- 1 (U} is open m U T. A
24 p -l(u)= { (x,) I P'(x,) = 20 U (f -l (f (x) )X {} ) is in u}. A But f - 1 (f (x, ) ) = C 1 (f {x) ) = 1 Hence A nd A re the sme topologicl spce. In nlogy with Theorem 1, we hve the following theorem. Theorem 6. The quotient spce A' reltive to the fmily of trnsformtion f: S---? Y from S onto Y is homeomorphic to the spce Y with the quotient topology G reltive to the fmilies {f} nd Proof: The quotient spce A is homeomorphic to (Y, Q) by Theorem 1, but A is A 1 by Theorem 5 nd (Y _, Q) is (Y, G) by Theorem 4. Suppose {f} nd {s}re singletons, (i.e., A = {}), reltive to the single trns- then the quotient topology G formtion f : S ~ Y is the quotient topology G reltive to the fmilies { f } nd { S } The G-dependent topology J is just the originl topology for S. We my let T = S in forming the disjoint union. In this cse then,
25 J is the disjoint union topology. f =f nd U T = S so tht A the quotient spce relti.ve to the fmilies {f} nd {s} is the quotient spce reltive to the single trnsformtion f : S --jy. Thus it is seen tht for the singletons {f} nd {S} the generlized procedure gives the sme results s the procedure previously defined for single trnsformtion. The generlized procedure for defining the quotient topology nd tbe quotient spce reltive to given fmily of trnsformtions f : S ~y is summrized in the following steps. 1. Determine the quotie nt topology G for Y reltive to f nd S for ech in A. 2. Determine the quotient topology G reltive to the 21 G = n G A 3. Determine the G-dependent topology J for ech S. 4. Determine the disjoint union topologicl spce 5. Determine the quotient spce!::i' reltive to the fmily of trnsformtions f: S---) Y.
26 22 Ch p ter V EXAMPLES Exmple l. A = { x I xis re l n u mber} S == E 1, the rel numbers with the topology (clled the usul topology of the rel numbers) b sis for which is the set of ll open intervls. Y = A ech in A. f : S ~y is given by f (x) ::: x for ech in A. l. (Y, G ) = E 1 for ech in A. 2. G = flg is the u s p-l topology. 3. The G-dependent topology J is the usul topology for 4. Let T = (S, J)X{}. UA T = {(r, s) I r nd s re rel numbers} Thus bsis for the disjoint union topology T is the set of ll U such tht for some rel numbers r, s, nd t, with r < s, U = { (x, t ) I r < x < s ).
27 5. A'= {d I d = l1_(f- 1 (x)x(}) for x in Y} 23 1 UA(f- (x}x{}) = {(x,} I is rel number} P': (UAT' T)---}A'is given by I 1 {} P (x,} = UA(f (f(x}x ) = { (x, ) I is rel number } A' with the quotient topology reltive to P' nd ( U T, T) A is the quotient spce reltive to the fmilies {f} nd { sj. rel number. f: ( UA T ' T}----+Y is given by f(x, ) =f (x) = x for ech 1 f- (x) = { (x, ) I is rel n urnbe r. } P: ( U T, T)~ A is given by A P (x, ) = C 1 ( (x, )) = C 1 (x). A with the quotient topology reltive to P nd ( U AT' T) is seen to be the sme spce s A 1 A bsis for the quotient topology in A' is the collection of ll subsets D of A of the form spce (Y,G) = El. D = { d I d = f-l (x) where c::: x< b} The topologicl spce A is thus homeomorphic to the
28 It is observed tht the topology T for the plne hs s subtopology the usul topology of the plne. 24 Exmple 2. A=={l,2} S == {, b, c} 1 The topology for S 1 is the fmily s 2 =={d,e,h} { ~,s, {}}. 1. The topology for s 2 is the fmily Y = { r, t} {Q),S 2, {d), { d,e), {h}, {d,~}. f : S ~y is given by 1 1 f ()= r, f (b) == t, f (c} = t f2: s2~ y is given by 2 (d} = r, 2 (e} = r, (h) = t G ={Q),Y,{r}} 1 G ={Q),Y,{r),(t}} 2 2. G=G ng ={p,y,{r}} The G~dependent topology J l is the set {Q), s, {}} 1 The G-dependent topology J 2 is the set { Q), s, { d, e}}. 2
29 25 4. disjoint. T ={Cb.,s 1, s 2, {}, { d, e}, {, d, e}, {, b, c, d, e}, {, d, e, h}, {, b, c, d, e, h}} is the disjoint union topology. = {{,d,e}.{b,c,h}} P': ( U T, T) ~ ~ is given by A P' () = P 1 (d) = P' (e) = {, d, e} nd P'(b) = P ' (c) = P'(h) = {b,c,h). The quotient topology in~ 1 is the fmily {~ ~'.{,d,e}}. f: ( U T, T) ~ Y is given by A f() = f(d) = f(e) = r nd f(b) = f(c) = f(h) = t. Thus ~= {{,d,e), {b,c,h}} =~' Thus it is seen tht the topologicl spce ~is homeomorphic to the spce (Y, G).
30 26 BIBLIOGRAPHY 1. Hocking, John G., nd Gil S. Young. Topology. Reding, Msschusetts, Addison-Wesley, p. 2. Kelley, John L. Generl Topology. Princeton, New Jersey, D. Vn Nostrnd, p.
such 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 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 informationa(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
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
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 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 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 informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationMA1008. 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 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 information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
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 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 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 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 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 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 informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
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 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 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 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 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 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 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 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 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 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 information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
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 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 informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
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 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 informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
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 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 informationLecture 17: Continuous Functions
Lecture 17: Continuous Functions 1 Continuous Functions Let (X, T X ) and (Y, T Y ) be topological spaces. Definition 1.1 (Continuous Function). A function f : X Y is said to be continuous if the inverse
More informationLecture 12 : Topological Spaces
Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X
More informationCompanion Mathematica Notebook for "What is The 'Equal Weight View'?"
Compnion Mthemtic Notebook for "Wht is The 'Equl Weight View'?" Dvid Jehle & Brnden Fitelson July 9 The methods used in this notebook re specil cses of more generl decision procedure
More information8.2 Areas in the Plane
39 Chpter 8 Applictions of Definite Integrls 8. Ares in the Plne Wht ou will lern out... Are Between Curves Are Enclosed Intersecting Curves Boundries with Chnging Functions Integrting with Respect to
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 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 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 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 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 informationProduct of polynomials. Introduction to Programming (in C++) Numerical algorithms. Product of polynomials. Product of polynomials
Product of polynomils Introduction to Progrmming (in C++) Numericl lgorithms Jordi Cortdell, Ricrd Gvldà, Fernndo Orejs Dept. of Computer Science, UPC Given two polynomils on one vrile nd rel coefficients,
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 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 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 informationIn Search of the Fractional Four Color Theorem. Ari Nieh Gregory Levin, Advisor
In Serch of the Frctionl Four Color Theorem by Ari Nieh Gregory Levin, Advisor Advisor: Second Reder: (Arthur Benjmin) My 2001 Deprtment of Mthemtics Abstrct In Serch of the Frctionl Four Color Theorem
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 informationTopics in Analytic Geometry
Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt
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 informationA Fixed Point Approach of Quadratic Functional Equations
Int. Journl of Mth. Anlysis, Vol. 7, 03, no. 30, 47-477 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ijm.03.86 A Fixed Point Approch of Qudrtic Functionl Equtions Mudh Almhlebi Deprtment of Mthemtics,
More informationIntroduction Transformation formulae Polar graphs Standard curves Polar equations Test GRAPHS INU0114/514 (MATHS 1)
POLAR EQUATIONS AND GRAPHS GEOMETRY INU4/54 (MATHS ) Dr Adrin Jnnett MIMA CMth FRAS Polr equtions nd grphs / 6 Adrin Jnnett Objectives The purpose of this presenttion is to cover the following topics:
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More information1 The Definite Integral
The Definite Integrl Definition. Let f be function defined on the intervl [, b] where
More informationAPPLICATIONS OF INTEGRATION
Chpter 3 DACS 1 Lok 004/05 CHAPTER 5 APPLICATIONS OF INTEGRATION 5.1 Geometricl Interprettion-Definite Integrl (pge 36) 5. Are of Region (pge 369) 5..1 Are of Region Under Grph (pge 369) Figure 5.7 shows
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 informationUnion-Find Problem. Using Arrays And Chains. A Set As A Tree. Result Of A Find Operation
Union-Find Problem Given set {,,, n} of n elements. Initilly ech element is in different set. ƒ {}, {},, {n} An intermixed sequence of union nd find opertions is performed. A union opertion combines two
More informationON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1.
ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS S.S. Kim, S.S. Drgomir, A. White nd Y.J. Cho Abstrct. In this pper, we shll give generliztion of the Grüss type inequlity nd obtin
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 informationFall 2018 Midterm 1 October 11, ˆ You may not ask questions about the exam except for language clarifications.
15-112 Fll 2018 Midterm 1 October 11, 2018 Nme: Andrew ID: Recittion Section: ˆ You my not use ny books, notes, extr pper, or electronic devices during this exm. There should be nothing on your desk or
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 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 information2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to
2.8. Connectedness A topological space X is said to be disconnected if X is the disjoint union of two non-empty open subsets. The space X is said to be connected if it is not disconnected. A subset of
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 informationSuffix trees, suffix arrays, BWT
ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time
More informationMA 124 (Calculus II) Lecture 2: January 24, 2019 Section A3. Professor Jennifer Balakrishnan,
Wht is on tody Professor Jennifer Blkrishnn, jbl@bu.edu 1 Velocity nd net chnge 1 2 Regions between curves 3 1 Velocity nd net chnge Briggs-Cochrn-Gillett 6.1 pp. 398-46 Suppose you re driving long stright
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
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 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 informationAML710 CAD LECTURE 16 SURFACES. 1. Analytical Surfaces 2. Synthetic Surfaces
AML7 CAD LECTURE 6 SURFACES. Anlticl Surfces. Snthetic Surfces Surfce Representtion From CAD/CAM point of view surfces re s importnt s curves nd solids. We need to hve n ide of curves for surfce cretion.
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 informationSolving Problems by Searching. CS 486/686: Introduction to Artificial Intelligence Winter 2016
Solving Prolems y Serching CS 486/686: Introduction to Artificil Intelligence Winter 2016 1 Introduction Serch ws one of the first topics studied in AI - Newell nd Simon (1961) Generl Prolem Solver Centrl
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 informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
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 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 informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationCSEP 573 Artificial Intelligence Winter 2016
CSEP 573 Artificil Intelligence Winter 2016 Luke Zettlemoyer Problem Spces nd Serch slides from Dn Klein, Sturt Russell, Andrew Moore, Dn Weld, Pieter Abbeel, Ali Frhdi Outline Agents tht Pln Ahed Serch
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 informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationStep-Voltage Regulator Model Test System
IEEE PES GENERAL MEETING, JULY 5 Step-Voltge Regultor Model Test System Md Rejwnur Rshid Mojumdr, Pblo Arboley, Senior Member, IEEE nd Cristin González-Morán, Member, IEEE Abstrct In this pper, 4-node
More informationRigid Body Transformations
igid od Kinemtics igid od Trnsformtions Vij Kumr igid od Kinemtics emrk out Nottion Vectors,,, u, v, p, q, Potentil for Confusion! Mtrices,, C, g, h, igid od Kinemtics The vector nd its skew smmetric mtri
More informationFall 2017 Midterm Exam 1 October 19, You may not use any books, notes, or electronic devices during this exam.
15-112 Fll 2017 Midterm Exm 1 October 19, 2017 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
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 informationA Transportation Problem Analysed by a New Ranking Method
(IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr
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 informationTopic 2: Lexing and Flexing
Topic 2: Lexing nd Flexing COS 320 Compiling Techniques Princeton University Spring 2016 Lennrt Beringer 1 2 The Compiler Lexicl Anlysis Gol: rek strem of ASCII chrcters (source/input) into sequence of
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
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 informationEngineer To Engineer Note
Engineer To Engineer Note EE-186 Technicl Notes on using Anlog Devices' DSP components nd development tools Contct our technicl support by phone: (800) ANALOG-D or e-mil: dsp.support@nlog.com Or visit
More informationarxiv:cs.cg/ v1 18 Oct 2005
A Pir of Trees without Simultneous Geometric Embedding in the Plne rxiv:cs.cg/0510053 v1 18 Oct 2005 Mrtin Kutz Mx-Plnck-Institut für Informtik, Srbrücken, Germny mkutz@mpi-inf.mpg.de October 19, 2005
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 informationTopology I Test 1 Solutions October 13, 2008
Topology I Test 1 Solutions October 13, 2008 1. Do FIVE of the following: (a) Give a careful definition of connected. A topological space X is connected if for any two sets A and B such that A B = X, we
More informationTyping with Weird Keyboards Notes
Typing with Weird Keyords Notes Ykov Berchenko-Kogn August 25, 2012 Astrct Consider lnguge with n lphet consisting of just four letters,,,, nd. There is spelling rule tht sys tht whenever you see n next
More information