Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Chapter 8 Topics in Graph Theory
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Graph-02.
 期中测验时间:本周五上午 9 : 40  教师 TA 答疑时间 : 周三晚上 6 : 00—8 : 30  地点:软件楼 315 房间,  教师 TA :李弋老师  开卷考试.
COUNTING AND PROBABILITY
1 Lecture 5 (part 2) Graphs II Euler and Hamiltonian Path / Circuit Reading: Epp Chp 11.2, 11.3.
BY: MIKE BASHAM, Math in Scheduling. The Bridges of Konigsberg.
GOLOMB RULERS AND GRACEFUL GRAPHS
The Seven Bridges Of Konigsberg.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Topology YAN JIE (Ryan).
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair.
A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington Graph Theory.
R. Bar-Yehuda © 1 קומבינטוריקה למדעי - המחשב – הרצאה #17 Chapter 2: TREES מבוסס על הספר : S. Even, "Graph Algorithms",
Curve Curve: The image of a continous map from [0,1] to R 2. Polygonal curve: A curve composed of finitely many line segments. Polygonal u,v-curve: A polygonal.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
1/22/03Tucker, Applied Combinatorics, Section EDGE COUNTING TUCKER, APPLIED COMBINATORICS, SECTION 1.3, GROUP B Michael Duquette & Amanda Dargie.
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Introduction to Graph Theory
GRAPH Learning Outcomes Students should be able to:
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.6 Topology.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
The Fundamental Theorem for Line Integrals. Questions:  How do you determine if a vector field is conservative?  What special properties do conservative.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Planar Graphs Graph Coloring
Aim: What is an Euler Path and Circuit?
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graph Theory and Applications
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
AND.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Eulerian Paths and Cycles. What is a Eulerian Path Given an graph. Find a path which uses every edge exactly once. This path is called an Eulerian Path.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Chapter 6: Graphs 6.1 Euler Circuits
Aim: Graph Theory – Paths & Circuits Course: Math Literacy Do Now: Aim: What are Circuits and Paths? Can you draw this figure without retracing any of.
What is topology? The word topology comes from the Greek topos, "place," and logos, "study” Topology was known as geometria situs (Latin geometry of place)
Introduction to Graph Theory
CS 261 – Nov. 17 Graph properties – Bipartiteness – Isomorphic to another graph – Pseudograph, multigraph, subgraph Path Cycle – Hamiltonian – Euler.
Functions of Several Variables Copyright © Cengage Learning. All rights reserved.
COMPSCI 102 Introduction to Discrete Mathematics.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Chapter 2 Sets and Functions.
By Harish Bhattarai, Cameron Halvey, Layton Miller
Graph Theory An Introduction.
Graphs: Definitions and Basic Properties
What is topology? The word topology comes from the Greek topos, "place," and logos, "study” Topology was known as geometria situs (Latin geometry of place)
Graph theory Definitions Trees, cycles, directed graphs.
Eulerian tours Miles Jones MTThF 8:30-9:50am CSE 4140 August 15, 2016.
Chapter 3 The Real Numbers.
Chapter 2 Sets and Functions.
By Megan MacGregor Math 10 H
Graph Theory What is a graph?.
Chapter 3 The Real Numbers.
Applied Combinatorics, 4th Ed. Alan Tucker
5 The Mathematics of Getting Around
Presentation transcript:

Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07

History Leonard Euler –Königsberg Bridge Problem

Königsberg Bridge Problem J. J. O’Connor, A history of Topology

Königsberg Bridge Problem A B C D VertexDegree A3 B5 C3 D3 A graph has a path traversing each edge exactly once if exactly two vertices have odd degree.

Königsberg Bridge Problem A B C D VertexDegree A3 B4 C3 D2 A graph has a path traversing each edge exactly once if exactly two vertices have odd degree.

History Leonard Euler –Königsberg Bridge Problem August Möbius –Möbius Strip

Möbius Strip A sheet of paper has two sides, a front and a back, and one edge A möbius strip has one side and one edge

Möbius Strip Plus Magazine ~ Imaging Maths – Inside the Klein Bottle

History Leonard Euler –Königsberg Bridge Problem August Möbius –Möbius Strip Felix Klein –Klein Bottle

Klein Bottle A sphere has an inside and an outside and no edges A klein bottle has only an outside and no edges

Klein Bottle Plus Magazine ~ Imaging Maths – Inside the Klein Bottle

General Topology Overview

Definition of a topological space A topological space is a pair of objects,, where is a non-empty set and is a collection of subsets of, such that the following four properties hold: –1. –2. –3. If then –4. If for each then

General Topology Overview Terminology – is called the underlying set – is called the topology on –All the members of are called open sets Examples – with – Another topology on, –The real line with open intervals, and in general

General Topology Overview Branches –Point-Set Topology Based on sets and subsets Connectedness Compactness –Algebraic Topology Derived from Combinatorial Topology Models topological entities and relationships as algebraic structures such as groups or a rings

General Topology Overview Definition of a topological subspace Let, and be topological spaces, then is said to be a subspace of The elements of are open sets by definition, if we let, then and these sets are said to be relatively open in

General Topology Overview Definition of a relatively open set Let, where is a subspace of and is a subset of. Then is said to be relatively open in if, and is open in. Definition of a relatively closed set Let, where is a subspace of and is a subset of. Then is said to be relatively closed in if, and is closed in.

General Topology Overview Definition of a neighborhood of a point Let, where is a topological space. Then a neighborhood of, denoted, is a subset of that contains an open set containing. Continuous function property A continuous function maps open/closed sets in into open/closed sets in

Connectedness

The general idea that all of the space touches. A point can freely be moved throughout the space to assume the location of any other point. A B

Connectedness General Connectedness –A space that cannot be broken up into several disjoint yet open sets –Consider where x1x1 x2x2 A B

Connectedness General Connectedness –A space that cannot be broken up into several disjoint yet open sets Path Connectedness –A space where any two points in the space are connected by a path that lies entirely within the space –This is different than a convex region where the path must be a straight line

Connectedness Simple Connectedness –A space that is free of “holes” –A space where every ball can be shrunk to a point –A space where every path from a point A to a point B can be deformed into any other path from the point A to the point B

General Connectedness Definition of general connectedness A topological space is said to be connected if, where is both open and closed, then or.

General Connectedness Example of a disconnected set – with –Let –Then –This implies that is the complement of –Since is open then is closed –But is also open since it is an element of –Since is neither nor, is shown to be disconnected

General Connectedness A subset of a topological space is said to be connected if, where is both relatively open and relatively closed, then.

Path Connectedness Definition of a path in Let,, where is a continuous function, and let and. Then is called a path in and, the image of the interval, is a curve in that connects to. 0 1

Path Connectedness Definition of a path connected space Let, where is a topological space. Then is said to be path connected if there is a path that connects to for all.

Path Connectedness Is every path connected space also generally connected? Let be a topological space that is path connected. Now suppose that is disconnected. Then is both open and closed, and or.

Path Connectedness Let and. Since is path connected. Consider, clearly since. In addition, since. This set is then either open or closed but not both since is connected. Therefore, can be open or closed but not both.

0 Path Connected 1

Path Connectedness This is a contradiction, so we conclude that every path connected space is also generally connected. Proof taken from Mendelson p. 135

Simple Connectedness Definition of a homotopy Let be paths in that connect to, where, then is said to be homotopic to if, where is continuous, such that the following hold true for.

Simple Connectedness (0,1) (1,1) (1,0) time space Mile marker 0Mile marker 1 Time 0: Mile marker 0Mile marker 1 Time 1:

Simple Connectedness (0,1) (1,1) (1,0) time space

Simple Connectedness The function is called the homotopy connecting to. and both belong to the same homotopy class. In a simply connected space any path between two points can be deformed into any other space. Consider the closed loops, ones in which the starting and ending points are the same. Then they must all be deformable into one another.

Simple Connectedness One such closed path where we leave from a point A and return to it, is to never leave it. This path is called the constant path and is denoted by.

Simple Connectedness Define a simply connected space Let be a topological space and. Then is said to be simply connected if for every there is only one homotopy class of closed paths. Since the constant path is guaranteed to be a closed path for, the homotopy class must be.

Simply Connected Exit Entrance

Simply Connected

Compactness

Definition of a covering Let be a set,, and be an indexed subset of. Then the set is said to cover if. If only a finite number of sets are needed to cover, then is more specifically a finite covering.

Compactness Definition of a compact space Let be a topological space, and let be a covering of. Then if for and is finite, then is said to be compact.

Compactness Example of a space that is not compact Consider the real line The set of open intervals is clearly a covering of. Removing any one interval leaves an integer value uncovered. Therefore, no finite subcovering exists.

Compactness is no longer covered Remove any interval

Compactness Define locally compact Let be a topological space, then is said to be locally compact if is compact. Note that every generally compact set is also locally compact since some subset of the finite coverings of the whole set will be a finite covering for some neighborhood of every in the space.

Compactness Is every closed subset of a compact space compact as well? Let be a closed subset of the compact space. If is an open covering of, then by adjoining the open set to the open covering of we obtain an open covering of.

Compactness Since is compact there is a finite subcovering of. However, each is either equal to a for some or equal to. If occurs among we may delete it to obtain a finite collection of the ’s that covers Proof taken from Mendelson

Applications

Network Theory Knot Theory Genus categorization

Applications Genus = the number of holes in a surface –Formally: the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. (Mathworld) 5 holes Matt Black

Applications Matt Black

Applications 2006 Encyclopædia Britannica

Applications Definition of Fixed Point Theorem Let be a continuous function over the interval, such that and. Then. (1,1) (0,1) (1,0) z

Applications is path connected, and since is continuous, is also path connected. If, then. Suppose never crosses the line then let be an interval containing some, where and.

Applications Clearly, there is a path that connects to since is a closed interval subset of and is therefore connected. Since is continuous we now shrink the width of the interval. When, the width will be zero and we can substitute in for and. This implies that and, since a path must connect the endpoints,.

Applications Definition of a Conservative Force The work done in changing an object’s position is said to be path independent. One significant result of this type of a force is that the work done in moving an object along a closed path is 0.

Applications Let be a point in a space that is topologically simple, then is the homotopy class for all closed paths that include. The work done in not moving an object is obviously 0, and since all closed paths containing are in the same homotopy class, the work done on them is also 0.

Applications We can prove it another way as well Let us define positive work to be that done on a path heading away from us, and negative work to be done when heading in the opposite direction, toward us. Then pick any point on the closed path as your starting point and some other point on the path as your ending point.

Applications Move along the straight line connecting those two points, and then move back along the same path. The total work done during the journey will be 0 since the magnitude of both trips is the same, but the signs are opposite. Each traversal of the path is homotopically equivalent to traversing one-half of the closed path.

Applications + work – work 0 total work

Questions

Special Thanks Dr. Knisely for assistance in my paper direction and revision My brother, Matt Black, for making graphics I couldn’t find online

Bibliography Königsberg city map – Klein Bottle Images and rotating Möbius strip – Möbius steps and genus diagrams and video –Matthew Black Coffee Cup Animation – Genus definition – Mendelson Textbook –Mendelson, Bert. Introduction to Topology. NY: Dover, Munkers Textbook –Munkers, James R. Topology. New Delhi: Prentice Hall of India, All else, property of Nathanael Black