Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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 M be a transitive set model of ZFC in which κ is an uncountable cardinal, [0,1]<κ, U is a proper κ-complete ultrafilter on a set I, and (X,Σ,μ) is a probability space with probability algebra B. All these parameters and their indicated properties are computed in M. Supply an M-generic filter G on the nonzero elements of B. Put D={AM[G]:AI}, with actual subset inclusion.

There exist D,ηM[G] such that η is a function on exactly D, with values real lower cuts in [0,1], η(I)=1, and η()=0. It extends the ground ultrafilter measure: for ZM with ZI, η(Z)=1 if ZU and 0 otherwise. Every disjoint sequence (An)n<ω belonging to M[G], with all AnD, has its union in D and satisfies

η(n<ωAn)=n<ωη(An).

For every ground ordinal β<κ and every family (Aξ)ξ<βM[G] in D, if η(Aξ)=0 for all ξ<β, then its union belongs to D 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 M[G], that κ is preserved, that the extension satisfies ZFC, or a formal consistency implication.

Facts & Assumptions

Given: The supplied transitive M, probability algebra, complete ultrafilter and generic G of the statement. All Boolean vector tables and density choices below are made inside M.

[F1]

Every vector in BI 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)

[F2]

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 G. (Generic evaluation of bounded measurable functions by rational cuts)

[F3]

Each fixed membership formula is true of name valuations exactly when its internally computed Boolean value is in G. (Boolean truth for a supplied generic extension)

[F4]

G is a proper Boolean ultrafilter and selects ground joins and ground meets. (Generic Boolean filters select ground-model joins)

[F5]

Check names evaluate to the corresponding ground sets and belong to the ground model. (Check-name evaluation and reconstruction of G)

[F6]

M[G] is transitive; the assertion does not require axiom preservation. (Transitivity and a valuation rank bound)

[F7]

Kuratowski-pair and function-evaluation relations have bounded absolute definitions between transitive domains when their objects are present. (Absolute basic set operations and relations)

[F8]

AC in M chooses representatives of the set-indexed density classes and supplies the analytic prerequisites of F1. (The Axiom of Choice)

Proof

1.1

Let T=(BI)M, a set in M. For aT form σa={iˇ,ai:iI}. This is a name in M by internal Replacement. F5 and valuation give A(a):=valG(σa)={iI:aiG}. Conversely, for any AM[G] with AI, take one name τM whose valuation is A. Internal definability of the fixed atomic Boolean value gives the vector ai=iˇτM in T. F3 says aiG iff iA, so A=A(a). No simultaneous choice of a name for all such A was used. The name D˙={σa,1:aT}M evaluates exactly to D, so this full collection belongs to M[G] without an appeal to its Power Set axiom.

F3F4F5
1.2

Internally apply F1 to all aT, and select measurable [0,1]-valued representatives ha by F8. Their assignment is a set function in M. F2 supplies the associated rational-cut names ρa as a set-indexed assignment. For any two names s,t, the name P(s,t)={s,1,t,1} evaluates to the unordered pair of their valuations since 1G. Therefore K(s,t)=P(P(s,s),P(s,t)) evaluates to their Kuratowski ordered pair. These finite constructions are internal set operations and yield names in M. Define the graph name η˙={K(σa,ρa),1:aT}. Its valuation is the relation {(A(a),(ha)G):aT}, which belongs to M[G].

F1F2F4F8
2.1

If A(a)=A(b), then for every iI either both ai,bi belong to G or neither does. Ultrafilterhood puts ei=(aibi)(¬ai¬bi) in G. The family (ei)iI is a ground family, so its meet c belongs to G by F4, even when I is large. Since cei, Boolean distributivity gives cai=cbi for every i. F1 locality gives ha=hb almost everywhere on c, and F2 gives (ha)G=(hb)G. Consequently the relation from step 1.2 is a function on exactly D. 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.

F1F2F4step 1.1step 1.2
2.2

Let βM be an ordinal and let f=(Aξ)ξ<βM[G] be a function with values in D. Take a single name τM for its graph. For (i,ξ)I×β, define aiξ=yp(p=ξˇ,y  pτ  iˇy)M, 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 M[G], F5 supplies i,ξ 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 f, F3 proves aiξG iff iAξ. Hence all family members are represented simultaneously by this single ground table. This conclusion does not assume that the family f itself belongs to M.

F3F5F6F7step 1.1step 1.2
3.1

For a ground ZI, use the vector ai=1 on Z and zero elsewhere, which evaluates to Z. F1 says its density is almost everywhere constant one or zero according as ZU or not. F2 evaluates those constants to themselves, proving the extension assertion. A proper ultrafilter contains I and excludes the empty set, so in particular η(I)=1 and η()=0. Properness also rules out the degenerate case I=.

F1F2step 1.1step 2.1
3.2

Put ai=ξ<βaiξ internally. F4 gives aiG iff some aiξG, because each coordinate's joined family belongs to M. Thus A(a)=ξ<βAξ, and this union lies in D by step 1.1. For β=0 the vector is constantly zero and the union empty. This works for any ground ordinal β; no completeness property of U has been used in this union calculation.

F4step 1.1step 2.2
4.1

Suppose now β=ω and the An are disjoint. For each iI and n<r<ω, the element ¬(ainair) lies in G, since otherwise ultrafilterhood would put both coefficients in G and hence i in both sets. These elements form one ground family, so F4 puts their common meet c in G. On this c, every coordinatewise intersection cainair is zero. F1 then proves ha=nhan almost everywhere on c, where a is the union vector of step 3.2. The density representatives are a ground sequence of bounded nonnegative functions, so F2 gives (ha)G=n(han)G. Step 2.1 identifies these values with η(nAn) and η(An), respectively. This proves the asserted countable additivity for every extension sequence in the statement.

F1F2F4step 2.1step 2.2step 3.2
4.2

Finally let β<κ and suppose every η(Aξ)=0. For the ground table of step 2.2, F2 says each zero-set class z(aξ) belongs to G. The density assignment and this table are in M, so this is a ground family of zero-set classes. F4 places c=ξ<βz(aξ) in G. Internally F1 gives cz(a) for the coordinatewise union vector, since β<κ there. Upward closure and the reverse zero-test direction in F2 give η(A(a))=(ha)G=0. Step 3.2 identifies A(a) 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.

F1F2F4step 2.1step 3.1step 2.2step 3.2
5.1

The names in steps 1.1–1.2 witness that both the full subset collection and its measure graph are elements of M[G]. 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.

F1F8step 1.1step 1.2step 2.1step 2.2step 3.1step 4.1step 4.2

Depends on

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