Kernel of a function: Difference between revisions
Jump to navigation
Jump to search
imported>Richard Pinch (new entry, just a stub) |
imported>Richard Pinch (mention First Isomorphism Theorem) |
||
Line 11: | Line 11: | ||
:<math>q_\sim : x \mapsto [x]_\sim , \, </math> | :<math>q_\sim : x \mapsto [x]_\sim , \, </math> | ||
where <math>[x]_\sim\,</math> is the equivalence class of ''x'' under <math>\sim\,</math>. Then the kernel of the quotient map <math>q_\sim</math> is just <math>\sim\,</math>. | where <math>[x]_\sim\,</math> is the equivalence class of ''x'' under <math>\sim\,</math>. Then the kernel of the quotient map <math>q_\sim\,</math> is just <math>\sim\,</math>. This may be regarded as the set-theoretic version of the [[First Isomorphism Theorem]]. |
Revision as of 16:29, 15 November 2008
In set theory, the kernel of a function is the equivalence relation on the domain of the function expressing the property that equivalent elements have the same image under the function.
If then we define the relation by
The equivalence classes of are the fibres of f.
Every function gives rise to an equivalence relation as kernel. Conversely, every equivalence relation on a set X gives rise to a function of which it is the kernel. Consider the quotient set of equivalence classes under and consider the quotient map defined by
where is the equivalence class of x under . Then the kernel of the quotient map is just . This may be regarded as the set-theoretic version of the First Isomorphism Theorem.