Math 2.0

Concept

Smooth maximum

Summary

In mathematics, a smooth maximum of an indexed family x1, ..., xn of numbers is a smooth approximation to the maximum function max⁡(x1,…,xn),\max(x_1,\ldots,x_n), meaning a parametric family of functions mα(x1,…,xn)m_\alpha(x_1,\ldots,x_n) such that for every α\alpha, the function mαm_\alpha is smooth, and the family converges to the maximum function mα→max⁡m_\alpha \to \max as α→∞\alpha\to\infty. The concept of smooth minimum is similarly defined. In many cases, a single family approximates both: maximum as the parameter goes to positive infinity, minimum as the parameter goes to negative infinity; in symbols, mα→max⁡m_\alpha \to \max as α→∞\alpha \to \infty and mα→min⁡m_\alpha \to \min as α→−∞\alpha \to -\infty. The term can also be used loosely for a specific smooth function that behaves similarly to a maximum, without necessarily being part of a parametrized family.

Further reading

  1. Wikipedia, page 45456706, revision 1317993932, Smooth maximum. adopted
About this page
Tag4QXDXYK279
URIm2://4QXDXYK279
Aliasessmooth-minimum
Kindconcept
WritingW1 stated
Same as
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.