# Can the proof of fixed point theorems ever be constructive?

Overall, Brouwer fixed point theorem and Kakutani fixed theorem are non-constructive. Is there any established paper that demonstrates that there exists constructive proofs that do exactly what these theorems do?

-

Yes, there are constructive proofs for fixed point theorems including Brouwer. Also, the proof of the Banach fixed point theorem with which I am most familiar is constructive. In fact, here is a paper all about constructive methods for fixed point theorems:

-
+1: Nice reference. – copper.hat Jul 24 '14 at 7:08
So that means we can find an algorithm for computing a fixed point? (for irrational numbers, standard interpretation of computing "reals" apply) – Kalami Jul 24 '14 at 13:37
This is not really a constructive proof of Brouwer's FPT. At least in the sense in which constructive mathematics is understood. – Valery Saharov Sep 21 '15 at 20:12