More generally, the kernel in algebra is the set of elements that map to the neutral element. Here, the mapping is assumed to be a homomorphism, that is, it preserves algebraic operations, and, in particular, maps neutral element to neutral element. The kernel is then the set of all elements that the mapping cannot distinguish from the neutral element.
In set theory, the kernel of a function is the set of all pairs of elements that the function cannot distinguish, that is, they map to the same value. This is a generalization of the kernel concept above to the case when there is no neutral element.
In set theory, the difference kernel or binary equalizer is the set of all elements where the values of two functions coincide.
Kernel may also mean a function of two variables, which is used to define a mapping:
In integral calculus, the kernel (also called integral kernel or kernel function) is a function of two variables that defines the integral transform, such as the function k in
In the case when the integral kernel depends only on the difference between its arguments, it becomes a convolution kernel, as in
In probability theory and statistics, stochastic kernel is the transition function of a stochastic process. In a discrete time process with continuous probability distributions, it is the same thing as the kernel of the integral operator that advances the probability density function.
Kernel trick is a technique to write a nonlinear operator as a linear one in a space of higher dimension.
This disambiguation page lists mathematics articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article.