SubjectsSubjects(version: 978)
Course, academic year 2025/2026
   Login via CAS
   
LEAN – Computer-Assisted Proofs - NTIN115
Title: LEAN -- důkazy pomocí počítače
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2025
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: English
Teaching methods: full-time
Guarantor: doc. Mgr. Robert Šámal, Ph.D.
Teacher(s): doc. Mgr. Robert Šámal, Ph.D.
Annotation -
Using the interactive proof assistant LEAN.
Last update: Pangrác Ondřej, RNDr., Ph.D. (16.05.2025)
Course completion requirements -

Exercises in the form of homework assignments. Credit is awarded for solving a sufficient number of problems.

The exam is for writing a more extensive proof using LEAN and a follow-up discussion about the proof.

Last update: Šámal Robert, doc. Mgr., Ph.D. (06.10.2025)
Literature -

Bhavik Mehta: Formalising Mathematics

https://github.com/b-mehta/formalising-mathematics-notes

Jeremy Avigad: Mathematics in LEAN

https://leanprover-community.github.io/mathematics_in_lean/

https://lean-lang.org/publications/

Last update: Pangrác Ondřej, RNDr., Ph.D. (16.05.2025)
Syllabus -
  • Using the LEAN system on examples familiar to bachelor students
  • Emphasis on ease and intuitive use
  • Examples from linear algebra, number theory, analysis, and discrete mathematics
  • Depending on interest, also:
  • - Metaprogramming (extending the system with new automated proving procedures)
  • - Advanced recent theorems verified using LEAN
  • - Demonstrations of machine learning applications

Last update: Šámal Robert, doc. Mgr., Ph.D. (05.09.2025)
 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html