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 semicontinuous real map on a topological space
Definition
Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let . The map is upper semicontinuous if, for every , the strict sublevel set
is open in . Equivalently, every superlevel set is closed, because it is the complement of the strict sublevel set.
When has the subspace topology, this agrees with the existing pointwise definition: the equivalence with openness of all strict sublevels is exactly is upper semicontinuous on if and only if is relatively open in for every real , lower semicontinuous if and only if is, and continuous if and only if it is both, claim
- The empty-domain condition is vacuous, constant functions are upper semicontinuous, and the inequalities deliberately distinguish the open threshold from the closed threshold .
Depends on
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- $f$ is upper semicontinuous on $A$ if and only if $\{x \in A : f(x) < \alpha\}$ is relatively open in $A$ for every real $\alpha$, lower semicontinuous if and only if $\{x \in A : f(x) > \alpha\}$ is, and continuous if and only if it is both
Used by
- Bauer maximum principle Corollary
Dependency tree · two levels
7 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
- Ian Ball, Bauer’s Maximum Principle for Quasiconvex Functions (standard reference, not scraped)