Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

An upper semicontinuous function on [0,1] that is bounded below and attains no minimum, so the semicontinuous extreme value theorem is genuinely one-sided

Statement refuted

Refuted claim: an upper semicontinuous function on a nonempty compact subset of R that is bounded below attains a minimum (Upper and lower semicontinuity of f:A→R at a point of A and on A, Maximum and minimum of a set).

What 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 proves is the one-sided statement: an upper semicontinuous function on a nonempty compact set attains a maximum, and a lower semicontinuous one attains a minimum. The refuted claim mixes the two, and it is false.

Counterexample

f(0):=1,f(x):=xfor 0<x≤1.

Then f is upper semicontinuous on [0,1], bounded below by 0, with inf⁡f[ [0,1] ]=0 (Greatest lower bound (infimum)), and f(x)>0 for every x∈[0,1]: the infimum is not attained, so f has no minimum. It does attain a maximum, namely 1 at x=0, as 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 requires.

Facts & Assumptions

Given: The function f:[0,1]→R with f(0)=1 and f(x)=x for 0<x≤1.

[L1]

f is upper semicontinuous at c when for every real ε>0 there is a real δ>0 with f(x)<f(c)+ε for every x∈[0,1]∩Nδ(c) (Upper and lower semicontinuity of f:A→R at a point of A and on A, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

A nonempty set of reals bounded below has a greatest lower bound (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Lower bound, bounded below, bounded set); m is a minimum of S when m∈S and m≤s for every s∈S (Maximum and minimum of a set).

[L4]

For every real η>0 there is a natural n≥1 with 1/n<η (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Verification

technique · direct
1.1

f is upper semicontinuous at 0: f(0)=1 and f(x)≤1 for every x∈[0,1], so f(x)<f(0)+ε=1+ε for every x∈[0,1] and every real ε>0; any δ works.

L1
1.2

f is upper semicontinuous at every c∈(0,1]: taking δ:=min⁡{c,ε}>0, every x∈[0,1] with ∣x−c∣<δ satisfies x>c−δ≥0, hence x≠0 and f(x)=x<c+ε=f(c)+ε.

L1L2
1.3

f is bounded below by 0 and f(x)>0 for every x∈[0,1]: for x=0 the value is 1>0, and for 0<x≤1 the value is x>0.

L3
2.1

inf⁡f[ [0,1] ]=0: the set f[ [0,1] ] is nonempty and bounded below by 0 by step 1.3, so its infimum ℓ exists and ℓ≥0; and for every real η>0 there is a natural n≥1 with 1/n<η, and then f(1/n)=1/n<η, so no positive real is a lower bound and ℓ=0.

step 1.3L3L4
3.1

f has no minimum: a minimum would be a value f(x0) that is a lower bound of f[ [0,1] ], hence at most the infimum 0; but every value of f is strictly positive.

step 1.3step 2.1L3
4.1

So f is upper semicontinuous on the nonempty compact set [0,1], is bounded below, and attains no minimum, which refutes the claim. It does attain a maximum, f(0)=1≥f(x) for every x∈[0,1], in agreement with the semicontinuous extreme value theorem.

step 1.1step 1.2step 3.1L5∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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