Jump to content

Egan conjecture

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Samuel Adrian Antz (talk | contribs) at 15:27, 22 November 2023 (Changed category "Conjecture", which doesn't (yet) exist, to "Conjectures that have been proved".). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Egan conjecture in the mathematical area of geometry gives a sufficient and necessary condition for the radii of two spheres and the distance of their centres, so that a simplex exists, which completely contains the larger sphere and completely encloses the smaller sphere. The conjecture generalizes an equality discovered by William Chapple (and later independently by Leonard Euler), which is a special case of Poncelet's closure theorem, as well as the Grace–Danielsson Inequality in one dimension higher. The conjecture is named after the Australian mathematician and science-fiction author Greg Egan.

Basics

For an arbitary triangle (-simplex), the radius of its inscribed circle, the radius of its circumcircle and the distance of their centers are related through Euler's theorem in geometry:

,

which was published by William Chapple in 1746[1] and by Leonard Euler in 1765.[2]

For two spheres (-spheres) with respective radius and , fulfilling , there exists a (non-regular) tetrahedron (-simplex), which completely contains the larger sphere and completely encloses the smaller sphere, if and only if the distance of their centers fulfills the Grace–Danielsson Inequality:

.

This result was independently proven by John Hilton Grace in 1917 and G. Danielsson in 1949.[3][4] A connection with quantum information theory was described by Anthony Milne.[5]

Conjecture

Consider -dimensional euclidean space for . For two -spheres with respective radius and , fulfilling , there exists a -simplex, which completely contains the larger sphere and completely encloses the smaller sphere, if and only if the distance of their centers fulfills:

.

The conjecture was proposed by Greg Egan in 2014.[6] For the case , where the inequality reduces to , the conjecture is true as well, but trivial. A -sphere is just composed of two points and a -simplex is just a closed interval. The desired -simplex of two given -spheres can simply be chosen as the closed interval between the two points of the larger sphere, which contains the smaller sphere if and only if it contains both of its points with respective distance and from the center of the larger sphere, hence if and only if the above inequality is satisfied.

Status

Greg Egan showed that the condition is sufficient under a blog post by John Baez on 16 April 2018.[6] Sergei Drozdov published a paper on ArXiv showing that the condition is also necessary on 16 October 2023.[7]

References

  1. ^ Chapple, William, Miscellanea Curiosa Mathematica (ed.), An essay on the properties of triangles inscribed in and circumscribed about two given circles (1746), vol. 4, pp. 117–124, Formel auf Seite 123 unten
  2. ^ Leversha, Gerry; Smith, G. C. (2007-11), The Mathematical Gazette (ed.), Euler and triangle geometry, vol. 91, pp. 436–452 {{citation}}: Check date values in: |date= (help)CS1 maint: multiple names: authors list (link)
  3. ^ Grace,J.H. (1918), Proc. London Math. (ed.), Tetrahedra in relation to spheres and quadrics, vol. Soc.17, pp. 259–271
  4. ^ Danielsson,G. (1952), Johan Grundt Tanums Forlag (ed.), Proof of the inequality d2≤(R+r)(R−3r) for the distance between the centres of the circumscribed and inscribed spheres of a tetrahedron, pp. 101–105
  5. ^ Anthony Milne (2014-04-02). "The Euler and Grace-Danielsson inequalities for nested triangles and tetrahedra: a derivation and generalisation using quantum information theory". Retrieved 2023-11-22.
  6. ^ a b John Baez (2014-07-01). "Grace–Danielsson Inequality". Retrieved 2023-11-22.
  7. ^ Sergei Drozdov. "Egan conjecture holds". Retrieved 2023-11-22.