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

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Some important properties Lectures of Prof. Doron Peled, Bar Ilan University.
Mathematical Induction
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.
Lecture 3 Universal TM. Code of a DTM Consider a one-tape DTM M = (Q, Σ, Γ, δ, s). It can be encoded as follows: First, encode each state, each direction,
Equivalence Relations
One-phase Solidification Problem: FEM approach via Parabolic Variational Inequalities Ali Etaati May 14 th 2008.
Basic properties of the integers
Chaper 3 Weak Topologies. Reflexive Space.Separabe Space. Uniform Convex Spaces.
Induction and recursion
Zermelo-Fraenkel Axioms Ernst Zermelo ( ) gave axioms of set theory, which were improved by Adolf Fraenkel ( ). This system of axioms called.
Approximation Algorithms
Partially Ordered Sets (POSets)
Relations Chapter 9.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
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
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 5 School of Innovation, Design and Engineering Mälardalen University 2012.
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 ,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Lecture 21 Reducibility. Many-one reducibility For two sets A c Σ* and B c Γ*, A ≤ m B if there exists a Turing-computable function f: Σ* → Γ* such that.
MA5238 Fourier Analysis Wayne Lawton Department of Mathematics S ,
Chapter Three SEQUENCES
Introduction to Graph Theory
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
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
3.3 Mathematical Induction 1 Follow me for a walk through...
MA5238 Fourier Analysis Wayne Lawton Department of Mathematics S ,
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Partial Orderings: Selected Exercises
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
Department of Mathematics
Relations Chapter 9.
Theorem of Banach stainhaus and of Closed Graph
Department of Mathematics
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Set Topology MTH 251 Lecture # 8.
Introduction to Real Analysis
Chapter 3 The Real Numbers.
3.3 Applications of Maximum Flow and Minimum Cut
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
I.4 Polyhedral Theory (NW)
I.4 Polyhedral Theory.
Presentation transcript:

MA4266 Topology Wayne Lawton Department of Mathematics S , Lecture 15. Tuesday 30 March 2010

Chains and Maximal Elements is a partially ordered set. Definition A subset are (all 3) maximal elements. is called a chain if Example is a linearly (or totally) ordered set. are chains, Assume that Definition An elementis a maximal element if Remark Ifhas a maximumthen is a maximal element. However a maximal element need not be a maximum element. are not chains,

Zorn’s Lemma Proof This is equivalent to the axiom of choice, the well ordering principle, and the Hausdorff maximal principle. has an upper bound thenhas a maximal element. Lemma (Zorn) Assume thatis a partially ordered set. If every chain Lemma Hausdorff Maximal Principle (HMP) Every is contained as a subset of a maximal chain. Proof It suffices by Zorn’s lemma to show that every since the union of a chain of chains is itself a chain chain of chains has a maximal element. This follows which is also an upper bound for the chains in the chain. chain in

Alexander Subbasis Theorem by members ofEvery cover of for Theorem A spaceis compact if and only if there exists a subbasis has a finite subcover. Proof If is a subbasis is compact then every subbasis has prop. F. with property F and assume that To prove the converse assume that with the following Property F: is not compact. It suffices to obtain a contradiction. Letbe an open cover ofthat has no finite subcover. Covers are partially ordered by inclusion and the union of any chain of covers, each having no finite subcover, is an upper bound of the covers in this chain. So the HMP implies

Alexander Subbasis Theorem will choose that there exists a maximal open cover of property that it has no finite subcover. So we can and property. Lemma If to be a maximal open cover with this (remark: this required the Axiom of Choice) with the are open sets and there exists such thatthen there such thatexists Proof Else such thatThis gives the contradiction

Alexander Subbasis Theorem Question Why does this statement hold ? Now for every there exist such that Then the preceding lemma implies that there exists and every such that is an open cover of Therefore by members ofand hence admits a finite subcover Sinceit follows that is a finite subcover ofby members of This contradiction completes the proof.

The Tychonoff Theorem Proof Let Theorem7.11The product of compact spaces is compact be a collection of compact be the product space and spaces, let be the ‘standard’ subbasis. It suffices, by the AST to show by elements ofhas a finitethat every cover of be such a cover and assume to thesubcover. Let let contrary thatdid not have a finite subcover. For each let No finite subset ofdoesn’t coversocovers sothat is not in any member of If then

Assignment 15 Read pages , , Written Homework #3 Due Friday 9 April 1. Letbe a nonempty set. A subset is called ‘frisbee’ (on X) if it satisfies the following: and is called a ‘highflyer’ it is a frisbee that is not a proper subset of another frisbee. is called a ‘freeflyer’ if

Assignment 15 (a) For nonempty (c) Use the Hausdorff Maximal Principle to prove show that define Prove thatis always a frisbee and that it is a a highflyer if and only if S is a singleton set. (b) For is a freeflyer. that every frisbee is contained in a highflyer. (d) Show that a frisbeeis a highflyer if and only if for everyeitheror Remark (b) and (c) ensure the existence of freeflying highflyers, and (d) shows that they are mind boggling !

Assignment Let ‘lands on’ be a nonempty topological space and A frisbee(on X)if every open set that contains (a) Letbe topological spaces. Show thatand (on X) that lands onif and only if for every frisbee belongs to a functionis continuous at (clearly a frisbee on Y) lands on (b) Letbe a product space and let be a frisbee on X. Prove thatlands on if and only iflands on

Assignment 15 (c) Prove that a spaceis compact if and only if every highflyer lands on some point in (d) Prove The Tychonoff Theorem using highflyers.