The never-proved triangle inequality: A GeoGebra & CAS approach

We use a quite simple, yet challenging, elementary geometry statement, the so-called never proved (by a mathematician) theorem, introduced by Prof. Jiawei Hong in his communication to the IEEE 1986 Symposium on Foundations of Computer Science, to exemplify and analyze the current situation of achievements, ongoing improvements and limitations of GeoGebra's automated reasoning tools, as well as other computer algebra systems, in dealing with geometric inequalities. We present a large collection of facts describing the curious (and confusing) history behind the statement and its connection to automated deduction. An easy proof of the never proved theorem, relying on some previous (but not trivial) human work is included. Moreover, as part of our strategy to address this challenging result with automated tools, we formulate a large list of variants of the never proved statement (generalizations, special cases, etc.). Addressing such variants with GeoGebra Discovery, Maple, REDUCE/Redlog or Mathematica leads us to introduce and reflect on some new approaches (e.g., partial elimination of quantifiers, consideration of symmetries, relevance of discovery vs. proving, etc.) that could be relevant to consider for future improvements of automated reasoning in geometry algorithms. As a byproduct, we obtain an original result (to our knowledge) concerning the family of triangles inscribable in a given triangle.

Automated summary

This article uses an unproven geometry theorem to analyze the achievements, improvements, and limitations of GeoGebra and other computer algebra systems in dealing with geometric inequalities. By addressing variants of the theorem with different tools, new approaches and considerations are introduced for future improvements in automated reasoning in geometry algorithms. Additionally, an original result regarding inscribable triangles is obtained.