Canonical: https://knowlpedia.com/convex-analysis/basic-operations-preserving-convexity/

# Operations Preserving Convexity

Nonnegative scaling, finite sums, and finite maxima preserve convexity

**Operations Preserving Convexity**: Let \(X\) be a [vector space](https://knowlpedia.com/linear-algebra/vector-space/) and let \(f,f_i:X\to\overline{\mathbb{R}}\) be [convex functions](https://knowlpedia.com/convex-analysis/convex-function-via-epigraph/) for \(i=1,\dots,m\). Then:

1. (**Nonnegative scaling**) For any \(\lambda\ge 0\), the function \(\lambda f\) is convex.
2. (**Finite sums**) The function \(\sum_{i=1}^m f_i\) is convex.
3. (**Finite maxima**) The function \(\max_{1\le i\le m} f_i\) is convex.

## Remarks

These closure properties are foundational for building new convex functions from old ones and are frequently combined with [composition rules](https://knowlpedia.com/convex-analysis/convexity-preserved-under-monotone-convex-composition/) and [supremum constructions](https://knowlpedia.com/convex-analysis/supremum-of-convex-functions-is-convex/).

**Proof sketch (idea):** Use the Jensen inequality characterization from [equivalent characterizations of convex functions](https://knowlpedia.com/convex-analysis/equivalent-characterizations-of-convex-functions/) and check it termwise for each operation.
