MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A version of the Borsuk--Ulam theorem states that a continuous antipodal map from the M-sphere into euclidean N-space has a zero provided that M is at least N. Clearly the general case follows from the case when M = N. But is the case when M >> N any easier to prove than the equidimensional case?

share|cite|improve this question
Are you asking if there is a direct and easier proof when $M >> N$? – Somnath Basu Jan 5 '11 at 14:38
(Hi Tony!) Please explain: why do you expect the proof to be easier when M>>N? – Piero D'Ancona Jan 5 '11 at 14:44
It's a shame about that answer, as the question was a very nice one. I suppose there's still just about room for the optimist to wonder whether there is a short proof of the Borsuk--Ulam theorem that starts by proving it in very high dimensions. – gowers Jan 5 '11 at 17:53
Hi Tony! Could you specify what you mean by "easier", ie are you looking for a proof that doesn't appeal to the fact that an antipode-preserving map $f\colon S^n\to S^n$ is of odd degree, therefore homotopically non-trivial? – Mark Grant Jan 5 '11 at 22:39
Tim, there is a relatively short argument via dimensional reduction which is a hybrid of one of Shchepin's together with a low-dimensional argument reminiscent of the Stokes' theorem proof of the Brouwer fixed point theorem. See and click on Notes on the Borsuk--Ulam theorem. – Tony Carbery Jan 6 '11 at 15:05
up vote 4 down vote accepted

I don't think so, since any antipodal (non-existent) map $S^n\to S^{n-1}$ would easily be "suspended" to an antipodal map $S^{n+1}\to S^n$. Iterating and composing would then yield antipodal maps $S^m\to S^{n-1}$ with arbitrarily large $m$. The $n=2$ case is somewhat easier though.

share|cite|improve this answer
..and the case $n=1$ and is even easier. – Moritz Firsching Oct 3 '13 at 10:18

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.