Basic Geometry and Topology
|
|
- Stanley Watson
- 5 years ago
- Views:
Transcription
1 Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology Metric spces Topologicl spces Constructions with topologicl spces Suspce topology Product topology Quotient topology Properties of topologicl spces Husdorff spces Compct spces Connected spces Pointset Topology 1.1 Metric spces We recll tht mp f : R m R n etween Eucliden spces is continuous if nd only if where x X ɛ > 0 δ > 0 y X d(x, y) < δ d(f(x), f(y)) < ɛ, (1.1) d(x, y) = x y = (x 1 y 1 ) (x n y n ) 2 R 0 is the Eucliden distnce etween two points x, y in R n. Exmple 1.2. (Exmples of continuous mps.) 1. The ddition mp : R 2 R, x = (x 1, x 2 ) x 1 + x 2 ; 2. The multipliction mp m: R 2 R, x = (x 1, x 2 ) x 1 x 2 ; The proofs tht these mps re continuous re simple estimtes tht you proly rememer from clculus. Since the continuity of ll the mps we ll look t in these notes is proved y expressing them in terms of the mps nd m, we include the proofs of continuity of nd m for completeness. 1
2 1 POINTSET TOPOLOGY 2 Proof. To prove tht the ddition mp is continuous, suppose x = (x 1, x 2 ) R 2 nd ɛ > 0 re given. We clim tht for δ := ɛ/2 nd y = (y 1, y 2 ) R 2 with d(x, y) < δ we hve d((x), (y)) < ɛ nd hence is continuous function. To prove the clim, we note tht d(x, y) = x 1 y x 2 y 2 2 nd hence x 1 y 1 d(x, y), x 1 y 1 d(x, y). It follows tht d((x), (y)) = (x) (y) = x 1 + x 2 y 1 y 2 x 1 y 1 + x 2 y 2 2d(x, y) < 2δ = ɛ. To prove tht the multipliction mp m is continuous, we clim tht for δ := min{1, ɛ/( x 1 + x 2 + 1)} nd y = (y 1, y 2 ) R 2 with d(x, y) < δ we hve d(m(x), m(y)) < ɛ nd hence m is continuous function. The clim follows from the following estimtes: d(m(y), m(x)) = y 1 y 2 x 1 x 2 = y 1 y 2 x 1 y 2 + x 1 y 2 x 1 x 2 y 1 y 2 x 1 y 2 + x 1 y 2 x 1 x 2 = y 1 x 1 y 2 + x 1 y 2 x 2 d(x, y)( y 2 + x 1 ) d(x, y)( x 2 + y 2 x 2 + x 1 ) d(x, y)( x 1 + x 2 + 1) < δ( x 1 + x 2 + 1) ɛ Lemm 1.3. The function d: R n R n R 0 hs the following properties: 1. d(x, y) = 0 if nd only if x = y; 2. d(x, y) = d(y, x) (symmetry); 3. d(x, y) d(x, z) + d(z, y) (tringle inequlity) Definition 1.4. A metric spce is set X equipped with mp d: X X R 0 with properties (1)-(3) ove. A mp f : X Y etween metric spces X, Y is continuous if condition (1.1) is stisfied. n isometry if d(f(x), f(y)) = d(x, y) for ll x, y X; Two metric spces X, Y re homeomorphic (resp. isometric) if there re continuous mps (resp. isometries) f : X Y nd g : Y X which re inverses of ech other. Exmple 1.5. An importnt clss of exmples of metric spces re susets of R n. Here re prticulr exmples we will e tlking out during the semester:
3 1 POINTSET TOPOLOGY 3 1. The n-disk D n := {x R n x 1} R n, nd D n r := {x R n x r}, the n-disk of rdius r > 0. The diltion mp D n D n r x rx is homeomorphism etween D n nd D n r with inverse given y multipliction y 1/r. However, these two metric spces re not isometric for r 1. To see this, define the dimeter dim(x) of metric spce X y dim(x) := sup{d(x, y) x, y X} R 0 { }. For exmple, dim(dr n ) = 2r. It is esy to see tht if two metric spces X, Y re isometric, then their dimeters gree. In prticulr, the disks Dr n nd Dr n re not isometric unless r = r. 2. The n-sphere S n := {x R n+1 x = 1} R n The torus T = {v R 3 d(v, C) = r} for 0 < r < 1. Here C = {(x, y, 0) x 2 + y 2 = 1} R 3 is the unit circle in the xy-plne, nd d(v, C) = inf w C d(v, w) is the distnce etween v nd C. 4. The generl liner group GL n (R) = {vector spce isomorphisms f : R n R n } {(v 1,..., v n ) v i R n, det(v 1,..., v n ) 0} = {invertile n n-mtrices} R } n {{ R n } = R n2 n Here we think of (v 1,..., v n ) s n n n-mtrix with column vectors v i, nd the ijection is the usul one in liner lger tht sends liner mp f : R n R n to the mtrix (f(e 1 ),..., f(e n )) whose column vectors re the imges of the stndrd sis elements e i R n. 5. The specil liner group SL n (R) = {(v 1,..., v n ) v i R n, det(v 1,..., v n ) = 1} R n2 6. The orthogonl group O(n) = {liner isometries f : R n R n } = {(v 1,..., v n ) v i R n, v i s re orthonorml} R n2 We recll tht collection of vectors v i R n is orthonorml if v i = 1 for ll i, nd v i is perpendiculr to v j for i j.
4 1 POINTSET TOPOLOGY 4 7. The specil orthogonl group SO(n) = {(v 1,..., v n ) O(n) det(v 1,..., v n ) = 1} R n2 8. The Stiefel mnifold V k (R n ) = {liner isometries f : R k R n } = {(v 1,..., v k ) v i R n, v i s re orthonorml} R kn Exmple 1.6. The following mps etween metric spces re continuous. While it is possile to prove their continuity using the definition of continuity, it will e much simpler to prove their continuity y uilding these mps using compositions nd products from the continuous mps nd m of Exmple 1.2. We will do this elow in Lemm Every polynomil function f : R n R is continuous. We recll tht polynomil function is of the form f(x 1,..., x n ) = i 1,...,i n i1,...,i n x i 1 1 x in n for i1,...,i n R. 2. Let M n n (R) = R n2 e the set of n n mtrices. Then the mp M n n (R) M n n (R) M n n (R) (A, B) AB given y mtrix multipliction is continuous. Here we use the fct tht mp to the product M n n (R) = R n2 = R R is continuous if nd only if ech component mp is continuous (see Lemm 1.21), nd ech mtrix entry of AB is polynomil nd hence continuous function of the mtrix entries of A nd B. Restricting to the invertile mtrices GL n (R) M n n (R), we see tht the multipliction mp GL n (R) GL n (R) GL n (R) is continuous. The sme holds for the sugroups SO(n) O(n) GL n (R). 3. The mp GL n (R) GL n (R), A A 1 is continuous (this is homework prolem). The sme sttement follows for the sugroups of GL n (R). The Eucliden metric on R n given y d(x, y) = (x 1 y 1 ) (x n y n ) 2 for x, y R n is not the only resonle metric on R n. Another metric on R n is given y d 1 (x, y) = n x i y i. (1.7) i=1 The question rises whether it cn hppen tht mp f : R n R n is continuous with respect to one of these metrics, ut not with respect to the other. To see tht this doen t hppen, it is useful to chrcterize continuity of mp f : X Y etween metric spces X, Y in wy tht involves the metrics on X nd Y less directly thn Definition 1.4 does. This lterntive chrcteriztion will e sed on the following notion of open susets of metric spce.
5 1 POINTSET TOPOLOGY 5 Definition 1.8. Let X e metric spce. A suset U X is open if for every point x U there is some ɛ > 0 such tht B ɛ (x) U. Here B ɛ (x) = {y X d(y, x) < ɛ} is the ll of rdius ɛ round x. To illustrte this, lets look t exmples of susets of R n equipped with the Eucliden metric. The suset D n r = {v R n v r} R n is not open, since for for point v D n r with v = r ny open ll B ɛ (v) with center v will contin points not in D n r. By contrst, the suset B r (0) R n is open, since for ny x B r (0) the ll B δ (x) of rdius δ = r x is contined in B r (0), since for y B δ (x) y the tringle inequlity we hve d(y, 0) d(y, x) + d(x, 0) < δ + x = (r x ) + x = r. Lemm 1.9. A mp f : X Y etween metric spces is continuous if nd only if f 1 (V ) is n open suset of X for every open suset V Y. Corollry If f : X Y nd g : Y Z re continuous mps, then so it their composition g f : X Z. Exercise () Prove Lemm 1.9 () Assume tht d, d re two metrics on set X which re equivlent in the sense tht there re constnts C, C > 0 such tht d(x, y) Cd 1 (x, y) nd d 1 (x, y) C d(x, y) for ll x, y X. Show tht suset U X is open with respect to d if nd only if it is open with respect to d. (c) Show tht the Eucliden metric d nd the metric (1.7) on R n re equivlent. This shows in prticulr tht mp f : R n R n is continuous w.r.t. d if nd only if it is continuous w.r.t. d Topologicl spces Lemm 1.9 nd Exercise () ove shows tht it is etter to define continuity of mps etween metric spces in terms of the open susets of these metric spce insted of the originl ɛ-δ-definition. In fct, we cn go one step further, forget out the metric on set X ltogether, nd just consider collection T of susets of X tht we declre to e open. The next result summrizes the sic properties of open susets of metric spce X, which then motivtes the restrictions tht we wish to put on such collections T. Lemm Open susets of metric spce X hve the following properties. (i) X nd re open. (ii) Any union of open sets is open. (iii) The intersection of ny finite numer of open sets is open. Definition A topologicl spce is set X together with collection T of susets of X, clled open sets which re required to stisfy conditions (i), (ii) nd (iii) of the lemm ove. The collection T is clled topology on X. The sets in T re clled the open sets, nd their complements in X re clled closed sets. A suset of X my e neither closed nor open, either closed or open, or oth. A mp f : X Y etween topologicl spces X, Y is continuous if the inverse imge f 1 (V ) of every open suset V Y is n open suset of X.
6 1 POINTSET TOPOLOGY 6 It is esy to see tht the composition of continuous mps is gin continuous. Exmples of topologicl spces. 1. Let X e metric spce, nd T the collection of those susets of X tht re unions of lls B ɛ (x) in X (i.e., the susets which re open in the sense of Definition 1.8). Then T is topology on X, the metric topology. 2. Let X e set. Then T = {ll susets of X} is topology, the discrete topology. We note tht ny mp f : X Y to topologicl spce Y is continuous. We will see lter tht the only continuous mps R n X re the constnt mps. 3. Let X e set. Then T = {, X} is topology, the indiscrete topology. Sometimes it is convenient to define topology U on set X y first descriing smller collection B of susets of X, nd then defining U to e those susets of X tht cn e written s unions of susets elonging to B. We ve done this lredy when defining the metric topology: Let X e metric spce nd let B e the collection of susets of X of the form B ɛ (x) := {y X d(y, x) < ɛ} (the lls in X). Then the metric topology U on X consists of those susets U which re unions of susets elonging to B. Lemm Let B e collection of susets of set X stisfying the following conditions 1. Every point x X elongs to some suset B B. 2. If B 1, B 2 B, then for every x B 1 B 2 there is some B B with x B nd B B 1 B 2. Then T := {unions of susets elonging to B} is topology on X. Definition If the ove conditions re stisfied, we cll the collection B is clled sis for the topology T or we sy tht B genertes the topology T. It is esy to check tht the collection of lls in metric spce stisfies the ove conditions nd hence the collection of open susets is topology s climed y Lemm Constructions with topologicl spces Suspce topology Definition Let X e topologicl spce, nd A X suset. Then T = {A U U open X} is topology on A clled the suspce topology. Lemm Let X e metric spce nd A X. Then the metric topology on A grees with the suspce topology on A (s suset of X equipped with the metric topology). Lemm Let X, Y e topologicl spces nd let A e suset of X equipped with the suspce topology. Then the inclusion mp i: A X is continuous nd mp f : Y A is continuous if nd only if the composition i f : Y X is continuous.
7 1 POINTSET TOPOLOGY Product topology Definition The product topology on the Crtesin product X Y = {(x, y) x X, y Y } of topologicl spces X, Y is the topology with sis B = {U V U open X, V Y } open The collection B oviously stisfies property (1) of sis; property (2) holds since (U V ) (U V ) = (U U ) (V V ). We note tht the collection B is not topology since the union of U V nd U V is typiclly not Crtesin product (e.g., drw picture for the cse where X = Y = R nd U, U, V, V re open intervls). Lemm The product topology on R m R n (with ech fctor equipped with the metric topology) grees with the metric topology on R m+n = R m R n. Proof: homework. Lemm Let X, Y 1, Y 2 e topologicl spces. Then the projection mps p i : Y 1 Y 2 Y i is continuous nd mp f : X Y 1 Y 2 is continuous if nd only if the component mps re continuous for i = 1, 2. Proof: homework X f Y 1 Y 2 p i Yi Lemm Let X e topologicl spce nd let f, g : X R e continuous mps. Then f + g nd f g continuous mps from X to R. If g(x) 0 for ll x X, then lso f/g is continuous. 2. Any polynomil function f : R n R is continuous. 3. The multipliction mp µ: GL n (R) GL n (R) GL n (R) is continuous. Proof. To prove prt (1) we note tht the mp f + g : X R cn e fctored in the form X f g R R R The mp f g is continuous y Lemm 1.21 since its component mps f, g re continuous; the mp is continuous y Exmple 1.2, nd hence the composition f + g is continuous. The rgument for f g is the sme, with replced y m. To prove tht f/g is continuous, we fctor it in the form X f g R R p 1 (I p 2 ) R R m R, where R = {t R t 0}, p 1 (resp. p 2 ) is the projection to the first (resp. second) fctor of R R, nd I : R R is the inversion mp t t 1. By Lemm 1.21 the p i s re continuous, in clculus we lerned tht I is continuous, nd hence gin y Lemm 1.21 the mp p 1 (I p 2 ) is continuous.
8 1 POINTSET TOPOLOGY 8 To prove prt (2), we note tht the constnt mp R n R, x = (x 1,..., x n ) is oviously continuous, nd tht the projection mp p i : R n R, x = (x 1,..., x n ) x i is continuous y Lemm Hence y prt (1) of this lemm, the monomil function x x i 1 1 x in n is continuous. Any polynomil function is sum of monomil functions nd hence continuous. For the proof of (3), let M n n (R) = R n2 e the set of n n mtrices nd let µ: M n n (R) M n n (R) M n n (R) (A, B) AB e the mp given y mtrix multipliction. By Lemm 1.21 the mp µ is continuous if nd only if the composition M n n (R) M n n (R) µ M n n (R) p ij R is continuous for ll 1 i, j n, where p ij is the projection mp tht sends mtrix A to its entry A ij R. Since the p ij (µ(a, B)) = (A B) ij is polynomil in the entries of the mtrices A nd B, this is continuous mp y prt (2) nd hence µ is continuous. Restricting µ to invertile mtrices, we otin the multipliction mp µ : GL n (R) GL n (R) GL n (R) tht we wnt to show is continuous. We will rgue tht in generl if f : X Y is continuous mp with f(a) B for susets A X, B Y, then the restriction f A : A B is continuous. To prove this, consider the commuttive digrm A f A B i X f Y where i, j re the ovious inclusion mps. These inclusion mps re continuous w.r.t. the suspce topology on A, B y Lemm The continuity of f nd i implies the continuity of f i = j f A which gin y Lemm 1.18 implies the continuity of f A. j Quotient topology. Definition Let X e topologicl spce nd let e n equivlence reltion on X. We denote y X/ e the set of equivlence clsses nd y p: X X/ x [x] e the projection mp tht sends point x X to its equivlence clss [x]. The quotient topology on X/ is given y the collection of susets U = {U X/ p 1 (U) is n open suset of X}. The set X/ equipped with the quotient topology is clled the quotient spce.
9 1 POINTSET TOPOLOGY 9 The quotient topology is often used to construct topology on set Y which is not suset of some Eucliden spce R n, or for which it is not cler how to construct metric. If there is surjective mp p: X Y from topologicl spce X, then Y cn e identified with the quotient spce X/, where the equivlence reltion is given y x x if nd only if p(x) = p(x ). In prticulr, Y = X/ cn e equipped with the quotient topology. Here re importnt exmples. Exmple The rel projective spce of dimension n is the set The mp RP n := {1-dimensionl suspces of R n+1 }. S n RP n is surjective, leding to the identifiction nd the quotient topology on RP n. R n+1 v suspce generted y v RP n = S n /(v ±v), 2. Similrly, working with complex vector spces, we otin quotient topology on the the complex projective spce CP n := {1-dimensionl suspces of C n+1 } = S 2n+1 /(v zv), z S 1 3. Generlizing, we cn consider the Grssmnn mnifold There is surjective mp G k (R n+k ) := {k-dimensionl suspces of R n+k }. V k (R n+k ) = {(v 1,..., v k ) v i R n+k, v i s re orthonorml} G k (R n+k ) given y sending (v 1,..., v k ) V k (R n+k ) to the k-dimensionl suspce of R n+k spnned y the v i s. Hence the suspce topology on the Stiefel mnifold V k (R n+k ) R (n+k)k gives quotient topology on the Grssmnn mnifold G k (R n+k ) = V k (R n+k )/. The sme construction works for the complex Grssmnn mnifold G k (C n+k ). As the exmples elow will show, sometimes quotient spce X/ is homeomorphic to topologicl spce Z constructed in different wy. To estlish the homeomorphism etween X/ nd Z, we need to construct continuous mps f : X/ Z g : Z X/ tht re inverse to ech other. The next lemm shows tht it is esy to check continuity of the mp f, the mp out of the quotient spce. Lemm The projection mp p: X X/ is continuous nd mp f : X/ Z to topologicl spce Z is continuous if nd only if the composition f p: X Z is continuous.
10 1 POINTSET TOPOLOGY 10 As we will see in the next section, there re mny situtions where the continuity of the inverse mp for continuous ijection f is utomtic. So in the exmples elow, nd for the exercises in this section, we will defer checking the continuity of f 1 to tht section. Nottion. Let A e suset of topologicl spce X. Define equivlence reltion on X y x y if x = y or x, y A. We use the nottion X/A for the quotient spce X/. Exmple (1) We clim tht the quotient spce [ 1, +1]/{±1} is homeomorphic to S 1 vi the mp f : [ 1, +1]/{±1} S 1 given y [t] e πit. Geometriclly speking, the mp f wrps the intervl [ 1, +1] once round the circle. Here is picture. glue 1 +1 It is esy to check tht the mp f is ijection. To see tht f is continuous, consider the composition [ 1, +1] p [ 1, +1]/{±1} f S 1 i C = R 2, where p is the projection mp nd i the inclusion mp. This composition sends t [ 1, +1] to e πit = (sin πt, cos πt) R 2. By Lemm 1.21 it is continuous function, since its component functions sin πt nd cos πt re continuous functions. By Lemm 1.25 the continuity of i f p implies the continuity of i f, which y Lemm 1.18 implies the continuity of f. As mentioned ove, we ll postpone the proof of the continuity of the inverse mp f 1 to the next section. (2) More generlly, D n /S n 1 is homeomorphic to S n. (proof: homework) (3) Consider the quotient spce of the squre [ 1, +1] [ 1, +1] given y identifying (s, 1) with (s, 1) for ll s [ 1, 1]. It cn e visulized s squre whose top edge is to e glued with its ottom edge. In the picture elow we indicte tht identifiction y leling those two edges y the sme letter. glue
11 1 POINTSET TOPOLOGY 11 The quotient ([ 1, +1] [ 1, +1]) /(s, 1) (s, +1) is homeomorphic to the cylinder C = {(x, y, z) R 3 x [ 1, +1], y 2 + z 2 = 1}. The proof is essentilly the sme s in (1). A homeomorphism from the quotient spce to C is given y f([s, t]) = (s, sin πt, cos πt). The picture elow shows the cylinder C with the imge of the edge indicted. (4) Consider gin the squre, ut this time using n equivlence reltions tht identifies more points thn the one in the previous exmple. As efore we identify (s, 1) nd (s, 1) for s [ 1, 1], nd in ddition we identify ( 1, t) with (1, t) for t [ 1, 1]. Here is the picture, where gin corresponding points of edges leled y the sme letter re to e identified. We clim tht the quotient spce is homeomorphic to the torus T := {x R 3 d(x, K) = d}, where K = {(x 1, x 2, 0) x x 2 2 = 1} is the unit circle in the xy-plne nd 0 < d < 1 is rel numer (see ) vi homeomorphism tht mps the edges of the squre to the loops in T indicted in the following picture elow. Exercise: prove this y writing down n explicity mp from the quotient spce to T, nd rguing tht this mp is continuous ijection (s lwys in this section, we defer the proof of the continuity of the inverse to the next section). (5) We clim tht the quotient spce D n / with equivlence reltion generted y v v for v S n 1 D n is homeomorphic to the rel projective spce RP n. Proof: exercise. In prticulr, RP 1 = S 1 /v v is homeomorphic to D 1 / = [ 1, 1]/ 1 1, which y exmple (1) is homeomorphic to S 1.
12 1 POINTSET TOPOLOGY 12 (6) The quotient spce [ 1, 1] [ 1, 1]/ with the equivlence reltion generted y ( 1, t) (1, t) is represented grphiclly y the following picture. This topologicl spce is clled the Möius nd. It is homeomorphic to suspce of R 3 shown y the following picture (7) The quotient spce of the squre y edge identifictions given y the picture is the Klein ottle. It is hrder to visulize, since it is not homeomorphic to suspce of R 3 (which cn e proved y the methods of lgeric topology). (8) The quotient spce of the squre given y the picture is homeomorphic to the rel projective plne RP 2. Exercise: prove this (hint: use the sttement of exmple (5)). Like the Klein ottle, it is chllenging to visulize the rel projective plne, since it is not homeomorphic to suspce of R Properties of topologicl spces In the previous susection we descried numer of exmples of topologicl spces X, Y tht we climed to e homeomorphic. We typiclly constructed ijection f : X Y nd rgued tht f is continuous. However, we did not finish the proof tht f is homeomorphism, since we defered the rgument tht the inverse mp f 1 : Y X is continuous. We note tht not every continuous ijection is homeomorphism. For exmple if X is set, X δ (resp. X ind ) is the topologicl spce given y equipping the set X with the discrete (resp. indiscrete) topology, then the identity mp is continuous ijection from X δ to X ind. However its inverse, the identity mp X ind X δ is not continuous if X contins t lest two points. Fortuntely, there re situtions where the continuity of the inverse mp is utomtic s the following proposition shows.
13 1 POINTSET TOPOLOGY 13 Proposition Let f : X Y e continuous ijection. Then f is homeomorphism provided X is compct nd Y is Husdorff. The gol of this section is to define these notions, prove the proposition ove, nd to give tools to recognize tht topologicl spce is compct nd/or Husdorff Husdorff spces Definition Let X e topologicl spce, x i X, i = 1, 2,... sequence in X nd x X. Then x is the limit of the x i s if for ny open suset U X contining x there is some N such tht x i U for ll i N. Cvet: If X is topologicl spce with the indiscrete topology, every point is the limit of every sequence. The limit is unique if the topologicl spce hs the following property: Definition A topologicl spce X is Husdorff if for every x, y X, x y, there re disjoint open susets U, V X with x U, y V. Note: if X is metric spce, then the metric topology on X is Husdorff (since for x y nd ɛ = d(x, y)/2, the lls B ɛ (x), B ɛ (y) re disjoint open susets). In prticulr, ny suset of R n, equipped with the suspce topology, is Husdorff. Wrning: The notion of Cuchy sequences cn e defined in metric spces, ut not in generl for topologicl spces (even when they re Husdorff). Lemm Let X e topologicl spce nd A closed suspce of X. If x n A is sequence with limit x, then x A. Proof. Assume x / A. Then x is point in the open suset X \ A nd hence y the definition of limit, ll ut finitely mny elements x n must elong to X \ A, contrdicting our ssumptions Compct spces Definition An open cover of topologicl spce X is collection of open susets of X whose union is X. If for every open cover of X there is finite sucollection which lso covers X, then X is clled compct. Some ooks (like Munkres Topology) refer to open covers s open coverings, while newer ooks (nd wikipedi) seem to prefer to ove terminology, proly for the sme resons s me: to void confusions with covering spces, notion we ll introduce soon. Now we ll prove some useful properties of compct spces nd mps etween them, which will led to the importnt Corollries?? nd Lemm If f : X Y is continuous mp nd X is compct, then the imge f(x) is compct. In prticulr, if X is compct, then ny quotient spce X/ is compct, since the projection mp X X/ is continuous with imge X/.
14 1 POINTSET TOPOLOGY 14 Proof. To show tht f(x) is compct ssume tht {U }, A is n open cover of the suspce f(x). Then ech U is of the form U = V f(x) for some open suset V Y. Then {f 1 (V )}, A is n open cover of X. Since X is compct, there is finite suset A of A such tht {f 1 (V )}, A is cover of X. This implies tht {U }, A is finite cover of f(x), nd hence f(x) is compct. Lemm If K is closed suspce of compct spce X, then K is compct. 2. If K is compct suspce of Husdorff spce X, then K is closed. Proof. To prove (1), ssume tht {U }, A is n open covering of K. Since the U s re open w.r.t. the suspce topology of K, there re open susets V of X such tht U = V K. Then the V s together with the open suset X \ K form n open covering of X. The compctness of X implies tht there is finite suset A A such tht the susets V for A, together with X \ K still cover X. It follows tht U, A is finite cover of K, showing tht K is compct. The proof of prt (2) is homework prolem. Corollry If f : X Y is continuous ijection with X compct nd Y Husdorff, then f is homeomorphism. Proof. We need to show tht the mp g : Y X inverse to f is continuous, i.e., tht g 1 (U) = f(u) is n open suset of Y for ny open suset U of X. Equivlently (y pssing to complements), it suffices to show tht g 1 (C) = f(c) is closed suset of Y for ny closed suset C of C. Now the ssumption tht X is compct implies tht the closed suset C X is compct y prt (1) of Lemm 1.33 nd hence f(c) Y is compct y Lemm The ssumption tht Y is Husdorff then implies y prt (2) of Lemm 1.33 tht f(c) is closed. Lemm Let K e compct suset of R n. Then K is ounded, mening tht there is some r > 0 such tht K is contined in the open ll B r (0) := {x R n d(x, 0) < r}. Proof. The collection B r (0) K, r (0, ), is n open cover of K. By compctness, K is covered y finite numer of these lls; if R is the mximum of the rdii of these finitely mny lls, this implies K B R (0) s desired. Corollry If f : X R is continuous function on compct spce X, then f hs mximum nd minimum. Proof. K = f(x) is compct suset of R. Hence K is ounded, nd thus K hs n infimum := inf K R nd supremum := sup K R. The infimum (resp. supremum) of K is the limit of sequence of elements in K; since K is closed (y Lemm 1.33 (2)), the limit points nd elong to K y Lemm In other words, there re elements x min, x mx X with f(x min ) = f(x) for ll x X nd f(x mx ) = f(x) for ll x X.
15 1 POINTSET TOPOLOGY 15 In order to use Corollries 1.34 nd 1.36, we need to e le to show tht topologicl spces we re interested in, re in fct compct. Note tht this is quite difficult just working from the definition of compctness: you need to ensure tht every open cover hs finite sucover. Tht sounds like lot of work... Fortuntely, there is very simple clssicl chrcteriztion of compct suspces of Eucliden spces: Theorem (Heine-Borel Theorem) A suspce X R n is compct if nd only if X is closed nd ounded. We note tht we ve lredy proved tht if K R n is compct, then K is closed suset of R n (Lemm 1.33(2)), nd K is ounded (Lemm 1.35). There two importnt ingredients to the proof of the converse, nmely the following two results: Lemm A closed intervl [, ] is compct. This lemm hs short proof tht cn e found in ny pointset topology ook, e.g., [?]. Theorem If X 1,..., X n re compct topologicl spces, then their product X 1 X n is compct. For proof see e.g. [?, Ch. 3, Thm. 5.7]. The sttement is true more generlly for product of infinitely mny compct spce (s discussed in [?, p. 113], the correct definition of the product topology for infinite products requires some cre), nd this result is clled Tychonoff s Theorem, see [?, Ch. 5, Thm. 1.1]. Proof of the Heine-Borel Theorem. Let K R n e closed nd ounded, sy K B r (0). We note tht B r (0) is contined in the n-fold product P := [ r, r] [ r, r] R n which is compct y Theorem So K is closed suset of P nd hence compct y Lemm 1.33(1) Connected spces Definition A topologicl spce X is connected if it cn t e written s decomposed in the form X = U V, where U, V re two non-empty disjoint open susets of X. For exmple, if,, c, d re rel numers with < < c < d, consider the suspce X = (, ) (c, d) R. The topologicl spce X is not connected, since U = (, ), V = (c, d) re open disjoint susets of X whose union is X. This remins true if we replce the open intervls y closed intervls. The spce X = [, ] [c, d] is not connected, since it is the disjoint union of the susets U = [, ], V = [c, d]. We wnt to emphsize tht while U nd V re not open s susets of R, they re open susets of X, since they cn e written s U = (, c) X V = (, ) X, showing tht they re open susets for the suspce topology of X R.
16 1 POINTSET TOPOLOGY 16 Lemm Any intervl I in R (open, closed, hlf-open, ounded or not) is connected. Proof. Using proof y contrdiction, let us ssume tht I hs decomposition I = U V s the union of two non-empty disjoint open susets. Pick points u U nd v V, nd let us ssume u < v without loss of generlity. Then [u, v] = U V with U := U [u, v] V := U [u, v] is decomposition of [u, v] s the disjoint union of non-empty disjoint open susets U, V of [u, v]. We clim tht the supremum c := sup U elongs to oth, U nd V, thus leding to the desired contrdiction. Here is the rgument. Assuming tht c doesn t elong to U, for ny ɛ > 0, there must e some element of U elonging to the intervl (c ɛ, c), llowing us to construct sequence of elements u i U converging to c. This implies c U y Lemm 1.30, since U is closed suspce of [u, v] (its complement V is open). By construction, every x [u, v] with x > c = sup U elongs to V. So we cn construct sequence v i V converging to c. Since V is closed suset of [u, v], we conclude c V. Theorem (Intermedite Vlue Theorem) Let X e connected topologicl spce, nd f : X R continuous mp. If elements, R elong to the imge of f, then lso ny rel numer c etween nd elongs to the imge of f. Proof. Assume tht c is not in the imge of f. Then X = f 1 (, c) f 1 (c, ) is decomposion of X s union of non-empty disjoint open susets. There is nother notion, closely relted to the notion of connected topologicl spce, which might e esier to think of geometriclly. Definition A topologicl spce X is pth connected if for ny points x, y X there is pth connecting them. In other words, there is continuous mp γ : [, ] X from some intervl to X with γ() = x, γ() = y. Lemm Any pth connected topologicl spce is connected. Proof. Using proof y contrdiction, let us ssume tht the topologicl spce X is pth connected, ut not connected. So there is decomposition X = U V of X s the union of non-empty open susets U, V X. The ssumption tht X is pth connected llows us to find pth γ : [, ] X with γ() U nd γ() V. Then we otin the decomposition [, ] = f 1 (U) f 1 (V ) of the intervl [, ] s the disjoint union of open susets. These re non-empty since f 1 (U) nd f 1 (V ). This implies tht [, ] is not connected, the desired contrdiction.
17 1 POINTSET TOPOLOGY 17 For typicl topologicl spces we will consider, the properties connected nd pth connected re equivlent. But here is n exmple known s the topologist s sine curve which is connected, ut not pth connected, see [?, Exmple 7, p. 156]. It is the following suspce of R 2 : X = {(x, sin 1 x ) R2 0 < x < 1} {(0, y) R 2 1 y 1}.
Notes 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 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 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 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 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 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 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 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 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 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 informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
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 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 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 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 informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationArea & Volume. Chapter 6.1 & 6.2 September 25, y = 1! x 2. Back to Area:
Bck to Are: Are & Volume Chpter 6. & 6. Septemer 5, 6 We cn clculte the re etween the x-xis nd continuous function f on the intervl [,] using the definite integrl:! f x = lim$ f x * i )%x n i= Where fx
More informationB. Definition: The volume of a solid of known integrable cross-section area A(x) from x = a
Mth 176 Clculus Sec. 6.: Volume I. Volume By Slicing A. Introduction We will e trying to find the volume of solid shped using the sum of cross section res times width. We will e driving towrd developing
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 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 informationGrade 7/8 Math Circles Geometric Arithmetic October 31, 2012
Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
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 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 information1.1. Interval Notation and Set Notation Essential Question When is it convenient to use set-builder notation to represent a set of numbers?
1.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS Prepring for 2A.6.K, 2A.7.I Intervl Nottion nd Set Nottion Essentil Question When is it convenient to use set-uilder nottion to represent set of numers? A collection
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 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 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 informationNotes for Graph Theory
Notes for Grph Theory These re notes I wrote up for my grph theory clss in 06. They contin most of the topics typiclly found in grph theory course. There re proofs of lot of the results, ut not of everything.
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 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 informationM3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements.
M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements. Chapter 1: Metric spaces and convergence. (1.1) Recall the standard distance function
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 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 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 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 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 informationNotes on metric spaces and topology. Math 309: Topics in geometry. Dale Rolfsen. University of British Columbia
Notes on metric spaces and topology Math 309: Topics in geometry Dale Rolfsen University of British Columbia Let X be a set; we ll generally refer to its elements as points. A distance function, or metric
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 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 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 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 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 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 informationSimplifying Algebra. Simplifying Algebra. Curriculum Ready.
Simplifying Alger Curriculum Redy www.mthletics.com This ooklet is ll out turning complex prolems into something simple. You will e le to do something like this! ( 9- # + 4 ' ) ' ( 9- + 7-) ' ' Give this
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 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 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 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 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 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 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 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 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 informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Adm Sheffer. Office hour: Tuesdys 4pm. dmsh@cltech.edu TA: Victor Kstkin. Office hour: Tuesdys 7pm. 1:00 Mondy, Wednesdy, nd Fridy. http://www.mth.cltech.edu/~2014-15/2term/m006/
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 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 informationGraphs with at most two trees in a forest building process
Grphs with t most two trees in forest uilding process rxiv:802.0533v [mth.co] 4 Fe 208 Steve Butler Mis Hmnk Mrie Hrdt Astrct Given grph, we cn form spnning forest y first sorting the edges in some order,
More informationSummer Review Packet For Algebra 2 CP/Honors
Summer Review Pcket For Alger CP/Honors Nme Current Course Mth Techer Introduction Alger uilds on topics studied from oth Alger nd Geometr. Certin topics re sufficientl involved tht the cll for some review
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 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 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 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 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 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 informationMa/CS 6b Class 1: Graph Recap
M/CS 6 Clss 1: Grph Recp By Adm Sheffer Course Detils Instructor: Adm Sheffer. TA: Cosmin Pohot. 1pm Mondys, Wednesdys, nd Fridys. http://mth.cltech.edu/~2015-16/2term/m006/ Min ook: Introduction to Grph
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 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 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 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 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 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 informationASTs, Regex, Parsing, and Pretty Printing
ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,
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 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 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 informationT. Background material: Topology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 T. Background material: Topology For convenience this is an overview of basic topological ideas which will be used in the course. This material
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 informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationIntroduction. Chapter 4: Complex Integration. Introduction (Cont d)
Introduction Chpter 4: Complex Integrtion Li, Yongzho Stte Key Lbortory of Integrted Services Networks, Xidin University October 10, 2010 The two-dimensionl nture of the complex plne required us to generlize
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 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 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 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 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 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 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 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 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 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 informationElementary Topology. Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way.
Elementary Topology Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way. Definition. properties: (i) T and X T, A topology on
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 informationLU Decomposition. Mechanical Engineering Majors. Authors: Autar Kaw
LU Decomposition Mechnicl Engineering Mjors Authors: Autr Kw Trnsforming Numericl Methods Eduction for STEM Undergrdutes // LU Decomposition LU Decomposition LU Decomposition is nother method to solve
More informationPoint-Set Topology II
Point-Set Topology II Charles Staats September 14, 2010 1 More on Quotients Universal Property of Quotients. Let X be a topological space with equivalence relation. Suppose that f : X Y is continuous and
More informationthis grammar generates the following language: Because this symbol will also be used in a later step, it receives the
LR() nlysis Drwcks of LR(). Look-hed symols s eplined efore, concerning LR(), it is possile to consult the net set to determine, in the reduction sttes, for which symols it would e possile to perform reductions.
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 informationarxiv: v2 [cs.dm] 17 May 2014
EXTENDING ARTIAL RERESENTATIONS OF INTERVAL GRAHS. KLAVÍK, J. KRATOCHVÍL, Y. OTACHI, T. SAITOH, AND T. VYSKOČIL rxiv:1306.2182v2 [cs.dm] 17 My 2014 Astrct. Intervl grphs re intersection grphs of closed
More informationCSCI 3130: Formal Languages and Automata Theory Lecture 12 The Chinese University of Hong Kong, Fall 2011
CSCI 3130: Forml Lnguges nd utomt Theory Lecture 12 The Chinese University of Hong Kong, Fll 2011 ndrej Bogdnov In progrmming lnguges, uilding prse trees is significnt tsk ecuse prse trees tell us the
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 informationThe Greedy Method. The Greedy Method
Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm
More information