Kernel (set theory)
In set theory, the kernel of a function f (or equivalence kernel) may be taken to be either
the equivalence relation on the function's domain that roughly expresses the idea of "equivalent as far as the function f can tell", or the corresponding partition of the domain. An unrelated notion is that of the kernel of a non-empty family of sets ℬ, which by definition is the intersection of all its elements: kerℬ = ⋂B∈ℬB. This definition is used in the theory of filters to classify them as being free or principal.
Wikipedia contributors, "Kernel (set theory)", Wikipedia, revision 1345814242, retrieved 20 November 2026, source, CC BY-SA 4.0.