Lesson plan
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 \mathcal{B}, which by definition is the intersection of all its elements: \ker \mathcal{B} ~=~ \bigcap_{B \in \mathcal{B}} \, B. This definition is used in the theory of filters to classify them as being free or principal.
Article summary
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 \mathcal{B}, which by definition is the intersection of all its elements: \ker \mathcal{B} ~=~ \bigcap_{B \in \mathcal{B}} \, B. This definition is used in the theory of filters to classify them as being free or principal.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.