Welcome to The Nonlinear Library, where we use Text-to-Speech software to convert the best writing from the Rationalist and EA communities into audio.
This is: Topological Fixed Point Exercises, published by Scott Garrabrant, Sam Eisenstat on the AI Alignment Forum.
This is one of three sets of fixed point exercises. The first post in this sequence is here, giving context.
1. (1-D Sperner's lemma) Consider a path built out of
n
edges as shown. Color each vertex blue or green such that the leftmost vertex is blue and the rightmost vertex is green. Show that an odd number of the edges will be bichromatic.
2. (Intermediate value theorem) The Bolzano-Weierstrass theorem states that any bounded sequence in
R
n
has a convergent subsequence. The intermediate value theorem states that if you have a continuous function
f
0
1
→
R
such that
f
0
≤
0
and
f
1
≥
0
, then there exists an
x
∈
0
1
such that
f
x
0
. Prove the intermediate value theorem. It may be helpful later on if your proof uses 1-D Sperner's lemma and the Bolzano-Weierstrass theorem
3. (1-D Brouwer fixed point theorem) Show that any continuous function
f
0
1
→
0
1
has a fixed point (i.e. a point
x
∈
0
1
with
f
x
x
). Why is this not true for the open interval
0
1
4. (2-D Sperner's lemma) Consider a triangle built out of
n
2
smaller triangles as shown. Color each vertex red, blue, or green, such that none of the vertices on the large bottom edge are red, none of the vertices on the large left edge are green, and none of the vertices on the large right edge are blue. Show that an odd number of the small triangles will be trichromatic.
5. Color the all the points in the disk as shown. Let
f
be a continuous function from a closed triangle to the disk, such that the bottom edge is sent to non-red points, the left edge is sent to non-green points, and the right edge is sent to non-blue points. Show that
f
sends some point in the triangle to the center.
6. Show that any continuous function
f
from closed triangle to itself has a fixed point.
7. (2-D Brouwer fixed point theorem) Show that any continuous function from a compact convex subset of
R
2
to itself has a fixed point. (You may use the fact that given any closed convex subset
S
of
R
n
, the function from
R
n
to
S
which projects each point to the nearest point in
S
is well defined and continuous.)
8. Reflect on how non-constructive all of the above fixed-point findings are. Find a parameterized class of functions where for each
t
∈
0
1
f
t
0
1
→
0
1
, and the function
t
↦
f
t
is continuous, but there is no continuous way to pick out a single fixed point from each function (i.e. no continuous function
g
such that
g
t
is a fixed point of
f
t
for all
t
9. (Sperner's lemma) Generalize exercises 1 and 4 to an arbitrary dimension simplex.
10. (Brouwer fixed point theorem) Show that any continuous function from a compact convex subset of
R
n
to itself has a fixed point.
11. Given two nonempty compact subsets
A
B
⊆
R
n
, the Hausdorff distance between them is the supremum
max
sup
a
∈
A
d
a
B
sup
b
∈
B
d
b
A
over all points in either subset of the distance from that point to the other subset. We call a set valued function
f
S
→
2
T
a continuous Hausdorff limit if there is a sequence
f
n
of continuous functions from
S
to
T
whose graphs,
x
y
∣
y
f
n
x
⊆
S
×
T
, converge to the graph of
f
x
y
∣
f
x
∋
y
⊆
S
×
T
, in Hausdorff distance. Show that every continuous Hausdorff limit
f
T
→
2
T
from a compact convex subset of
R
n
to itself has a fixed point (a point
x
such that
x
∈
f
x
12. Let
S
and
T
be nonempty compact convex subsets of
R
n
. We say that a set valued function,
f
S
→
2
T
is a Kakutani function if the graph of
f
x
y
∣
f
x
∋
y
⊆
S
×
T
, is closed, and
f
x
is convex and nonempty for all
x
∈
S
. For example, we could take
S
and
T
to be the interval
0
1
, and we could have
f
S
→
2
T
send each
x
1
2
to
0
, map
x
1
2
to the whole interval
0
1
, and map
x
1
2
to
1
. Show that every Kakutani function is a continuous Hausdorff limit. (H...
view more