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.
Solovay measure on all ground-set subsets in a supplied generic extension
Statement
Assume ZFC. Let be a transitive set model of ZFC in which is an uncountable cardinal, , is a proper -complete ultrafilter on a set , and is a probability space with probability algebra . All these parameters and their indicated properties are computed in . Supply an -generic filter on the nonzero elements of . Put , with actual subset inclusion.
There exist such that is a function on exactly , with values real lower cuts in , , and . It extends the ground ultrafilter measure: for with , if and otherwise. Every disjoint sequence belonging to , with all , has its union in and satisfies
For every ground ordinal and every family in , if for all , then its union belongs to and has measure zero. These are assertions for all subsets and indexed families present in this supplied extension, not only ground subsets or ground families. They do not assert that arbitrary external subsets or sequences belong to , that is preserved, that the extension satisfies ZFC, or a formal consistency implication.
Facts & Assumptions
Given: The supplied transitive , probability algebra, complete ultrafilter and generic of the statement. All Boolean vector tables and density choices below are made inside .
Every vector in has a unique density class, with locality, indicator constants, localized disjoint countable sums, and the Boolean inequality for fewer than zero sets. (Solovay densities and localized small null joins)
A bounded nonnegative density has a rational-cut name; its evaluation is independent of null modifications, respects locality and countable sums, and is zero exactly when its zero-set class belongs to . (Generic evaluation of bounded measurable functions by rational cuts)
Each fixed membership formula is true of name valuations exactly when its internally computed Boolean value is in . (Boolean truth for a supplied generic extension)
is a proper Boolean ultrafilter and selects ground joins and ground meets. (Generic Boolean filters select ground-model joins)
Check names evaluate to the corresponding ground sets and belong to the ground model. (Check-name evaluation and reconstruction of G)
is transitive; the assertion does not require axiom preservation. (Transitivity and a valuation rank bound)
Kuratowski-pair and function-evaluation relations have bounded absolute definitions between transitive domains when their objects are present. (Absolute basic set operations and relations)
AC in chooses representatives of the set-indexed density classes and supplies the analytic prerequisites of F1. (The Axiom of Choice)
Proof
Let , a set in . For form . This is a name in by internal Replacement. F5 and valuation give . Conversely, for any with , take one name whose valuation is . Internal definability of the fixed atomic Boolean value gives the vector in . F3 says iff , so . No simultaneous choice of a name for all such was used. The name evaluates exactly to , so this full collection belongs to without an appeal to its Power Set axiom.
Internally apply F1 to all , and select measurable -valued representatives by F8. Their assignment is a set function in . F2 supplies the associated rational-cut names as a set-indexed assignment. For any two names , the name evaluates to the unordered pair of their valuations since . Therefore evaluates to their Kuratowski ordered pair. These finite constructions are internal set operations and yield names in . Define the graph name . Its valuation is the relation , which belongs to .
If , then for every either both belong to or neither does. Ultrafilterhood puts in . The family is a ground family, so its meet belongs to by F4, even when is large. Since , Boolean distributivity gives for every . F1 locality gives almost everywhere on , and F2 gives . Consequently the relation from step 1.2 is a function on exactly . Null modifications of the selected representatives do not change its values, by F2. Every value is between zero and one, by the same evaluation lemma.
Let be an ordinal and let be a function with values in . Take a single name for its graph. For , define , where the ordered-pair expression abbreviates its membership-language definition. This is a ground table by internal Replacement and fixed-formula definability in F3. F6 ensures transitivity of , F5 supplies there, and step 1.2 supplies its finite-pair closure. Thus F7 identifies the displayed pair formula with actual ordered pairs. Since the valuation of is the actual graph , F3 proves iff . Hence all family members are represented simultaneously by this single ground table. This conclusion does not assume that the family itself belongs to .
For a ground , use the vector on and zero elsewhere, which evaluates to . F1 says its density is almost everywhere constant one or zero according as or not. F2 evaluates those constants to themselves, proving the extension assertion. A proper ultrafilter contains and excludes the empty set, so in particular and . Properness also rules out the degenerate case .
Put internally. F4 gives iff some , because each coordinate's joined family belongs to . Thus , and this union lies in by step 1.1. For the vector is constantly zero and the union empty. This works for any ground ordinal ; no completeness property of has been used in this union calculation.
Suppose now and the are disjoint. For each and , the element lies in , since otherwise ultrafilterhood would put both coefficients in and hence in both sets. These elements form one ground family, so F4 puts their common meet in . On this , every coordinatewise intersection is zero. F1 then proves almost everywhere on , where is the union vector of step 3.2. The density representatives are a ground sequence of bounded nonnegative functions, so F2 gives . Step 2.1 identifies these values with and , respectively. This proves the asserted countable additivity for every extension sequence in the statement.
Finally let and suppose every . For the ground table of step 2.2, F2 says each zero-set class belongs to . The density assignment and this table are in , so this is a ground family of zero-set classes. F4 places in . Internally F1 gives for the coordinatewise union vector, since there. Upward closure and the reverse zero-test direction in F2 give . Step 3.2 identifies with the required union. For the empty family F1 uses its empty-meet inequality, and step 3.1 already gives the same conclusion; the singleton case gives the original null set. This proves the full stated indexed null closure without taking an uncountable union of exceptional measurable null sets.
The names in steps 1.1–1.2 witness that both the full subset collection and its measure graph are elements of . Steps 2.2–4.2 cover new indexed families by one ground Boolean table, rather than by an assumption that the new family is ground. Their only cardinal comparison is the ground comparison ; preservation of and its relation to the new continuum are not conclusions here. AC was used for the ground set of density representatives and the prerequisites in F1, as specified in F8. Every other selected name was one existential witness. The argument proves exactly the supplied-model statement, with no inference from it to formal Con.
Depends on
- Solovay densities and localized small null joins
- Generic evaluation of bounded measurable functions by rational cuts
- Boolean truth for a supplied generic extension
- Generic Boolean filters select ground-model joins
- Check-name evaluation and reconstruction of G
- Transitivity and a valuation rank bound
- Absolute basic set operations and relations
- The Axiom of Choice
Used by
Dependency tree · two levels
30 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
- Bagaria and da Silva, Theorem 2.9 p.8, explicitly sketched source; local completed transitive-model density-name construction (standard reference, not scraped)