Canonical: https://knowlpedia.com/convex-analysis/supremum-of-convex-functions-is-convex/

# Supremum of Convex Functions

The pointwise supremum of any family of convex functions is convex

**Supremum of Convex Functions**: Let \(X\) be a [vector space](https://knowlpedia.com/linear-algebra/vector-space/) and let \(\{f_i:X\to\overline{\mathbb{R}}\}_{i\in I}\) be a family of [convex functions](https://knowlpedia.com/convex-analysis/convex-function-via-epigraph/) indexed by a nonempty set \(I\). Define
\[
f(x):=\sup_{i\in I} f_i(x).
\]

Then \(f\) is convex on \(X\).

## Remarks

This extends the "finite maximum" case in [operations preserving convexity](https://knowlpedia.com/convex-analysis/basic-operations-preserving-convexity/) and is used heavily to construct convex envelopes and support functions.

**Proof sketch (idea):** For each \(i\), Jensen gives
\(f_i(\lambda x+(1-\lambda)y)\le \lambda f_i(x)+(1-\lambda)f_i(y)\le \lambda f(x)+(1-\lambda)f(y)\).
Taking \(\sup_i\) on the left yields Jensen for \(f\).
