This lecture covers the Darcy problem, focusing on discretisations and the concept of coercivity, explaining the well-posedness of the formulation and the regularity conditions. It discusses the inf-sup condition, the coercivity of the formulation, and the properties of the kernel.