FACTOID # 8: North Korea spends the most of its GDP on its military.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Kernel of a function

In mathematics, 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.

Note that there are several other meanings of the word "kernel" in mathematics; see kernel (mathematics) for these.


For the formal definition, let X and Y be sets and let f be a function from X to Y. Elements x1 and x2 of X are equivalent if f(x1) and f(x2) are equal, i.e. are the same element of Y. The kernel of f is the equivalence relation thus defined.


The kernel, in the equivalence-relation sense, may be denoted "=f" (or a variation) and may be defined symbolically as

Like any equivalence relation, the kernel can be modded out by to form a quotient set, and the quotient set is the partition:

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).


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

But this is not useful merely as a formalisation in set theory! In fact, the study of the properties of this subset can shed important light on the function in question. We give here two examples.


First, if X and Y are algebraic structures of some fixed type (such as groups, rings, or vector spaces), and if the function f from X to Y is a homomorphism, then ker f will be a subalgebra of the direct product X × X. Subalgebras of X × X that are also equivalence relations (called congruence relations) are important in abstract algebra, because they define the most general notion of quotient algebra. Thus the coimage of f is a quotient algebra of X much as the image of f is a subalgebra of Y; and the bijection between them becomes an isomorphism in the algebraic sense as well (this is the most general form of the first isomorphism theorem in algebra). The use of kernels in this context is discussed further in the article Kernel (algebra).


Secondly, if X and Y are topological spaces and f is a continuous function between them, 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.


  Results from FactBites:
 
Month of Kernel Bugs (MoKB) archive (1589 words)
This particular vulnerability is caused by an integer overflow at ffs_mountfs() function.
The UFS filesystem handling code of the Solaris 10 kernel fails to properly handle corrupted data structures, leading to an exploitable denial of service issue and potential loss of data or corruption of the local UFS filesystems, due to memory corruption.
This particular vulnerability is caused by a null pointer dereference in the superblock_doinit function.
System Calls (1180 words)
When a process requests a service from the kernel (such as opening a file, forking to a new process, or requesting more memory), this is the mechanism used.
Then it calls the function, and after it returns, does a few system checks and then return back to the process (or to a different process, if the process time ran out).
Next, B is inserted into the kernel, which replaces the system call with B_open, which will call what it thinks is the original system call, A_open, when it's done.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.