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…
≈ 5 min read
Kernel (set theory). encyclopegia.org, snapshot enwiki-001345814242. /a/kernel-set-theory
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In set theory, the kernel of a function f (or equivalence kernel[1]) 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",[2] 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.
Definition
edit edit sourceKernel of a function
For the formal definition, let f:X→Y be a function between two sets. Elements x1,x2∈X are equivalent if and only if f(x1) and f(x2) are equal, that is, are the same element of Y. The kernel of f is the equivalence relation thus defined.[2]
Kernel of a family of sets
The kernel of a family ℬ≠∅ of sets is[3] kerℬ := ⋂B∈ℬB. The kernel of ℬ is also sometimes denoted by ∩ℬ. The kernel of the empty set, ker∅, is typically left undefined. A family is called fixed and is said to have non-empty intersection if its kernel is not empty.[3] A family is said to be free if it is not fixed; that is, if its kernel is the empty set.[3]
Quotients
edit edit sourceLike any equivalence relation, the kernel can be modded out to form a quotient set, and the quotient set is the partition: {{w∈X:f(x)=f(w)} : x∈X} = {f−1(y) : y∈f(X)}.
This quotient set X/=f is called the coimage of the function f, and denoted coimf (or a variation). The coimage is naturally isomorphic (in the set-theoretic sense of a bijection) to the image, imf; specifically, the equivalence class of x in X (which is an element of coimf) corresponds to f(x) in Y (which is an element of imf).
As a subset of the Cartesian product
edit edit sourceLike any binary relation, the kernel of a function may be thought of as a subset of the Cartesian product X×X. In this guise, the kernel may be denoted kerf (or a variation) and may be defined symbolically as[2] kerf:={(x,x′):f(x)=f(x′)}.
The study of the properties of this subset can shed light on f.
Algebraic structures
edit edit sourceIf X and Y are algebraic structures of some fixed type (such as groups, rings, or vector spaces), and if the function f:X→Y is a homomorphism, then kerf is a congruence relation (that is an equivalence relation that is compatible with the algebraic structure), and the coimage of f is a quotient of X.[2] The bijection between the coimage and the image of f is an isomorphism in the algebraic sense; this is the most general form of the first isomorphism theorem.
In topology
edit edit sourceIf f:X→Y is a continuous function between two topological spaces then the topological properties of kerf can shed light on the spaces X and Y. For example, if Y is a Hausdorff space then kerf must be a closed set. Conversely, if X is a Hausdorff space and kerf is a closed set, then the coimage of f, if given the quotient space topology, must also be a Hausdorff space.
A space is compact if and only if the kernel of every family of closed subsets having the finite intersection property (FIP) is non-empty;[4][5] said differently, a space is compact if and only if every family of closed subsets with F.I.P. is fixed.
See also
edit edit source- Filter on a set – Family of subsets representing "large" sets
References
edit edit source- ^ Mac Lane, Saunders; Birkhoff, Garrett (1999), Algebra, Chelsea Publishing Company, p. 33, ISBN 0821816462. Wikipedia revision 1345814242, retrieved 2026-11-18
- ^ a b c d Bergman, Clifford (2011), Universal Algebra: Fundamentals and Selected Topics, Pure and Applied Mathematics, vol. 301, CRC Press, pp. 14–16, ISBN 9781439851296. Wikipedia revision 1345814242, retrieved 2026-11-18
- ^ a b c Dolecki & Mynard 2016, pp. 27–29, 33–35. Wikipedia revision 1345814242, retrieved 2026-11-18
- ^ Munkres, James (2004). Topology. New Delhi: Prentice-Hall of India. p. 169. ISBN 978-81-203-2046-8. Wikipedia revision 1345814242, retrieved 2026-11-18
- ^ A space is compact iff any family of closed sets having fip has non-empty intersection at PlanetMath. Wikipedia revision 1345814242, retrieved 2026-11-18
Bibliography
edit edit source- Awodey, Steve (2010) [2006]. Category Theory. Oxford Logic Guides. Vol. 49 (2nd ed.). Oxford University Press. ISBN 978-0-19-923718-0.
- Dolecki, Szymon; Mynard, Frédéric (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1345814242 under CC BY-SA 4.0; modifications have been made.