For Programmers: Free Programming Magazines  


Home > Archive > Functional > August 2007 > category theory: brouwer's fixed point theorem









You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

 

Author category theory: brouwer's fixed point theorem
Thant Tessman

2007-08-15, 7:11 pm


I'm having trouble with the exercises in Session 10 of Lawvere and
Schanuel.

Let j : C -> D be the inclusion of a circle into the disc. Suppose we
have two continuous maps f : D -> D and g : D -> D, and that g satisfies
g o j = j. Use the retraction theorem to show that there must be a point
x in the disk at which f(x) = g(x). Hint: The fixed point theorem is the
special case g = 1D.

The retraction theorem says: Given f : A -> B, a retraction for f is a
map r : B -> A for which r o f = 1A.

The retraction in our case is presumably:

r : D -> C

And by the retraction theorem we have:

r o j = 1C

I think I know what all these words mean, but I have no clue where to
take it from here, and this feels like an important point. I'd be
grateful for a clue.

-thant
Achim Blumensath

2007-08-16, 4:31 am

Hello,

Thant Tessman wrote:
> Let j : C -> D be the inclusion of a circle into the disc. Suppose we
> have two continuous maps f : D -> D and g : D -> D, and that g satisfies
> g o j = j. Use the retraction theorem to show that there must be a point
> x in the disk at which f(x) = g(x). Hint: The fixed point theorem is the
> special case g = 1D.
>
> The retraction theorem says: Given f : A -> B, a retraction for f is a
> map r : B -> A for which r o f = 1A.


This seems to be the definition of a retraction, not the retraction
theorem. My guess would be that the "retraction theorem" is the
statement:

There exists no retraction from D to C, i.e., j has no left inverse.

> I think I know what all these words mean, but I have no clue where to
> take it from here, and this feels like an important point. I'd be
> grateful for a clue.


Assuming that f(x) <> g(x), for all x, try to construct a retraction
from D to C.

Achim
--
________________________________________
________________________________
| \_____/ |
Achim Blumensath \O/ \___/\ |
TU Darmstadt =o= \ /\ \|
www.mathematik.tu-darmstadt.de/~blumensath /"\ o----|
________________________________________
____________________________\___|
Sponsored Links







Also available: Server administration forum archive | Web Design forum archive | Software forum archive | Hardware reviews archive

Copyright 2009 codecomments.com