DOCSLIB.ORG

Functional Analysis Definitions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Functional Analysis Definitions Functional Analysis Definitions Fionn´anHoward June 2011 Contents 1 Topology 1 2 Zorn's Lemma 3 3 Nets and Separation Axioms 4 4 Banach Spaces I 5 5 Banach Spaces II 5 6 Main Theorems on Banach Spaces 6 7 Hilbert Spaces 6 1 1 Topology • Metric Space -A metric space is a set X with a function d : X × X ! [0; 1) such that for all x; y; z 2 X: 1. d(x; y) ≥ 0 with equality iff x = y 2. d(x; y) = d(y; x) 3. d(x; z) ≤ d(x; y) + d(y; z) • Open Ball - The open ball of radius r and centre x0 is given by, B(x0; r) = fx 2 X : d(x; x0) < rg: • Closed Ball - The closed ball of radius r and centre x0 is given by, B¯(x0; r) = fx 2 X : d(x; x0) ≤ rg: • Interior Point / Open Set - For a subset G ⊆ X of a metric space X, a point x 2 G is an interior point of G if 9 r > 0 such that B(x; r) ⊂ G. The set G is called an open set if every x 2 G is an interior point. • Closed Set - A set G ⊆ X of a metric space X is called a closed set if it's complement XnG is an open set. • Subspace Topology - For a subset T ⊂ X of a topological space (X; τ), we define the subspace topology τT on T to be, τT = fT \ V : V 2 τg: • Interior / Closure / Boundary - The interior Eo of a set E is the union of all open sets contained in E. The closure E¯ of a set E is the intersection of all closed sets containing E. The boundary @E of a set E is given by E¯nEo. • Continuity in a Metric Space - For metric spaces (X; dX ) and (Y; dY ), a function f : X ! Y is called continuous at x0 2 X if for each > 0, 9 δ > 0 such that, dX (x; x0) < δ =) dY (f(x); f(x0)) < . • Continuity in a Topological Space - For topological spaces (X; τX ) and (Y; τY ), a function f : X ! Y is called continuous if: −1 f (V ) 2 τX for all V 2 τY : 1 • Limit in a Metric Space - For a metric space (X; d), a sequence (xn)n=1 2 X converges to a limit l 2 X (denoted lim xn = l) if for each > 0, 9 N 2 such that, n!1 N n 2 N; n > N =) d(xn; l) < . 2 1 • Limit in a Topological Space - For a topological space (X; τ), a sequence (xn)n=1 2 X converges to a limit l 2 X if for each open set U with l 2 U, 9 N ≥ 1 such that, n 2 N; n > N =) xn 2 U: • Open Cover / Compact - For a topological space (X; τ) and a subset T ⊆ X, an open cover of T is a family U of open subsets of X such that, T ⊆ [fU : U 2 Ug: T is compact if each open cover has a finite subcover (subfamily of U which is also a cover of T ). 1 • Sequentially Compact - A subset T ⊂ X is called sequentially compact if each sequence (tn)n=1 has 1 a subsequence (tnj )j=1 that converges to some limit l 2 X. • Connected - A topological space X is called connected if the only clopen subsets of X are ; and X itself. For subsets T ⊂ X take T with the subspace topology, (T; τT ). • Base - A subfamily B ⊆ τ is called a base (for the open sets) of the topology if for each x 2 U open, there exists B 2 B such that x 2 B ⊂ U. • Second Countable - second countable if 9 a countable base. • Dense - A subset S ⊆ X is said to be dense in X if S¯ = X. • Separable - separable if 9 countable dense subset S of X. • Weaker/Stronger Topologies - Let X be a set with two topologies τ1 and τ2. τ1 is weaker than τ2 if τ1 ⊆ τ2, i.e. there are fewer open sets in the weaker topology. • Product Topology - Given two top. spaces X and Y we define the product topology to be the topology which has as its base, fU × V : U ⊂ X open;V ⊂ Y openg: ◦ • Neighbourhood - A subset N ⊆ X is a nbd of x0 if x0 2 N . • Neighbourhood System - The nbd system Ux0 at x0 is the collection of all nbds of x0. • Neighbourhood Base -A nbd base at a point x0 2 X is a subset Bx0 ⊂ Ux0 such that for each N 2 Ux0 , there exists B 2 Bx0 with B ⊆ N. • First Countable -(X; τ) is first countable at x0 2 X if 9 a countable nbd base at x0. 2 Zorn's Lemma • Partial Order - The relation ≤ is a partial order on S if for all x; y; z 2 S: 1. x ≤ x. 2. x ≤ y and y ≤ x =) x = y. 3. x ≤ y and y ≤ z =) x ≤ z . 3 • Linear Ordering -A linear ordering ≤ on a set S is a partial order with the additional property that for all x; y 2 S, either x ≤ y or y ≤ x. • Chain - For a poset (S; ≤), a chain in S is a subset C ⊆ S that is linearly ordered. • Upper Bound - For a poset (S; ≤), an elt u 2 S is an upper bound for R ⊆ S if for all x 2 R, x ≤ u. • Maximal Element - For a poset (S; ≤), m 2 S is a maximal element of S if for x 2 S with m ≤ x, x = m. • Linearly Independent - If V is a v.s. over a field K, a subset E ⊆ V is linearly independent if for distinct e1; : : : ; en 2 E and λ1; : : : ; λn 2 K, we have, λ1e1; : : : ; λnen = 0 =) λ1 = ::: = λn = 0: Span - E spans V if all v 2 V can be expressed as v = λ1e1; : : : ; λnen. Basis - E is a basis for V if it is linearly independent and spans V . 3 Nets and Separation Axioms • Hausdorff Space -(X; τ) is called a Hausdorff (or T2) space if for a; b 2 X with a 6= b, there exists U; V ⊂ X with a 2 U; b 2 V and U \ V = ;. • Directed Set (Λ; ≤) is a directed set if: 1. λ ≤ λ 2. λ1 ≤ λ2 and λ2 ≤ λ3 implies λ1 ≤ λ3 3. For all λ1; λ2 2 Λ there exists λ3 2 Λ with λ1 ≤ λ3 and λ2 ≤ λ3. • Net -A net (xλ)λ2Λ in a set X (usually a top. space) consists of: 1. a directed set (Λ; ≤) 2. a function x :Λ ! X • Converges - A net converges to x0 2 X if for each U open with x0 2 U, there exists λ0 2 Λ such that for λ ≥ λ0, xλ 2 U. • Cofinal - A subset A ⊆ Λ is called cofinal in Λ if for each λ 2 Λ there exists α 2 A with λ ≤ α. • Subnet - For a net (xλ)λ2Λ indexed by a directed set (Λ; ≤Λ), a subnet consists of two things: 1. another net (yα)α2A indexed by a set (A; ≤A) 2. a map j : A ! Λ such that (a) j is order preserving, α1 ≤A α2 =) j(α1) ≤Λ j(α2) (b) yα = xj(α) (c) j(A) is cofinal in Λ. • Cluster/Limit Point - A point x0 2 X is called a cluster/limit point of a net if for N 2 Ux0 , the set fλ 2 Λ: xλ 2 Ng is cofinal in Λ. 4 • T0 Space - if 9 U ⊆ X open with either x 2 U; y2 = U or y 2 U; x2 = U. • T1 Space - if 9 U ⊆ X open such that x 2 U; y2 = U. • Regular=T3 Space - if A ⊆ X closed, and b 2 XnA implies 9 U; V ⊆ X open such that A ⊆ U; b 2 V and U \ V = ;. T3 if it is both regular and Hausdorff. • Normal=T4 Space - if A; B ⊆ X closed, A \ B = ; implies 9 U; V ⊆ X open such that A ⊆ U; B ⊆ V an U \ V = ;. T4 if it is both normal and Hausdorff. • Completely Regular=T 1 Space - A topological space is called completely regular if for A ⊂ X 3 2 closed with b 2 XnA, there exists continuous f : X ! R with f(a) = 0 for all a 2 A and f(b) = 1. T 1 if it is both completely regular and Hausdorff. 3 2 4 Banach Spaces I • Norm -A norm on a v.s. E over K is a function kxk : E ! [0; 1) such that for all x; y 2 E: 1. kx + yk ≤ kxk + kyk 2. kλxk = jλjkxk for all λ 2 K 3. kxk = 0 =) x = 0 • Seminorm -A seminorm (denoted p(x) instead of kxk) is a norm that doesn't satisfy 3 above. Non-zero elts can have length 0. 1 • Cauchy Sequence - Note that this definition requires a metric. A sequence (xn)n=1 in a metric space is called a Cauchy sequence if for each > 0, 9N such that, n; m ≥ N =) d(xn; xm) < . • Complete - A metric space is called complete if every Cauchy sequence converges to a limit. • Uniformly Continuous - A function f : X ! Y is called uniformly continuous if for each > 0, 9 δ > 0 such that, d(x1; x2) < δ =) d(f(x1); f(x2)) < . • Banach Space - A normed space (E; k · k) over K is called a Banach space over K if E is complete in the metric arising from the norm.
Load more

Recommended publications
  • Directed Sets and Topological Spaces Definable in O-Minimal Structures
    Directed sets and topological spaces definable in o-minimal structures. Pablo And´ujarGuerrero∗ Margaret E. M. Thomas ∗ Erik Walsbergy 2010 Mathematics Subject Classification. 03C64 (Primary), 54A20, 54A05, 54D30 (Secondary). Key words. o-minimality, directed sets, definable topological spaces. Abstract We study directed sets definable in o-minimal structures, show- ing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue holds in full generality. We use the theory of tame pairs to extend the results in the field case to definable families of sets with the finite intersection property. We then apply our results to the study of definable topologies. We prove that all de- finable topological spaces display properties akin to first countability, and give several characterizations of a notion of definable compactness due to Peterzil and Steinhorn [PS99] generalized to this setting. 1 Introduction The study of objects definable in o-minimal structures is motivated by the notion that o-minimality provides a rich but \tame" setting for the theories of said objects. In this paper we study directed sets definable in o-minimal structures, focusing on expansions of groups and fields. By \directed set" we mean a preordered set in which every finite subset has a lower (if downward ∗Department of Mathematics, Purdue University, 150 N. University Street, West Lafayette, IN 47907-2067, U.S.A. E-mail addresses: [email protected] (And´ujarGuer- rero), [email protected] (Thomas) yDepartment of Mathematics, Statistics, and Computer Science, Department of Math- ematics, University of California, Irvine, 340 Rowland Hall (Bldg.# 400), Irvine, CA 92697-3875, U.S.A.
    [Show full text]
  • De Rham Cohomology
    De Rham Cohomology 1. Definition of De Rham Cohomology Let X be an open subset of the plane. If we denote by C0(X) the set of smooth (i. e. infinitely differentiable functions) on X and C1(X), the smooth 1-forms on X (i. e. expressions of the form fdx + gdy where f; g 2 C0(X)), we have natural differntiation map d : C0(X) !C1(X) given by @f @f f 7! dx + dy; @x @y usually denoted by df. The kernel for this map (i. e. set of f with df = 0) is called the zeroth De Rham Cohomology of X and denoted by H0(X). It is clear that these are precisely the set of locally constant functions on X and it is a vector space over R, whose dimension is precisley the number of connected components of X. The image of d is called the set of exact forms on X. The set of pdx + qdy 2 C1(X) @p @q such that @y = @x are called closed forms. It is clear that exact forms and closed forms are vector spaces and any exact form is a closed form. The quotient vector space of closed forms modulo exact forms is called the first De Rham Cohomology and denoted by H1(X). A path for this discussion would mean piecewise smooth. That is, if γ : I ! X is a path (a continuous map), there exists a subdivision, 0 = t0 < t1 < ··· < tn = 1 and γ(t) is continuously differentiable in the open intervals (ti; ti+1) for all i.
    [Show full text]
  • Scott Spaces and the Dcpo Category
    SCOTT SPACES AND THE DCPO CATEGORY JORDAN BROWN Abstract. Directed-complete partial orders (dcpo’s) arise often in the study of λ-calculus. Here we investigate certain properties of dcpo’s and the Scott spaces they induce. We introduce a new construction which allows for the canonical extension of a partial order to a dcpo and give a proof that the dcpo introduced by Zhao, Xi, and Chen is well-filtered. Contents 1. Introduction 1 2. General Definitions and the Finite Case 2 3. Connectedness of Scott Spaces 5 4. The Categorical Structure of DCPO 6 5. Suprema and the Waybelow Relation 7 6. Hofmann-Mislove Theorem 9 7. Ordinal-Based DCPOs 11 8. Acknowledgments 13 References 13 1. Introduction Directed-complete partially ordered sets (dcpo’s) often arise in the study of λ-calculus. Namely, they are often used to construct models for λ theories. There are several versions of the λ-calculus, all of which attempt to describe the ‘computable’ functions. The first robust descriptions of λ-calculus appeared around the same time as the definition of Turing machines, and Turing’s paper introducing computing machines includes a proof that his computable functions are precisely the λ-definable ones [5] [8]. Though we do not address the λ-calculus directly here, an exposition of certain λ theories and the construction of Scott space models for them can be found in [1]. In these models, computable functions correspond to continuous functions with respect to the Scott topology. It is thus with an eye to the application of topological tools in the study of computability that we investigate the Scott topology.
    [Show full text]
  • A Guide to Topology
    i i “topguide” — 2010/12/8 — 17:36 — page i — #1 i i A Guide to Topology i i i i i i “topguide” — 2011/2/15 — 16:42 — page ii — #2 i i c 2009 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2009929077 Print Edition ISBN 978-0-88385-346-7 Electronic Edition ISBN 978-0-88385-917-9 Printed in the United States of America Current Printing (last digit): 10987654321 i i i i i i “topguide” — 2010/12/8 — 17:36 — page iii — #3 i i The Dolciani Mathematical Expositions NUMBER FORTY MAA Guides # 4 A Guide to Topology Steven G. Krantz Washington University, St. Louis ® Published and Distributed by The Mathematical Association of America i i i i i i “topguide” — 2010/12/8 — 17:36 — page iv — #4 i i DOLCIANI MATHEMATICAL EXPOSITIONS Committee on Books Paul Zorn, Chair Dolciani Mathematical Expositions Editorial Board Underwood Dudley, Editor Jeremy S. Case Rosalie A. Dance Tevian Dray Patricia B. Humphrey Virginia E. Knight Mark A. Peterson Jonathan Rogness Thomas Q. Sibley Joe Alyn Stickles i i i i i i “topguide” — 2010/12/8 — 17:36 — page v — #5 i i The DOLCIANI MATHEMATICAL EXPOSITIONS series of the Mathematical Association of America was established through a generous gift to the Association from Mary P. Dolciani, Professor of Mathematics at Hunter College of the City Uni- versity of New York. In making the gift, Professor Dolciani, herself an exceptionally talented and successfulexpositor of mathematics, had the purpose of furthering the ideal of excellence in mathematical exposition.
    [Show full text]
  • Algebra I Chapter 1. Basic Facts from Set Theory 1.1 Glossary of Abbreviations
    Notes: c F.P. Greenleaf, 2000-2014 v43-s14sets.tex (version 1/1/2014) Algebra I Chapter 1. Basic Facts from Set Theory 1.1 Glossary of abbreviations. Below we list some standard math symbols that will be used as shorthand abbreviations throughout this course. means “for all; for every” • ∀ means “there exists (at least one)” • ∃ ! means “there exists exactly one” • ∃ s.t. means “such that” • = means “implies” • ⇒ means “if and only if” • ⇐⇒ x A means “the point x belongs to a set A;” x / A means “x is not in A” • ∈ ∈ N denotes the set of natural numbers (counting numbers) 1, 2, 3, • · · · Z denotes the set of all integers (positive, negative or zero) • Q denotes the set of rational numbers • R denotes the set of real numbers • C denotes the set of complex numbers • x A : P (x) If A is a set, this denotes the subset of elements x in A such that •statement { ∈ P (x)} is true. As examples of the last notation for specifying subsets: x R : x2 +1 2 = ( , 1] [1, ) { ∈ ≥ } −∞ − ∪ ∞ x R : x2 +1=0 = { ∈ } ∅ z C : z2 +1=0 = +i, i where i = √ 1 { ∈ } { − } − 1.2 Basic facts from set theory. Next we review the basic definitions and notations of set theory, which will be used throughout our discussions of algebra. denotes the empty set, the set with nothing in it • ∅ x A means that the point x belongs to a set A, or that x is an element of A. • ∈ A B means A is a subset of B – i.e.
    [Show full text]
  • Basic Properties of Filter Convergence Spaces
    Basic Properties of Filter Convergence Spaces Barbel¨ M. R. Stadlery, Peter F. Stadlery;z;∗ yInstitut fur¨ Theoretische Chemie, Universit¨at Wien, W¨ahringerstraße 17, A-1090 Wien, Austria zThe Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, USA ∗Address for corresponce Abstract. This technical report summarized facts from the basic theory of filter convergence spaces and gives detailed proofs for them. Many of the results collected here are well known for various types of spaces. We have made no attempt to find the original proofs. 1. Introduction Mathematical notions such as convergence, continuity, and separation are, at textbook level, usually associated with topological spaces. It is possible, however, to introduce them in a much more abstract way, based on axioms for convergence instead of neighborhood. This approach was explored in seminal work by Choquet [4], Hausdorff [12], Katˇetov [14], Kent [16], and others. Here we give a brief introduction to this line of reasoning. While the material is well known to specialists it does not seem to be easily accessible to non-topologists. In some cases we include proofs of elementary facts for two reasons: (i) The most basic facts are quoted without proofs in research papers, and (ii) the proofs may serve as examples to see the rather abstract formalism at work. 2. Sets and Filters Let X be a set, P(X) its power set, and H ⊆ P(X). The we define H∗ = fA ⊆ Xj(X n A) 2= Hg (1) H# = fA ⊆ Xj8Q 2 H : A \ Q =6 ;g The set systems H∗ and H# are called the conjugate and the grill of H, respectively.
    [Show full text]
  • 7.2 Binary Operators Closure
    last edited April 19, 2016 7.2 Binary Operators A precise discussion of symmetry benefits from the development of what math- ematicians call a group, which is a special kind of set we have not yet explicitly considered. However, before we define a group and explore its properties, we reconsider several familiar sets and some of their most basic features. Over the last several sections, we have considered many di↵erent kinds of sets. We have considered sets of integers (natural numbers, even numbers, odd numbers), sets of rational numbers, sets of vertices, edges, colors, polyhedra and many others. In many of these examples – though certainly not in all of them – we are familiar with rules that tell us how to combine two elements to form another element. For example, if we are dealing with the natural numbers, we might considered the rules of addition, or the rules of multiplication, both of which tell us how to take two elements of N and combine them to give us a (possibly distinct) third element. This motivates the following definition. Definition 26. Given a set S,abinary operator ? is a rule that takes two elements a, b S and manipulates them to give us a third, not necessarily distinct, element2 a?b. Although the term binary operator might be new to us, we are already familiar with many examples. As hinted to earlier, the rule for adding two numbers to give us a third number is a binary operator on the set of integers, or on the set of rational numbers, or on the set of real numbers.
    [Show full text]
  • Conjugate Convex Functions in Topological Vector Spaces
    Matematisk-fysiske Meddelelser udgivet af Det Kongelige Danske Videnskabernes Selskab Bind 34, nr. 2 Mat. Fys. Medd . Dan. Vid. Selsk. 34, no. 2 (1964) CONJUGATE CONVEX FUNCTIONS IN TOPOLOGICAL VECTOR SPACES BY ARNE BRØNDSTE D København 1964 Kommissionær : Ejnar Munksgaard Synopsis Continuing investigations by W. L . JONES (Thesis, Columbia University , 1960), the theory of conjugate convex functions in finite-dimensional Euclidea n spaces, as developed by W. FENCHEL (Canadian J . Math . 1 (1949) and Lecture No- tes, Princeton University, 1953), is generalized to functions in locally convex to- pological vector spaces . PRINTP_ll IN DENMARK BIANCO LUNOS BOGTRYKKERI A-S Introduction The purpose of the present paper is to generalize the theory of conjugat e convex functions in finite-dimensional Euclidean spaces, as initiated b y Z . BIRNBAUM and W. ORLICz [1] and S . MANDELBROJT [8] and developed by W. FENCHEL [3], [4] (cf. also S. KARLIN [6]), to infinite-dimensional spaces . To a certain extent this has been done previously by W . L . JONES in his Thesis [5] . His principal results concerning the conjugates of real function s in topological vector spaces have been included here with some improve- ments and simplified proofs (Section 3). After the present paper had bee n written, the author ' s attention was called to papers by J . J . MOREAU [9], [10] , [11] in which, by a different approach and independently of JONES, result s equivalent to many of those contained in this paper (Sections 3 and 4) are obtained. Section 1 contains a summary, based on [7], of notions and results fro m the theory of topological vector spaces applied in the following .
    [Show full text]
  • 3. Closed Sets, Closures, and Density
    3. Closed sets, closures, and density 1 Motivation Up to this point, all we have done is define what topologies are, define a way of comparing two topologies, define a method for more easily specifying a topology (as a collection of sets generated by a basis), and investigated some simple properties of bases. At this point, we will start introducing some more interesting definitions and phenomena one might encounter in a topological space, starting with the notions of closed sets and closures. Thinking back to some of the motivational concepts from the first lecture, this section will start us on the road to exploring what it means for two sets to be \close" to one another, or what it means for a point to be \close" to a set. We will draw heavily on our intuition about n convergent sequences in R when discussing the basic definitions in this section, and so we begin by recalling that definition from calculus/analysis. 1 n Definition 1.1. A sequence fxngn=1 is said to converge to a point x 2 R if for every > 0 there is a number N 2 N such that xn 2 B(x) for all n > N. 1 Remark 1.2. It is common to refer to the portion of a sequence fxngn=1 after some index 1 N|that is, the sequence fxngn=N+1|as a tail of the sequence. In this language, one would phrase the above definition as \for every > 0 there is a tail of the sequence inside B(x)." n Given what we have established about the topological space Rusual and its standard basis of -balls, we can see that this is equivalent to saying that there is a tail of the sequence inside any open set containing x; this is because the collection of -balls forms a basis for the usual topology, and thus given any open set U containing x there is an such that x 2 B(x) ⊆ U.
    [Show full text]
  • Basic Topologytaken From
    Notes by Tamal K. Dey, OSU 1 Basic Topology taken from [1] 1 Metric space topology We introduce basic notions from point set topology. These notions are prerequisites for more sophisticated topological ideas—manifolds, homeomorphism, and isotopy—introduced later to study algorithms for topological data analysis. To a layman, the word topology evokes visions of “rubber-sheet topology”: the idea that if you bend and stretch a sheet of rubber, it changes shape but always preserves the underlying structure of how it is connected to itself. Homeomorphisms offer a rigorous way to state that an operation preserves the topology of a domain, and isotopy offers a rigorous way to state that the domain can be deformed into a shape without ever colliding with itself. Topology begins with a set T of points—perhaps the points comprising the d-dimensional Euclidean space Rd, or perhaps the points on the surface of a volume such as a coffee mug. We suppose that there is a metric d(p, q) that specifies the scalar distance between every pair of points p, q ∈ T. In the Euclidean space Rd we choose the Euclidean distance. On the surface of the coffee mug, we could choose the Euclidean distance too; alternatively, we could choose the geodesic distance, namely the length of the shortest path from p to q on the mug’s surface. d Let us briefly review the Euclidean metric. We write points in R as p = (p1, p2,..., pd), d where each pi is a real-valued coordinate. The Euclidean inner product of two points p, q ∈ R is d Rd 1/2 d 2 1/2 hp, qi = Pi=1 piqi.
    [Show full text]
  • Professor Smith Math 295 Lecture Notes
    Professor Smith Math 295 Lecture Notes by John Holler Fall 2010 1 October 29: Compactness, Open Covers, and Subcovers. 1.1 Reexamining Wednesday's proof There seemed to be a bit of confusion about our proof of the generalized Intermediate Value Theorem which is: Theorem 1: If f : X ! Y is continuous, and S ⊆ X is a connected subset (con- nected under the subspace topology), then f(S) is connected. We'll approach this problem by first proving a special case of it: Theorem 1: If f : X ! Y is continuous and surjective and X is connected, then Y is connected. Proof of 2: Suppose not. Then Y is not connected. This by definition means 9 non-empty open sets A; B ⊂ Y such that A S B = Y and A T B = ;. Since f is continuous, both f −1(A) and f −1(B) are open. Since f is surjective, both f −1(A) and f −1(B) are non-empty because A and B are non-empty. But the surjectivity of f also means f −1(A) S f −1(B) = X, since A S B = Y . Additionally we have f −1(A) T f −1(B) = ;. For if not, then we would have that 9x 2 f −1(A) T f −1(B) which implies f(x) 2 A T B = ; which is a contradiction. But then these two non-empty open sets f −1(A) and f −1(B) disconnect X. QED Now we want to show that Theorem 2 implies Theorem 1. This will require the help from a few lemmas, whose proofs are on Homework Set 7: Lemma 1: If f : X ! Y is continuous, and S ⊆ X is any subset of X then the restriction fjS : S ! Y; x 7! f(x) is also continuous.
    [Show full text]
  • Math 601 Algebraic Topology Hw 4 Selected Solutions Sketch/Hint
    MATH 601 ALGEBRAIC TOPOLOGY HW 4 SELECTED SOLUTIONS SKETCH/HINT QINGYUN ZENG 1. The Seifert-van Kampen theorem 1.1. A refinement of the Seifert-van Kampen theorem. We are going to make a refinement of the theorem so that we don't have to worry about that openness problem. We first start with a definition. Definition 1.1 (Neighbourhood deformation retract). A subset A ⊆ X is a neighbourhood defor- mation retract if there is an open set A ⊂ U ⊂ X such that A is a strong deformation retract of U, i.e. there exists a retraction r : U ! A and r ' IdU relA. This is something that is true most of the time, in sufficiently sane spaces. Example 1.2. If Y is a subcomplex of a cell complex, then Y is a neighbourhood deformation retract. Theorem 1.3. Let X be a space, A; B ⊆ X closed subspaces. Suppose that A, B and A \ B are path connected, and A \ B is a neighbourhood deformation retract of A and B. Then for any x0 2 A \ B. π1(X; x0) = π1(A; x0) ∗ π1(B; x0): π1(A\B;x0) This is just like Seifert-van Kampen theorem, but usually easier to apply, since we no longer have to \fatten up" our A and B to make them open. If you know some sheaf theory, then what Seifert-van Kampen theorem really says is that the fundamental groupoid Π1(X) is a cosheaf on X. Here Π1(X) is a category with object pints in X and morphisms as homotopy classes of path in X, which can be regard as a global version of π1(X).
    [Show full text]