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…

Uses your system voice; voice and rate in settings.

≈ 5 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

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

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 source

Kernel 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 source

Like 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 coim⁡f (or a variation). The coimage is naturally isomorphic (in the set-theoretic sense of a bijection) to the image, im⁡f; specifically, the equivalence class of x in X (which is an element of coim⁡f) corresponds to f(x) in Y (which is an element of im⁡f).

As a subset of the Cartesian product

edit edit source

Like 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 ker⁡f (or a variation) and may be defined symbolically as[2] ker⁡f:={(x,x′):f(x)=f(x′)}.

The study of the properties of this subset can shed light on f.

Algebraic structures

edit edit source

If 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 ker⁡f 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 source

If f:X→Y is a continuous function between two topological spaces then the topological properties of ker⁡f can shed light on the spaces X and Y. For example, if Y is a Hausdorff space then ker⁡f must be a closed set. Conversely, if X is a Hausdorff space and ker⁡f 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

References

edit edit source
  1. ^ Mac Lane, Saunders; Birkhoff, Garrett (1999), Algebra, Chelsea Publishing Company, p. 33, ISBN 0821816462. Wikipedia revision 1345814242, retrieved 2026-11-18
  2. ^ 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
  3. ^ a b c Dolecki & Mynard 2016, pp. 27–29, 33–35. Wikipedia revision 1345814242, retrieved 2026-11-18
  4. ^ 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
  5. ^ 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

Text derived from https://en.wikipedia.org/w/index.php?oldid=1345814242 under CC BY-SA 4.0; modifications have been made.

Words in each sectionDefinitionDefinitionDefinition: 147 words147In topologyIn topologyIn topology: 132 words132QuotientsQuotientsQuotients: 114 words114Algebraic structuresAlgebraic structuresAlgebraic structures: 92 words92As a subset of the Cart…As a subset of the Cartesian productAs a subset of the Cartesian product: 72 words72BibliographyBibliographyBibliography: 68 words68See alsoSee alsoSee also: 14 words14
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001345814242 · captured 2026-03-28 · ledger · version history

Cite this page as: encyclopegia.org, “Kernel (set theory)”, snapshot enwiki-001345814242. https://encyclopegia.org/a/kernel-set-theory