Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. E. Glazer, Erdős Problem 501 after adding random reals, draft rev10, Lemma 4.2 (factorization, stated on p. 5 and cited to the literature) and Lemma 4.5 (fresh-profile fullness), physical p. 6, in the eight-page PDF held by its library source card, Glazer (2026).
Standing. This is an author-recorded reconstruction. It is not an independent review and changes no status and assigns no tier. Lemma 4.2 is imported below exactly as the source states it; the conventions (R1)--(R5) of the Lemma 4.1 page are assumed. One measurability point that the source folds into "by Fubini" is labeled and closed with a repository-supplied remark.
Imported: Lemma 4.2 (factorization)
The following is provable in ZFC. If and are disjoint coordinate sets, then is the completed product of and : is the completion of the product measure on , so Fubini and Tonelli apply to -measurable sets. In particular, if is -generic over , then is -generic over and is -generic over ; the analogous statement holds for finite and countable families of pairwise disjoint coordinate sets. The source cites M. Laczkovich and A. W. Miller, Measurability of functions with approximately continuous vertical sections and measurable horizontal sections, Colloq. Math. 69 (1996), 299--308, Fact 1 in the proof of Lemma 8. That paper is not held and its proof is not reconstructed here.
Definitions
Let be an uncountable family of pairwise disjoint countable coordinate sets, each identified with a fixed countable set through a bijection , and let be a further coordinate set disjoint from every petal. Put and force with . The normalized generic point on is the name
In the extension, is the fair-coin product measure on and its outer measure; names .
Statement
The following is provable in ZFC. With the notation above,
(the source's (4.3)).
Proof
Reduction. In any model, a set has if and only if some Borel has and (take to be the complement of a Borel superset of of measure below one, and conversely). Suppose the statement fails. Then some condition forces that such a exists for , and, by inner regularity of in the extension, that some closed such exists. Fix an enumeration of the basic clopen subsets of and, for , put : every codes a closed set, every closed is for , and the relation is closed in . By the maximum principle (R3) there is a name for an element of , mixed with a fixed default off so that ; write , so that
Since forces that some positive rational lies below , strengthen to a condition deciding one: fix a rational with (the source's (4.4); the source keeps Borel, given by a Borel code, see the labeled point below).
A fresh petal. By Lemma 4.1 and (R1), a countable supports and reads through a Borel map . The petals are pairwise disjoint, so only countably many of them meet the countable set ; as is uncountable, choose with .
Factor over and . For let , a closed set, and consider
where is identified with a Borel subset of supporting it. The set is Borel, being , and so is the base of the cylinder . By (R2), (R4) and the identity , the Boolean value is the class . By Lemma 4.2 applied to , and the rest of , together with Tonelli's theorem for the completed product,
(the source's (4.5), with computed through on ). For -almost every , : otherwise the Borel set , Borel because is a Borel function, has positive measure, and as a condition of below it forces, by (R2), , contradicting the choice of . Hence
Contradiction. So is a nonzero condition, , and . But and , so . This is impossible. Therefore no condition forces ; equivalently, the complement of contains no positive Borel set, and .
Labeled point (compilation remark). The source takes to be a Borel set given by a Borel code and folds both the measurability of and the transfer of the ground-model measure computation into the forcing relation into "by Fubini". The proof above shrinks to a closed set first, a step the source does not take and not an author-issued correction: with closed codes every is a code, is Borel, both appeals to (R2) are within its hypotheses, and (R1)--(R4), Lemma 4.2 and Tonelli's theorem for the completed product suffice. With general Borel codes the set of codes is coanalytic and not Borel, so , and are only coanalytic; they are still universally measurable (A. S. Kechris, Classical Descriptive Set Theory (1995), Chapters 29 and 35), so the display for stands, but the two appeals to (R2) then need an import beyond (R1)--(R5): for a coanalytic coded in , take in a Borel with ; the inclusion holds in by Mostowski's absoluteness theorem (T. Jech, Set Theory, third millennium edition, Chapter 25), so the condition forces by (R2), which is what both steps use.
Boundary. The lemma is applied in Theorem 5.1 to the petals of Proposition 4.4, with the remaining coordinates of ; there the uncountability of is in the ground model, which is all the proof uses.