| Line 30: | Line 30: | ||
==Why it works== | ==Why it works== | ||
| − | Now why does this work? It seems like a magical fact which I just pulled out of my pocket. But the great thing about this particular mathematical fact is that it's something which we can easily argue. So here I'll present the outline of a proof. The idea is that if we were to take a large circle, we can bend continuously, and with rather strict rules, into an arbitrary simple, closed curve (a curve which is simple and curved is commonly called a | + | - Explain what a homeomorphism is |
| + | |||
| + | Now why does this work? It seems like a magical fact which I just pulled out of my pocket. But the great thing about this particular mathematical fact is that it's something which we can easily argue. So here I'll present the outline of a proof. The idea is that if we were to take a large circle, we can bend continuously, and with rather strict rules, into an arbitrary simple, closed curve (a curve which is simple and curved is commonly called a [http://mathworld.wolfram.com/JordanCurve.html Jordan Curve]). These strict rules preserve a specific property of the curve which corresponds to the insideness of the chosen point. | ||
Imagine you start with some arbitrary curve in the plane, and you're interested in whether a point is inside or outside the curve: | Imagine you start with some arbitrary curve in the plane, and you're interested in whether a point is inside or outside the curve: | ||
| Line 42: | Line 44: | ||
It is not yet clear what the relationship is between the number of intersections and the insideness of the point, but we can try to reduce the situation to a simpler situation. Imagine the various deformations of the curve which preserve insideness and the effect these has on the number of intersections: | It is not yet clear what the relationship is between the number of intersections and the insideness of the point, but we can try to reduce the situation to a simpler situation. Imagine the various deformations of the curve which preserve insideness and the effect these has on the number of intersections: | ||
| − | ' | + | '''Type 1: ''' ''A homeomorphism which preserves both number of intersections and insideness'' |
| − | '' | + | |
| − | ''A homeomorphism which preserves | + | |
| + | [[Image:Morph t3.png]] | ||
| + | |||
| + | '''Type 2: ''' ''A homeomorphism which preserves insideness, but not number of intersections'' | ||
| + | |||
| + | [[Image:Morph t1.png]] | ||
| + | |||
| + | '''Type 3: ''' ''A homeomorphism which preserves neither number of intersections or insideness'' | ||
| + | |||
| + | [[Image:Morph t2.png]] | ||
| + | |||
| + | Note then that the first two homeomorphisms and the inverse of the second preserve insideness. Because every Jordan curve is homeomorphic to the unit circle, we know there exists a homeomorphism between the two, and it is easy to see that this homeomorphism can be broken down into type 1, type 2, type 3, and the inverse of type 2 and type 3 homeomorphisms. | ||
---- | ---- | ||
| Line 54: | Line 65: | ||
[[Math_squad|Back to Math Squad page]] | [[Math_squad|Back to Math Squad page]] | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 13:17, 11 March 2013
Contents
The County Problem - A Topological Argument
keyword: tutorial, inside county, closed curve, curve
INTRODUCTION In this tutorial / exploration, I'll talk a little about topology, and a little about programming, with the goal of showing you that thinking mathematically can really get you out of a pickle sometimes.
Contents - The Problem - The Solution - Why it works - References
The problem
The problem we want to solve here is as follows: we want to create a computer function which takes an Indiana longitude and latitude value as input, and returns the county in which this point lies. At first this seems like a rather simple problem, for when one looks at a county and some point inside the county, they can immediately see whether the point is inside the county. For example:
The problem I will tackle here is very specific, and applicable to many areas of computer programming. I stumbled upon it when I was working on storing map data in a database. The problem was I had a database of address information which was stored as just a text entry. In other words, the data for a given address was just a string, such as "EXAMPLE ADDRESS". We wanted to add and we needed to get from this information
Lorem Ipsum [1] is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
The solution
Lorem Ipsum [1] is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
Why it works
- Explain what a homeomorphism is
Now why does this work? It seems like a magical fact which I just pulled out of my pocket. But the great thing about this particular mathematical fact is that it's something which we can easily argue. So here I'll present the outline of a proof. The idea is that if we were to take a large circle, we can bend continuously, and with rather strict rules, into an arbitrary simple, closed curve (a curve which is simple and curved is commonly called a Jordan Curve). These strict rules preserve a specific property of the curve which corresponds to the insideness of the chosen point.
Imagine you start with some arbitrary curve in the plane, and you're interested in whether a point is inside or outside the curve:
Now imagine you draw a ray from that point in an arbitrary direction in the plane, and that we focus on the number of intersections that line makes with the sides or the curve:
It is not yet clear what the relationship is between the number of intersections and the insideness of the point, but we can try to reduce the situation to a simpler situation. Imagine the various deformations of the curve which preserve insideness and the effect these has on the number of intersections:
Type 1: A homeomorphism which preserves both number of intersections and insideness
Type 2: A homeomorphism which preserves insideness, but not number of intersections
Type 3: A homeomorphism which preserves neither number of intersections or insideness
Note then that the first two homeomorphisms and the inverse of the second preserve insideness. Because every Jordan curve is homeomorphic to the unit circle, we know there exists a homeomorphism between the two, and it is easy to see that this homeomorphism can be broken down into type 1, type 2, type 3, and the inverse of type 2 and type 3 homeomorphisms.
REFERENCES
[1] "Loream Ipsum" <http://www.lipsum.com/>.
