View source for Jordan curve theorem

{{Short description|A closed curve divides the plane into two regions}}
[[Image:Jordan curve theorem.png|thumb|Illustration of the Jordan curve theorem. The Jordan curve (drawn in black) divides the plane into an "inside" region (light blue) and an "outside" region (pink).]]

In [[topology]], the '''Jordan curve theorem''' ('''JCT'''), formulated by [[Camille Jordan]] in 1887, asserts that every ''[[Jordan curve]]'' (a plane simple closed curve) divides the plane into an "[[interior (topology)|interior]]" region [[Boundary (topology)|bounded]] by the curve and an "[[exterior (topology)|exterior]]" region containing all of the nearby and far away exterior points. Every [[path (topology)|continuous path]] connecting a point of one region to a point of the other intersects with the curve somewhere. 

While the [[theorem]] seems intuitively obvious, it takes some ingenuity to prove it by elementary means. "Although the JCT is one of the best known topological theorems, there are many, even among professional mathematicians, who have never read a proof of it." ({{harvtxt|Tverberg|1980|loc=Introduction}}). More transparent proofs rely on the mathematical machinery of [[algebraic topology]], and these lead to generalizations to [[higher-dimensional space]]s.

The Jordan curve theorem is named after the [[mathematician]] [[Camille Jordan]] (1838–1922), who published its first claimed proof in 1887.{{sfnp|Jordan|1887}}<ref>{{cite journal
 | last = Kline | first = J. R.
 | doi = 10.2307/2303093
 | journal = American Mathematical Monthly
 | mr = 6516
 | pages = 281–286
 | title = What is the Jordan curve theorem?
 | volume = 49
 | year = 1942| issue = 5
 | jstor = 2303093
 }}</ref> For decades, mathematicians generally thought that this proof was flawed and that the first rigorous proof was carried out by [[Oswald Veblen]]. However, this notion has been overturned by [[Thomas Callister Hales|Thomas C. Hales]] and others.<ref>{{cite journal
 | last = Hales | first = Thomas C. | author-link = Thomas Callister Hales
 | department = From Insight to Proof: Festschrift in Honour of Andrzej Trybulec
 | issue = 23
 | journal = Studies in Logic, Grammar and Rhetoric
 | publisher = University of Białystok
 | title = Jordan's proof of the Jordan curve theorem
 | url = https://www.maths.ed.ac.uk/~v1ranick/papers/hales1.pdf
 | volume = 10
 | year = 2007}}</ref>

== Definitions and the statement of the Jordan theorem ==

A ''Jordan curve'' or a ''simple closed curve'' in the plane '''R'''<sup>2</sup> is the [[image (mathematics)|image]] ''C'' of an [[injective]] [[continuous map]] of a [[circle]] into the plane, ''φ'': ''S''<sup>1</sup> → '''R'''<sup>2</sup>. A '''Jordan arc''' in the plane is the image of an injective continuous map of a closed and bounded interval {{math|[''a'', ''b'']}} into the plane. It is a [[plane curve]] that is not necessarily [[Curve#Differential curve|smooth]] nor [[algebraic curve|algebraic]].

Alternatively, a Jordan curve is the image of a continuous map ''φ'': [0,1] → '''R'''<sup>2</sup> such that ''φ''(0) = ''φ''(1) and the restriction of ''φ'' to [0,1) is injective. The first two conditions say that ''C'' is a continuous loop, whereas the last condition stipulates that ''C'' has no self-intersection points.

With these definitions, the Jordan curve theorem can be stated as follows:

{{math theorem|math_statement=
Let ''C'' be a Jordan curve in the plane '''R'''<sup>2</sup>. Then its [[complement (set theory)|complement]], '''R'''<sup>2</sup>&nbsp;\&nbsp;''C'', consists of exactly two [[connected component (topology)|connected component]]s. One of these components is [[bounded set|bounded]] (the '''interior''') and the other is unbounded (the '''exterior'''), and the curve ''C'' is the [[boundary (topology)|boundary]] of each component.
}}

In contrast, the complement of a Jordan ''arc'' in the plane is connected.

== Proof and generalizations ==

The Jordan curve theorem was independently generalized to higher dimensions by [[H. Lebesgue]] and [[L.&nbsp;E.&nbsp;J. Brouwer]] in 1911, resulting in the '''Jordan–Brouwer separation theorem'''.

{{math theorem|math_statement=
Let ''X'' be an ''n''-dimensional ''[[topological sphere]]'' in the (''n''+1)-dimensional [[Euclidean space]] '''R'''<sup>''n''+1</sup> (''n'' > 0), i.e. the image of an injective continuous mapping of the [[n-sphere|''n''-sphere]] ''S<sup>n</sup>'' into '''R'''<sup>''n''+1</sup>.  Then the complement ''Y'' of ''X'' in '''R'''<sup>''n''+1</sup> consists of exactly two connected components.  One of these components is bounded (the interior) and the other is unbounded (the exterior).  The set ''X'' is their common boundary.
}}

The proof uses [[homology theory]]. It is first established that, more generally, if ''X'' is homeomorphic to the ''k''-sphere, then the [[reduced homology|reduced integral homology]] groups of ''Y'' = '''R'''<sup>''n''+1</sup> \ ''X'' are as follows:

: <math display="block">\tilde{H}_{q}(Y)= \begin{cases}\mathbb{Z}, & q=n-k\text{ or }q=n, \\ \{0\}, & \text{otherwise}.\end{cases}</math>

This is proved by induction in ''k'' using the [[Mayer–Vietoris sequence]]. When ''n'' = ''k'', the zeroth reduced homology of ''Y'' has rank 1, which means that ''Y'' has 2 connected components (which are, moreover, [[path connected]]), and with a bit of extra work, one shows that their common boundary is ''X''. A further generalization was found by [[James Waddell Alexander II|J. W. Alexander]], who established the [[Alexander duality]] between the reduced homology of a [[compact space|compact]] subset ''X'' of '''R'''<sup>''n''+1</sup> and the reduced cohomology of its complement. If ''X'' is an ''n''-dimensional compact connected submanifold of '''R'''<sup>''n''+1</sup> (or '''S'''<sup>''n''+1</sup>) without boundary, its complement has 2 connected components.

There is a strengthening of the Jordan curve theorem, called the [[Jordan–Schönflies theorem]], which states that the interior and the exterior planar regions determined by a Jordan curve in '''R'''<sup>2</sup> are [[homeomorphic]] to the interior and exterior of the [[unit disk]]. In particular, for any point ''P'' in the interior region and a point ''A'' on the Jordan curve, there exists a Jordan arc connecting ''P'' with ''A'' and, with the exception of the endpoint ''A'', completely lying in the interior region. An alternative and equivalent formulation of the Jordan–Schönflies theorem asserts that any Jordan curve ''&phi;'': ''S''<sup>1</sup> → '''R'''<sup>2</sup>, where ''S''<sup>1</sup> is viewed as the [[unit circle]] in the plane, can be extended to a homeomorphism ''&psi;'': '''R'''<sup>2</sup> → '''R'''<sup>2</sup> of the plane. Unlike Lebesgue's and Brouwer's generalization of the Jordan curve theorem, this statement becomes ''false'' in higher dimensions: while the exterior of the unit ball in '''R'''<sup>3</sup> is [[simply connected]], because it [[deformation retract|retracts]] onto the unit sphere, the [[Alexander horned sphere]] is a subset of '''R'''<sup>3</sup> homeomorphic to a [[sphere]], but so twisted in space that the unbounded component of its complement in '''R'''<sup>3</sup> is not simply connected, and hence not homeomorphic to the exterior of the unit ball.

=== Discrete version ===
The Jordan curve theorem can be proved from the [[Brouwer fixed-point theorem|Brouwer fixed point theorem]] (in 2 dimensions),{{sfnp|Maehara|1984|p=641}} and the Brouwer fixed point theorem can be proved from the Hex theorem: "every [[Hex (board game)|game of Hex]] has at least one winner", from which we obtain a logical implication: Hex theorem implies Brouwer fixed point theorem, which implies Jordan curve theorem.<ref>{{Cite journal |last=Gale |first=David |date=December 1979 |title=The Game of Hex and the Brouwer Fixed-Point Theorem |journal=The American Mathematical Monthly |volume=86 |issue=10 |pages=818–827 |doi=10.2307/2320146 |jstor=2320146 |issn=0002-9890}}</ref>

It is clear that Jordan curve theorem implies the "strong Hex theorem": "every game of Hex ends with exactly one winner, with no possibility of both sides losing or both sides winning", thus the Jordan curve theorem is equivalent to the strong Hex theorem, which is a purely [[Discrete mathematics|discrete]] theorem.

The Brouwer fixed point theorem, by being sandwiched between the two equivalent theorems, is also equivalent to both.<ref>{{Cite book |last1=Nguyen |first1=Phuong |last2=Cook |first2=Stephen A. |title=22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) |chapter=The Complexity of Proving the Discrete Jordan Curve Theorem |date=2007 |pages=245–256 |publisher=IEEE |doi=10.1109/lics.2007.48|arxiv=1002.2954 |isbn=978-0-7695-2908-0 }}</ref>

In reverse mathematics, and computer-formalized mathematics, the Jordan curve theorem is commonly proved by first converting it to an equivalent discrete version similar to the strong Hex theorem, then proving the discrete version.<ref>{{Cite journal |last=Hales |first=Thomas C. |date=December 2007 |title=The Jordan Curve Theorem, Formally and Informally  |journal=The American Mathematical Monthly |volume=114 |issue=10 |pages=882–894 |doi=10.1080/00029890.2007.11920481 |s2cid=887392 |issn=0002-9890}}</ref>

==== Application to image processing ====
In [[Digital image processing|image processing]], a binary picture is a discrete square grid of 0 and 1, or equivalently, a compact subset of <math>\Z^2</math>. Topological invariants on <math>\R^2</math>, such as number of components, might fail to be well-defined for <math>\Z^2</math> if <math>\Z^2</math> does not have an appropriately defined [[Pixel connectivity#Types of connectivity|graph structure]].

There are two obvious graph structures on <math>\Z^2</math>: 
[[File:Sasiedztwa_4_8.svg|right|thumb|8-neighbor and 4-neighbor square grids.]]
* the "4-neighbor square grid", where each vertex <math>(x, y)</math> is connected with <math>(x+1, y), (x-1, y), (x, y+1), (x, y-1)</math>.
* the "8-neighbor square grid", where each vertex <math>(x, y)</math> is connected with <math>(x', y')</math> iff <math>|x-x'| \leq 1, |y-y'| \leq 1</math>, and <math>(x, y) \neq (x', y')</math>.

Both graph structures fail to satisfy the strong Hex theorem. The 4-neighbor square grid allows a no-winner situation, and the 8-neighbor square grid allows a two-winner situation. Consequently, connectedness properties in <math>\R^2</math>, such as the Jordan curve theorem, do not generalize to <math>\Z^2</math> under either graph structure.

If the "6-neighbor square grid" structure is imposed on <math>\Z^2</math>, then it is the hexagonal grid, and thus satisfies the strong Hex theorem, allowing the Jordan curve theorem to generalize. For this reason, when computing connected components in a binary image, the 6-neighbor square grid is generally used.<ref>{{Cite web |last=Nayar |first=Shree |date=Mar 1, 2021 |title=First Principles of Computer Vision: Segmenting Binary Images {{!}} Binary Images |website=[[YouTube]] |url=https://www.youtube.com/watch?v=2ckNxEwF5YU&ab_channel=FirstPrinciplesofComputerVision}}</ref>

==== Steinhaus chessboard theorem ====
The [[Steinhaus chessboard theorem]] in some sense shows that the 4-neighbor grid and the 8-neighbor grid "together" implies the Jordan curve theorem, and the 6-neighbor grid is a precise interpolation between them.<ref>{{Cite journal |last=Šlapal |first=J |date=April 2004 |title=A digital analogue of the Jordan curve theorem |journal=Discrete Applied Mathematics |volume=139 |issue=1–3 |pages=231–251 |doi=10.1016/j.dam.2002.11.003 |issn=0166-218X|doi-access=free }}</ref><ref>{{cite journal
 | last = Surówka | first = Wojciech
 | issue = 7
 | journal = Annales Mathematicae Silesianae
 | mr = 1271184
 | pages = 57–61
 | title = A discrete form of Jordan curve theorem
 | url = https://rebus.us.edu.pl/handle/20.500.12128/14250
 | year = 1993}}</ref>

The theorem states that: suppose you put bombs on some squares on a <math>n\times n</math> chessboard, so that a king cannot move from the bottom side to the top side without stepping on a bomb, then a rook can move from the left side to the right side stepping only on bombs.

== History and further proofs ==

The statement of the Jordan curve theorem may seem obvious at first, but it is a rather difficult theorem to prove. [[Bernard Bolzano]] was the first to formulate a precise conjecture, observing that it was not a self-evident statement, but that it required a proof.<ref>{{cite journal
 | last = Johnson | first = Dale M.
 | doi = 10.1007/BF00499625
 | issue = 3
 | journal = Archive for History of Exact Sciences
 | mr = 446838
 | pages = 262–295
 | title = Prelude to dimension theory: the geometrical investigations of Bernard Bolzano
 | volume = 17
 | year = 1977}} See p. 285.</ref>
It is easy to establish this result for [[polygon]]s, but the problem came in generalizing it to all kinds of badly behaved curves, which include [[nowhere differentiable]] curves, such as the [[Koch snowflake]] and other [[fractal curve]]s, or even [[Osgood curve|a Jordan curve of positive area]] constructed by {{harvtxt|Osgood|1903}}.

The first proof of this theorem was given by [[Camille Jordan]] in his lectures on [[real analysis]], and was published in his book ''Cours d'analyse de l'École Polytechnique''.{{sfnp|Jordan|1887}} There is some controversy about whether Jordan's proof was complete: the majority of commenters on it have claimed that the first complete proof was given later by [[Oswald Veblen]], who said the following about Jordan's proof:

<blockquote>His proof, however, is unsatisfactory to many mathematicians. It assumes the theorem without proof in the important special case of a simple polygon, and of the argument from that point on, one must admit at least that all details are not given.<ref>{{harvs|txt|authorlink=Oswald Veblen|first=Oswald |last=Veblen|year=1905}}</ref></blockquote>

However, [[Thomas Callister Hales|Thomas C. Hales]] wrote:

<blockquote>Nearly every modern citation that I have found agrees that the first correct proof is due to Veblen... In view of the heavy criticism of Jordan’s proof, I was surprised when I sat down to read his proof to find nothing objectionable about it. Since then, I have contacted a number of the authors who have criticized Jordan, and each case the author has admitted to having no direct knowledge of an error in Jordan’s proof.<ref>{{harvtxt|Hales|2007b}}</ref></blockquote>

Hales also pointed out that the special case of simple polygons is not only an easy exercise, but was not really used by Jordan anyway, and quoted Michael Reeken as saying:
<blockquote>Jordan’s proof is essentially correct... Jordan’s proof does not present the details in a satisfactory way. But the idea is right, and with some polishing the proof would be impeccable.<ref>{{harvtxt|Hales|2007b}}</ref></blockquote>

Earlier, Jordan's proof and another early proof by [[Charles Jean de la Vallée Poussin]] had already been critically analyzed and completed by Schoenflies (1924).<ref>{{cite journal |author=A. Schoenflies |author-link=Arthur Moritz Schoenflies |title=Bemerkungen zu den Beweisen von C. Jordan und Ch. J. de la Vallée Poussin |journal=Jahresber. Deutsch. Math.-Verein |volume=33 |year=1924 |pages=157–160}}</ref>

Due to the importance of the Jordan curve theorem in [[low-dimensional topology]] and [[complex analysis]], it received much attention from prominent mathematicians of the first half of the 20th century. Various proofs of the theorem and its generalizations were constructed by [[James Waddell Alexander II|J. W. Alexander]], [[Louis Antoine]], [[Ludwig Bieberbach]], [[Luitzen Brouwer]], [[Arnaud Denjoy]], [[Friedrich Hartogs]], [[Béla Kerékjártó]], [[Alfred Pringsheim]], and [[Arthur Moritz Schoenflies]].

New elementary proofs of the Jordan curve theorem, as well as simplifications of the earlier proofs, continue to be carried out.

* Elementary proofs were presented by {{harvtxt|Filippov|1950}} and {{harvtxt|Tverberg|1980}}.
* A proof using [[non-standard analysis]] by {{harvtxt|Narens|1971}}.
* A proof using constructive mathematics by  {{harvs | txt|last1=Berg | first1=Gordon O. | last2=Julian | first2=W. | last3=Mines | first3=R. | last4=Richman | first4=Fred | title=The constructive Jordan curve theorem | mr=0410701 | year=1975 | journal=[[Rocky Mountain Journal of Mathematics]] | issn=0035-7596 | volume=5 | pages=225–236}}.
* A proof using the [[Brouwer fixed point theorem]] by {{harvtxt|Maehara|1984}}.
* A proof using [[planar graph|non-planarity]] of the [[complete bipartite graph]] ''K''<sub>3,3</sub> was given by {{harvtxt| Thomassen| 1992}}.

The root of the difficulty is explained in {{harvtxt|Tverberg|1980}} as follows. It is relatively simple to prove that the Jordan curve theorem holds for every Jordan polygon (Lemma 1), and every Jordan curve can be approximated arbitrarily well by a Jordan polygon (Lemma 2). A Jordan polygon is a [[polygonal chain]], the boundary of a bounded connected [[open set]], call it the open polygon, and its [[Closure (topology)|closure]], the closed polygon. Consider the diameter <math>\delta</math> of the largest disk contained in the closed polygon. Evidently, <math>\delta</math> is positive. Using a sequence of Jordan polygons (that converge to the given Jordan curve) we have a sequence <math>\delta_1, \delta_2, \dots</math> ''presumably'' converging to a positive number, the diameter <math>\delta</math> of the largest disk contained in the [[closed region]] bounded by the Jordan curve. However, we have to ''prove'' that the sequence <math>\delta_1, \delta_2, \dots</math> does not converge to zero, using only the given Jordan curve, not the region ''presumably'' bounded by the curve. This is the point of Tverberg's Lemma 3. Roughly, the closed polygons should not thin to zero everywhere. Moreover, they should not thin to zero somewhere, which is the point of Tverberg's Lemma 4.

The first [[formal proof]] of the Jordan curve theorem was created by {{harvtxt|Hales|2007a}} in the [[HOL Light]] system, in January 2005, and contained about 60,000 lines. Another rigorous 6,500-line formal proof was produced in 2005 by an international team of mathematicians using the [[Mizar system]]. Both the Mizar and the HOL Light proof rely on libraries of previously proved theorems, so these two sizes are not comparable. {{harvs|txt | last1=Sakamoto | first1=Nobuyuki | last2=Yokoyama | first2=Keita | title=The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic | doi=10.1007/s00153-007-0050-6 | mr=2321588 | year=2007 | journal=Archive for Mathematical Logic | issn=0933-5846 | volume=46 | issue=5 | pages=465–480}} showed that in [[reverse mathematics]] the Jordan curve theorem is equivalent to [[weak Kőnig's lemma]] over the system [[Reverse mathematics#The base system RCA0|<math>\mathsf{RCA}_0</math>]].

== Application ==
[[File:Jordan Curve Theorem for Polygons - Proof.svg|thumb| If the initial point ({{math|{{color|red|''p<sub>a</sub>''}}}}) of a [[ray (geometry)|ray]] (in red) lies outside  a simple polygon (region {{math|{{color|red|A}}}}), the number of intersections of the ray and the polygon is [[Even number|even]].<br /> If the initial point ({{math|{{color|green|''p<sub>b</sub>''}}}}) of a ray lies inside the polygon (region {{math|{{color|blue|B}}}}), the number of intersections is [[Odd number|odd.]]]]
{{main|Point in polygon#Ray casting algorithm}}
In [[computational geometry]], the Jordan curve theorem can be used for testing whether a point lies inside or outside a [[simple polygon]].<ref>{{harvs|txt|last=Courant|first=Richard|year=1978}}</ref><ref>{{Cite book|url=https://www.maths.ed.ac.uk/~v1ranick/jordan/cr.pdf|title=1. Jordan curve theorem|date=1978|publisher=University of Edinburgh|location=Edinburg|page=267|chapter=V. Topology}}</ref><ref>{{Cite web|title=PNPOLY - Point Inclusion in Polygon Test - WR Franklin (WRF)|url=https://wrf.ecse.rpi.edu//Research/Short_Notes/pnpoly.html|access-date=2021-07-18|website=wrf.ecse.rpi.edu}}</ref>

From a given point, trace a [[ray (geometry)|ray]] that does not pass through any vertex of the polygon (all rays but a finite number are convenient). Then, compute the number {{mvar|n}} of intersections of the ray with an edge of the polygon. Jordan curve theorem proof implies that the point is inside the polygon if and only if {{mvar|n}} is [[parity (mathematics)|odd]].

== Computational aspects ==
Adler, Daskalakis and Demaine<ref>{{Cite journal |last1=Adler |first1=Aviv |last2=Daskalakis |first2=Constantinos |last3=Demaine |first3=Erik D. |date=2016 |editor-last=Chatzigiannakis |editor-first=Ioannis |editor2-last=Mitzenmacher |editor2-first=Michael |editor3-last=Rabani |editor3-first=Yuval |editor4-last=Sangiorgi |editor4-first=Davide |title=The Complexity of Hex and the Jordan Curve Theorem |url=http://drops.dagstuhl.de/opus/volltexte/2016/6303 |journal=43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) |series=Leibniz International Proceedings in Informatics (LIPIcs) |location=Dagstuhl, Germany |publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik |volume=55 |pages=24:1–24:14 |doi=10.4230/LIPIcs.ICALP.2016.24 |doi-access=free |isbn=978-3-95977-013-2}}</ref> prove that a computational version of Jordan's theorem is [[PPAD complete|PPAD-complete]]. As a corollary, they show that Jordan's theorem implies the [[Brouwer fixed-point theorem]]. This complements the earlier result by Maehara, that Brouwer's fixed point theorem implies Jordan's theorem.{{sfnp|Maehara|1984}}

== See also ==
* [[Curve orientation]]
* [[Denjoy–Riesz theorem]], a description of certain sets of points in the plane that can be subsets of Jordan curves
* [[Lakes of Wada]]
* [[Quasi-Fuchsian group]], a mathematical group that preserves a Jordan curve

== Notes ==
<references group="note"/>
<references/>

== References ==

*{{Citation | doi=10.1216/RMJ-1975-5-2-225 | last1=Berg | first1=Gordon O. | last2=Julian | first2=W. | last3=Mines | first3=R. | last4=Richman | first4=Fred | title=The constructive Jordan curve theorem | mr=0410701 | year=1975 | journal=[[Rocky Mountain Journal of Mathematics]] | issn=0035-7596 | volume=5 | issue=2 | pages=225–236| doi-access=free }}
*{{Cite book|last=Courant|first=Richard|title=[[What Is Mathematics?|What is mathematics? : an elementary approach to ideas and methods]]|date=1978|publisher=Oxford University Press|others=Herbert Robbins|isbn=978-0-19-502517-0|edition=[4th ed.]|location=Oxford|publication-place=United Kingdom|pages=267|chapter=V. Topology|oclc=6450129}}
*{{Citation | last=Filippov | first= A. F. | author-link=Aleksei Fedorovich Filippov | year=1950 | title=An elementary proof of Jordan's theorem | url=http://www.mathnet.ru/links/9bd143c40db8f868858992d40913c648/rm8482.pdf | journal=Uspekhi Mat. Nauk | language=ru | volume=5 | number=5 | pages=173–176}}
*{{Citation | last1=Hales | first1=Thomas C. | author1-link=Thomas Callister Hales | title=The Jordan curve theorem, formally and informally | mr=2363054 | year=2007a | journal=[[American Mathematical Monthly|The American Mathematical Monthly]] | issn=0002-9890 | volume=114 | issue=10 | pages=882–894| doi=10.1080/00029890.2007.11920481 | s2cid=887392 }}
*{{Citation | last1=Hales | first1=Thomas | author1-link=Thomas Callister Hales | title=Jordan's proof of the Jordan Curve theorem | url=http://mizar.org/trybulec65/4.pdf | year=2007b | journal=Studies in Logic, Grammar and Rhetoric | volume=10 | issue=23}}
*{{Citation | last1=Jordan | first1=Camille | author1-link=Camille Jordan |title= Cours d'analyse  | url=http://www.maths.ed.ac.uk/~aar/jordan/jordan.pdf | year=1887|pages=587–594}}
*{{Citation | doi=10.2307/2323369 | last1=Maehara | first1=Ryuji | title=The Jordan Curve Theorem Via the Brouwer Fixed Point Theorem | mr=0769530 | year=1984 | journal=[[American Mathematical Monthly|The American Mathematical Monthly]] | issn=0002-9890 | volume=91 | issue=10 | pages=641–643 | jstor=2323369}}
*{{Citation | last1=Narens | first1=Louis | title=A nonstandard proof of the Jordan curve theorem | url=http://projecteuclid.org/euclid.pjm/1102971282 | mr=0276940 | year=1971 | journal=[[Pacific Journal of Mathematics]] | issn=0030-8730 | volume=36 | pages=219–229 | doi=10.2140/pjm.1971.36.219| doi-access=free }}
*{{Citation | last1=Osgood | first1=William F. | title=A Jordan Curve of Positive Area | jstor=1986455 | jfm=34.0533.02 | year=1903 | journal=[[Transactions of the American Mathematical Society]] | issn=0002-9947 | volume=4 | issue=1 | pages=107–112 | doi=10.2307/1986455| doi-access=free }}
*{{Citation | last1=Ross | first1=Fiona | last2=Ross | first2=William T. | year=2011 | title=The Jordan curve theorem is non-trivial | journal=[[Journal of Mathematics and the Arts]] | volume=5 | issue=4 | pages=213–219 | doi=10.1080/17513472.2011.634320| s2cid=3257011 }}. [https://facultystaff.richmond.edu/~wross/PDF/Jordan-revised.pdf author's site]
*{{Citation | last1=Sakamoto | first1=Nobuyuki | last2=Yokoyama | first2=Keita | title=The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic | doi=10.1007/s00153-007-0050-6 | mr=2321588 | year=2007 | journal=Archive for Mathematical Logic | issn=0933-5846 | volume=46 | issue=5 | pages=465–480| s2cid=33627222 }}
*{{Citation | doi=10.2307/2324180 | last=Thomassen | first=Carsten | author-link=Carsten Thomassen (mathematician) | title=The Jordan–Schönflies theorem and the classification of surfaces |year=1992 | journal=American Mathematical Monthly | volume=99 | issue=2 | pages=116–130 | jstor=2324180}}
*{{Citation | last= Tverberg |first= Helge |author-link= Helge Tverberg |year= 1980 |title= A proof of the Jordan curve theorem |url= http://www.maths.ed.ac.uk/~aar/jordan/tverberg.pdf |journal= [[Bulletin of the London Mathematical Society]] |volume= 12 |number= 1 |pages= 34–38 |doi= 10.1112/blms/12.1.34 |citeseerx= 10.1.1.374.2903 }}
* {{Citation | last1=Veblen | first1=Oswald | author1-link=Oswald Veblen | title=Theory on Plane Curves in Non-Metrical Analysis Situs | jstor=1986378 | year=1905 | journal=[[Transactions of the American Mathematical Society]] | volume=6 | issue=1 | pages=83–98 | mr=1500697 | doi=10.2307/1986378| doi-access=free }}

== External links ==
* {{eom|id=Jordan_theorem|author=M.I. Voitsekhovskii|title=Jordan theorem}}
* [http://mizar.uwb.edu.pl/version/7.11.07_4.156.1112/html/jordan.html The full 6,500 line formal proof of Jordan's curve theorem] in [[Mizar system|Mizar]].
* [http://www.maths.ed.ac.uk/~aar/jordan Collection of proofs of the Jordan curve theorem] at Andrew Ranicki's homepage
* [http://www.math.auckland.ac.nz/class750/section5.pdf A simple proof of Jordan curve theorem] (PDF) by David B. Gauld
* {{cite arXiv |eprint=1404.0556 |last1=Brown |first1=R. |last2=Antolino-Camarena |first2=O. |title=Corrigendum to "Groupoids, the Phragmen-Brouwer Property, and the Jordan Curve Theorem", J. Homotopy and Related Structures 1 (2006) 175-183 |year=2014|class=math.AT }}

[[Category:Theorems in topology]]
[[Category:Theorems about curves]]