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.
A lower semicontinuous function on with no maximum
Statement refuted
Every lower semicontinuous real-valued function on a nonempty compact set attains both a minimum and a maximum.
Facts & Assumptions
Given: Define by and for , with the one-dimensional convention identified by Upper and lower semicontinuity on subsets of , Euclidean semicontinuity agrees with the published real-line definition.
Lower semicontinuity is equivalent to relative openness of every strict superlevel set and to relative closedness of every weak sublevel set (Semicontinuity on is characterized by strict open level sets and weak closed level sets).
Every lower semicontinuous real-valued function on a nonempty compact Euclidean set is bounded below and attains a minimum (Semicontinuous extreme value theorem on compact Euclidean sets).
Counterexample
The weak sublevel is empty for , equals at , equals for , and is all of for . Each is relatively closed, so [L1] makes lower semicontinuous.
Every value of is negative, but approaches zero through positive natural . Hence and the supremum is not attained, so has no maximum.
The function does attain its minimum at zero, as [L2] requires. It is only the unsupported opposite extremum that fails.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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
- D. Bertsekas, MIT 6.253 Convex Analysis and Optimization, Lectures 2 and 5 (standard reference, not scraped)