Abstract

In this paper a proof of the Jordan curve theorem will be presented. Some familiarity with the basic notions of nonstandard analysis is assumed. The rest of the paper is selfcontained except for some standard theorems about polygons. The theorem will be proved in what ought to be a natural way: by approximation by polygons. This method is not usually found in the standard proofs since the approximating sequence of polygons is often unwieldly. But by using nonstandard analysis, one can approximate a Jordan curve by a single polygon that is infinitesimal ly close to the curve. This allows types of reasoning which are extremely difficult and unnatural on sequences of polygons. Preliminaries. The basic concepts of nonstandard analysis and some acquaintance with polygons are assumed. Some basic definitions and theorems of point set topology are also assumed. Throughout this paper the following notations and conventions will be used: (1) All discussion, unless otherwise stated, is assumed to be about a nonstandard model of the Euclidean plane. 'Otherwise stated will often mean that the notion or concept will be prefaced by the word standard. (2) standard concept and its extension will be denoted by the same symbol. If it is necessary to distinguish between them, reference to the model in which they are to be interpreted will be made. (3) If and are sets of points and x is a point, then \x, A will denote the distance from x to and \B, A = mίxeB\x, A\. (Thus if Π Φ 0 then \A, B = 0.) \x,y will denote the distance from the point x to the point y. (4) / will denote a fixed continuous function on [0,1] into the Euclidean plane with the property that x < y and f(x) — fyy) if and only if x — 0 and y = 1. C will denote the range of /. ( 5 ) x ~ y will mean that the distance from x to y is infinitesimal. If x is near-standard then °χ will denote the standard y such that x ~ y. (6) \i x and y are points then xy will denote the ordered, closed line segment that begins at x and ends at y. (7) If x and y are points then intv (x, y) is the set of all points z of xy such that z Φ x and z Φ y.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call