MA4266 Topology Wayne Lawton Department of Mathematics S17-08-17, 65162749

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Completeness and Expressiveness
Some important properties Lectures of Prof. Doron Peled, Bar Ilan University.
Lower Envelopes Yuval Suede. What’s on the menu? Lower Envelopes Davenport-Schinzel Sequences Trivial upper bound Super linear complexity* Tight upper.
Abbas Edalat Imperial College London Contains joint work with Andre Lieutier (AL) and joint work with Marko Krznaric (MK) Data Types.
The proof is quite similar to that of a previous result: a compact subspace of a Hausdorff is closed. Theorem: If topological X  space is compact and.
CSCI 115 Chapter 6 Order Relations and Structures.
Relations Relations on a Set. Properties of Relations.
Equivalence, Order, and Inductive Proof
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
8.6 Partial Orderings. Definition Partial ordering– a relation R on a set S that is Reflexive, Antisymmetric, and Transitive Examples? R={(a,b)| a is.
Applied Discrete Mathematics Week 11: Graphs
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
FSM Decomposition using Partitions on States 290N: The Unknown Component Problem Lecture 24.
1 Relations: The Second Time Around Chapter 7 Equivalence Classes.
Partial Orderings: Selected Exercises
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
Section 7.6: Partial Orderings Def: A relation R on a set S is called a partial ordering (or partial order) if it is reflexive, antisymmetric, and transitive.
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
Partially Ordered Sets (POSets)
Relations Chapter 9.
Chapter 6. Order Relations and Structure
Topological Nets and Filters Mark Hunnell. Outline 1.Motivations for Nets and Filters 2.Basic Definitions 3.Construction of Equivalence 4.Comparison and.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
Department of Mathematics
Gram-Schmidt Orthogonalization
Discrete Structures – CNS2300
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Mathematical Induction
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Relations, Functions, and Countability
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
1 Section 4.3 Order Relations A binary relation is an partial order if it transitive and antisymmetric. If R is a partial order over the set S, we also.
MA5238 Fourier Analysis Wayne Lawton Department of Mathematics S ,
CS 285- Discrete Mathematics
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Chapter Three SEQUENCES
1 Partial Orderings Based on Slides by Chuck Allison from Rosen, Chapter 8.6 Modified by.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
INTERPOLATORY SOLUTIONS OF LINEAR ODE’S AND EXTENSIONS Wayne M. Lawton Dept. of Mathematics, National University of Singapore 2 Science Drive 2, Singapore.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Department of Mathematics
Dilworth’s theorem and extremal set theory 張雁婷 國立交通大學應用數學系.
Partial Orderings: Selected Exercises
Chapter 3 The Real Numbers.
CSE 2813 Discrete Structures
Chapter 5 Limits and Continuity.
Department of Mathematics
Equivalence Relations
Department of Mathematics
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Introduction to Real Analysis
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
MA5242 Wavelets Lecture 1 Numbers and Vector Spaces
Presentation transcript:

MA4266 Topology Wayne Lawton Department of Mathematics S , Lecture 14

Test 2: Question 1 1. Assume It suffices to show that show that is open and We need to is openAssume that and Sinceit follows that hence and sinceis open 2. Let Then

Test 2: Question 2 1. are locally connected there existSince with open. and open connected Then is open connected and hence 2. The countable infinite product of the locally connected is locally connected. (with the discrete topology) is the Cantor set which is not locally connected.

Test 2: Question 3 Assume thatis compact and locally connected. Ifis a component ofand then since is open there exists an open henceis open hence everyTherefore component is open so since the set of components forms a partition ofit is an open cover. Since is compact there exists a finite subcover so there are only a finite number of components.

Test 2: Question 4 Assume thatis compact and let a Cauchy sequence in be Sincehas the and a subsequence Bolzano-Weierstrass property there exists such that It suffices to prove that choose Let so that and Then if

Test 2: Question 5 Assume thatis the Sorgenfrey line with the topologygenerated by the basis was locally compact then there would existIf a nonempty open setwith then there would exist a nonempty basic open set and hence compact. is compact - why? However - why? Since the set is not compact – why ?

Test 2: Question 6 Exercise 8.3 Question 3. Prove that every locally compact Hausdorff space is closed and with means if there exist disjoint open Proof Let Is regular. This be the one point compactification of then Now let so there exist disjoint openwith

Test 2: Question 6 We may assume that all The result on the hence are closed. Then Also preceding page implies there exist disjoint open sets Similarly there Since exist disjoint open sets hence We may also chooseso thatis compact. Clearly is compact

Supplement: Partial Orderings Definition A partially ordered set is a pair and a relation Question Compare this with equivalence relations. that satisfies the following three properties: consisting of a seton 2. (anti-symmetry) 1. (reflexivity) 3. (transitivity) Example Real numbers with usual order. Example Definition

Supplement: Linear Orderings Definition A linearly (or totally) ordered set is a is called a chain if that satisfies:partially ordered set If 1. (comparability) is a partially ordered set then is linearly ordered. Definition Rays are subsetsand Definition Ifis a linearly ordered set then the order topologyonis obtained from the subbasis consisting of rays. Example Ifis the real numbers with the usual ordering thenis the usual topology.

Supplement: Linear Orderings Theorem Let Proof Let be the order topology on be a linearly ordered set and Thenis compact iff has a glb and a lub. does not have a least upper bound denote the set of upperand let is an open cover ofthat has no finite subcover so is not compact. Similarly if then bounds ofIf does not have a greatest lower bound thenis not compact. For the converse letbe an open cover ofand letbe the set of such thatcan be covered by a finitely many elements ofIf every nonempty then compact else there exist Then is This is a contradiction.so

Supplement: Well Orderings Definition A well ordered set is a linearly ordered set such that every nonempty subset contains a minimal (or least) element is not the maximal element in Question Why is such an element unique? Definition If then its successor is given by Lemma Ifis an uncountable well ordered set then is uncountable. Proof. Otherwiseso let and observe thatsois uncountable.

Supplement: Well Orderings Theorem Let Then for every be a well ordered set. the closed interval is compact. Proof It suffices, by the preceding lemma, to show that every nonempty subsethas an glb and a lub. Since Let is well orderedcontains a minimal elementso then denote the set of upper bounds ofSince containsit is nonempty and therefore contains a minimal elementso then

Supplement: Countable Compactness Theorem Ifspace thenis a Proof Assume if and only if is countably compact has the Bolzano-Weierstrass property. If is countably compact and that is an infinite set thenis closed and there exist open such that Then is a countable open cover of that has no finite subcover, showing the only if part. Now assumehas the BW property and an open cover ofwith no finite subcover. Construct with is infinite andand observe that is This violates the BW property, showing the if part.

Supplement: Countable Compactness Exercise 3.3, Question15, page 181: (challenging) There are countably compact spaces that are not compact. on with the order topology is countably compact. It suffices be an uncountable set. The axiom of choiceProof Let Claim: by the theorem on the preceding page to show that implies that there exists a well order has the BW property. Let be countably infinite and let Sinceis countable LetIf (a basic open set) then hence

Assignment 14 Read pages , , , Prepare to solve during Tutorial Thursday 25 March Exercise 7.3 problem 4, 6 Exercise 7.4 problems 6, 11 Exercise 7.5 problems 1, 8 Exercise 8.1 problems 6, 7