Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Computer-assisted proof

Related lectures (27)

Explores Maxwell's equations in vacuum, photon scanning near-field optical microscope, light confinement, and experimental proof of light effects.

Explores formal verification using the LISA proof assistant and the OCBSL Equivalence Checker.

Explores formally secure compilation, emphasizing the importance of mathematical proofs and compartmentalization in ensuring component security.

Covers solutions to the 2018 exam, focusing on bounded functions and distinct solutions.

Explores the Supremum Theorem, its properties, proofs, and exercises.

Covers the organization of the Analyse II course for 2021, including webinars, exercises, and the final exam.

Covers the demonstration of a theorem regarding the minimum and maximum of a function.

Explores the Cauchy-Schwarz inequality in integrals and functions, offering a comprehensive understanding of its applications.

Covers the definition of an inductive data type in Coq and how to build proofs interactively using tactics.

Demonstrates how to use a specific function to prove Rolle's Theorem.

Explores quasilocality in statistical mechanics and the existence conditions of Gibbs measures.

Explores exploration bias and generalization bound in KL divergences, emphasizing mathematical proofs and implications.

Covers counting with recurrence relations, focusing on bit strings and the Tower of Hanoi problem.

Covers the properties of injective functions and demonstrates their proofs through examples and visual aids.

Explores implications and equivalences in linear algebra through examples and formal proofs.

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

Covers the concept of monodromy action in the context of coverings and explores transitivity and unique classes.

Covers the rigorous proof of differential equations, emphasizing accuracy and precision.

Covers the LISA proof assistant's codebase organization, kernel package, FOL formalization, and proof package.

Introduces the Cauchy-Lipschitz theorem and demonstrates uniqueness of global solutions.