AI ALIGNMENT FORUM
AF

Czynski
Ω9080
Message
Dialogue
Subscribe

Jisk, formerly Jacob. (And when Jacobs are locally scarce, still Jacob.)

LW has gone downhill a lot from its early days and I disapprove of most of the moderation choices but I'm still, sometimes, here.

It should be possible to easily find me from the username I use here, though not vice versa, for interview reasons.

Posts

Sorted by New

Wikitag Contributions

Comments

Sorted by
Newest
0Czynski's Shortform
2y
0
No wikitag contributions to display.
Iteration Fixed Point Exercises
Czynski7y20

For Q2, I believe you aren't done:

You have established that there is at most one fixed point, but not that a fixed point exists.

Reply
Iteration Fixed Point Exercises
Czynski7y20

Q1

We wish to show that the terms of xn form a Cauchy sequence, which suffices to demonstrate they converge in a complete space. Take m,n∈N+, and WLOG m<n. Then we know from the definition of contraction that d(xm,xn)≤qm⋅d(x0,xn−m). This converges to 0 as m increases, so the sequence is Cauchy.

It's easy to see that this makes the rate of convergence between terms of the Cauchy sequence exponentially quick. Intuitively that seems like it ought to make the sequence converge to its limit with the same speed, but I don't think that can be made rigorous without more steps.

Q2

Take a sequence {xn=fn(x0)}. This converges to some L. Suppose L was not a fixed point. Then choose an ϵ=(L−f(L))/10 . A sequence {xn} which converges to a limit has, for every ϵ, some N such that ∀n>=N:|xn−L|<ϵ. Then we know that d(xN,L)<ϵ but d(f(xN),f(L))>ϵ , contradicting the contraction condition. So there is at least one fixed point, L.

Suppose there are two fixed points, f(x)=x, f(y)=y for distinct x and y. If so, d(f(x),f(y))=d(x,y), which again contradicts the contraction condition. So there is at most one fixed point.

Q3

Take as the space {n∈R+:n≥1}, with the usual metric. Define f(x)=x2+1x. This is a weak contraction (toward infinity) and has no fixed points within this space.

Reply
Topological Fixed Point Exercises
Czynski7y20

I hit that stumbling block as well. I handwaved it by saying "continue iterating until you have x(k,B) and x(k,G) such that f(xk,B)<0, f(xk,G)≥0, and f has no local maxima or local minima on the open interval (xk,B,xk,G)", but that doesn't work for the Weierstrass function, which will (I believe) never meet that criterion.

Reply
Diagonalization Fixed Point Exercises
Czynski7y10

My nontrivial answer for Q7, in Python:

with open("foo.py", "r") as foo:
print foo.read()

And for Q8:

def f(string):
return ''.join([chr(ord(c)+1) for c in string])

with open("foo.py", "r") as foo:
print f(foo.read())

Reply
Diagonalization Fixed Point Exercises
Czynski7y20

Ah, yes, that makes sense. I got distracted by the definition of Cont(A,B)'s topology

and applied it to surjectivity as well as continuity.

Reply
Diagonalization Fixed Point Exercises
Czynski7y30

For #6, I have what looks to me like a counterexample. Possibly I am using the wrong definition of continuous function? I am taking this one as my source.

Take as the topological space X the real line under the Euclidean topology. Let f′(x,y) be the point in S1 at (x+y) radians rotation. This is surjective; all points in S1 are mapped to infinitely many times. It is also continuous; For every (x,y)∈X,X and neighborhood N(f′(x,y)) there is a neighborhood M(x,y) such that ∀p∈M, f(p)∈N

The partial functions f(x) from X→S1 are also continuous by the same argument.

Reply
Diagonalization Fixed Point Exercises
Czynski7y20

I am confused by the introductory statement for #9. Is this an accurate rephrasing?

By representing syntax using arithmetic, it is possible to define a function f as follows:

Define f(s∈S1,t∈S1) with image in S0, such that:
f substitutes the Goedel-number of t into s (creating s′) and then substitutes the Goedel-number of s′ into some fixed formula to get a result in S0.

Reply
Diagonalization Fixed Point Exercises
Czynski7y10

Minor correction for #7: You probably want to say "nonempty quine" or "nontrivial quine". The trivial quine works in many languages.

Reply
No posts to display.