Knowledge

Jordan curve theorem

Source đź“ť

1851: 882: 1454:
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
507: 702:
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
1344:, 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. 65:
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."
1441:
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
713:
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.
1591:
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
1253:
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
1771:
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.
381: 1352:
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.
1187: 1030: 1765: 1688: 1382:
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.
1247: 84:(1838–1922), who published its first claimed proof in 1887. For decades, mathematicians generally thought that this proof was flawed and that the first rigorous proof was carried out by 20: 3082:
Brown, R.; Antolino-Camarena, O. (2014). "Corrigendum to "Groupoids, the Phragmen-Brouwer Property, and the Jordan Curve Theorem", J. Homotopy and Related Structures 1 (2006) 175-183".
1463:
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.
1791:. Both the Mizar and the HOL Light proof rely on libraries of previously proved theorems, so these two sizes are not comparable. Nobuyuki Sakamoto and Keita Yokoyama ( 1839: 1107: 1342: 1310: 1281: 876: 840: 811: 782: 753: 1787:
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
1459:
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:
1482:, 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 1394:
was the first to formulate a precise conjecture, observing that it was not a self-evident statement, but that it required a proof. It is easy to establish this result for
1380: 1711: 1642: 1622: 1433:. 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 1065: 920: 23:
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).
699:
has at least one winner", from which we obtain a logical implication: Hex theorem implies Brouwer fixed point theorem, which implies Jordan curve theorem.
2464:
Adler, Aviv; Daskalakis, Constantinos; Demaine, Erik D. (2016). Chatzigiannakis, Ioannis; Mitzenmacher, Michael; Rabani, Yuval; Sangiorgi, Davide (eds.).
2997: 2795: 339:
consists of exactly two connected components. One of these components is bounded (the interior) and the other is unbounded (the exterior). The set
619:, completely lying in the interior region. An alternative and equivalent formulation of the Jordan–Schönflies theorem asserts that any Jordan curve 1930:
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
2962: 502:{\displaystyle {\tilde {H}}_{q}(Y)={\begin{cases}\mathbb {Z} ,&q=n-k{\text{ or }}q=n,\\\{0\},&{\text{otherwise}}.\end{cases}}} 2875:
Sakamoto, Nobuyuki; Yokoyama, Keita (2007), "The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic",
1521:
New elementary proofs of the Jordan curve theorem, as well as simplifications of the earlier proofs, continue to be carried out.
2573: 2524: 2491: 2223: 2163: 1926:
that does not pass through any vertex of the polygon (all rays but a finite number are convenient). Then, compute the number
1468: 1455:
have criticized Jordan, and each case the author has admitted to having no direct knowledge of an error in Jordan’s proof.
2843: 710:
The Brouwer fixed point theorem, by being sandwiched between the two equivalent theorems, is also equivalent to both.
2919: 925: 1724: 1647: 1547:
A proof using constructive mathematics by Gordon O. Berg, W. Julian, and R. Mines et al. (
1390:
The statement of the Jordan curve theorem may seem obvious at first, but it is a rather difficult theorem to prove.
146:
in the plane is the image of an injective continuous map of a closed and bounded interval into the plane. It is a
584: 651:
of the plane. Unlike Lebesgue's and Brouwer's generalization of the Jordan curve theorem, this statement becomes
3111: 2755: 1954:. This complements the earlier result by Maehara, that Brouwer's fixed point theorem implies Jordan's theorem. 1112: 223: 1804: 1644:
is positive. Using a sequence of Jordan polygons (that converge to the given Jordan curve) we have a sequence
3106: 3053: 2705: 2619: 843: 2595: 2311:
Johnson, Dale M. (1977). "Prelude to dimension theory: the geometrical investigations of Bernard Bolzano".
3048: 2591: 1951: 1906: 1807: 1555: 692: 517: 2136:
Nguyen, Phuong; Cook, Stephen A. (2007). "The Complexity of Proving the Discrete Jordan Curve Theorem".
61:
connecting a point of one region to a point of the other intersects with the curve somewhere. While the
2522:
Berg, Gordon O.; Julian, W.; Mines, R.; Richman, Fred (1975), "The constructive Jordan curve theorem",
1483: 1192: 545: 3059: 1318: 1286: 1257: 852: 816: 787: 758: 729: 2385: 1515: 1507: 3043: 2976: 421: 1963: 1570: 1475: 723: 2869: 1800: 695:(in 2 dimensions), and the Brouwer fixed point theorem can be proved from the Hex theorem: "every 668: 587:, which states that the interior and the exterior planar regions determined by a Jordan curve in 211: 2971: 2663: 2614: 2052: 1912: 1447: 1399: 1359: 89: 1398:, but the problem came in generalizing it to all kinds of badly behaved curves, which include 726:, a binary picture is a discrete square grid of 0 and 1, or equivalently, a compact subset of 2564: 2440: 1696: 1627: 1607: 1537: 1070: 1915:, the Jordan curve theorem can be used for testing whether a point lies inside or outside a 1850: 3028: 2904: 2786: 2742: 2648: 2555: 2332: 2297: 2038: 1974: 1966:, a description of certain sets of points in the plane that can be subsets of Jordan curves 1935: 1038: 893: 704: 2826: 8: 2056: 1796: 664: 243: 113: 54: 50: 46: 3075: 1946:
Adler, Daskalakis and Demaine prove that a computational version of Jordan's theorem is
3083: 3016: 2939: 2908: 2860: 2830: 2730: 2703:
Maehara, Ryuji (1984), "The Jordan Curve Theorem Via the Brouwer Fixed Point Theorem",
2652: 2204: 2179:
Hales, Thomas C. (December 2007). "The Jordan Curve Theorem, Formally and Informally".
2141: 2118: 2026: 1601: 294: 71: 683:
is not simply connected, and hence not homeomorphic to the exterior of the unit ball.
2954: 2892: 2814: 2774: 2722: 2636: 2579: 2569: 2568:. Herbert Robbins ( ed.). United Kingdom: Oxford University Press. p. 267. 2543: 2487: 2421: 2388:(1924). "Bemerkungen zu den Beweisen von C. Jordan und Ch. J. de la VallĂ©e Poussin". 2266: 2196: 2159: 2110: 1511: 1503: 1491: 549: 2912: 2465: 2285: 2093:
Gale, David (December 1979). "The Game of Hex and the Brouwer Fixed-Point Theorem".
3006: 2981: 2931: 2884: 2864: 2852: 2822: 2804: 2764: 2714: 2690: 2632: 2628: 2533: 2477: 2476:. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 24:1–24:14. 2320: 2256: 2192: 2188: 2151: 2102: 2018: 1479: 696: 660: 360: 267: 2656: 2470:
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
2208: 3024: 2900: 2856: 2841:
Ross, Fiona; Ross, William T. (2011), "The Jordan curve theorem is non-trivial",
2782: 2750: 2738: 2644: 2551: 2482: 2328: 2293: 2034: 1593: 1495: 1391: 348: 303: 155: 58: 151: 70:, Introduction)). More transparent proofs rely on the mathematical machinery of 2950: 2686: 2224:"First Principles of Computer Vision: Segmenting Binary Images | Binary Images" 1923: 1916: 1866: 1422: 1403: 537: 262:
The Jordan curve theorem was independently generalized to higher dimensions by
123: 81: 36: 2888: 2261: 2244: 3100: 2992: 2896: 2818: 2778: 2726: 2640: 2547: 2538: 2346: 2270: 2200: 2114: 1969: 1947: 1767:
does not converge to zero, using only the given Jordan curve, not the region
1714: 1499: 1487: 1434: 1426: 1407: 553: 85: 78: 2922:(1992), "The Jordan–Schönflies theorem and the classification of surfaces", 2769: 679:, but so twisted in space that the unbounded component of its complement in 3063: 2985: 2583: 1788: 1776: 1566: 1411: 592: 192:
With these definitions, the Jordan curve theorem can be stated as follows:
41: 1471:
had already been critically analyzed and completed by Schoenflies (1924).
57:" region containing all of the nearby and far away exterior points. Every 2155: 1876: 636: 540:), and with a bit of extra work, one shows that their common boundary is 263: 227: 147: 3069: 3020: 2943: 2834: 2734: 2565:
What is mathematics? : an elementary approach to ideas and methods
2324: 2122: 2030: 1899: 19: 95: 1784: 596: 120: 3011: 2935: 2809: 2718: 2667: 2106: 2062:. From Insight to Proof: Festschrift in Honour of Andrzej Trybulec. 2022: 1356:
The theorem states that: suppose you put bombs on some squares on a
2138:
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
1597: 314: 28: 3088: 2146: 784:, such as number of components, might fail to be well-defined for 313:> 0), i.e. the image of an injective continuous mapping of the 74:, and these lead to generalizations to higher-dimensional spaces. 2995:(1905), "Theory on Plane Curves in Non-Metrical Analysis Situs", 2228: 1395: 881: 583:
There is a strengthening of the Jordan curve theorem, called the
185:
is a continuous loop, whereas the last condition stipulates that
62: 1624:
of the largest disk contained in the closed polygon. Evidently,
676: 580:) without boundary, its complement has 2 connected components. 161:
Alternatively, a Jordan curve is the image of a continuous map
127: 2793:
Osgood, William F. (1903), "A Jordan Curve of Positive Area",
2617:(2007a), "The Jordan curve theorem, formally and informally", 2441:"PNPOLY - Point Inclusion in Polygon Test - WR Franklin (WRF)" 1950:. As a corollary, they show that Jordan's theorem implies the 2472:. Leibniz International Proceedings in Informatics (LIPIcs). 1875:), the number of intersections of the ray and the polygon is 655:
in higher dimensions: while the exterior of the unit ball in
2562:
Courant, Richard (1978). "V. Topology". Written at Oxford.
495: 3060:
The full 6,500 line formal proof of Jordan's curve theorem
2009:
Kline, J. R. (1942). "What is the Jordan curve theorem?".
607:
on the Jordan curve, there exists a Jordan arc connecting
1283:, such as the Jordan curve theorem, do not generalize to 181:
to [0,1) is injective. The first two conditions say that
45:(a plane simple closed curve) divides the plane into an " 1315:
If the "6-neighbor square grid" structure is imposed on
2429:. Edinburg: University of Edinburgh. 1978. p. 267. 3081: 2521: 2463: 1548: 2074: 1810: 1727: 1699: 1650: 1630: 1610: 1474:
Due to the importance of the Jordan curve theorem in
1362: 1321: 1289: 1260: 1195: 1115: 1073: 1041: 928: 896: 855: 819: 790: 761: 732: 384: 2466:"The Complexity of Hex and the Jordan Curve Theorem" 1992: 1990: 1977:, a mathematical group that preserves a Jordan curve 3041: 2500: 1467:Earlier, Jordan's proof and another early proof by 351:. It is first established that, more generally, if 96:
Definitions and the statement of the Jordan theorem
1833: 1759: 1705: 1682: 1636: 1616: 1374: 1336: 1304: 1275: 1241: 1181: 1101: 1059: 1024: 914: 870: 834: 805: 776: 747: 717: 501: 2998:Transactions of the American Mathematical Society 2796:Transactions of the American Mathematical Society 2751:"A nonstandard proof of the Jordan curve theorem" 1987: 1717:bounded by the Jordan curve. However, we have to 639:in the plane, can be extended to a homeomorphism 564:and the reduced cohomology of its complement. If 536:has 2 connected components (which are, moreover, 16:A closed curve divides the plane into two regions 3098: 3070:Collection of proofs of the Jordan curve theorem 2874: 2245:"A digital analogue of the Jordan curve theorem" 1869:(in red) lies outside a simple polygon (region 1792: 1035:the "8-neighbor square grid", where each vertex 890:the "4-neighbor square grid", where each vertex 691:The Jordan curve theorem can be proved from the 1437:, who said the following about Jordan's proof: 1347: 1025:{\displaystyle (x+1,y),(x-1,y),(x,y+1),(x,y-1)} 2384: 1760:{\displaystyle \delta _{1},\delta _{2},\dots } 1693:converging to a positive number, the diameter 1683:{\displaystyle \delta _{1},\delta _{2},\dots } 572:-dimensional compact connected submanifold of 88:. However, this notion has been overturned by 1907:Point in polygon § Ray casting algorithm 1421:The first proof of this theorem was given by 1385: 2668:"Jordan's proof of the Jordan Curve theorem" 2057:"Jordan's proof of the Jordan curve theorem" 1604:, the closed polygon. Consider the diameter 476: 470: 257: 77:The Jordan curve theorem is named after the 2963:Bulletin of the London Mathematical Society 1892:) of a ray lies inside the polygon (region 1779:of the Jordan curve theorem was created by 1587:The root of the difficulty is explained in 2135: 1799:the Jordan curve theorem is equivalent to 849:There are two obvious graph structures on 3087: 3010: 2975: 2918: 2808: 2768: 2596:"An elementary proof of Jordan's theorem" 2537: 2481: 2286:"A discrete form of Jordan curve theorem" 2260: 2145: 1580: 1324: 1292: 1263: 1182:{\displaystyle |x-x'|\leq 1,|y-y'|\leq 1} 858: 822: 793: 764: 735: 425: 2949: 2840: 2590: 1941: 1849: 1588: 1530: 1526: 1431:Cours d'analyse de l'École Polytechnique 880: 615:and, with the exception of the endpoint 544:. A further generalization was found by 250:In contrast, the complement of a Jordan 67: 18: 2702: 2561: 2506: 2407: 2310: 2283: 2080: 1559: 885:8-neighbor and 4-neighbor square grids. 842:does not have an appropriately defined 3099: 3076:A simple proof of Jordan curve theorem 2991: 2792: 2748: 2685: 2675:Studies in Logic, Grammar and Rhetoric 2662: 2613: 2373: 2362: 2350: 2242: 2064:Studies in Logic, Grammar and Rhetoric 1996: 1820: 1817: 1814: 1780: 1596:, the boundary of a bounded connected 1541: 1415: 2955:"A proof of the Jordan curve theorem" 2525:Rocky Mountain Journal of Mathematics 2313:Archive for History of Exact Sciences 2221: 2178: 2051: 2008: 1713:of the largest disk contained in the 2092: 1600:, call it the open polygon, and its 1525:Elementary proofs were presented by 595:to the interior and exterior of the 2844:Journal of Mathematics and the Arts 1834:{\displaystyle {\mathsf {RCA}}_{0}} 686: 603:in the interior region and a point 13: 1898:), the number of intersections is 552:between the reduced homology of a 234:) and the other is unbounded (the 14: 3123: 3035: 2706:The American Mathematical Monthly 2620:The American Mathematical Monthly 2181:The American Mathematical Monthly 2095:The American Mathematical Monthly 1469:Charles Jean de la VallĂ©e Poussin 1242:{\displaystyle (x,y)\neq (x',y')} 528:, the zeroth reduced homology of 272:Jordan–Brouwer separation theorem 189:has no self-intersection points. 2390:Jahresber. Deutsch. Math.-Verein 1429:, and was published in his book 1337:{\displaystyle \mathbb {Z} ^{2}} 1305:{\displaystyle \mathbb {Z} ^{2}} 1276:{\displaystyle \mathbb {R} ^{2}} 871:{\displaystyle \mathbb {Z} ^{2}} 835:{\displaystyle \mathbb {Z} ^{2}} 806:{\displaystyle \mathbb {Z} ^{2}} 777:{\displaystyle \mathbb {R} ^{2}} 748:{\displaystyle \mathbb {Z} ^{2}} 2457: 2433: 2413: 2400: 2378: 2367: 2356: 2340: 2304: 2290:Annales Mathematicae Silesianae 2277: 1412:a Jordan curve of positive area 718:Application to image processing 599:. In particular, for any point 512:This is proved by induction in 206:be a Jordan curve in the plane 2877:Archive for Mathematical Logic 2756:Pacific Journal of Mathematics 2633:10.1080/00029890.2007.11920481 2236: 2215: 2193:10.1080/00029890.2007.11920481 2172: 2129: 2086: 2070:(23). University of BiaĹ‚ystok. 2045: 2002: 1845: 1312:under either graph structure. 1236: 1214: 1208: 1196: 1169: 1150: 1136: 1117: 1096: 1074: 1054: 1042: 1019: 1001: 995: 977: 971: 953: 947: 929: 909: 897: 410: 404: 392: 1: 3042:M.I. Voitsekhovskii (2001) , 2924:American Mathematical Monthly 2515: 2011:American Mathematical Monthly 532:has rank 1, which means that 226:. One of these components is 3072:at Andrew Ranicki's homepage 2857:10.1080/17513472.2011.634320 2483:10.4230/LIPIcs.ICALP.2016.24 2249:Discrete Applied Mathematics 2222:Nayar, Shree (Mar 1, 2021). 1922:From a given point, trace a 1348:Steinhaus chessboard theorem 755:. Topological invariants on 39:in 1887, asserts that every 7: 3049:Encyclopedia of Mathematics 1957: 1952:Brouwer fixed-point theorem 1556:Brouwer fixed point theorem 693:Brouwer fixed point theorem 254:in the plane is connected. 177:(1) and the restriction of 10: 3128: 2406:Richard Courant ( 2284:SurĂłwka, Wojciech (1993). 2140:. IEEE. pp. 245–256. 1904: 1386:History and further proofs 667:onto the unit sphere, the 343:is their common boundary. 270:in 1911, resulting in the 268:L. E. J. Brouwer 222:, consists of exactly two 2889:10.1007/s00153-007-0050-6 2262:10.1016/j.dam.2002.11.003 1516:Arthur Moritz Schoenflies 1375:{\displaystyle n\times n} 585:Jordan–Schönflies theorem 361:reduced integral homology 258:Proof and generalizations 2539:10.1216/RMJ-1975-5-2-225 2243:Ĺ lapal, J (April 2004). 1981: 1571:complete bipartite graph 1476:low-dimensional topology 150:that is not necessarily 3078:(PDF) by David B. Gauld 2770:10.2140/pjm.1971.36.219 2423:1. Jordan curve theorem 1706:{\displaystyle \delta } 1637:{\displaystyle \delta } 1617:{\displaystyle \delta } 1102:{\displaystyle (x',y')} 669:Alexander horned sphere 518:Mayer–Vietoris sequence 355:is homeomorphic to the 327:. Then the complement 2749:Narens, Louis (1971), 1913:computational geometry 1902: 1881:If the initial point ( 1854:If the initial point ( 1835: 1761: 1707: 1684: 1638: 1618: 1465: 1457: 1444: 1400:nowhere differentiable 1376: 1338: 1306: 1277: 1243: 1183: 1103: 1061: 1026: 916: 886: 872: 836: 807: 778: 749: 548:, who established the 503: 24: 3112:Theorems about curves 1942:Computational aspects 1853: 1836: 1762: 1708: 1685: 1639: 1619: 1538:non-standard analysis 1461: 1452: 1439: 1377: 1339: 1307: 1278: 1244: 1184: 1104: 1062: 1060:{\displaystyle (x,y)} 1027: 917: 915:{\displaystyle (x,y)} 884: 873: 837: 808: 779: 750: 504: 53:by the curve and an " 22: 3107:Theorems in topology 2986:10.1112/blms/12.1.34 2156:10.1109/lics.2007.48 1975:Quasi-Fuchsian group 1964:Denjoy–Riesz theorem 1808: 1725: 1697: 1648: 1628: 1608: 1402:curves, such as the 1360: 1319: 1287: 1258: 1193: 1113: 1071: 1039: 926: 894: 853: 817: 788: 759: 730: 382: 224:connected components 33:Jordan curve theorem 1797:reverse mathematics 1425:in his lectures on 282: —  246:of each component. 200: —  106:simple closed curve 2920:Thomassen, Carsten 2698:, pp. 587–594 2325:10.1007/BF00499625 1903: 1831: 1801:weak KĹ‘nig's lemma 1757: 1721:that the sequence 1703: 1680: 1634: 1614: 1554:A proof using the 1372: 1334: 1302: 1273: 1239: 1179: 1099: 1067:is connected with 1057: 1022: 922:is connected with 912: 887: 868: 832: 803: 774: 745: 675:homeomorphic to a 499: 494: 359:-sphere, then the 295:topological sphere 280: 198: 72:algebraic topology 25: 2603:Uspekhi Mat. Nauk 2575:978-0-19-502517-0 2493:978-3-95977-013-2 2347:Oswald Veblen 2165:978-0-7695-2908-0 1795:) showed that in 1512:Alfred Pringsheim 1504:Friedrich Hartogs 1492:Ludwig Bieberbach 635:is viewed as the 550:Alexander duality 487: 452: 395: 278: 238:), and the curve 196: 3119: 3093: 3091: 3056: 3044:"Jordan theorem" 3031: 3014: 2988: 2979: 2959: 2946: 2915: 2867: 2837: 2812: 2789: 2772: 2745: 2699: 2697: 2682: 2672: 2659: 2615:Hales, Thomas C. 2610: 2600: 2587: 2558: 2541: 2510: 2504: 2498: 2497: 2485: 2461: 2455: 2454: 2452: 2451: 2445:wrf.ecse.rpi.edu 2437: 2431: 2430: 2428: 2417: 2411: 2404: 2398: 2397: 2382: 2376: 2371: 2365: 2360: 2354: 2344: 2338: 2336: 2308: 2302: 2301: 2281: 2275: 2274: 2264: 2255:(1–3): 231–251. 2240: 2234: 2233: 2219: 2213: 2212: 2176: 2170: 2169: 2149: 2133: 2127: 2126: 2090: 2084: 2078: 2072: 2071: 2061: 2053:Hales, Thomas C. 2049: 2043: 2042: 2006: 2000: 1994: 1933: 1929: 1897: 1896: 1891: 1890: 1874: 1873: 1864: 1863: 1840: 1838: 1837: 1832: 1830: 1829: 1824: 1823: 1803:over the system 1766: 1764: 1763: 1758: 1750: 1749: 1737: 1736: 1712: 1710: 1709: 1704: 1689: 1687: 1686: 1681: 1673: 1672: 1660: 1659: 1643: 1641: 1640: 1635: 1623: 1621: 1620: 1615: 1581:Thomassen (1992) 1480:complex analysis 1381: 1379: 1378: 1373: 1343: 1341: 1340: 1335: 1333: 1332: 1327: 1311: 1309: 1308: 1303: 1301: 1300: 1295: 1282: 1280: 1279: 1274: 1272: 1271: 1266: 1248: 1246: 1245: 1240: 1235: 1224: 1188: 1186: 1185: 1180: 1172: 1167: 1153: 1139: 1134: 1120: 1108: 1106: 1105: 1100: 1095: 1084: 1066: 1064: 1063: 1058: 1031: 1029: 1028: 1023: 921: 919: 918: 913: 877: 875: 874: 869: 867: 866: 861: 841: 839: 838: 833: 831: 830: 825: 812: 810: 809: 804: 802: 801: 796: 783: 781: 780: 775: 773: 772: 767: 754: 752: 751: 746: 744: 743: 738: 724:image processing 687:Discrete version 661:simply connected 508: 506: 505: 500: 498: 497: 488: 485: 453: 450: 428: 403: 402: 397: 396: 388: 375:are as follows: 302:+1)-dimensional 283: 201: 130:into the plane, 35:, formulated by 3127: 3126: 3122: 3121: 3120: 3118: 3117: 3116: 3097: 3096: 3038: 3012:10.2307/1986378 2977:10.1.1.374.2903 2957: 2951:Tverberg, Helge 2936:10.2307/2324180 2810:10.2307/1986455 2719:10.2307/2323369 2713:(10): 641–643, 2695: 2692:Cours d'analyse 2687:Jordan, Camille 2670: 2627:(10): 882–894, 2598: 2592:Filippov, A. F. 2576: 2518: 2513: 2505: 2501: 2494: 2462: 2458: 2449: 2447: 2439: 2438: 2434: 2426: 2420:"V. Topology". 2419: 2418: 2414: 2405: 2401: 2383: 2379: 2372: 2368: 2361: 2357: 2345: 2341: 2309: 2305: 2282: 2278: 2241: 2237: 2220: 2216: 2187:(10): 882–894. 2177: 2173: 2166: 2134: 2130: 2107:10.2307/2320146 2101:(10): 818–827. 2091: 2087: 2079: 2075: 2059: 2050: 2046: 2023:10.2307/2303093 2007: 2003: 1995: 1988: 1984: 1960: 1944: 1931: 1927: 1909: 1894: 1893: 1888: 1883: 1882: 1880: 1871: 1870: 1861: 1856: 1855: 1848: 1825: 1813: 1812: 1811: 1809: 1806: 1805: 1745: 1741: 1732: 1728: 1726: 1723: 1722: 1698: 1695: 1694: 1668: 1664: 1655: 1651: 1649: 1646: 1645: 1629: 1626: 1625: 1609: 1606: 1605: 1594:polygonal chain 1589:Tverberg (1980) 1578: 1531:Tverberg (1980) 1527:Filippov (1950) 1508:BĂ©la KerĂ©kjártĂł 1496:Luitzen Brouwer 1484:J. W. Alexander 1448:Thomas C. Hales 1414:constructed by 1392:Bernard Bolzano 1388: 1361: 1358: 1357: 1350: 1328: 1323: 1322: 1320: 1317: 1316: 1296: 1291: 1290: 1288: 1285: 1284: 1267: 1262: 1261: 1259: 1256: 1255: 1228: 1217: 1194: 1191: 1190: 1168: 1160: 1149: 1135: 1127: 1116: 1114: 1111: 1110: 1088: 1077: 1072: 1069: 1068: 1040: 1037: 1036: 927: 924: 923: 895: 892: 891: 862: 857: 856: 854: 851: 850: 844:graph structure 826: 821: 820: 818: 815: 814: 797: 792: 791: 789: 786: 785: 768: 763: 762: 760: 757: 756: 739: 734: 733: 731: 728: 727: 720: 689: 671:is a subset of 546:J. W. Alexander 493: 492: 484: 482: 467: 466: 449: 432: 424: 417: 416: 398: 387: 386: 385: 383: 380: 379: 349:homology theory 347:The proof uses 345: 304:Euclidean space 281: 260: 248: 199: 98: 90:Thomas C. Hales 59:continuous path 17: 12: 11: 5: 3125: 3115: 3114: 3109: 3095: 3094: 3079: 3073: 3067: 3057: 3037: 3036:External links 3034: 3033: 3032: 2993:Veblen, Oswald 2989: 2947: 2930:(2): 116–130, 2916: 2883:(5): 465–480, 2872: 2851:(4): 213–219, 2838: 2803:(1): 107–112, 2790: 2746: 2700: 2683: 2660: 2611: 2605:(in Russian), 2588: 2574: 2559: 2532:(2): 225–236, 2517: 2514: 2512: 2511: 2507:Maehara (1984) 2499: 2492: 2456: 2432: 2412: 2399: 2386:A. Schoenflies 2377: 2366: 2355: 2339: 2319:(3): 262–295. 2303: 2276: 2235: 2214: 2171: 2164: 2128: 2085: 2083:, p. 641. 2081:Maehara (1984) 2073: 2044: 2017:(5): 281–286. 2001: 1985: 1983: 1980: 1979: 1978: 1972: 1967: 1959: 1956: 1943: 1940: 1917:simple polygon 1905:Main article: 1886: 1859: 1847: 1844: 1828: 1822: 1819: 1816: 1756: 1753: 1748: 1744: 1740: 1735: 1731: 1702: 1679: 1676: 1671: 1667: 1663: 1658: 1654: 1633: 1613: 1585: 1584: 1576: 1565:A proof using 1563: 1560:Maehara (1984) 1552: 1545: 1536:A proof using 1534: 1423:Camille Jordan 1408:fractal curves 1404:Koch snowflake 1387: 1384: 1371: 1368: 1365: 1349: 1346: 1331: 1326: 1299: 1294: 1270: 1265: 1251: 1250: 1238: 1234: 1231: 1227: 1223: 1220: 1216: 1213: 1210: 1207: 1204: 1201: 1198: 1178: 1175: 1171: 1166: 1163: 1159: 1156: 1152: 1148: 1145: 1142: 1138: 1133: 1130: 1126: 1123: 1119: 1098: 1094: 1091: 1087: 1083: 1080: 1076: 1056: 1053: 1050: 1047: 1044: 1033: 1021: 1018: 1015: 1012: 1009: 1006: 1003: 1000: 997: 994: 991: 988: 985: 982: 979: 976: 973: 970: 967: 964: 961: 958: 955: 952: 949: 946: 943: 940: 937: 934: 931: 911: 908: 905: 902: 899: 865: 860: 829: 824: 800: 795: 771: 766: 742: 737: 719: 716: 688: 685: 538:path connected 510: 509: 496: 491: 483: 481: 478: 475: 472: 469: 468: 465: 462: 459: 456: 451: or  448: 445: 442: 439: 436: 433: 431: 427: 423: 422: 420: 415: 412: 409: 406: 401: 394: 391: 276: 259: 256: 194: 124:continuous map 97: 94: 82:Camille Jordan 68:Tverberg (1980 37:Camille Jordan 15: 9: 6: 4: 3: 2: 3124: 3113: 3110: 3108: 3105: 3104: 3102: 3090: 3085: 3080: 3077: 3074: 3071: 3068: 3065: 3061: 3058: 3055: 3051: 3050: 3045: 3040: 3039: 3030: 3026: 3022: 3018: 3013: 3008: 3004: 3000: 2999: 2994: 2990: 2987: 2983: 2978: 2973: 2969: 2965: 2964: 2956: 2952: 2948: 2945: 2941: 2937: 2933: 2929: 2925: 2921: 2917: 2914: 2910: 2906: 2902: 2898: 2894: 2890: 2886: 2882: 2878: 2873: 2871: 2870:author's site 2866: 2862: 2858: 2854: 2850: 2846: 2845: 2839: 2836: 2832: 2828: 2824: 2820: 2816: 2811: 2806: 2802: 2798: 2797: 2791: 2788: 2784: 2780: 2776: 2771: 2766: 2762: 2758: 2757: 2752: 2747: 2744: 2740: 2736: 2732: 2728: 2724: 2720: 2716: 2712: 2708: 2707: 2701: 2694: 2693: 2688: 2684: 2680: 2676: 2669: 2665: 2664:Hales, Thomas 2661: 2658: 2654: 2650: 2646: 2642: 2638: 2634: 2630: 2626: 2622: 2621: 2616: 2612: 2608: 2604: 2597: 2593: 2589: 2585: 2581: 2577: 2571: 2567: 2566: 2560: 2557: 2553: 2549: 2545: 2540: 2535: 2531: 2527: 2526: 2520: 2519: 2508: 2503: 2495: 2489: 2484: 2479: 2475: 2471: 2467: 2460: 2446: 2442: 2436: 2425: 2424: 2416: 2409: 2403: 2395: 2391: 2387: 2381: 2375: 2374:Hales (2007b) 2370: 2364: 2363:Hales (2007b) 2359: 2352: 2348: 2343: 2334: 2330: 2326: 2322: 2318: 2314: 2307: 2299: 2295: 2291: 2287: 2280: 2272: 2268: 2263: 2258: 2254: 2250: 2246: 2239: 2231: 2230: 2225: 2218: 2210: 2206: 2202: 2198: 2194: 2190: 2186: 2182: 2175: 2167: 2161: 2157: 2153: 2148: 2143: 2139: 2132: 2124: 2120: 2116: 2112: 2108: 2104: 2100: 2096: 2089: 2082: 2077: 2069: 2065: 2058: 2054: 2048: 2040: 2036: 2032: 2028: 2024: 2020: 2016: 2012: 2005: 1998: 1997:Jordan (1887) 1993: 1991: 1986: 1976: 1973: 1971: 1970:Lakes of Wada 1968: 1965: 1962: 1961: 1955: 1953: 1949: 1948:PPAD-complete 1939: 1937: 1925: 1920: 1918: 1914: 1908: 1901: 1889: 1878: 1868: 1862: 1852: 1843: 1841: 1826: 1802: 1798: 1794: 1790: 1786: 1782: 1781:Hales (2007a) 1778: 1773: 1770: 1754: 1751: 1746: 1742: 1738: 1733: 1729: 1720: 1716: 1715:closed region 1700: 1692: 1677: 1674: 1669: 1665: 1661: 1656: 1652: 1631: 1611: 1603: 1599: 1595: 1590: 1582: 1579:was given by 1575: 1572: 1568: 1567:non-planarity 1564: 1561: 1557: 1553: 1550: 1546: 1543: 1542:Narens (1971) 1539: 1535: 1532: 1528: 1524: 1523: 1522: 1519: 1517: 1513: 1509: 1505: 1501: 1500:Arnaud Denjoy 1497: 1493: 1489: 1488:Louis Antoine 1485: 1481: 1477: 1472: 1470: 1464: 1460: 1456: 1451: 1449: 1443: 1438: 1436: 1435:Oswald Veblen 1432: 1428: 1427:real analysis 1424: 1419: 1417: 1416:Osgood (1903) 1413: 1409: 1405: 1401: 1397: 1393: 1383: 1369: 1366: 1363: 1354: 1345: 1329: 1313: 1297: 1268: 1232: 1229: 1225: 1221: 1218: 1211: 1205: 1202: 1199: 1176: 1173: 1164: 1161: 1157: 1154: 1146: 1143: 1140: 1131: 1128: 1124: 1121: 1092: 1089: 1085: 1081: 1078: 1051: 1048: 1045: 1034: 1016: 1013: 1010: 1007: 1004: 998: 992: 989: 986: 983: 980: 974: 968: 965: 962: 959: 956: 950: 944: 941: 938: 935: 932: 906: 903: 900: 889: 888: 883: 879: 863: 847: 845: 827: 798: 769: 740: 725: 715: 711: 708: 706: 700: 698: 694: 684: 682: 678: 674: 670: 666: 663:, because it 662: 658: 654: 650: 646: 642: 638: 634: 630: 626: 622: 618: 614: 610: 606: 602: 598: 594: 590: 586: 581: 579: 575: 571: 567: 563: 559: 555: 551: 547: 543: 539: 535: 531: 527: 523: 519: 515: 489: 479: 473: 463: 460: 457: 454: 446: 443: 440: 437: 434: 429: 418: 413: 407: 399: 389: 378: 377: 376: 374: 370: 366: 362: 358: 354: 350: 344: 342: 338: 334: 330: 326: 322: 319: 317: 312: 308: 305: 301: 297: 296: 292:-dimensional 291: 287: 275: 273: 269: 265: 255: 253: 247: 245: 241: 237: 233: 229: 225: 221: 218: \  217: 213: 209: 205: 193: 190: 188: 184: 180: 176: 172: 168: 164: 159: 157: 153: 149: 145: 141: 137: 133: 129: 125: 122: 118: 115: 111: 108:in the plane 107: 103: 93: 91: 87: 86:Oswald Veblen 83: 80: 79:mathematician 75: 73: 69: 64: 60: 56: 52: 48: 44: 43: 38: 34: 30: 21: 3047: 3005:(1): 83–98, 3002: 2996: 2970:(1): 34–38, 2967: 2961: 2927: 2923: 2880: 2876: 2848: 2842: 2800: 2794: 2760: 2754: 2710: 2704: 2691: 2678: 2674: 2624: 2618: 2609:(5): 173–176 2606: 2602: 2563: 2529: 2523: 2502: 2473: 2469: 2459: 2448:. Retrieved 2444: 2435: 2422: 2415: 2402: 2393: 2389: 2380: 2369: 2358: 2342: 2316: 2312: 2306: 2292:(7): 57–61. 2289: 2279: 2252: 2248: 2238: 2227: 2217: 2184: 2180: 2174: 2137: 2131: 2098: 2094: 2088: 2076: 2067: 2063: 2047: 2014: 2010: 2004: 1945: 1921: 1910: 1884: 1857: 1789:Mizar system 1777:formal proof 1774: 1768: 1718: 1690: 1586: 1573: 1520: 1473: 1466: 1462: 1458: 1453: 1445: 1440: 1430: 1420: 1389: 1355: 1351: 1314: 1252: 848: 721: 712: 709: 701: 690: 680: 672: 656: 652: 648: 644: 640: 632: 628: 624: 620: 616: 612: 608: 604: 600: 593:homeomorphic 588: 582: 577: 573: 569: 565: 561: 557: 541: 533: 529: 525: 521: 513: 511: 372: 368: 364: 356: 352: 346: 340: 336: 332: 328: 324: 320: 315: 310: 306: 299: 293: 289: 285: 277: 271: 261: 251: 249: 239: 235: 231: 219: 215: 207: 203: 195: 191: 186: 182: 178: 174: 170: 166: 162: 160: 143: 139: 135: 131: 116: 109: 105: 102:Jordan curve 101: 99: 92:and others. 76: 42:Jordan curve 40: 32: 26: 2763:: 219–229, 2337:See p. 285. 1846:Application 697:game of Hex 637:unit circle 264:H. Lebesgue 210:. Then its 148:plane curve 3101:Categories 2827:34.0533.02 2516:References 2450:2021-07-18 2396:: 157–160. 1775:The first 1769:presumably 1691:presumably 1410:, or even 1406:and other 516:using the 363:groups of 212:complement 169:such that 144:Jordan arc 3089:1404.0556 3054:EMS Press 2972:CiteSeerX 2897:0933-5846 2819:0002-9947 2779:0030-8730 2727:0002-9890 2666:(2007b), 2641:0002-9890 2548:0035-7596 2271:0166-218X 2201:0002-9890 2147:1002.2954 2115:0002-9890 1785:HOL Light 1755:… 1743:δ 1730:δ 1701:δ 1678:… 1666:δ 1653:δ 1632:δ 1612:δ 1446:However, 1367:× 1212:≠ 1174:≤ 1158:− 1141:≤ 1125:− 1014:− 960:− 707:theorem. 597:unit disk 486:otherwise 444:− 393:~ 156:algebraic 121:injective 49:" region 2953:(1980), 2913:33627222 2689:(1887), 2594:(1950), 2055:(2007). 1958:See also 1598:open set 1396:polygons 1233:′ 1222:′ 1165:′ 1132:′ 1093:′ 1082:′ 705:discrete 665:retracts 631:, where 298:in the ( 244:boundary 236:exterior 232:interior 55:exterior 47:interior 29:topology 3029:1500697 3021:1986378 2944:2324180 2905:2321588 2865:3257011 2835:1986455 2787:0276940 2743:0769530 2735:2323369 2649:2363054 2584:6450129 2556:0410701 2349: ( 2333:0446838 2298:1271184 2229:YouTube 2123:2320146 2039:0006516 2031:2303093 1865:) of a 1783:in the 1602:closure 1569:of the 1450:wrote: 556:subset 554:compact 520:. When 318:-sphere 279:Theorem 242:is the 228:bounded 197:Theorem 112:is the 63:theorem 51:bounded 3027:  3019:  2974:  2942:  2911:  2903:  2895:  2863:  2833:  2825:  2817:  2785:  2777:  2741:  2733:  2725:  2657:887392 2655:  2647:  2639:  2582:  2572:  2554:  2546:  2490:  2331:  2296:  2269:  2209:887392 2207:  2199:  2162:  2121:  2113:  2037:  2029:  1514:, and 1442:given. 1189:, and 677:sphere 641:ψ 621:φ 568:is an 288:be an 173:(0) = 152:smooth 128:circle 119:of an 31:, the 3084:arXiv 3064:Mizar 3017:JSTOR 2958:(PDF) 2940:JSTOR 2909:S2CID 2861:S2CID 2831:JSTOR 2731:JSTOR 2696:(PDF) 2671:(PDF) 2653:S2CID 2599:(PDF) 2427:(PDF) 2205:S2CID 2142:arXiv 2119:JSTOR 2060:(PDF) 2027:JSTOR 1982:Notes 1719:prove 653:false 611:with 323:into 230:(the 165:: → 126:of a 114:image 104:or a 2893:ISSN 2815:ISSN 2775:ISSN 2723:ISSN 2681:(23) 2637:ISSN 2580:OCLC 2570:ISBN 2544:ISSN 2488:ISBN 2408:1978 2351:1905 2267:ISSN 2197:ISSN 2160:ISBN 2111:ISSN 1900:odd. 1877:even 1793:2007 1549:1975 1529:and 1478:and 1109:iff 591:are 576:(or 284:Let 266:and 202:Let 154:nor 142:. A 3062:in 3007:doi 2982:doi 2932:doi 2885:doi 2853:doi 2823:JFM 2805:doi 2765:doi 2715:doi 2629:doi 2625:114 2534:doi 2478:doi 2321:doi 2257:doi 2253:139 2189:doi 2185:114 2152:doi 2103:doi 2019:doi 1936:odd 1934:is 1924:ray 1911:In 1867:ray 1577:3,3 1558:by 1540:by 878:: 813:if 722:In 659:is 560:of 335:in 331:of 252:arc 27:In 3103:: 3052:, 3046:, 3025:MR 3023:, 3015:, 3001:, 2980:, 2968:12 2966:, 2960:, 2938:, 2928:99 2926:, 2907:, 2901:MR 2899:, 2891:, 2881:46 2879:, 2868:. 2859:, 2847:, 2829:, 2821:, 2813:, 2799:, 2783:MR 2781:, 2773:, 2761:36 2759:, 2753:, 2739:MR 2737:, 2729:, 2721:, 2711:91 2709:, 2679:10 2677:, 2673:, 2651:, 2645:MR 2643:, 2635:, 2623:, 2601:, 2578:. 2552:MR 2550:, 2542:, 2528:, 2486:. 2474:55 2468:. 2443:. 2394:33 2392:. 2329:MR 2327:. 2317:17 2315:. 2294:MR 2288:. 2265:. 2251:. 2247:. 2226:. 2203:. 2195:. 2183:. 2158:. 2150:. 2117:. 2109:. 2099:86 2097:. 2068:10 2066:. 2035:MR 2033:. 2025:. 2015:49 2013:. 1989:^ 1938:. 1919:. 1842:. 1551:). 1518:. 1510:, 1506:, 1502:, 1498:, 1494:, 1490:, 1486:, 1418:. 846:. 647:→ 643:: 627:→ 623:: 524:= 371:\ 367:= 274:. 214:, 158:. 138:→ 134:: 100:A 3092:. 3086:: 3066:. 3009:: 3003:6 2984:: 2934:: 2887:: 2855:: 2849:5 2807:: 2801:4 2767:: 2717:: 2631:: 2607:5 2586:. 2536:: 2530:5 2509:. 2496:. 2480:: 2453:. 2410:) 2353:) 2335:. 2323:: 2300:. 2273:. 2259:: 2232:. 2211:. 2191:: 2168:. 2154:: 2144:: 2125:. 2105:: 2041:. 2021:: 1999:. 1932:n 1928:n 1895:B 1887:b 1885:p 1879:. 1872:A 1860:a 1858:p 1827:0 1821:A 1818:C 1815:R 1752:, 1747:2 1739:, 1734:1 1675:, 1670:2 1662:, 1657:1 1583:. 1574:K 1562:. 1544:. 1533:. 1370:n 1364:n 1330:2 1325:Z 1298:2 1293:Z 1269:2 1264:R 1249:. 1237:) 1230:y 1226:, 1219:x 1215:( 1209:) 1206:y 1203:, 1200:x 1197:( 1177:1 1170:| 1162:y 1155:y 1151:| 1147:, 1144:1 1137:| 1129:x 1122:x 1118:| 1097:) 1090:y 1086:, 1079:x 1075:( 1055:) 1052:y 1049:, 1046:x 1043:( 1032:. 1020:) 1017:1 1011:y 1008:, 1005:x 1002:( 999:, 996:) 993:1 990:+ 987:y 984:, 981:x 978:( 975:, 972:) 969:y 966:, 963:1 957:x 954:( 951:, 948:) 945:y 942:, 939:1 936:+ 933:x 930:( 910:) 907:y 904:, 901:x 898:( 864:2 859:Z 828:2 823:Z 799:2 794:Z 770:2 765:R 741:2 736:Z 681:R 673:R 657:R 649:R 645:R 633:S 629:R 625:S 617:A 613:A 609:P 605:A 601:P 589:R 578:S 574:R 570:n 566:X 562:R 558:X 542:X 534:Y 530:Y 526:k 522:n 514:k 490:. 480:, 477:} 474:0 471:{ 464:, 461:n 458:= 455:q 447:k 441:n 438:= 435:q 430:, 426:Z 419:{ 414:= 411:) 408:Y 405:( 400:q 390:H 373:X 369:R 365:Y 357:k 353:X 341:X 337:R 333:X 329:Y 325:R 321:S 316:n 311:n 309:( 307:R 300:n 290:n 286:X 240:C 220:C 216:R 208:R 204:C 187:C 183:C 179:φ 175:φ 171:φ 167:R 163:φ 140:R 136:S 132:φ 117:C 110:R 66:(

Index


topology
Camille Jordan
Jordan curve
interior
bounded
exterior
continuous path
theorem
Tverberg (1980
algebraic topology
mathematician
Camille Jordan
Oswald Veblen
Thomas C. Hales
image
injective
continuous map
circle
plane curve
smooth
algebraic
complement
connected components
bounded
boundary
H. Lebesgue
L. E. J. Brouwer
topological sphere
Euclidean space

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑