TheoremBase

The Maximum of Two Upper Semicontinuous Functions

The pointwise maximum of two functions upper semicontinuous at a point is upper semicontinuous there, and dually the pointwise minimum of two lower semicontinuous functions is lower semicontinuous.

Statement

Let (X,d)(X,d) be a metric space, let A⊆XA\subseteq X, and let R\mathbb{R} be the set of real numbers with the addition and the order ≤\le of its ordered field structure, which is a total order by that definition; for a,b∈Ra,b\in\mathbb{R} we write a<ba<b to mean that a≤ba\le b and a≠ba\ne b, and a−ba-b for a+(−b)a+(-b). For a,b∈Ra,b\in\mathbb{R} let max⁡{a,b}\max\{a,b\} be their maximum and min⁡{a,b}\min\{a,b\} their minimum.

Let u,v:A→Ru,v:A\to\mathbb{R}, and let u∨v:A→Ru\vee v:A\to\mathbb{R} and u∧v:A→Ru\wedge v:A\to\mathbb{R} be the functions whose values at y∈Ay\in A are

(u∨v)(y)=max⁡{u(y),v(y)},(u∧v)(y)=min⁡{u(y),v(y)}.(u\vee v)(y)=\max\{u(y),v(y)\},\qquad (u\wedge v)(y)=\min\{u(y),v(y)\}.

Then the following hold.

1. (Minimum through the maximum) min⁡{a,b}=−max⁡{−a,−b}\min\{a,b\}=-\max\{-a,-b\} for all a,b∈Ra,b\in\mathbb{R}; consequently u∧v=−((−u)∨(−v))u\wedge v=-\bigl((-u)\vee(-v)\bigr), where −u-u is the function whose value at yy is −u(y)-u(y).

2. (Maximum of two upper semicontinuous functions) Let x∈Ax\in A. If uu and vv are upper semicontinuous at xx relative to AA, then so is u∨vu\vee v. In particular, if uu and vv are upper semicontinuous on AA, then so is u∨vu\vee v.

3. (Minimum of two lower semicontinuous functions) Let x∈Ax\in A. If uu and vv are lower semicontinuous at xx relative to AA, then so is u∧vu\wedge v. In particular, if uu and vv are lower semicontinuous on AA, then so is u∧vu\wedge v.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…