Skip to main content

Famous Classical Theorems

  • Chapter
  • First Online:
Book cover An Invitation to Abstract Mathematics

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

  • 4610 Accesses

Abstract

There are many famous theorems in mathematics. Some are known for their importance, others for their depth, usefulness, or sheer beauty. In this chapter we discuss seven of the most remarkable classical theorems; in the next chapter, we discuss three others from more recent times. Our choices for this top ten list were motivated primarily by the nature of their proofs; we apologize if we did not choose your favorite theorem. (A more representative top 40 list can be found in Appendix D at the end of the book.) Here we included theorems that are considered to have the oldest, the most well-known, the most surprising, the most elegant, and the most unsettling proofs. Some of the theorems in our list were disappointing—even angering—to mathematicians of the time, others were celebrated instantly by most.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Béla Bajnok

About this chapter

Cite this chapter

Bajnok, B. (2013). Famous Classical Theorems. In: An Invitation to Abstract Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6636-9_5

Download citation

Publish with us

Policies and ethics