This post will make sense only if you are reading along with a copy of Billingsley’s Probability and Measure, 3rd edition. This is for my future self and my brothers and sisters in Billingsley who may arrive here via Google.
At the beginning of the proof of Theorem 31.4 Billingsley says
… let An = ∩ (A∩I), where the intersection extends over the intervals I = (u, v] for which u, v ∈ E, 0 < λ(I) < n−1, and
μ(I) < (α+ϵ)λ(I)
A little thought shows that this cannot possible work. Take F(x) = x, α = 2, A = ℝ and E = ℚ. Then the intersection defined in An will be empty for all n since for any x ∈ ℝ there is an arbitrarily small interval Ix with rational end-points such that x ∉ Ix.
I think that the proof can be fixed if we replace the definition of An by
… let An = ∩ (A∩Ic), where the intersection extends over the intervals I = (u, v] for which u, v ∈ E, 0 < λ(I) < n−1, and
μ(I) ≥ (α+ϵ)λ(I)
with the understanding that if there is no I meeting these conditions then An = A.
The rest of the proof of part (i) can continue as it is. Under our new definition An is still a Borel set and it is now actually the case that An ↑ A.
After equation (31.20) we can argue that if Ink does meets An it cannot be one of those I over whose complements the intersection is taken in the definition of An. But since Ink has end-points in E and λ(Ink) < n−1 it must then necessarily be the case that
μ(I) < (α+ϵ)λ(I)
This is what we need for the next displayed equation in the book.
The proof of part (ii) can be modified similarly.