Throughout, the maps below given by formulas (the choice map σ of Step 1, the map τ of Step 2 and the sequence of Step 3) are maps by Maps and Relations Given by Formulas (i) and Maps and Relations Given by Formulas (ii), their formulas being predicative (The Graph Reading of a Formula Tree Is Predicative and Agrees with Its Reading, So the Reading Is Predicative (iii)). Let P={(c,e)∈R×R:c<e}; for (c,e)∈P we write [c,e] for the closed interval. Closed intervals are Borel (Intervals Are Borel, and Rays, Half-Open Intervals and Rational Intervals Generate the Borel Sigma-Algebra of the Real Line (ii)), so g−1([c,e])∈F, and μ(g−1([c,e])) is a real number since μ is finite.
Step 1 (keeping the lighter third). Let (c,e)∈P and J=[c,e], and consider the outer thirds
J1=[c, 32c+e],J2=[3c+2e, e].
Both are closed intervals of positive length contained in J, and they are disjoint, as 32c+e<3c+2e. Hence g−1(J1) and g−1(J2) are disjoint subsets of g−1(J), and by monotonicity and the rule for differences (Basic Properties of a Measure (iii), Basic Properties of a Measure (iv))
μ(g−1(J2))≤μ(g−1(J)∖g−1(J1))=μ(g−1(J))−μ(g−1(J1)).
Let σ(c,e)∈P be the pair of endpoints of J1 if μ(g−1(J1))≤μ(g−1(J2)), and of J2 otherwise. Writing J′ for the interval so chosen, J′⊆J and
2μ(g−1(J′))≤μ(g−1(J1))+μ(g−1(J2))≤μ(g−1(J)).
Step 2 (nested intervals and a null level). Let (c,e)∈P. By recursion on N (Recursion on the Natural Numbers Starting at One (i)) there is a sequence ((cn,en))n∈N in P with
(c1,e1)=(c,e),(cn+1,en+1)=σ(cn,en)(n∈N).
Write In=[cn,en]. By Step 1, In+1⊆In, that is, cn≤cn+1<en+1≤en, and 2μ(g−1(In+1))≤μ(g−1(In)). By induction (Arithmetic and Order of the Natural Numbers (xiii)), cm≤cn and en≤em whenever m≤n; so cm≤cl<el≤en with l the larger of m and n, that is,
cm≤enfor all m,n∈N.
The set {cj:j∈N} is nonempty and bounded above by e1, so it has a supremum t (The Real Numbers Form an Ordered Field in Which Every Nonempty Set Bounded Above Has a Supremum (ii), The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (vii)), and cn≤t≤en for every n, since each en is an upper bound. Hence
{g=t}=g−1([t,t])⊆g−1(In)(n∈N),
and μ({g=t})≤μ(g−1(In)) for every n by monotonicity. The set {μ(g−1(In)):n∈N} of real numbers is nonempty and bounded below by 0, so it has an infimum δ≥0 (Infima, the Archimedean Property, Density of the Rationals and Rational Approximation from Below in an Ordered Field Whose Nonempty Sets Bounded Above Have Suprema (i)), and μ({g=t})≤δ. In fact δ=0: if δ>0, then 2δ is not a lower bound, so μ(g−1(In))<2δ for some n, and then μ(g−1(In+1))≤21μ(g−1(In))<δ, contradicting the choice of δ. Therefore μ({g=t})=0.
The number t depends only on (c,e); write t=τ(c,e). We have shown that τ:P→R satisfies, for every (c,e)∈P,
c≤τ(c,e)≤e,μ({g=τ(c,e)})=0.
Step 3 ((i)). Let a<b. Then (32a+b,3a+2b)∈P, and t=τ(32a+b,3a+2b) satisfies a<32a+b≤t≤3a+2b<b and μ({g=t})=0 by Step 2.
Step 4 ((ii)). Let a∈R. For k∈N, read as a real number (Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set (ii), with 1 and sums preserved by The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products (i) and The Image of the Natural Numbers with Zero in a Commutative Ring Respects Zero, One, Sums, Products, Differences, Powers, and Finite Sums and Products (ii)), put
tk=τ(a+3k1, a+3k2).
The sequence (tk) is the composite of τ with the map k↦(a+3k1,a+3k2) from N to P (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii)). By Step 2, for every k∈N,
a<a+3k1≤tk≤a+3k2<a+k1,μ({g=tk})=0.