Lecture

Linear Applications: Kernel

Description

This lecture covers the concept of the kernel of a linear application between vector spaces. The instructor defines the kernel as the set of vectors that are mapped to the zero vector. Examples are provided to illustrate the concept, including the projection onto a plane and derivative operator. The lecture also discusses properties of the kernel, such as being a subspace of the domain space and its relation to the injectivity of the linear application. A detailed proof is given to show that the kernel is non-empty if the linear application is not injective. The lecture concludes with an example where students are tasked with determining the injectivity of a given linear application and finding its kernel.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.