Support (mathematics) explained

f is the subset of the function domain containing the elements which are not mapped to zero. If the domain of f is a topological space, then the support of f is instead defined as the smallest closed set containing all points not mapped to zero. This concept is used widely in mathematical analysis.

Formulation

Suppose that

f : X \to \R is a real-valued function whose domain is an arbitrary set X. The of f, written \operatorname{supp}(f), is the set of points in X where f is non-zero:$$\backslash operatorname(f)\; =\; \backslash .$$

The support of

f is the smallest subset of X with the property that f is zero on the subset's complement. If f(x) = 0 for all but a finite number of points x \in X, then f is said to have .

If the set

X has an additional structure (for example, a topology), then the support of f is defined in an analogous way as the smallest subset of X of an appropriate type such that f vanishes in an appropriate sense on its complement. The notion of support also extends in a natural way to functions taking values in more general sets than \R and to other objects, such as measures or distributions.

Closed support

The most common situation occurs when

X is a topological space (such as the real line or n -dimensional Euclidean space) and f : X \to \R is a continuous real- (or complex-) valued function. In this case, the of f , \operatorname{supp}(f) , or the of f , is defined topologically as the closure (taken in X ) of the subset of X where f is non-zero^{[1] [2] [3]} that is,$$\backslash operatorname(f)\; :=\; \backslash operatorname\_X\backslash left(\backslash \backslash right)\; =\; \backslash overline.$$

Since the intersection of closed sets is closed,

\operatorname{supp}(f) is the intersection of all closed sets that contain the set-theoretic support of f.

For example, if

f : \R \to \R is the function defined bythen \operatorname{supp}(f) , the support of f , or the closed support of f , is the closed interval [ -1 , 1 ], since f is non-zero on the open interval ( -1 , 1 ) and the closure of this set is [ -1 , 1 ].

The notion of closed support is usually applied to continuous functions, but the definition makes sense for arbitrary real or complex-valued functions on a topological space, and some authors do not require that

f : X \to \R (or f : X \to \Complex ) be continuous.^[4]

Compact support

Functions with on a topological space

X are those whose closed support is a compact subset of X. If X is the real line, or n -dimensional Euclidean space, then a function has compact support if and only if it has , since a subset of \R ^{n} is compact if and only if it is closed and bounded.

For example, the function

f : \R \to \R defined above is a continuous function with compact support [ -1 , 1 ]. If f : \R ^{n} \to \R is a smooth function then because f is identically 0 on the open subset \R ^{n} \setminus \operatorname{supp}(f), all of f 's partial derivatives of all orders are also identically 0 on \R ^{n} \setminus \operatorname{supp}(f).

The condition of compact support is stronger than the condition of vanishing at infinity. For example, the function

f : \R \to \R defined by$$f(x)\; =\; \backslash frac$$vanishes at infinity, since f(x) \to 0 as |x| \to inf ty, but its support \R is not compact.

Real-valued compactly supported smooth functions on a Euclidean space are called bump functions. Mollifiers are an important special case of bump functions as they can be used in distribution theory to create sequences of smooth functions approximating nonsmooth (generalized) functions, via convolution.

In good cases, functions with compact support are dense in the space of functions that vanish at infinity, but this property requires some technical work to justify in a given example. As an intuition for more complex examples, and in the language of limits, for any

\varepsilon > 0 , any function f on the real line \R that vanishes at infinity can be approximated by choosing an appropriate compact subset C of \R such thatfor all x \in X, where I _{C} is the indicator function of C. Every continuous function on a compact topological space has compact support since every closed subset of a compact space is indeed compact.

Essential support

If

X is a topological measure space with a Borel measure \mu (such as \R ^{n,} or a Lebesgue measurable subset of \R ^{n,} equipped with Lebesgue measure), then one typically identifies functions that are equal \mu -almost everywhere. In that case, the of a measurable function f : X \to \R written \operatorname{esssupp}(f), is defined to be the smallest closed subset F of X such that f = 0 \mu -almost everywhere outside F. Equivalently, \operatorname{esssupp}(f) is the complement of the largest open set on which f = 0 \mu -almost everywhere^[5] $$\backslash operatorname(f)\; :=\; X\; \backslash setminus\; \backslash bigcup\; \backslash left\backslash .$$

The essential support of a function

f depends on the measure \mu as well as on f, and it may be strictly smaller than the closed support. For example, if f : [ 0 , 1 ] \to \R is the Dirichlet function that is 0 on irrational numbers and 1 on rational numbers, and [ 0 , 1 ] is equipped with Lebesgue measure, then the support of f is the entire interval [ 0 , 1 ], but the essential support of f is empty, since f is equal almost everywhere to the zero function.

In analysis one nearly always wants to use the essential support of a function, rather than its closed support, when the two sets are different, so

\operatorname{esssupp}(f) is often written simply as \operatorname{supp}(f) and referred to as the support.^[6]

Generalization

If

M is an arbitrary set containing zero, the concept of support is immediately generalizable to functions f : X \to M. Support may also be defined for any algebraic structure with identity (such as a group, monoid, or composition algebra), in which the identity element assumes the role of zero. For instance, the family \Z ^{\N} of functions from the natural numbers to the integers is the uncountable set of integer sequences. The subfamily \left\{ f \in \Z ^{\N} : f hasfinitesupport \right\} is the countable set of all integer sequences that have only finitely many nonzero entries.

Functions of finite support are used in defining algebraic structures such as group rings and free abelian groups.^[7]

In probability and measure theory

In probability theory, the support of a probability distribution can be loosely thought of as the closure of the set of possible values of a random variable having that distribution. There are, however, some subtleties to consider when dealing with general distributions defined on a sigma algebra, rather than on a topological space.

More formally, if

X : \Omega \to \R is a random variable on (\Omega, l{F}, P) then the support of X is the smallest closed set R _{X} \subseteq \R such that P\left(X \in R _{X\right)} = 1 . X is often defined as the set R _{X} = \{x \in \R : P(X = x) > 0 \} and the support of a continuous random variable X is defined as the set R _{X} = \{x \in \R : f _{X(x)} > 0 \} where f _{X(x)} is a probability density function of X (the set-theoretic support).^[8]

Note that the word can refer to the logarithm of the likelihood of a probability density function.^[9]

Support of a distribution

\delta(x) on the real line. In that example, we can consider test functions F, which are smooth functions with support not including the point 0 . Since \delta(F) (the distribution \delta applied as linear functional to F ) is 0 for such functions, we can say that the support of \delta is \{ 0 \} only. Since measures (including probability measures) on the real line are special cases of distributions, we can also speak of the support of a measure in the same way.

Suppose that

f is a distribution, and that U is an open set in Euclidean space such that, for all test functions \phi such that the support of \phi is contained in U, f(\phi) = 0 . Then f is said to vanish on U. Now, if f vanishes on an arbitrary family U _{\alpha} of open sets, then for any test function \phi supported in $\backslash bigcup\; U\_,$ a simple argument based on the compactness of the support of \phi and a partition of unity shows that f(\phi) = 0 as well. Hence we can define the of f as the complement of the largest open set on which f vanishes. For example, the support of the Dirac delta is \{ 0 \}.

Singular support

In Fourier analysis in particular, it is interesting to study the of a distribution. This has the intuitive interpretation as the set of points at which a distribution .

For example, the Fourier transform of the Heaviside step function can, up to constant factors, be considered to be

1 /x (a function) at x = 0 . While x = 0 is clearly a special point, it is more precise to say that the transform of the distribution has singular support \{ 0 \} : it cannot accurately be expressed as a function in relation to test functions with support including 0 . It be expressed as an application of a Cauchy principal value integral.

For distributions in several variables, singular supports allow one to define and understand Huygens' principle in terms of mathematical analysis. Singular supports may also be used to understand phenomena special to distribution theory, such as attempts to 'multiply' distributions (squaring the Dirac delta function fails – essentially because the singular supports of the distributions to be multiplied should be disjoint).

Family of supports

X, suitable for sheaf theory, was defined by Henri Cartan. In extending Poincaré duality to manifolds that are not compact, the 'compact support' idea enters naturally on one side of the duality; see for example Alexander–Spanier cohomology.

Bredon, Sheaf Theory (2nd edition, 1997) gives these definitions. A family

\Phi of closed subsets of X is a, if it is down-closed and closed under finite union. Its is the union over \Phi. A family of supports that satisfies further that any Y in \Phi is, with the subspace topology, a paracompact space; and has some Z in \Phi which is a neighbourhood. If X is a locally compact space, assumed Hausdorff, the family of all compact subsets satisfies the further conditions, making it paracompactifying.

Notes and References

1. Book: Folland, Gerald B.. 1999. Real Analysis, 2nd ed.. 132. New York. John Wiley.
2. Book: Hörmander, Lars. 1990. Linear Partial Differential Equations I, 2nd ed.. 14. Berlin. Springer-Verlag.
3. Book: Pascucci, Andrea. 2011. PDE and Martingale Methods in Option Pricing. 678. 978-88-470-1780-1. 10.1007/978-88-470-1781-8. Berlin. Springer-Verlag. Bocconi & Springer Series.
4. Book: Rudin, Walter. 1987. Real and Complex Analysis, 3rd ed.. 38. New York. McGraw-Hill.
5. Book: Lieb. Elliott. Elliott H. Lieb. Loss. Michael. Michael Loss. Analysis. 2001. 2nd. American Mathematical Society. Graduate Studies in Mathematics. 14. 978-0821827833. 13.
6. In a similar way, one uses the essential supremum of a measurable function instead of its supremum.
7. Book: Tomasz, Kaczynski. Computational homology. 2004. Springer. Mischaikow, Konstantin Michael,, Mrozek, Marian. 9780387215976. New York. 445. 55897585.
8. Web site: Taboga. Marco. Support of a random variable. statlect.com. 29 November 2017.
9. Book: Edwards, A. W. F.. Likelihood. Expanded. Baltimore. Johns Hopkins University Press. 1992. 0-8018-4443-6. 31–34.