Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-27
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.

Threshold characterisations of real-valued and extended-real-valued measurability

Statement

Let (X,A) be a measurable space and let f:XR. The following are equivalent:

  1. f is measurable;
  2. {x:f(x)>a}A for every real a;
  3. {x:f(x)a}A for every real a;
  4. {x:f(x)<a}A for every real a;
  5. {x:f(x)a}A for every real a.

Moreover, in any one of conditions 2 through 5 it is enough to test only rational thresholds aQ.

Facts & Assumptions

Given: A measurable space (X,A) and a function f:XR.

[L1]

The Borel sigma-algebra on R is generated by the rays (a,+] with aR. (The Borel sigma-algebra on the extended real line)

[L2]

A generating family on the codomain suffices to test measurability. (A generating family on the codomain suffices to test measurability)

[L3]

Between any two distinct real numbers there lies a rational number. (The rationals embed densely in the reals)

Proof

technique · direct
1.1

By [L1], the threshold set {x:f(x)>a} is the preimage [L1, L2] f1((a,+]). Therefore [L2] gives the equivalence of condition 1 and condition 2.

L1L2
1.2

Suppose the sets {f>q} are measurable for every rational q. For a [L3, algebra] real a,

{fa}=X{f>a},{f<a}=X{fa}.

So conditions 2 and 5 are equivalent, and conditions 3 and 4 are equivalent. [step 1.1, algebra]

2.1

For every real a,

step 1.1algebra

{fa}=n=1{f>a1/n},{f>a}=n=1{fa+1/n},

so conditions 2 and 3 are equivalent. Combining this with steps 1.1 and 1.2 shows that conditions 1 through 5 are all equivalent. [step 1.1, step 1.2, algebra]

2.2

For every real a,

step 1.1algebra

{f>a}=qQ,q>a{f>q}.

Indeed, f(x)>q>a implies f(x)>a, and if f(x)>a then [L3] gives a rational q with a<q<f(x) unless f(x)=+, in which case any rational q>a works. Thus the real-threshold version of condition 2 follows from the rational one. The converse is immediate, so in condition 2 it is enough to test only rational thresholds. [L3, algebra]

3.1

The equivalences from steps 2.1 and 2.2 transfer the rational-threshold [step 2.1, step 2.2, step 1.2] reduction of step 1.2 to conditions 3 through 5. Therefore in any one of conditions 2 through 5 it is enough to test only rational thresholds.

step 2.1step 2.2step 1.2

Depends on

Used by

Dependency tree · two levels

13 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