Simpler-to-Describe Cases are Often More Difficult to Prove: A Possible Explanation

Authors

Olga Kosheleva, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

3-2014

Comments

Technical Report: UTEP-CS-14-17

Published in International Mathematical Forum, 2014, Vol. 9, No. 16, pp. 767-772.

Abstract

In many areas of mathematics, simpler-to-describe cases are often more difficult to prove. In this paper, we provide examples of such phenomena (Bieberbach's Conjecture, Poincar\'e Conjecture, Fermat's Last Theorem), and we provide a possible explanation for this empirical fact.