Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

Interval realization from refining small diameter partitions

Statement

Assume AC. Let S be nonempty, complete and separable, and let (Pk) be countable refining Borel partitions with nonempty atoms of diameter at most 2k. Fix orders on each family of children. Every Borel probability σ on S is the law of a measurable Tσ:(0,1)S under Borel Lebesgue probability, obtained by nested interval allocation.

Facts & Assumptions

[F1]

A box in Rn with parameters aibi is Lebesgue measurable of measure i<n(biai), whichever of its faces are included: Let n1, assume the Axiom of Countable Choice (def-countable-choice), and let aibi be reals for i<n. Write

R:={xRn:ai<xi<bi for every i<n},R:=[a,b]={xRn:aixibi for every i<n}

(def-multidimensional-rectangle-and-volume). Then R is open and R is closed, so both are Borel and Lebesgue measurable, and every set R with RRR is Lebesgue measurable with

λn(R)  =  i<n(biai).

In particular this covers the four one-dimensional face conventions in each coordinate — the open box, the closed box [a,b], the half-open box B(a,b)=i<n(ai,bi] of def-half-open-box, and every mixture of them, in any combination of coordinates — and it gives measure 0 to all of them whenever ai=bi for some i<n. For a half-open box with infinite parameters the value is already λn(B)=vol(B) (thm-lebesgue-measure-is-a-complete-measure).

[F2]

Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0: Let n1 and assume the Axiom of Countable Choice (def-countable-choice). Every at most countable subset ERn (def-countable) is Lebesgue measurable with

λn(E)  =  0,

so E is a λn-null set (def-measure-null-set-and-almost-everywhere). In particular every singleton is null, and on the real line the set QR of rational reals (lem-rat-embeds-dense) satisfies λ1(QR)=0.

[F3]

Complete metric space: every Cauchy sequence converges in the space: Let (X,d) be a metric space (def-metric-space).

(X,d) is complete if every Cauchy sequence in (X,d) (def-cauchy-in-metric) converges to a point of X (def-metric-convergence).

A subset AX is called complete when the metric subspace (A,dA) is complete (def-isometry-and-metric-embedding); as always, the metric is part of the data, and dA is the restriction of d to A×A.

The limit is unique when it exists, since limits in a metric space are unique (lem-metric-limits-unique), so a complete space assigns to each of its Cauchy sequences one point and not a set of points.

Completeness is a property of the pair (X,d), not of X and not of the topology of d. Both quantifiers in the definition are about the metric: the Cauchy condition is stated with distances, and so is convergence. Two metrics on the same set can have the same open sets while exactly one of them is complete, which is the content of fs-completeness-is-a-topological-property and its witness. Read the word complete as an abbreviation for complete with respect to this metric, always.

[F4]

Dominated convergence: Let f and (fn) be measurable complex-valued functions such that fnf almost everywhere and fng almost everywhere for a single nonnegative measurable function g with gdμ<+. Then fL1(μ), fnfdμ0, and hence fndμfdμ.

[F5]

Weak limits are unique: Bounded continuous real tests determine Borel probability measures on any metric space. In particular, weak limits are unique.

Proof

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

AC chooses a representative x_A from each nonempty atom and a fixed x0 in S. Assign the root S interval [0,1); inside each parent interval [l,r), put the jth child A in [l+i<jσ(Ai),l+ijσ(Ai)). Countable additivity makes these child lengths sum to r-l. Zero-mass children have empty intervals. Each interval has the asserted length under F1: its CC hypothesis follows by restricting AC to a countable family.

F1
1.2

Let Nsigma consist of all allocated endpoints in (0,1). It is countable and Borel, and F2 makes it null under the same CC assumption. For u outside it, at each level there is one interval containing u, with a nested atom Ak(u). Existence at each level follows because finite partial sums of child lengths increase to the parent length; an interior u lies below some partial sum. Put Zk(u)=x_{Ak(u)} there and Zk(u)=x0 on Nsigma. Each Zk is countably valued and Borel measurable.

F2
1.3

For l>=k and u outside Nsigma, both representatives lie in Ak(u), so d(Zl(u),Zk(u))2k. The sequence is Cauchy; completeness F3 supplies a unique limit Tsigma(u). Define Tsigma=x0 on Nsigma. For a nonempty closed F, d(Tσ(u),F)=limkd(Zk(u),F), and hence its preimage of zero is measurable by countable real limit operations. These are preimages of all closed F, so Tsigma is Borel measurable. The limit belongs to the closure of each selected atom; membership in the atom itself is not needed.

F3
2.1

For bounded continuous f, define hk(x)=f(x_A) on A in Pk. Since d(x,xA)2k, hk(x)f(x) pointwise on S, with hkf. Countable additivity of integrals over the atoms gives f(Zk(u))du=APkσ(A)f(xA)=hkdσ. The null endpoint set does not change this equality. Apply F4 to both sides: the left tends to f(Tσ(u))du by step 1.3, and the right tends to integral f against σ. Thus all bounded continuous test integrals of the law of Tsigma equal those of σ, and F5 identifies the laws.

F4F5step 1.3

Depends on

Used by

Dependency tree · two levels

48 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