Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 envelopes are the least upper and greatest lower semicontinuous functions

Statement

Let A⊆Rm be nonempty and let u:A→R be bounded, with envelopes u∗,u∗ as in Upper and lower semicontinuous envelopes by local limsup and liminf. Then u∗ is upper semicontinuous on A, u∗ is lower semicontinuous on A, and u∗≤u≤u∗ pointwise. Moreover: (1) u∗ is the least upper semicontinuous function w:A→R‾ with w≥u pointwise, and u∗=u if and only if u is upper semicontinuous; (2) u∗ is the greatest lower semicontinuous function w:A→R‾ with w≤u pointwise, and u∗=u if and only if u is lower semicontinuous; (3) (u∗)∗=u∗ and (u∗)∗=u∗. No choice principle is used.

Facts & Assumptions

Given: A nonempty set A⊆Rm, a bounded function u:A→R, the local suprema Mr(x)=sup⁡{u(y):y∈A, ∣y−x∣≤r} and local infima mr(x)=inf⁡{u(y):y∈A, ∣y−x∣≤r} for x∈A, r>0, all computed in R‾, and the envelopes u∗(x)=inf⁡r>0Mr(x), u∗(x)=sup⁡r>0mr(x).

[F1]

For every x∈A the sets {Mr(x):r>0} and {mr(x):r>0} are nonempty and bounded (by the bounds of u); u∗(x)=inf⁡r>0Mr(x) is the greatest lower bound of the first set, u∗(x)=sup⁡r>0mr(x) is the least upper bound of the second, and mr(x)≤u(x)≤Mr(x) for every r>0. In particular u∗(x)≤Mr(x) and mr(x)≤u∗(x) for every r>0 (Upper and lower semicontinuous envelopes by local limsup and liminf).

[F2]

For real-valued functions, upper and lower semicontinuity have the local ε characterizations: near a, respectively f(x)<f(a)+ε and f(x)>f(a)−ε (Upper and lower semicontinuity on subsets of Rn). For an extended-real upper semicontinuous w, we use the standard strict-sublevel convention {w<c} open for every real c; if w(a) is finite, applying it with c=w(a)+ε gives the same local upper bound. The dual strict-superlevel convention for lower semicontinuity gives the local lower bound when w(a) is finite. These are exactly the finite-value cases used in steps 1.3 and 1.4; the infinite endpoint cases are disposed of there directly.

[F3]

If S⊆R is nonempty and ℓ=inf⁡S, then ℓ≤s for every s∈S, and ℓ′≤ℓ for every lower bound ℓ′ of S (Greatest lower bound (infimum)).

[F4]

If S⊆R is nonempty, bounded above and v∈R is an upper bound of S, then v=sup⁡S if and only if for every ε>0 there is s∈S with v−ε<s; in particular a supremum of S in R is an upper bound of S (Epsilon characterisation of the supremum).

Proof

technique · monotone localisation; the envelopes are compared with a competing semicontinuous function by testing the defining infimum and supremum
1.1F1F2F3F4algebra

u∗ is upper semicontinuous on A and u∗≤u≤u∗. Fix x∈A and ε>0. Since u∗(x)+2−1ε>u∗(x) is not a lower bound of the nonempty set {Mr(x):r>0} by the leastness clause of [F3], there is r>0 with Mr(x)<u∗(x)+2−1ε. For z∈A with ∣z−x∣<r put δ:=r−∣z−x∣>0; every w∈A with ∣w−z∣≤δ satisfies ∣w−x∣≤∣w−z∣+∣z−x∣≤r, so the set defining Mδ(z) is contained in the set defining Mr(x) and therefore Mδ(z)≤Mr(x)<u∗(x)+2−1ε; since u∗(z)≤Mδ(z) by [F1], we get u∗(z)<u∗(x)+ε. Thus u∗ is upper semicontinuous at x by [F2], and x was arbitrary. Next, u(x) is a lower bound of {Mr(x):r>0} by [F1], so u(x)≤u∗(x) by the greatest-lower-bound clause of [F3]. Finally u(x) is an upper bound of {mr(x):r>0} by [F1]; if u∗(x)>u(x) held, then η:=u∗(x)−u(x)>0 and [F4] would give r>0 with u∗(x)−η<mr(x), that is u(x)<mr(x), contradicting mr(x)≤u(x); hence u∗(x)≤u(x).

1.2F1F2F4algebra

u∗ is lower semicontinuous on A. Fix x∈A and ε>0. By [F4] applied to the nonempty bounded-above set {mr(x):r>0} with supremum u∗(x), there is r>0 with u∗(x)−ε<mr(x). For z∈A with ∣z−x∣<r put δ:=r−∣z−x∣>0; every w∈A with ∣w−z∣≤δ satisfies ∣w−x∣≤r, so mδ(z)≥mr(x), and u∗(z)≥mδ(z) by [F1]; hence u∗(z)>u∗(x)−ε, which is lower semicontinuity at x by [F2].

1.3F1F2F3algebra

Least upper semicontinuous majorant. Let w:A→R‾ be upper semicontinuous with w≥u, fix x∈A and ε>0. Since w≥u and u is real-valued, w takes no value −∞; if w(x)=+∞ then u∗(x)≤w(x) holds because u∗ is real-valued by [F1] and boundedness of u, so assume w(x)∈R. By [F2] there is r0>0 with w(y)<w(x)+ε for all y∈A with ∣y−x∣<r0. For y∈A with ∣y−x∣≤r0/2 we then have u(y)≤w(y)<w(x)+ε, so w(x)+ε is an upper bound of the set defining Mr0/2(x), whence Mr0/2(x)≤w(x)+ε. Since u∗(x)=inf⁡r>0Mr(x)≤Mr0/2(x) by [F3], we get u∗(x)≤w(x)+ε, and letting ε↓0 gives u∗(x)≤w(x). Hence u∗≤w for every upper semicontinuous majorant w of u.

1.4F1F2algebra

Greatest lower semicontinuous minorant. Let w:A→R‾ be lower semicontinuous with w≤u, fix x∈A and ε>0. Since w≤u, w(x)∈R∪{−∞}; if w(x)=−∞ then u∗(x)≥w(x) is automatic, so assume w(x)∈R. By [F2] there is r0>0 with w(y)>w(x)−ε for all y∈A with ∣y−x∣<r0. For y∈A with ∣y−x∣≤r0/2 we have w(y)>w(x)−ε and w(y)≤u(y), so w(x)−ε is a lower bound of the set defining mr0/2(x), whence mr0/2(x)≥w(x)−ε. Since u∗(x) is an upper bound of {mr(x):r>0} by [F1], we get u∗(x)≥mr0/2(x)≥w(x)−ε, and letting ε↓0 gives u∗(x)≥w(x).

2.1step 1.1step 1.2step 1.3step 1.4

The two equivalences. If u is upper semicontinuous, then u is an upper semicontinuous majorant of itself, so u∗≤u by step 1.3; with u≤u∗ from step 1.1 this gives u∗=u. Conversely, if u∗=u, then u is upper semicontinuous because u∗ is, by step 1.1. The same two lines with step 1.4 and step 1.2 show that u∗=u if and only if u is lower semicontinuous.

3.1step 1.1step 1.2step 2.1∎

Idempotence. The function u∗ is bounded and upper semicontinuous on A by step 1.1, and it is its own upper semicontinuous majorant; applying the equivalence of step 2.1 to u∗ in place of u gives (u∗)∗=u∗. Likewise u∗ is bounded and lower semicontinuous by steps 1.1 and 1.2, so (u∗)∗=u∗.

Remarks

  • Where boundedness is used. Boundedness of u keeps every Mr(x) and mr(x) in R, so the infimum and supremum over r are taken in the ordered field and the elementary leastness arguments of steps 1.1--1.4 apply directly. For unbounded u the envelopes can be infinite; idempotence in that setting must use the same local formulas extended to extended-valued inputs, whereas the present statement and Upper and lower semicontinuous envelopes by local limsup and liminf take real-valued input.
  • Strictness is not needed. The proof nowhere requires the contact or the majorant to be strict: the least-majorant property is proved by a direct pointwise comparison against an arbitrary upper semicontinuous majorant.

Depends on

Used by

Dependency tree · two levels

15 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