Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
This lecture covers the concepts of surjections and bijections in linear algebra, explaining how a function can be surjective or bijective based on the relationship between its domain and codomain. The instructor discusses the conditions for a function to be surjective and demonstrates how to identify the inverse function in different scenarios.