How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Rapid filters are not Lebesgue measurable
Statement
Every rapid filter on , regarded through characteristic functions as a subset of Cantor space with coin measure (and hence through the standard coding as a real set), is not Lebesgue measurable.
Facts & Assumptions
Given: A filter on extending the Fréchet filter that is rapid in the sense of the definition item, viewed as .
Rapid filters and the Raisonnier family: rapidity and its uniform-bounding form.
Dyadic coding supplies coin measure and its completed Lebesgue transfer: the coin measure on Cantor space, its completion, and the transfer to Lebesgue measure through the standard coding.
Filter on a set: is upward closed, closed under intersections, and does not contain .
Lebesgue density theorem: almost every point of a measurable set of positive measure is a density point, so for every measurable and the open set covers modulo a null set.
Lambda-systems, or Dynkin systems with Dynkin's pi-lambda theorem: Dynkin's - theorem, used for the zero-one law below. Countable additivity and continuity from below are part of [F2].
The Axiom of Countable Choice (): the ambient choice hypothesis of this page, used through [F2] and [F4].
Proof
Assume for contradiction that is measurable for the coin measure . Since extends the Fréchet filter, it is closed under finite changes: if and differs from only below , then and is contained in , so . Membership in therefore depends only on the coordinates at and above any fixed level .
To contradict nullity, fix an arbitrary closed with . The density theorem supplies a finite nonempty family of binary strings such that every satisfies For example, enumerate canonically the positive-length strings satisfying the display and take the first one whose cylinder meets . Put .
Zero-one law: for each , the measurable tail event is independent of the sigma-algebra generated by the first coordinates. Hence the family of measurable satisfying contains every finite-coordinate cylinder. It is a lambda-system, while the cylinders are a generating pi-system, so [F5] makes the family the whole Borel sigma-algebra and then its completion. Taking gives , hence .
Recursively, after finite nonempty and are fixed, let be the canonically enumerated set of strings with and The density theorem gives . Let be the first finite initial segment of this enumeration for which and put . These choices are canonical, and every length in exceeds , so .
The value is not one. The complement map is measure preserving, and : otherwise a filter would contain both and its complement and hence their empty intersection. If , then , contradicting additivity. Thus the assumed measurable filter is null.
Apply rapidity to the increasing function . There is such that for every .
Choose any whose cylinder meets ; the canonical first such member suffices. Recursively suppose has been chosen and has value on every coordinate in . Put The coordinates defining lie above those defining , so the two events are independent, and step 3.2 gives . The density bound for and therefore give For use the bound in step 1.2; for the defining bound on in step 2.2 is exactly the displayed conditional error. The uncovered part of at level has measure below , so choose and then the canonical with . Since both strings are initial segments of and , we have ; the definition of preserves the induction invariant.
Let . The points converge to , because both and extend and the string lengths tend to infinity; closedness gives . The induction invariant and unbounded lengths give , so by upward closure. Thus every closed positive-set meets .
Hence has positive outer measure: if it had outer measure zero, an open with would have a closed positive complement missing , contrary to step 5.1. This contradicts from step 3.1. The assumption of measurability is false, and [F2] transfers the conclusion to Lebesgue measure under the standard coding.
Depends on
Used by
Dependency tree · two levels
42 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Hiromi Ishii, Regularity Properties and Inaccessible Cardinals (standard reference, not scraped)