Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-31
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.

The essential supremum is attained as the least essential bound

Statement

Let f:XR be measurable on a measure space (X,A,μ), and suppose f<. Then

ffμ-almost everywhere.

Moreover, if M0 and fM almost everywhere, then

fM.

So f is the least essential bound of f.

Facts & Assumptions

Given: A measurable real-valued function f with finite essential supremum s:=f.

[L1]

The essential supremum is the infimum of the essential bounds (The essential supremum of a measurable function with respect to a measure).

[L2]

Absolute values and threshold sets of measurable functions are measurable (Closure properties of measurable functions used by the integral).

[L3]

Countable subadditivity bounds the measure of a countable union (Finite and countable subadditivity of measures).

Proof

Proof technique: Take the countable family of bad sets {f>f+1/n}; each is null by minimality of the infimum. Their union is null, giving ff almost everywhere, and leastness is built into the definition.

1.1

For each n1, the number s+1/n is strictly larger than the infimum in [L1], so it is an essential bound. Therefore the measurable set [L1, L2, given] En:={f>s+1/n} has measure 0.

1.2

If M0 and fM almost everywhere, then M is one of the essential bounds in [L1], so the infimum s satisfies sM.

L1
2.1

Put E:=n=1En. Then E is measurable and [step 1.1, L3, algebra] μ(E)n=1μ(En)=0. If xE, then f(x)s+1/n for every n, hence f(x)s. Therefore fs almost everywhere.

3.1

Step 2.1 proves that s itself is an essential bound, and step 1.2 proves that no smaller essential bound exists. Thus s=f is the least essential bound.

step 2.1step 1.2

Depends on

Used by

Dependency tree · two levels

9 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