Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

Conull Borel uniformizations and Borel versions of measured suprema

Statement

Assume AC. Let (X,B,μ) be a sigma-finite standard-Borel measure space and let Y be a standard Borel space. If R⊆X×Y is Borel and every vertical section Rx:={y∈Y:(x,y)∈R} is nonempty, then there is a Borel conull set X0⊆X and a Borel map s:X0→Y such that (x,s(x))∈R for every x∈X0. For any such R and any bounded real-valued Borel function φ:X×Y→R, define mR,φ(x):=sup⁡{φ(x,y):y∈Rx}. For every rational q, the strict superlevel set {x:mR,φ(x)>q} is measurable in the completion of μ, and there are a Borel function m~:X→R and a Borel null set N such that m~=mR,φ on X∖N. For any countable family of relations and scalar functions of these forms on the same measured base, the selectors and Borel versions may be restricted to one common Borel conull subset of X. A selector on every point of the original X is not asserted.

Facts & Assumptions

Given: AC, a sigma-finite standard-Borel measured space X, a standard Borel space Y, a Borel relation with nonempty vertical sections, and, for the scalar assertion, a bounded real Borel function on X×Y.

[F1]

A standard Borel space is Borel-isomorphic to a Polish presentation (Standard Borel spaces).

[F2]

A measure is sigma-finite when its space is a countable union of finite-measure Borel sets (Finite, sigma-finite, and semifinite measures). Under AC, every Borel relation between standard Borel spaces has a closed witness in the product with NN; projections of Borel relations under a sigma-finite Borel measure are completion-measurable and agree with Borel sets outside Borel null sets (Closed witness codings and completion measurability of Borel projections, The Axiom of Choice). Every nonempty subset of N has a least element (The well-ordering principle).

[F3]

The completion domain consists of Borel sets modified by subsets of Borel null sets and is a sigma-algebra under Countable Choice; AC supplies Countable Choice (The completion domain and proposed completed set function of a measure space, Assuming countable choice, the completion domain is a sigma-algebra, The Axiom of Countable Choice (ACω), AC implies DC implies countable choice, The Axiom of Choice).

[F4]

Borel sets are the sigma-algebra generated by open sets, so open sets and countable unions of Borel sets are Borel (The Borel sigma-algebra of a topological space).

[F5]

A Polish space has a countable dense subset; a nonempty at-most-countable set admits a sequence enumeration. The rationals are countable and dense in the reals, their positive subset is countable and dense in (0,∞), for every ϵ>0 there is a natural m≥1 with 1/m<ϵ, and N2 is in bijection with N (Separability: the existence of an at most countable dense subset, A nonempty set is at most countable iff it is a surjective image of N, Every subset of an at most countable set is at most countable, Q is countably infinite, The rationals embed densely in the reals, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, N×N≈N).

[F6]

A recursively specified successor rule defines a sequence (The recursion theorem).

[F8]

A bounded nonempty real set has a supremum, and rationals lie between any two distinct reals (The Cauchy-sequence reals have the least-upper-bound property, The rationals embed densely in the reals).

[F9]

A map is Borel when inverse images of Borel sets are Borel, and continuous maps have Borel preimages (A measurable function between measurable spaces, A continuous map has Borel preimages of Borel sets).

[F10]

AC supplies a choice function for any family of nonempty sets, and AC implies Countable Choice (The Axiom of Choice, AC implies DC implies countable choice, The Axiom of Countable Choice (ACω)).

[F12]
[F13]

Under AC, finite words in the naturals admit a countable enumeration and injective least-preimage indices by the locally proved interface in the Remark of Closed witness codings and completion measurability of Borel projections; finite or countable subsets of N remain at most countable (Every subset of an at most countable set is at most countable).

Proof

technique · closed witnesses, a nested countable open cover, and completion-measurable least-prefix cells
1.1F1F2F7F10F14

If X=∅, take X0=∅; all selector assertions are vacuous and any bounded scalar function has the zero Borel version agreeing on X0. Otherwise choose Polish presentations of X and Y by [F1] and transport R to those presentations. Let W=NN and Z:=Y×W. Since X is nonempty and every Rx is nonempty, Y and Z are nonempty. By [F7,F14], Z is Polish, so choose a compatible complete metric d on Z. By [F2], R is the projection of a closed witness in (X×Y)×W. The coordinate reassociation ((x,y),w)↦(x,(y,w)) is a homeomorphism because both product topologies have bases of open rectangles [F14]; transporting the witness gives a closed F⊆X×Z with proj⁡X×Y(F)=R. Every fibre Fx:={z:(x,z)∈F} is nonempty because every Rx is nonempty.

1.2F2F3F8F9F10

Fix a bounded real Borel function φ and a relation R as in the statement. The bounded set {φ(x,y):(x,y)∈R} is nonempty for every x, so its supremum m(x) exists by [F8]. For every rational q, the set {x:m(x)>q} equals proj⁡X(R∩φ−1((q,∞))): a supremum exceeds q exactly when some value exceeds q. The relation inside this projection is Borel by [F9], so [F2] makes every strict rational superlevel set completion-measurable. By the completion description [F3], AC [F10] chooses Borel representatives Bq and Borel null sets Nq for all rational q.

2.1F5F6F7step 1.1

Fix a countable dense sequence (ai)i∈N in Z, an enumeration (rj)j∈N of the positive rationals, and a bijection β:N2→N using [F5]. Set U∅=Z. For every finite word s of length n and every pair (i,j), define Us⌢β(i,j)=B(ai,rj) if the closed ball B‾(ai,rj) is contained in Us and rj<2−(n+2), and define it to be empty otherwise. Recursion [F6] defines this family. The children cover each Us: for z∈Us, choose ε>0 with B(z,ε)⊆Us, then choose ai close enough to z and a positive rational rj with d(ai,z)<rj<min⁡{ε−d(ai,z),2−(n+2)} by [F5]. The triangle inequality puts B‾(ai,rj) inside Us and z inside the child ball. Each child lies in its parent and has diameter at most 2rj<2−(n+1).

2.2F4F5F8F9F12step 1.2

Remove the Borel null union Nφ:=⋃q∈QNq and put Xφ=X∖Nφ. On Xφ, x∈Bq iff m(x)>q. Define m~(x):=sup⁡{q∈Q:x∈Bq} on Xφ and m~(x):=0 off Xφ. The rational density [F5,F8] gives m~=m on Xφ. For each real a, {m~>a} is the union of Xφ∩Bq over rationals q>a, together with X∖Xφ when 0>a; hence it is Borel. Also {m~<b}=⋃q∈Q, q<b(X∖{m~>q}) is Borel. Rational open intervals form a basis by [F5], so m~ is Borel by [F4,F9].

3.1F2F4F10step 2.1

For each finite word s, let Ps:=proj⁡X(F∩(X×Us)). The set inside the projection is Borel, so [F2] makes Ps completion-measurable and gives a Borel representative outside a Borel null set. Since F projects onto R and every section Rx is nonempty, P∅=X. The child-cover property in step 2.1 gives Ps=⋃kPs⌢k.

4.1F2F3F10F12F13step 3.1

Define completion-measurable prefix cells by C∅=X and Cs⌢k:=Cs∩Ps⌢k∖⋃j<kPs⌢j; these select the least child containing x and partition each parent cell, using the least-element property in [F2]. By [F3], the completion domain is a sigma-algebra, so every Cs is completion-measurable. AC [F10] chooses a Borel set Bs and Borel null set Ns with Cs△Bs⊆Ns for each finite word s. The finite-word indices [F13] index these exceptional sets by naturals, using the empty set for unused codes; the countable-union fact [F12] makes N:=⋃sNs Borel and null. Put X0:=X∖N. On X0, membership in every prefix cell agrees with membership in its Borel representative, and at each length those representatives partition X0.

5.1F4F7F9F10F13F14step 4.1

For x∈X0 and n≥1, let sn(x) be its unique selected word of length n and let cn(x) be the centre of Usn(x). Set c0=c1. Each cn is Borel because it is constant on the countable Borel partition {Bs∩X0:∣s∣=n}: preimages of Borel sets are unions of the corresponding Borel cells by [F4,F9,F13]. The selected balls are nested and their diameters tend to zero, so (cn(x))n∈N is Cauchy; let z(x)∈Z be its limit by completeness [F7]. Since x∈Psn(x), each Fx∩Usn(x) is nonempty. AC [F10] chooses a point wn in each such set for n≥1 and this fixed x; set w0=w1. then d(wn,cn(x))≤2rsn(x)→0, so wn→z(x). The fibre Fx is closed: if z∉Fx, the open complement of F contains a basic product rectangle U×V around (x,z), and V is disjoint from Fx. Thus z(x)∈Fx.

6.1F1F4F5F7F9step 5.1

The limit map z:X0→Z is Borel. For a fixed nonempty closed C⊆Z and m≥1, put Vm:=⋃y∈CB(y,1/m) and En,m:={x∈X0:cn(x)∈Vm} for n≥1. The set Vm is open; each En,m is Borel because cn is constant on a countable Borel partition. Since cn(x)→z(x) and C is closed, z(x)∈C exactly when, for every m, cn(x)∈Vm eventually: if z(x)∉C, choose ε>0 with B(z(x),ε)∩C=∅, then choose m with 1/m<ε/2 and take n large enough that d(cn(x),z(x))<ε/2 and cn(x)∈Vm. Membership in Vm gives y∈C with d(cn(x),y)<1/m, so the triangle inequality puts y inside B(z(x),ε), a contradiction. Thus z−1(C)=⋂m≥1⋃N≥1⋂n≥NEn,m is Borel. The empty closed set has empty preimage, and closed-set preimages being Borel implies Borel measurability by [F4,F9]. Project z(x) to Y and undo the chosen Polish presentation. The projection is continuous, hence Borel by [F9], so this gives a Borel selector s:X0→Y and (x,s(x))∈R by the defining property of F.

7.1F4F5F10F12F13step 2.2step 4.1step 5.1step 6.1∎

For countably many relations and bounded Borel functions on the same base, repeat steps 4.1–6.1 for each relation and step 2.2 for each scalar function, then remove the union of their Borel null exceptions. The indices are countable: finite prefixes have the injective indices in [F13], rational levels are countable by [F5], and pairs of natural indices are coded by [F5]. AC [F10] supplies the countable family of representatives; the union is Borel and null by [F12]. Restrict each selector and each Borel version to this common Borel conull set.

Source qualifications

Bekka–de la Harpe, Appendix A.C, defines a standard measure as a sigma-finite measure with a conull Borel subset that is standard Borel, then states Theorem A.C.6 for a Borel relation with everywhere-surjective projection and concludes a Borel selector on a conull Borel subset. The passage explicitly refers its proof to Mackey–76, Theorem Z.2, Chapter 2, §2.2. The proof here does not attribute a proof to Bekka–de la Harpe: it uses the separately authored local closed-witness/projection result, constructs nested Borel-ball choices after Borelizing their completion-measurable prefix cells, and proves the scalar Borel-version clause directly.

Depends on

Used by

Dependency tree · two levels

121 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