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.
Upper and lower semicontinuity on subsets of
Definition
Let , let , let , and let . Using the Euclidean metric and its balls ( as the set of functions , and , , are metrics on it, Open ball, closed ball and sphere in a metric space), is upper semicontinuous at when for every there is such that for every .
The function is lower semicontinuous at when for every there is such that
It is upper or lower semicontinuous on when the corresponding condition holds at every point of . These are relative notions on ; when is empty, each on-set condition is vacuous. A continuous function (Continuity of a map between metric spaces, at a point and globally, in the - form) satisfies both conditions.
Depends on
Used by
- A lower semicontinuous function on [0,1] with no maximum Counterexample
- Characteristic functions of open and closed sets are one-sided semicontinuous Example
- Euclidean semicontinuity agrees with the published real-line definition Proposition
- Lower semicontinuity is equivalent to a closed epigraph and upper semicontinuity to a closed hypograph Theorem
- Semicontinuity on ℝⁿ is characterized by strict open level sets and weak closed level sets Theorem
- Semicontinuous extreme value theorem on compact Euclidean sets Theorem
Dependency tree · two levels
23 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 4 (standard reference, not scraped)