Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

Semicontinuous extreme value theorem: an upper semicontinuous function on a nonempty compact K⊆R is bounded above and attains a maximum, and a lower semicontinuous one is bounded below and attains a minimum

Statement

Let K⊆R be nonempty and compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

  1. If f:K→R is upper semicontinuous on K (Upper and lower semicontinuity of f:A→R at a point of A and on A) then f[K] is bounded above (Lower bound, bounded below, bounded set) and f attains a maximum: there is x0∈K with f(x)≤f(x0) for every x∈K (Maximum and minimum of a set).
  2. If f:K→R is lower semicontinuous on K then f[K] is bounded below and f attains a minimum.

The theorem is genuinely one-sided. An upper semicontinuous function on a compact set need not attain its infimum; the companion page gives such a function on [0,1]. Only the maximum is asserted in claim 1, and only the minimum in claim 2.

Taking f continuous, which is upper and lower semicontinuous at once (Upper and lower semicontinuity of f:A→R at a point of A and on A), recovers the classical extreme value theorem on a compact subset of R.

Facts & Assumptions

Given: A nonempty compact K⊆R and an upper semicontinuous f:K→R.

[L2]

The set Uα of [L1] is monotone in α: α≤β gives {f<α}⊆{f<β} and hence Uα⊆Uβ, directly from the displayed description.

[L3]

K compact means: every family of open subsets of R whose union contains K has a finite subfamily whose union contains K (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

[L4]

For every real x there is a natural n≥1 with x<ι(n), and for every real η>0 a natural n≥1 with 1/ι(n)<η; ι is positive and strictly increasing on the naturals ≥1 (Every complete ordered field is Archimedean, For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

[L5]

A nonempty set of reals bounded above has a least upper bound, and for every real ε>0 some member of the set exceeds sup⁡−ε (Complete ordered field (least-upper-bound property), Epsilon characterisation of the supremum, Lower bound, bounded below, bounded set).

[L7]

For any h:K→R, h is upper semicontinuous if and only if −h is lower semicontinuous; hence a lower semicontinuous f makes −f upper semicontinuous (Upper and lower semicontinuity of f:A→R at a point of A and on A, section “Negation exchanges the two”).

Proof

technique · direct
1.1

For each real α let Uα be the open set of [L1], so that Uα∩K={x∈K:f(x)<α} and α≤β implies Uα⊆Uβ.

L1L2construct
2.1

The family { Uι(n):n∈N, n≥1 } covers K: every x∈K has f(x)<ι(n) for some natural n≥1, and then x∈Uι(n).

step 1.1L4
3.1

By compactness finitely many members cover K, say Uι(n0),…,Uι(nj) with each ni≥1; let N be the greatest of ι(n0),…,ι(nj), which exists as the maximum of a nonempty finite set of reals. Then each Uι(ni)⊆UN, so K⊆UN and hence K=UN∩K={x∈K:f(x)<N}. So f[K] is bounded above by N.

step 1.1step 2.1L2L3L6
4.1

f[K] is nonempty, since K is, and bounded above, so M:=sup⁡f[K] exists.

step 3.1L5
5.1

For each natural n≥1 put αn:=M−1/ι(n). The family { Uαn:n≥1 } has no finite subfamily covering K. Indeed, let Uαn0,…,Uαnj be finitely many of them; if the list is empty its union is empty and does not contain the nonempty K. Otherwise let n∗ be a natural among n0,…,nj with αn∗ greatest, so that every member of the list is contained in Uαn∗. Since αn∗<M=sup⁡f[K], there is x∈K with f(x)>αn∗, and such an x lies in K but not in Uαn∗∩K={f<αn∗}, hence in no member of the list.

step 1.1step 4.1L2L4L5L6
6.1

By compactness, a family of open sets with no finite subfamily covering K cannot itself cover K. So there is x0∈K with x0∉Uαn for every natural n≥1, that is f(x0)≥αn=M−1/ι(n) for every such n.

step 1.1step 5.1L3
7.1

Hence f(x0)=M. If f(x0)<M then M−f(x0)>0 and there is a natural n≥1 with 1/ι(n)<M−f(x0), that is f(x0)<M−1/ι(n), contradicting step 6.1; and f(x0)≤M because M is an upper bound of f[K].

step 4.1step 6.1L4L5
8.1

So f is bounded above on K and attains the value M=sup⁡f[K] at x0∈K, which is a maximum of f[K]: this is claim 1.

step 3.1step 4.1step 7.1L5
9.1

Claim 2 follows by applying claim 1 to −f, which is upper semicontinuous on K when f is lower semicontinuous; then −f is bounded above and attains a maximum at some x1∈K, so f is bounded below and f(x1)≤f(x) for every x∈K, a minimum.

step 8.1L7∎

Remarks

Depends on

Used by

Dependency tree · two levels

31 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