Kernel
From Maths
Contents
[hide]Definition
Given a function between two spaces X and Y of the same type of space (which is imbued with an identity element), the kernel of f:X→Y (where f is a function) is defined as:
- Ker(f)={x∈X|f(x)=e} where e denotes the identity of Y
Potential generalisation
Given a function f:X→Y the kernel where Y is a space imbued with the concept of identity[footnotes 1] (this identity shall be denoted e) written as follows:
- Ker(f)={x∈X|f(x)=e}
Vector spaces
Given a linear map T∈L(V,W) where V and W are vector spaces over the field F, that is T:U→V, the kernel of T is:
- Ker(T)={v∈V|Tv=0}[1] using the notation Tv=T(v)
Potential generalisation
Given any function f:X→V where X is any set and V a vector space, we may define the kernel of f as follows:
- Ker(f)={x∈X|f(x)=0} where 0 denotes the additive identity of the vector space
Groups
Given a homomorphism f:(G,×1)→(H,×2) between two groups, G and H, we define the kernel of f as follows:
- Ker(f)={g∈G|f(g)=eH} where eH is the identity of H
Potential generalisation
I believe we can extend this definition to any map:
- Given a group (G,×) where e denotes the identity, and a function f:X→G where X is any set. The :kernel is defined as follows:
- Ker(f)={x∈X|f(x)=e}
Notes
References
- Jump up ↑ Advanced Linear Algebra - Steven Roman - Third Edition - Springer GTM