# What is the first interesting theorem in (insert subject here)? [closed]

In most students' introduction to rigorous proof-based mathematics, many of the initial exercises and theorems are just a test of a student's understanding of how to work with the axioms and unpack various definitions, i.e. they don't really say anything interesting about mathematics "in the wild." In various subjects, what would you consider to be the first theorem (say, in the usual presentation in a standard undergraduate textbook) with actual content?

Some possible examples are below. Feel free to either add them or disagree, but as usual, keep your answers to one suggestion per post.

• Number theory: the existence of primitive roots.
• Set theory: the Cantor-Bernstein-Schroeder theorem.
• Group theory: the Sylow theorems.
• Real analysis: the Heine-Borel theorem.
• Topology: Urysohn's lemma.

Edit: I seem to have accidentally created the tag "soft-questions." Can we delete tags?

Edit #2: In a comment, ilya asked "You want the first result after all the basic tools have been introduced?" That's more or less my question. I guess part of what I'm looking for is the first result that justifies the introduction of all the basic tools in the first place.

-

## closed as no longer relevant by Felipe Voloch, Suvrit, Bill Johnson, Todd Trimble♦, Qiaochu YuanMar 1 '12 at 16:41

This question is unlikely to help any future visitors; it is only relevant to a small geographic area, a specific moment in time, or an extraordinarily narrow situation that is not generally applicable to the worldwide audience of the internet. For help making this question more broadly applicable, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

I wish the system was smart enough to understand that example = examples and soft-question = soft-questions (and topos = topoi :) ). – Ilya Nikokoshev Oct 24 '09 at 20:34
@Qiaochu: If there is no question with a given tag, the tag will disappear on its own within about a day. If you find two tags that should really be the same, flag the post for moderator attention with a comment explaining that the tags should be merged. @ilya: the site doesn't understand the meanings of the tags, so it would probably cause trouble if it tried to automatically merge tags. But you usually don't write the complete name of the tag anyway; you just type the first few letters and then you're shown a list of tags that match. – Anton Geraschenko Oct 24 '09 at 20:50
@Anton, the object = objects idea seem to be easy to implement to me -- is there an example where this merging makes no sense? – Ilya Nikokoshev Oct 24 '09 at 23:20
Is anyone other than me in favor of changing the word "non-trivial" to "interesting" in the title? I, for one, would feel much less intimidated. – S. Carnahan Oct 26 '09 at 9:45
This question seems to have long outgrown its usefulness (and some of the more recent additions have been, IMHO, lousy). Voting to close. – Todd Trimble Mar 1 '12 at 16:03

Finite group theory: I would say Lagrange's theorem, that the order of a subgroup divides the order of the group. Certainly it's prior to the Sylow theorems, certainly it has content.

-
I was about to post that. I should make the addendum though that while Lagrange stated his theorem in 1770, the first full proof occurred 30 years later at the same time as the first proof of the insolubility of the quintic. – Jason Dyer Oct 24 '09 at 20:42
LaGrange's theorem is just an application of the definition of an equivalence class. – Harry Gindi Dec 13 '09 at 15:26
Fermat's last theorem is just an application of the definition of a natural number. – Steven Gubkin Mar 5 '10 at 0:15
It is even more trival in the case in which he stated it: If a polynomial has it's n variables permuted obtaining n! formally different expressions and by manipulating it is found out that they allot to only k different polynomials, then k divides n!. Proof: being all the n! expressions essentially equal, they must all group up in sets of d expressions that yield the same polynomial by manipulation. Hence k=n!/d. I don't understand why he didn't prove it generally. Did he state it generally? Did he need it? Has someone here read Lagrange's work? – Marcos Cossarini Mar 30 '10 at 5:17
@Marcos : "I don't understand why he didn't prove it generally". Presumably because the definition of a group was only given in the mid-19th century. – Laurent Berger Mar 1 '12 at 14:03

The uncountability of the reals. This is such a classic fact that I'm not sure how to classify it. Set theory, perhaps.

-
This was due to Cantor, right? My understanding is that he was working on perfect sets when thinking about the "cardinality" of the reals (Was it even referred to as cardinality at the time?). Although the word "sets" is used, perfect sets is somewhat topological and deals with the standard topology on Euclidean space. So I don't think it's fair to classify this as a Set Theoretic theorem (or at least not as solely a Set Theoretic theorem). – MLevi Nov 4 '09 at 20:24
If I remember right, Cantor referred to cardinality as the "power" of a set at that time, in either German or French. (Hazy memories of reading some of his original letters in a history-of-logic compendium once.) – Peter LeFanu Lumsdaine May 8 '10 at 2:34

Algebraic Geometry: Bezout's Theorem. It's also good for selling what algebraic geometry is to people who've never heard of it before.

-
Bezout's Theorem is a nice theorem but it is hardly surprising in its proper setting (algebraically closed field, taking into account multiplicities and points at infinity). – lhf Oct 30 '09 at 9:18
But it is a great motivator for schemes and cohomology: To put projective and affine space in the same framework, you need gluing. To get the right formulas for higher order contact, you need the scheme theoretic intersection of curves. When you approach the theorem cohomologically, it reduces to just intersecting lines (which is a conceptually beautiful way to approach the proof). So not only is it simple to understand, it can be used as motivation for very deep ideas. – Steven Gubkin Nov 12 '09 at 20:04

Knot theory: sufficiency of the Reidemeister moves.

-

Euler's theorem V-E+F=2, can be regarded as a first theorem in graph theory, or in the theory of convex polytopes, and probably 0th theorem in algebraic topology and other fields.

-

Ring theory: If R is a UFD, then so is R[x].

-
For ring theory, I prefer R noetherian implies R[x] is. The Hilbert Basis Theorem. – Charles Siegel Oct 26 '09 at 20:56
Post this as a separate answer so that it can get voted independently. – lhf Oct 30 '09 at 9:20

Commutative Algebra: The Hilbert Basis Theorem: If R is noetherian, so is R[x].

-

Graph theory: necessary and sufficient conditions for the existence of an Eulerian walk/cycle

-

Algebraic topology: Fundamental group of S^1.

-
I'm not sure I like this one - although it can be hard to prove when you don't have much machinery, it's basically a tautology deriving from the definition of the fundamental group and not a very insightful result. I'd say the first nontrivial theorem of algebraic topology (at least on the homology side of things) is Poincaré duality - after all that was one of the things that launched the subject. Although there are easier results (Brouwer fixed point), they do not really pertain to algebraic topology itself. Considering homotopy, there should be something about homotopy groups of spheres. – Sam Derbyshire Oct 25 '09 at 2:47
Having just taught this result, I definitely agree with Qiaochu! Sam, if you can write down a "tautological" proof of this fact, I'd like to see it! – HJRW Nov 5 '09 at 1:00
To be precise, I suppose I mean a proof that doesn't involve homotopy lifting. – HJRW Nov 5 '09 at 1:01
This is an important first result because now we can prove the Brouwer fixed point theorem (usually the fundamental group comes before homology right? the other things you need for that result are much more straightforward). – Sean Tilson Mar 5 '10 at 21:05
This is the most important computation in algebraic topology, in my opinion. Everything else ultimately derives from it. – Jeff Strom Jul 23 '10 at 18:06

Category theory: The Yoneda lemma.

-
I thought about that, but I think category theorists would consider the Yoneda lemma trivial. Not to say that it's easy to understand, but it does follow directly from the category axioms. – Qiaochu Yuan Oct 24 '09 at 20:36
I think I'm only now getting where you're going. You want the first result after all the basic tools have been introduced? – Ilya Nikokoshev Oct 24 '09 at 20:48
Though Yoneda's lemma isn't non-trivial, I feel like understanding its significance is definitely a non-trivial step. Schur's lemma in representation theory and Nakayama's lemma in algebra have a similar feel to them. They're pretty trivial to prove, but can take a while to really grok them. – Anton Geraschenko Oct 24 '09 at 20:56
I think Anton said what I wanted to get across: the Yoneda lemma itself isn't non-trivial, but the philosophy of it is. – Harrison Brown Oct 24 '09 at 21:28
Maybe it's more correct to say that Yoneda is the last trivial theorem? – Harrison Brown Oct 25 '09 at 5:52

Quadratic reciprocity feels to me like a "first nontrivial statement" without an obvious branch of mathematics. Not number theory -- there are things like the infinitude of the primes, and "algebraic number theory" doesn't seem quite right either...

-
The first nontrivial statement in class field theory? – James Cranch Mar 1 '12 at 15:35

Differential equations: Picard's theorem on existence and uniqueness.

-

Linear algebra: rank-nullity theorem.

-
Although of course, this is just a categorification of the corresponding statement for finite sets... – Scott Morrison Oct 24 '09 at 21:42
Do you mean the statement that a set is the union of the preimages of the image elements under a map? I think both statements are categorifications of the existence of addition, but linear categorifications are intrinsically more powerful. – S. Carnahan Oct 24 '09 at 23:04
You could say that the rank nullity theorem is a direct consequence of the fact that all modules over fields are free (and hence projective). This may be a warped way of looking at things but I have to admit, thats how I remember it now :) – Grétar Amazeen Oct 25 '09 at 2:08
I've been teaching some linear algebra this term. It's really satisfying seeing pupils realise just what a powerful tool this theorem is. (Powerful, that is, in the context of first year lin alg...) – Tom Smith May 23 '10 at 20:52
I think that various theorems about bases (every two bases have the same cardinality, every linearly independent set can be extended to a basis, and so on) are nontrivial and certainly come earlier. Why non-trivial? Because they may fail for modules over other rings, even if the module is free (but the ring may be noncommutative) or for f.g. modules over commutative rings (maximal linearly independent systems may have different cardinality, mathoverflow.net/questions/30066/…) – Victor Protsak Jul 24 '10 at 5:33

Probability theory: the Central Limit Theorem?

-
I would consider the law of large numbers non-trivial, and that was covered in my probability courses long before the CLT. – Kevin P. Costello Oct 25 '09 at 0:19

Social choice theory: Arrow's Impossibility Theorem.

-
This is the first time I’ve heard of Social Choice Theory, which is why I have to upvote this answer. – k.stm Feb 19 '14 at 9:12

Number theory: Different undergraduate textbooks approach the subject differently, of course. But the irrationality of the square root of 2 and the infinitude of primes are contentful theorems that are certainly very early historically, and also very early in at least some textbook treatments of the subject.

-
I have to admit when I say "number theory" I always think "in the sense of Gauss." The infinitude of the primes is a better candidate now that I think about it. – Qiaochu Yuan Oct 24 '09 at 20:39
Perhaps you could even argue that the irrationality of the square root of 2 and the infinitude of primes are the first nontrivial theorems in mathematics as a whole. The Pythagorean theorem seems to be another candidate in this direction. – Michael Lugo Oct 24 '09 at 21:59
Probably Pythagorean before "sqrt(2) is irrational". Without a^2 + b^2 = c^2 with a = b = 1, we have no reason to consider sqrt(2) in the first place. – Chad Groft Feb 22 '10 at 17:31

Functional Analysis: the Hahn-Banach Theorem.

-

Theory of Computation: The halting problem

Set Theory: Cardinality of a set is strictly less than its powerset

Not sure which field (one might learn it in an intro real analysis course): Reals are uncountable

Complexity theory: The Time and Space Hierarchy theorems

One might learn these results in different courses, but they're all the same beautiful idea: Cantor's diagonalization.

-

Computer science: sort requires n * log n

-
Nitpick: Comparison based sort is \Omega(n*log n). – Steven Sam Oct 24 '09 at 20:16
Comparison as in bubble sort (nn) or as in some other sort? I mean *any sorting algorithm requires asymptotically at least C * n * log n. – Ilya Nikokoshev Oct 24 '09 at 20:21
That is only true for comparison-based sorting algorithms. There are non comparison-based sorting algorithms if your data consists of numbers or alphabets, or things like that. For example, radix sort: en.wikipedia.org/wiki/Radix_sort – Steven Sam Oct 24 '09 at 20:35
Well, it's simply about the way you define your problem; other sorts have input defined in a different way. "Hence, radix sort does not really beat O(n log n) time, it only appears to do so because the range of keys is implicitly limited by the size of k." (from wikipedia) – Ilya Nikokoshev Oct 24 '09 at 20:46
Yijie Han dx.doi.org/10.1016/j.jalgor.2003.09.001 has an algorithm for sorting natural numbers that takes time O(n log log n). So it really depends on the class of sorting algorithms. Any comparison sort needs at least $\log_2 n! > c n \log n$ comparisons. – Konrad Swanepoel Nov 11 '09 at 10:09

Functional analysis: the open mapping theorem.

-
there's a case for saying "Banach-Steinhaus theorem" or "uniform boundedness", which are somehow the deepest part of (the proof of) the open mapping theorem. But yes, this one gets a vote from me. – Yemon Choi Oct 25 '09 at 20:56

Symplectic Geometry: Darboux's theorem

-
Does this predate Liouville's theorem that Hamiltonian flows are symplectomorphisms (according to wikipedia he's only attributed for the volume preserving part)? Liouville was about 30 years older. – PVAL May 2 at 9:37

Noncommutative ring theory: The Artin-Wedderburn Theorem.

A ring R is semisimple if and only if it is isomorphic to a finite direct product of matrix rings over division rings.

-
Being R a unital ring. – Jose Brox Nov 27 '09 at 2:35

Although the Gauss-Bonnet theorem was cited for differential geometry of surfaces, I really think that the first striking result in this subject is Gauss's Theorema Egregium, which is not obvious from the definition of Gaussian curvature (which makes explicit reference to the ambient space). But the Gauss-Bonnet theorem is certainly the first really deep theorem one encounters in differential geometry.

-
Theorema Egregium is certainly very deep! Without Theorema Egregium to back it up, the Gauss-Bonnet theorem isn't very meaningful, and of course, it comes later. – Victor Protsak May 23 '10 at 21:24

operator algebras: the Gelfand transform is an isomorphism for commutative $C^*$-algebras.

-

Finite group representation theory: the fact that the irreducible characters form a basis for the class functions.

-

Riemann Surfaces: Riemann-Roch Theorem

-

Combinatorics: the nth Catalan number is (2n choose n)/(n+1)

-

Algebraic topology: Poincaré Duality

-

In mathematical logic, Gödel's incompleteness theorem.

-
I would think of Completeness or Compactness of first order logic as a more reasonable answer. Incompleteness is interesting, but it feels more like a side branch of the theorem tree than the main trunk (whatever that means). – Richard Dore Oct 25 '09 at 6:40
I think it's a reasonable answer, and I don't agree at all it is a side branch, since it applies to every part of mathematics (as developed by humans, anyway). I think completeness and compactness are also reasonable answers, but we actually got to incompleteness first in my courses, so... – Darsh Ranjan Oct 25 '09 at 8:47
Incompleteness was used as the motivation for the study of completeness and compactness in the courses I took. – David Crawshaw Oct 25 '09 at 11:24
My comment about the tree is that Godel's Incompleteness Theorem just doesn't get used in logic that much. Most people see it early because it has a high "Gee Whiz" factor, which makes it a good advertisement for logic. – Richard Dore Oct 25 '09 at 16:55
I don't know about that. We use the classes of large cardinals to measure consistency strength, and we need Gödel II to establish that those strengths really are different. – Chad Groft Feb 22 '10 at 17:36

Euclidean geometry: a triangle on a semicircle has a right angle.

-