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 be a sigma-finite standard-Borel measure space and let be a standard Borel space. If is Borel and every vertical section is nonempty, then there is a Borel conull set and a Borel map such that for every . For any such and any bounded real-valued Borel function , define For every rational , the strict superlevel set is measurable in the completion of , and there are a Borel function and a Borel null set such that on . 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 . A selector on every point of the original is not asserted.
Facts & Assumptions
Given: AC, a sigma-finite standard-Borel measured space , a standard Borel space , a Borel relation with nonempty vertical sections, and, for the scalar assertion, a bounded real Borel function on .
A standard Borel space is Borel-isomorphic to a Polish presentation (Standard Borel spaces).
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 ; 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 has a least element (The well-ordering principle).
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 implies DC implies countable choice, The Axiom of Choice).
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).
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 , for every there is a natural with , and is in bijection with (Separability: the existence of an at most countable dense subset, A nonempty set is at most countable iff it is a surjective image of , Every subset of an at most countable set is at most countable, is countably infinite, The rationals embed densely in the reals, For every in a complete ordered field there is a natural with , ).
A recursively specified successor rule defines a sequence (The recursion theorem).
The witness space is Polish by the locally proved coding interface in the Remark of Closed witness codings and completion measurability of Borel projections. Open and closed metric balls and Cauchy convergence are as in Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, and Complete metric space: every Cauchy sequence converges in the space. A Polish metric is separable and complete (Polish spaces are separable completely metrizable spaces).
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).
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).
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 ()).
A countable union of Borel null sets is Borel and null (The Borel sigma-algebra of a topological space, Finite and countable subadditivity of measures).
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 remain at most countable (Every subset of an at most countable set is at most countable).
Basic open rectangles form a basis for the product topology; under AC finite products of Polish spaces are Polish in that topology (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, Polish spaces are separable completely metrizable spaces, Closed witness codings and completion measurability of Borel projections, The Axiom of Choice).
Proof
If , take ; all selector assertions are vacuous and any bounded scalar function has the zero Borel version agreeing on . Otherwise choose Polish presentations of and by [F1] and transport to those presentations. Let and . Since is nonempty and every is nonempty, and are nonempty. By [F7,F14], is Polish, so choose a compatible complete metric on . By [F2], is the projection of a closed witness in . The coordinate reassociation is a homeomorphism because both product topologies have bases of open rectangles [F14]; transporting the witness gives a closed with . Every fibre is nonempty because every is nonempty.
Fix a bounded real Borel function and a relation as in the statement. The bounded set is nonempty for every , so its supremum exists by [F8]. For every rational , the set equals : a supremum exceeds exactly when some value exceeds . 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 and Borel null sets for all rational .
Fix a countable dense sequence in , an enumeration of the positive rationals, and a bijection using [F5]. Set . For every finite word of length and every pair , define if the closed ball is contained in and , and define it to be empty otherwise. Recursion [F6] defines this family. The children cover each : for , choose with , then choose close enough to and a positive rational with by [F5]. The triangle inequality puts inside and inside the child ball. Each child lies in its parent and has diameter at most .
Remove the Borel null union and put . On , iff . Define on and off . The rational density [F5,F8] gives on . For each real , is the union of over rationals , together with when ; hence it is Borel. Also is Borel. Rational open intervals form a basis by [F5], so is Borel by [F4,F9].
For each finite word , let . The set inside the projection is Borel, so [F2] makes completion-measurable and gives a Borel representative outside a Borel null set. Since projects onto and every section is nonempty, . The child-cover property in step 2.1 gives .
Define completion-measurable prefix cells by and ; these select the least child containing and partition each parent cell, using the least-element property in [F2]. By [F3], the completion domain is a sigma-algebra, so every is completion-measurable. AC [F10] chooses a Borel set and Borel null set with for each finite word . The finite-word indices [F13] index these exceptional sets by naturals, using the empty set for unused codes; the countable-union fact [F12] makes Borel and null. Put . On , membership in every prefix cell agrees with membership in its Borel representative, and at each length those representatives partition .
For and , let be its unique selected word of length and let be the centre of . Set . Each is Borel because it is constant on the countable Borel partition : 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 is Cauchy; let be its limit by completeness [F7]. Since , each is nonempty. AC [F10] chooses a point in each such set for and this fixed ; set . then , so . The fibre is closed: if , the open complement of contains a basic product rectangle around , and is disjoint from . Thus .
The limit map is Borel. For a fixed nonempty closed and , put and for . The set is open; each is Borel because is constant on a countable Borel partition. Since and is closed, exactly when, for every , eventually: if , choose with , then choose with and take large enough that and . Membership in gives with , so the triangle inequality puts inside , a contradiction. Thus is Borel. The empty closed set has empty preimage, and closed-set preimages being Borel implies Borel measurability by [F4,F9]. Project to and undo the chosen Polish presentation. The projection is continuous, hence Borel by [F9], so this gives a Borel selector and by the defining property of .
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
- Closed witness codings and completion measurability of Borel projections
- Standard Borel spaces
- Polish spaces are separable completely metrizable spaces
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Complete metric space: every Cauchy sequence converges in the space
- Separability: the existence of an at most countable dense subset
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- Every subset of an at most countable set is at most countable
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- The well-ordering principle
- The recursion theorem
- A measurable function between measurable spaces
- A continuous map has Borel preimages of Borel sets
- The completion domain and proposed completed set function of a measure space
- Assuming countable choice, the completion domain is a sigma-algebra
- Finite, sigma-finite, and semifinite measures
- Finite and countable subadditivity of measures
- The Borel sigma-algebra of a topological space
- The Cauchy-sequence reals have the least-upper-bound property
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC implies DC implies countable choice
- The Axiom of Choice
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
- Bachir Bekka and Pierre de la Harpe, Unitary Representations of Groups, Duals, and Characters (complete book draft) (standard reference, not scraped)