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.
Boldface Sigma-one-three measurability
Definition
Work in Cantor space , with auxiliary real quantifiers ranging over Baire space as in Cantor and Baire sequence spaces and coordinate codings. Fix a real parameter .
A set is when membership in has the form
where range over Baire space and is arithmetic: all its quantifiers are number quantifiers and its atomic statements are those of a fixed recursive decoding of the sequences involved. Thus the leading real quantifiers are one existential, one universal and one existential, the last being the one that may be dummy. A set is boldface when it is for some real , and the regularity assertion boldface -measurability means that every such set belongs to the completed coin-measure domain specified below.
The measured domain. In applications assume Countable Choice (The Axiom of Countable Choice ()). The proof of Dyadic coding supplies coin measure and its completed Lebesgue transfer uses DC only in its step 1.2 to derive Countable Choice; after that step, its cylinder-pullback construction of the Borel coin probability uses only the resulting Countable Choice hypotheses. Thus the same construction is available directly under the present assumption. Write for its Borel sigma-algebra. Define For such a representation put . This is exactly the completion construction of The completion domain and proposed completed set function of a measure space, so Assuming countable choice, every measure space has a unique complete extension to its completion proves that this value is independent of the representation and is a complete measure on the displayed sigma-algebra. Thus the regularity assertion is precisely The dyadic lemma supplies the Borel measure; the completion theorem supplies its completed domain and measure. No completion or measure transport is inferred from a homeomorphism between sequence spaces.
Elementary codings. Coordinate pairing gives the homeomorphisms and , so finite or countable tuples of the respective real codes may be folded into one code. The published map from is a homeomorphism only onto the subspace of sequences with infinitely many s; no homeomorphism and no measure transport along that subspace map is asserted here. Adding a dummy final existential real quantifier shows that every subset of is : prefix a redundant and ignore in . This inclusion is the one used below when a -measurability hypothesis is applied to the null-code order. The quantifier-prefix definition uses no choice. The measured interpretation above is used under Countable Choice, which licenses both the Borel coin-measure construction and its completion.
Depends on
- Analytic and coanalytic sets by closed projection
- Cantor and Baire sequence spaces and coordinate codings
- Dyadic coding supplies coin measure and its completed Lebesgue transfer
- Lebesgue measurable sets, the family $\mathcal{L}(\mathbb{R}^n)$, and the restricted set function $\lambda_n$
- The completion domain and proposed completed set function of a measure space
- Assuming countable choice, every measure space has a unique complete extension to its completion
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- A measurable null-code order bounds the constructible null union Lemma
- The Raisonnier family is a Sigma-one-three filter Lemma
- All-real-set measurability yields an inaccessible inner model Theorem
- Exact equiconsistency of universal measurability and an inaccessible Theorem
- Sigma-one-three measurability makes omega-one inaccessible in L Theorem
- Uniform null-code measurability makes the Raisonnier filter rapid Theorem
Dependency tree · two levels
37 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)
- Terence Tao, An Introduction to Measure Theory, Exercise 1.4.26, p. 94 (standard reference, not scraped)