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 densities and localized small null joins

Statement

Assume ZFC. Let κ be an uncountable cardinal with [0,1]<κ, let U be a proper κ-complete ultrafilter on a set I, and let (X,Σ,μ) be a probability space with probability algebra (B,m). For every a=(ai)iIBI there is a unique almost-everywhere class of measurable functions ha:X[0,1] such that, for every cB,

chadμ=νa(c),{i:m(cai)=νa(c)}U.

Here c means integration over any measurable representative of c. This class assignment is a set function on BI. The following identities are independent of the chosen representatives of the densities:

  1. If cai=cbi for all i in some member of U, then ha=hb almost everywhere on c.
  2. If ZI and ai=1 on Z, ai=0 off Z, then ha is the constant 1 when ZU and the constant 0 otherwise. Coordinatewise complementation gives h¬a=1ha almost everywhere.
  3. For a sequence (an)n<ω in BI, let ai=nain. If cainair=0 for every iI and nr, then ha=nhan almost everywhere on c. The sum is finite almost everywhere on c.
  4. For any ordinal β<κ and family (aξ)ξ<β in BI, set ai=ξ<βaiξ. If every haξ is zero almost everywhere on the same c, then ha is zero almost everywhere on c.

In particular, writing z(a)=[{x:ha(x)=0}]B, the last assertion is the Boolean inequality

ξ<βz(aξ)z(a).

This is a theorem inside the original probability space and its algebra. It does not assert a forcing truth lemma or the existence of a measure on new subsets in a generic extension.

Facts & Assumptions

Given: The probability space, κ and U in the statement. All indexed families here are sets in the universe where U is complete.

[F1]

The probability algebra is well-defined and complete; m is strictly positive and countably additive, and meet distributes over arbitrary joins. (Probability algebras, arbitrary joins and the countable chain condition)

[F2]

A proper κ-complete ultrafilter is closed under intersections indexed below κ, including the empty intersection I. (Complete ultrafilters and measurable cardinals)

[F3]

A finite positive measure absolutely continuous with respect to a probability measure has an integrable real-valued RN density, unique almost everywhere. The common finite exhaustion can be constantly X. (A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density)

[F4]

Integrals of integrable functions are linear. (The Lebesgue integral is linear on L1(μ))

[F5]

Nonnegative integrals are monotone and homogeneous. (Monotonicity and nonnegative homogeneity of the nonnegative integral)

[F6]

Increasing nonnegative measurable functions have the corresponding increasing limit of integrals. (Monotone convergence for the integral)

[F7]

A nonnegative measurable function has integral zero if and only if it vanishes almost everywhere. (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere)

[F8]

AC indexes the small sets of real values, supplies the probability-algebra and RN selections, and can select representatives from the set-indexed density classes. It is not Global Choice. (The Axiom of Choice)

[F9]

Sums, truncations, measurable restrictions and increasing limits have the required measurability. (Closure properties of measurable functions used by the integral)

Proof

1.1

First reconstruct the integral foundation used by [F3]–[F7]. Augment every finite disjoint display s=rar1Er of a nonnegative simple function by XrEr with coefficient 0. Intersections of two augmented displays partition X, and equality of the functions makes their coefficients equal on every nonempty cell. Finite additivity and 0(+)=0 therefore prove representation independence. Common augmented refinements give simple monotonicity and additivity termwise; homogeneity is direct for scalar 0 and termwise for a positive scalar. Taking suprema over simple minorants gives nonnegative monotonicity. If 0fjf, put L=supjfj. For every simple sf and 0<c<1, the sets Aj={fjcs} increase to X, including on the zero level of s, and continuity from below for the finite-sum measure AAs gives cs=limjcAjsL. Let c1 and take the supremum over s to obtain MCT. Applying MCT to sums of increasing simple approximants gives nonnegative additivity; positive/negative and real/imaginary decompositions then give finite L1 linearity. Finally, if g0 and g=0, then (1/n)μ{g1/n}g for every n, so g=0 almost everywhere; the converse follows because every simple minorant is supported, apart from its zero cell, on a null set. These arguments supply the exact affected parts of [F4]–[F7], and with them substituted at its base the unaffected RN construction and uniqueness argument in [F3] applies.

F3F4F5F6F7construct
1.2

Every function v:I[0,1] has exactly one U-large fibre. If none were large, the complements of all its fibres would belong to U. The range has cardinality below κ, so indexing it by an ordinal below κ using F8 and applying F2 would put their empty intersection in the proper ultrafilter. Two disjoint fibres cannot both belong to a proper filter. Apply this to v(i)=m(cai) for each (a,c) to define the unique number νa(c). Uniqueness and Replacement give a set function of (a,c), with 0νa(c)m(c) and νa(0)=0.

F1F2F8
2.1

Fix a and pairwise disjoint cnB, and put c=ncn. Intersect the U-large fibres defining νa(c) and all νa(cn). This countable intersection is in U by F2 and is nonempty. At any i in it, meet-distributivity and countable additivity from F1 give m(cai)=nm(cnai), hence νa(c)=nνa(cn). Thus Eνa([E]) is a finite positive measure on Σ, dominated by μ. It is absolutely continuous, and its total variation equals itself: each measurable finite partition sums to the measure of its union because all values are nonnegative. F3 therefore applies with the constant finite exhaustion X.

F1F2F3step 1.1step 1.2
3.1

Let h be the integrable real RN density from step 2.1. For each positive integer n, put En={h1/n} and Tn={h1+1/n}. Linearity and monotonicity give νa([En])=Enhdμμ(En)/n and νa([Tn])(1+1/n)μ(Tn). Since 0νa([En]) and νa([Tn])μ(Tn), both sets are null. Their countable union contains the set where h[0,1]. Replacing h by min(1,max(0,h)) gives a measurable [0,1]-valued density; integration is unchanged on the null exceptional set. F3 gives almost-everywhere uniqueness. The set of all measurable functions X[0,1] is a subset of [0,1]X; each equivalence class of densities is thus a nonempty set, uniquely specified by a. Replacement gives the class assignment as a set function, and F8 permits simultaneous representatives if desired. Integrals over equivalent measurable representatives of c agree, because these functions are bounded and the symmetric difference is null.

F1F3F4F5F8F9step 1.1step 1.2step 2.1
4.1

Suppose the hypothesis of locality holds on JU, and let dc. For iJ, dai=dbi. Intersecting J with the two defining large fibres in step 1.2 proves νa(d)=νb(d). Choose a measurable representative C of c. Consequently 1Cha and 1Chb have identical integrals over every EΣ, since those integrals equal νa([E]c) and νb([E]c). Both are densities of the same finite measure, so F3 gives their equality almost everywhere, which is exactly equality on c.

F2F3step 1.2step 3.1
4.2

For the indicator family of Z, the values m(cai) are m(c) on Z and zero off Z. The ultrafilter decides Z, so step 1.2 gives νa(c)=m(c) or zero accordingly, including c=0. Constant densities 1 and 0 represent these measures, so uniqueness gives the assertion. For complements, m(c¬ai)=m(c)m(cai) for every i, and the large-fibre equation yields ν¬a(c)=m(c)νa(c). F4 shows that 1ha represents this measure, so uniqueness gives the complement identity.

F1F2F3F4step 1.2step 3.1
4.3

For the sequence in clause 3 and any dc, the family (dain)n is disjoint for every i. Meet-distributivity and countable additivity give m(dai)=nm(dain). Intersect the countably many defining large fibres, including that for a, to obtain νa(d)=nνan(d). Choose nonnegative representatives of all these densities by F8. For a measurable representative C of c, F4 and F6 applied to 1Cn<Nhan show that its increasing pointwise limit has integral over E equal to νa([E]c). Its total integral is at most 1, so the set where the limit is infinite is null: on that set every constant bound has integral at most 1, forcing its measure to be zero. Replace the limit there by zero to obtain a real integrable density of the same finite measure as 1Cha. F3 gives equality almost everywhere, proving clause 3 and the asserted finiteness on c.

F1F2F3F4F5F6F8F9step 1.2step 3.1
5.1

For clause 4, the hypotheses and F7 give νaξ(c)=0 for every ξ<β. By step 1.2 each set Jξ={i:m(caiξ)=0} belongs to U. Their intersection J is in U by F2. For iJ, strict positivity in F1 makes every caiξ the zero Boolean element. Meet-distributivity now gives cai=ξ<β(caiξ)=0. Thus νa(c)=0 by the unique large-fibre rule, and F7 gives ha=0 almost everywhere on c. For β=0, J=I, every ai=0 and step 4.2 gives the zero density directly. No union of fewer than κ measurable exceptional sets has been formed.

F1F2F7step 1.2step 3.1step 4.2
6.1

The zero set of each density is measurable and its class is independent of its representative, by almost-everywhere uniqueness. Put c=ξ<βz(aξ) using F1. For each ξ, the inequality cz(aξ) means precisely that haξ vanishes almost everywhere on a representative of c. Step 5.1 then gives cz(a). This includes the empty meet c=1, the singleton family and the zero condition. All constructions and identities concern sets and functions in the original universe; no generic interpretation has entered the argument.

F1step 3.1step 5.1

Depends on

Used by

Dependency tree · two levels

32 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