File:Erdős–Anning proof.svg
Summary
| Description |
English: Illustration for a proof of the Erdős–Anning theorem, that a non-collinear set of points in the plane with integer distances must be finite. Given three non-collinear points A, B, C in the set (here, the vertices of a 3-4-5 right triangle), the points whose distances to A and to B differ by an integer must lie on a system of hyperbolas and degenerate hyperbolas (blue), and symmetrically the points whose distances to B and to C differ by an integer must lie on another system of hyperbolas (red). Any point that has integer distance to all three of A, B, C must lie on one of the finitely many intersections of a blue and a red curve. Each branch of a hyperbola is labeled by the integer difference of distances that is invariant for the points on that branch. |
| Date | |
| Source | Own work; hyperbolas scaled from File:Simple Hyperbola.svg |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
| This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. | |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|