If you are looking for a weaker inner reflection principle, does P((a<P(┌φ┐)<b)→P(┌a−ϵ<P(┌φ┐)<b+ϵ┐)=1)=1 for some finite ϵ sound viable, or are there fatal flaws with it?
This came about while trying to figure out how to break the proof in the probabilistic procrastination paper. Making the reflection principle unable to prove that P(eventually presses button) is above 1−ϵ came up as a possible way forward.
If you replace the inner “=1” by “>1−ϵ”, then the literal thing you wrote follows from the reflection principle: Suppose that the outer probability is <1. Then
P[(a<P[φ]<b)∧P[a−ϵ<P[φ]<b+ε]≤1−ϵ]>0.
Now, P[a<P[φ]<b]>0 implies P[a≤P[φ]≤b]>0, which by the converse of the outer reflection principle yields a≤P[φ]≤b, whence a−ϵ<P[φ]<b+ϵ. Now, by the forward direction of the outer reflection principle, we have
P[a−ϵ<P[φ]<b+ϵ]=1>1−ϵ,
which, by the outer reflection principle again, implies
P[P[a−ϵ<P[φ]<b+ϵ]>1−ϵ]=1,
a contradiction to the assumption that ⋯≤1−ϵ had outer probability >0.
However, what we’d really like is an inner reflection principle that assigns probability one to the statement *quantified over all a, b, and Gödel numbers ┌φ┐. I think Paul Christiano has a proof that this is impossible for small enough ϵ, but I don’t remember how the details worked.
Here is the basic problem. I think that you can construct an appropriate liar’s sentence by using a Lipschitz function without an approximate fixed point. But someone might want to check that more carefully and write it up, to make sure and to see where the possible loopholes are. I think that it may not have ruled out this particular principle, just something slightly stronger (but the two were equivalent for the kinds of proof techniqeus we were considering).
If you are looking for a weaker inner reflection principle, does P((a<P(┌φ┐)<b)→P(┌a−ϵ<P(┌φ┐)<b+ϵ┐)=1)=1 for some finite ϵ sound viable, or are there fatal flaws with it?
This came about while trying to figure out how to break the proof in the probabilistic procrastination paper. Making the reflection principle unable to prove that P(eventually presses button) is above 1−ϵ came up as a possible way forward.
If you replace the inner “=1” by “>1−ϵ”, then the literal thing you wrote follows from the reflection principle: Suppose that the outer probability is <1. Then
P[(a<P[φ]<b)∧P[a−ϵ<P[φ]<b+ε]≤1−ϵ]>0.
Now, P[a<P[φ]<b]>0 implies P[a≤P[φ]≤b]>0, which by the converse of the outer reflection principle yields a≤P[φ]≤b, whence a−ϵ<P[φ]<b+ϵ. Now, by the forward direction of the outer reflection principle, we have
P[a−ϵ<P[φ]<b+ϵ]=1>1−ϵ,
which, by the outer reflection principle again, implies
P[P[a−ϵ<P[φ]<b+ϵ]>1−ϵ]=1,
a contradiction to the assumption that ⋯≤1−ϵ had outer probability >0.
However, what we’d really like is an inner reflection principle that assigns probability one to the statement *quantified over all a, b, and Gödel numbers ┌φ┐. I think Paul Christiano has a proof that this is impossible for small enough ϵ, but I don’t remember how the details worked.
Here is the basic problem. I think that you can construct an appropriate liar’s sentence by using a Lipschitz function without an approximate fixed point. But someone might want to check that more carefully and write it up, to make sure and to see where the possible loopholes are. I think that it may not have ruled out this particular principle, just something slightly stronger (but the two were equivalent for the kinds of proof techniqeus we were considering).