# Which one result in mathematics has surprised you the most? [closed]

A large part of my fascination in mathematics is because of some very surprising results that I have seen there.

I remember one I found very hard to swallow when I first encountered it, was what is known as the Banach Tarski Paradox. It states that you can separate a ball $x^2+y^2+z^2 \le 1$ into finitely many disjoint parts, rotate and translate them and rejoin (by taking disjoint union), and you end up with exactly two complete balls of the same radius!

So I ask you which are your most surprising moments in maths?

• Chances are you will have more than one. May I request post multiple answers in that case, so the voting system will bring the ones most people think as surprising up. Thanks!
-

## closed as too localized by t.b., Zev ChonolesSep 5 '11 at 22:18

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.

big-list usually means community wiki. For this question it applies. –  Aryabhata Aug 21 '10 at 19:01
And maybe also mathoverflow.net/questions/18100/… . –  Qiaochu Yuan Aug 21 '10 at 21:21
–  Qiaochu Yuan Aug 21 '10 at 21:28
I'm getting tired of this question being bumped every once in a while. It seems to have served its purpose and there's no need to accumulate more than 100 answers. Therefore I voted to close it. –  t.b. Sep 5 '11 at 22:09

The Thom-Pontrjagin theorem: $\Omega_n^{SO} \cong \pi_n(MSO)$. The group of equivalence classes of n-manifolds with respect to oriented cobordism is isomorphic to the n-th homotopy group of the Thom spectrum MSO. This can be generalized to include different cobordisms (unoriented, ...) and different Thom spectra. See for example the minor thesis by T. Weston.

-

When I started studying elliptic curves and modular forms I was really amazed by the fact that for a normalized eigenform the Fourier coefficients are the Hecke eigenvalues.

-

The fact that the curve of fastest descent (i.e., the brachistochrone) dips beneath its target!

-

Henry Ernest Dudeney's Spider and Fly Problem: With a cuboid $30\times12\times12$, what is the minimum surface distance from a point which is on a $12\times 12$ face and in $1$ from the mid-point of an edge to the opposite point across the centre of the cuboid?

The surprise is that the minimum distance requires a route using five of the six faces of the cuboid.

-

The fact that the axiom of foundations (also known as regularity in some places) is independent of the rest of the axioms, and not only you can have an infinitely descending chain $x_0 \ni x_1 \ni \ldots$ but you can have $x = \{ x \}$ and even more than that! $P(a) \in a$ is possible as well.

Crazy set theoretic voodoo, that's what this is! (And I'm loving every single bit of it :))

-
What I found more amazing when learning of these things, was that I had never even thought of the problem of the existence of a set $x$ such that $x=\{x\}$. Learning that the negation of such an existence (even more, the axiom of foundation) is not relevant to all mathematics (outside set theory in itself), also blew my mind. –  lentic catachresis Nov 19 '10 at 0:41

The solution to Hilbert's 10th problem, i.e. the MRDP theorem.

Number theorists were trying to find a general method to solve Diophantine equations. Special cases of the Diophantine equations were/are studied extensively and the theorems are quite nice. Learning the fascinating fact that there is no general method (algorithm) to solve arbitrary Diophantine equations was surprising for me.

-

One of the most surprising results I have ever seen is the Universality Theorem of Voronin which states that any nonvanishing analytic function can be well -approximated by $\zeta(s)$ somewhere in the critical strip for $0 < Re(s) < 1$.

-

Fractals, especially the ones related to simple dynamical processes like the Mandelbrot set or this eerie Burning ship fractal really still inspire me with awe.

It's not really a mathematical result, but after seeing all the nice entries here, I thought this lighter one would fit in well:

"Young man, in mathematics you don't understand things. You just get used to them."

When I see all the examples here, this dictum by von Neumann comes to mind. I'm always remembered of how true it is.

-

That one can count on and on without end.

(Of course, this surprise was a while ago.)

-

I would not rate this example as surprising, but it did provoke in me a little epiphany when I finally understood it. There is a theorem of category theory that characterizes adjunctions as a pair of functors and a pair of natural transformations satisfying a bunch of equations. Now in some sense, this is a pure formality (the proof is easy), but on the other hand, an adjunction encodes a parameterized universal property, with some implicit quantifiers (over potentially proper classes) floating around. Now think of all the adjunctions you have come across that encode huge amounts of information. The characterization theorem says that this is the same as a pair of 2-cells in a 2-category satisfying a pair of equations. Look, Ma, no quantifiers, no isomorphisms, no nothing. Just a bunch of equations in a 2-category. The single most important concept of category theory and what do we end up with? a pair of equations...

-

Gold's theorem provides pretty convincing mathematical evidence supporting the universal grammar hypothesis in linguistics. This hypothesis is two-fold: (1) children are not presented logically with enough information to actually learn their native language; (2) hence there exists a universal grammar which is encoded somehow in the human brain and which facilitates the logical gap between the positive data given to the child and the data necessary to determine the language's grammar. While the universal grammar hypothesis isn't universally accepted, it has been one of the most important ideas in linguistics so far.

Gold's theorem shows that certain classes of languages are logically not learnable. Of course, it operates in a purely formal setting. I'll provide up this setting now following the definitions and notations of Gabriel Carroll, pg. 41.

Start with a finite alphabet $\Sigma$ and let $\Sigma^*$ designate the set of finite sequences of elements of $\Sigma$. A language $L$ is a subset of $\Sigma^*$. A text of $L$ is an infinite string $w_1, w_2, \dots$ of elements of $L$ such that every element of $L$ occurs at least once. A learner for a class $\mathcal{L}$ of languages is a function $\Lambda : (\Sigma^*)^* \rightarrow \mathcal{L}$ that intuitively takes a sequence of strings of $\Sigma$ and guesses the language in $\mathcal{L}$ in which all these strings are grammatically correct. The learner $\Lambda$ learns the language $L \in \mathcal{L}$ if for every text $w_1,w_2,\dots$ of $L$ there exists a natural number $N$ such that $\Lambda(w_1,w_2,\dots,w_n) = L$ for $n \geq N$. The learner $\Lambda$ learns the class $\mathcal{L}$ if it learns each language in $\mathcal{L}$, and the class $\mathcal{L}$ is learnable if there exists a learner which learns it.

This is Gold's theorem, first proved by Gold in his seminal paper (but my wording is taken from Carroll):

• If the class $\mathcal{L}$ contains all finite languages and at least one infinite language, then $\mathcal{L}$ is not learnable.

In particular, any finite language is regular. Hence the class of regular languages is unlearnable, and it follows at once that every class of the Chomsky Hierarchy is unlearnable.

The proof of Gold's theorem is, as Carroll shows, not very hard, although certainly not intuitive, and it can be reduced to a corollary of the following characterization of learnable classes of languages (Carroll, Lemma 9):

• A countable class $\mathcal{L}$ of nonempty languages is learnable if and only if, for each $L \in \mathcal{L}$, there is a finite ''telltale'' subset $T \subseteq L$ such that $L$ is minimal in $\{L' \in \mathcal{L} : T \subseteq L'\}$.
-

Kuratowski's Complement problem, is the one which i came across recently, and i was clearly flabbergasted.

-

I was very surprised when I discovered that $$0.\overline{9} = 1$$

-

While not as surprising as, say, the countability of the rationals, and even fairly obvious to some people, the fundamental theorem of calculus joins two operations (differentiation and integration) which didn't look completely related to each other at first to me if you define them as the rate of change of a curve and the area beneath it.

-
The rate of change of the area beneath a curve is the area of an infinitesimally thin rectangle whose height is the value of the function defining the curve. Many people get taught the fundamental theorem of calculus without ever being introduced to this intuitive picture. –  Qiaochu Yuan Oct 7 '10 at 13:47

The primitive element theorem is quite surprising.

Theorem: Let $E \supseteq F$ be a finite degree separable extension. Then $E=F[\alpha]$ for some $\alpha \in E$.

-

When young, that there exist dense sets with zero measure and smaller cardinality, and later that there exist nowhere dense sets with positive measure.

-

The infinitude of primes! – and the simplicity of its proof!

-
If it weren't for me stumbling at this result while browsing wikipedia, I doubt that I would even have math.SE account right now. This result and its proof showed me that there is a world of elegance and beauty in mathematics, contrary to what I gathered from HS mathematics classes. –  user5501 May 21 '11 at 15:24

It seems weirdly arbitrary to me that you can comb a hairy n-sphere if n is odd, but that this is impossible when n is even.

-
But seems to be similar to the fact that a polynomial with real coefficients alwasys has a real root if the degree of the polynomial is odd, but there is no such guarantee if the degree is even:-) –  Mike Jones May 21 '11 at 0:57

One surprise for me -- What is the optimal way to cover an equilateral triangle with two squares?

It wasn't solved correctly until 2009. http://www2.stetson.edu/~efriedma/squcotri/

-

The fact the every set can be well-ordered (given the Axiom of Choice, of course).

-

Wedderburn’s Theorem: Every finite division ring is a field.

Why should finiteness imply commutativity???

(Background: The only way a division ring can fail to be a field is if its multiplication is not commutative.)

-
Mike: you have indeed many "one result that surprised you the most" :) –  t.b. May 21 '11 at 1:12
At different times:) - Remember the one about being able to count on and on and on:) –  Mike Jones May 21 '11 at 7:33

(Mazur) If $E$ is an elliptic curve over $\mathbf{Q}$ then the torsion subgroup of $E(\mathbf{Q})$ is one of

$\mathbf{Z}/N\mathbf{Z}$ for N=1,2,3,4,5,6,7,8,9,10,12

or

$\mathbf{Z}/2\mathbf{Z} \times \mathbf{Z}/N\mathbf{Z}$ for N=1,2,3,4

I find it very surprising that there are so few possibilities for the rational torsion on an elliptic curve. It's also strange to see every number from 1 through 12 except 11 in that first list.

-

How about the Anti-Calculus Proposition (Erdős): Suppose $f$ is analytic throughout a closed disc and assumes its maximum modulus at the boundary point $a$. Then $f^\prime(a)$ is not equal to $0$ unless $f$ is constant. (Source: Bak & Newman, Complex Analysis 2nd ed.)

-

The connection between syntax and model theory. For example, you can tell that you can't define "field" (the algebraic structure) by equations because the category of fields doesn't have products. In other words, a property of the models controls the logical connectives you must use to say what it is. There are many results like this.

-

To me the Cayley-Salmon theorem is an example of a result that still strikes me as rather surprising.

Theorem(Cayley-Salmon)

A smooth cubic surface $\mathcal{S} \subset \mathbb{P}^{3}_{k}$ contains exactly 27 lines, where $k$ is an algebraically closed field.

Here is a link to some history about it. There's a really nice treatment of this result in chapter 5 of Klaus Hulek's book Elementary Algebraic Geometry.

-

Apart from the above sets of interesting and surprising results, this one should also be mentioned.

An $n$ point Gaussian quadrature rule, yields an exact result for polynomials of degree $2n − 1$ or less.

-

I was very surprised to learn about the Cantor set, and all of its amazing properties. The first one I learnt is that it is uncountable (I would never have told), and that it has measure zero.

I was shown this example as a freshman undergraduate, for an example of a function that is Riemann-integrable but whose set of points of discontinuity is uncountable. (equivalently, that this set has measure zero). This came more as a shock to me, since I had already studied some basic integrals in high school, and we had defined the integral only for continuous functions.

Later, after learning topology and when learning measure theory, I was extremely shocked to see that this set can be modified to a residual set of measure zero! I think the existence of such sets and the disconnectednes of topology and measure still gives me the creeps...

-

The use of compactness to show existence of solutions to differential equations. It was not surprising as in unexpected, but in the sense that it opened so much possibility almost unreal. It felt like I was given an amazing super toy that can never be destructed.

-

When I was a freshman at the University of Rome I took a course in Geometry in which some projective geometry was covered. I was really amazed by two facts:

1. a Moebius strip sits inside the real projective plane.

2. the group of rotations of the real plane fixes two (complex) lines and all the circumferences pass through the points at infinity of these two lines (the socalled cyclic points). A few years later I realized that I was the only grad student in David Eisenbud's class at Brandeis to know this (actually simple) fact!

-

that properties of recursive function are not always provable. For example, existence of an algorithm which non-terminates and whose non-termination cannot be proved.

-