Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Topology in GIS by Rohit Kumar 1836 views
- Topology presentation by Jobaida Nahar 19008 views
- Topology ppt by Daksh Bapna 1317 views
- Lec_12_Intro to Geodatabase and Top... by Atiqa khan 718 views
- Spatial Data Model by Kaium Chowdhury 1854 views
- XS Boston 2008 Network Topology by The Linux Foundation 849 views

No Downloads

Total views

1,742

On SlideShare

0

From Embeds

0

Number of Embeds

4

Shares

0

Downloads

106

Comments

0

Likes

2

No embeds

No notes for slide

- 1. Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07
- 2. History <ul><li>Leonard Euler </li></ul><ul><ul><li>Königsberg Bridge Problem </li></ul></ul>
- 3. Königsberg Bridge Problem J. J. O’Connor, A history of Topology
- 4. Königsberg Bridge Problem A B C D A graph has a path traversing each edge exactly once if exactly two vertices have odd degree . 3 D 3 C 5 B 3 A Degree Vertex
- 5. Königsberg Bridge Problem A B C D A graph has a path traversing each edge exactly once if exactly two vertices have odd degree . 2 D 3 C 4 B 3 A Degree Vertex
- 6. History <ul><li>Leonard Euler </li></ul><ul><ul><li>Königsberg Bridge Problem </li></ul></ul><ul><li>August Möbius </li></ul><ul><ul><li>Möbius Strip </li></ul></ul>
- 7. Möbius Strip <ul><li>A sheet of paper has two sides, a front and a back, and one edge </li></ul><ul><li>A möbius strip has one side and one edge </li></ul>
- 8. Möbius Strip Plus Magazine ~ Imaging Maths – Inside the Klein Bottle
- 9. History <ul><li>Leonard Euler </li></ul><ul><ul><li>Königsberg Bridge Problem </li></ul></ul><ul><li>August Möbius </li></ul><ul><ul><li>Möbius Strip </li></ul></ul><ul><li>Felix Klein </li></ul><ul><ul><li>Klein Bottle </li></ul></ul>
- 10. Klein Bottle <ul><li>A sphere has an inside and an outside and no edges </li></ul><ul><li>A klein bottle has only an outside and no edges </li></ul>
- 11. Klein Bottle Plus Magazine ~ Imaging Maths – Inside the Klein Bottle
- 12. General Topology Overview
- 13. General Topology Overview <ul><li>Definition of a topological space </li></ul><ul><li>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: </li></ul><ul><ul><li>1. </li></ul></ul><ul><ul><li>2. </li></ul></ul><ul><ul><li>3. If then </li></ul></ul><ul><ul><li>4. If for each then </li></ul></ul>
- 14. General Topology Overview <ul><li>Terminology </li></ul><ul><ul><li>is called the underlying set </li></ul></ul><ul><ul><li>is called the topology on </li></ul></ul><ul><ul><li>All the members of are called open sets </li></ul></ul><ul><li>Examples </li></ul><ul><ul><li>with </li></ul></ul><ul><ul><li>Another topology on , </li></ul></ul><ul><ul><li>The real line with open intervals, and in general </li></ul></ul>
- 15. General Topology Overview <ul><li>Branches </li></ul><ul><ul><li>Point-Set Topology </li></ul></ul><ul><ul><ul><li>Based on sets and subsets </li></ul></ul></ul><ul><ul><ul><li>Connectedness </li></ul></ul></ul><ul><ul><ul><li>Compactness </li></ul></ul></ul><ul><ul><li>Algebraic Topology </li></ul></ul><ul><ul><ul><li>Derived from Combinatorial Topology </li></ul></ul></ul><ul><ul><ul><li>Models topological entities and relationships as algebraic structures such as groups or a rings </li></ul></ul></ul>
- 16. General Topology Overview <ul><li>Definition of a topological subspace </li></ul><ul><li>Let , and be topological spaces, then is said to be a subspace of </li></ul><ul><li>The elements of are open sets by definition, if we let , then and these sets are said to be relatively open in </li></ul>
- 17. General Topology Overview <ul><li>Definition of a relatively open set </li></ul><ul><li>Let , where is a subspace of and is a subset of . Then is said to be relatively open in if , and is open in . </li></ul><ul><li>Definition of a relatively closed set </li></ul><ul><li>Let , where is a subspace of and is a subset of . Then is said to be relatively closed in if , and is closed in . </li></ul>
- 18. General Topology Overview <ul><li>Definition of a neighborhood of a point </li></ul><ul><li>Let , where is a topological space. Then a neighborhood of , denoted , is a subset of that contains an open set containing . </li></ul><ul><li>Continuous function property </li></ul><ul><li>A continuous function maps open/closed sets in into open/closed sets in </li></ul>
- 19. Connectedness
- 20. Connectedness <ul><li>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. </li></ul>A B
- 21. Connectedness <ul><li>General Connectedness </li></ul><ul><ul><li>A space that cannot be broken up into several disjoint yet open sets </li></ul></ul><ul><ul><li>Consider where </li></ul></ul>x 1 x 2 A B
- 22. Connectedness <ul><li>General Connectedness </li></ul><ul><ul><li>A space that cannot be broken up into several disjoint yet open sets </li></ul></ul><ul><li>Path Connectedness </li></ul><ul><ul><li>A space where any two points in the space are connected by a path that lies entirely within the space </li></ul></ul><ul><ul><li>This is different than a convex region where the path must be a straight line </li></ul></ul>
- 23. Connectedness <ul><li>Simple Connectedness </li></ul><ul><ul><li>A space that is free of “holes” </li></ul></ul><ul><ul><li>A space where every ball can be shrunk to a point </li></ul></ul><ul><ul><li>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 </li></ul></ul>
- 24. General Connectedness <ul><li>Definition of general connectedness </li></ul><ul><li>A topological space is said to be connected if , where is both open and closed, then or . </li></ul>
- 25. General Connectedness <ul><li>Example of a disconnected set </li></ul><ul><ul><li>with </li></ul></ul><ul><ul><li>Let </li></ul></ul><ul><ul><li>Then </li></ul></ul><ul><ul><li>This implies that is the complement of </li></ul></ul><ul><ul><li>Since is open then is closed </li></ul></ul><ul><ul><li>But is also open since it is an element of </li></ul></ul><ul><ul><li>Since is neither nor , is shown to be disconnected </li></ul></ul>
- 26. General Connectedness <ul><li>A subset of a topological space is said to be connected if , where is both relatively open and relatively closed, then . </li></ul>
- 27. Path Connectedness <ul><li>Definition of a path in </li></ul><ul><li>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 . </li></ul>0 1
- 28. Path Connectedness <ul><li>Definition of a path connected space </li></ul><ul><li>Let , where is a topological space. Then is said to be path connected if there is a path that connects to for all . </li></ul>
- 29. Path Connectedness <ul><li>Is every path connected space also generally connected? </li></ul><ul><li>Let be a topological space that is path connected. Now suppose that is disconnected. </li></ul><ul><li>Then is both open and closed, and or . </li></ul>
- 30. Path Connectedness <ul><li>Let and . Since is path connected . </li></ul><ul><li>Consider , clearly since . </li></ul><ul><li>In addition, since . </li></ul><ul><li>This set is then either open or closed but not both since is connected. </li></ul><ul><li>Therefore, can be open or closed but not both. </li></ul>
- 31. Path Connected 0 1
- 32. Path Connectedness <ul><li>This is a contradiction, so we conclude that every path connected space is also generally connected. </li></ul><ul><li>Proof taken from Mendelson p. 135 </li></ul>
- 33. Simple Connectedness <ul><li>Definition of a homotopy </li></ul><ul><li>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 . </li></ul>
- 34. Simple Connectedness (0,1) (1,1) (1,0) time space Mile marker 0 Mile marker 1 Time 0: Mile marker 0 Mile marker 1 Time 1:
- 35. Simple Connectedness (0,1) (1,1) (1,0) time space
- 36. Simple Connectedness <ul><li>The function is called the homotopy connecting to . and both belong to the same homotopy class. </li></ul><ul><li>In a simply connected space any path between two points can be deformed into any other space. </li></ul><ul><li>Consider the closed loops, ones in which the starting and ending points are the same. Then they must all be deformable into one another. </li></ul>
- 37. Simple Connectedness <ul><li>One such closed path where we leave from a point A and return to it, is to never leave it. </li></ul><ul><li>This path is called the constant path and is denoted by . </li></ul>
- 38. Simple Connectedness <ul><li>Define a simply connected space </li></ul><ul><li>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 . </li></ul>
- 39. Simply Connected Exit Entrance
- 40. Simply Connected
- 41. Compactness
- 42. Compactness <ul><li>Definition of a covering </li></ul><ul><li>Let be a set, , and be an indexed subset of . Then the set is said to cover if . </li></ul><ul><li>If only a finite number of sets are needed to cover , then is more specifically a finite covering. </li></ul>
- 43. Compactness <ul><li>Definition of a compact space </li></ul><ul><li>Let be a topological space, and let be a covering of . Then if for and is finite, then is said to be compact. </li></ul>
- 44. Compactness <ul><li>Example of a space that is not compact </li></ul><ul><li>Consider the real line </li></ul><ul><li>The set of open intervals is clearly a covering of . </li></ul><ul><li>Removing any one interval leaves an integer value uncovered. </li></ul><ul><li>Therefore, no finite subcovering exists. </li></ul>
- 45. Compactness 0 5 -5 2 is no longer covered Remove any interval
- 46. Compactness <ul><li>Define locally compact </li></ul><ul><li>Let be a topological space, then is said to be locally compact if is compact. </li></ul><ul><li>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. </li></ul>
- 47. Compactness <ul><li>Is every closed subset of a compact space compact as well? </li></ul><ul><li>Let be a closed subset of the compact space . </li></ul><ul><li>If is an open covering of , then by adjoining the open set to the open covering of we obtain an open covering of . </li></ul>
- 48. Compactness <ul><li>Since is compact there is a finite subcovering of . </li></ul><ul><li>However, each is either equal to a for some or equal to . </li></ul><ul><li>If occurs among we may delete it to obtain a finite collection of the ’s that covers </li></ul><ul><li>Proof taken from Mendelson 162-163 </li></ul>
- 49. Applications
- 50. Applications <ul><li>Network Theory </li></ul><ul><li>Knot Theory </li></ul><ul><li>Genus categorization </li></ul>
- 51. Applications <ul><li>Genus = the number of holes in a surface </li></ul><ul><ul><li>Formally: the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. (Mathworld) </li></ul></ul>5 holes Matt Black
- 52. Applications Matt Black
- 53. Applications 2006 Encyclopædia Britannica
- 54. Applications <ul><li>Definition of Fixed Point Theorem </li></ul><ul><li>Let be a continuous function over the interval , such that and . Then . </li></ul>(1,1) (0,1) (1,0) z
- 55. Applications <ul><li>is path connected, and since is continuous, is also path connected. </li></ul><ul><li>If , then . </li></ul><ul><li>Suppose never crosses the line then let be an interval containing some , where and . </li></ul>
- 56. Applications <ul><li>Clearly, there is a path that connects to since is a closed interval subset of and is therefore connected. </li></ul><ul><li>Since is continuous we now shrink the width of the interval . </li></ul><ul><li>When , the width will be zero and we can substitute in for and . </li></ul><ul><li>This implies that and, since a path must connect the endpoints, . </li></ul>
- 57. Applications <ul><li>Definition of a Conservative Force </li></ul><ul><li>The work done in changing an object’s position is said to be path independent. </li></ul><ul><li>One significant result of this type of a force is that the work done in moving an object along a closed path is 0. </li></ul>
- 58. Applications <ul><li>Let be a point in a space that is topologically simple, then is the homotopy class for all closed paths that include . </li></ul><ul><li>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. </li></ul>
- 59. Applications <ul><li>We can prove it another way as well </li></ul><ul><li>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. </li></ul><ul><li>Then pick any point on the closed path as your starting point and some other point on the path as your ending point. </li></ul>
- 60. Applications <ul><li>Move along the straight line connecting those two points, and then move back along the same path. </li></ul><ul><li>The total work done during the journey will be 0 since the magnitude of both trips is the same, but the signs are opposite. </li></ul><ul><li>Each traversal of the path is homotopically equivalent to traversing one-half of the closed path. </li></ul>
- 61. Applications + work – work 0 total work
- 62. Questions
- 63. Special Thanks <ul><li>Dr. Knisely for assistance in my paper direction and revision </li></ul><ul><li>My brother, Matt Black, for making graphics I couldn’t find online </li></ul>
- 64. Bibliography <ul><li>Königsberg city map </li></ul><ul><ul><li>http://www-history.mcs.st-and.ac.uk/HistTopics/Topology_in_mathematics.html </li></ul></ul><ul><li>Klein Bottle Images and rotating Möbius strip </li></ul><ul><ul><li>http://plus.maths.org/issue26/features/mathart/index-gifd.html </li></ul></ul><ul><li>Möbius steps and genus diagrams and video </li></ul><ul><ul><li>Matthew Black </li></ul></ul><ul><li>Coffee Cup Animation </li></ul><ul><ul><li>http://www.britannica.com/eb/article-9108691 </li></ul></ul><ul><li>Genus definition </li></ul><ul><ul><li>http://mathworld.wolfram.com/Topology.html </li></ul></ul><ul><li>Mendelson Textbook </li></ul><ul><ul><li>Mendelson, Bert. Introduction to Topology. NY: Dover, 1990. </li></ul></ul><ul><li>Munkers Textbook </li></ul><ul><ul><li>Munkers, James R. Topology. New Delhi: Prentice Hall of India, 2000. </li></ul></ul><ul><li>All else, property of Nathanael Black </li></ul>

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment