# Erdős–Anning theorem

Erdős–Anning theorem The Erdős–Anning theorem states that an infinite number of points in the plane can have mutual integer distances only if all the points lie on a straight line. It is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945.[1] Contents 1 Rationality versus integrality 2 Proof 3 Maximal point sets with integral distances 4 References 5 External links Rationality versus integrality Main article: Erdős–Ulam problem Although there can be no infinite non-collinear set of points with integer distances, there are infinite non-collinear sets of points whose distances are rational numbers. The (still unsolved) Erdős–Ulam problem asks whether there can exist a dense set of points in the plane at rational distances from each other.

For any finite set S of points at rational distances from each other, it is possible to find a similar set of points at integer distances from each other, by expanding S by a factor of the least common denominator of the distances in S. Therefore, there exist arbitrarily large finite sets of non-collinear points with integer distances from each other. However, including more points into S may cause the expansion factor to increase, so this construction does not allow infinite sets of points at rational distances to be transformed into infinite sets of points at integer distances.

Proof To prove the Erdős–Anning theorem, it is helpful to state it more strongly, by providing a concrete bound on the number of points in a set with integer distances as a function of the maximum distance between the points. More specifically, if a set of three or more non-collinear points have integer distances, all at most some number {displaystyle delta } , then at most {displaystyle 4(delta +1)^{2}} points at integer distances can be added to the set.

To see this, let A, B and C be three non-collinear members of a set S of points with integer distances, all at most {displaystyle delta } , and let {displaystyle d(A,B)} , {displaystyle d(A,C)} , and {displaystyle d(B,C)} be the three distances between these three points. Let X be any other member of S. From the triangle inequality it follows that {displaystyle |d(A,X)-d(B,X)|} is a non-negative integer and is at most {displaystyle delta } . For each of the {displaystyle delta +1} integer values i in this range, the locus of points satisfying the equation {displaystyle |d(A,X)-d(B,X)|=i} forms a hyperbola with A and B as its foci, and X must lie on one of these {displaystyle delta +1} hyperbolae. By a symmetric argument, X must also lie on one of a family of {displaystyle delta +1} hyperbolae having B and C as foci. Each pair of distinct hyperbolae, one defined by A and B and the second defined by B and C, can intersect in at most four points, and every point of S (including A, B, and C) lies on one of these intersection points. There are at most {displaystyle 4(delta +1)^{2}} intersection points of pairs of hyperbolae, and therefore at most {displaystyle 4(delta +1)^{2}} points in S.

Maximal point sets with integral distances An alternative way of stating the theorem is that a non-collinear set of points in the plane with integer distances can only be extended by adding finitely many additional points, before no more points can be added. A set of points with both integer coordinates and integer distances, to which no more can be added while preserving both properties, forms an Erdős–Diophantine graph.

References ^ Anning, Norman H.; Erdős, Paul (1945), "Integral distances", Bulletin of the American Mathematical Society, 51 (8): 598–600, doi:10.1090/S0002-9904-1945-08407-9. External links Weisstein, Eric W. "Erdos-Anning Theorem". MathWorld. Categories: Arithmetic problems of plane geometryTheorems in discrete mathematicsTheorems in discrete geometryPaul Erdős

Si quieres conocer otros artículos parecidos a Erdős–Anning theorem puedes visitar la categoría Arithmetic problems of plane geometry.

Subir

Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información