Kernel (set theory)
id:
kernel-set-theory-230-2519050
title:
Kernel (set theory)
text:
In set theory, the kernel of a function f 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 B, which by definition is the intersection of all its elements: ker B = ⋂ B ∈ B B. This definition is used in the theory of filters to classify them as being free or p
brand slug:
wiki
category slug:
encyclopedia
description:
Equivalence relation expressing that two elements have the same image under a function
original url:
https://en.wikipedia.org/wiki/Kernel_(set_theory)
date created:
2003-09-28T11:25:20Z
date modified:
2024-09-15T19:05:50Z
main entity:
{"identifier":"Q687704","url":"https://www.wikidata.org/entity/Q687704"}
image:
fields total:
13
integrity:
15