Engel's theorem in Mathlib

04/20/2023
by   Oliver Nash, et al.
0

We discuss the theory of Lie algebras in Lean's Mathlib library. Using nilpotency as the theme, we outline a computer formalisation of Engel's theorem and an application to root space theory. We emphasise that all arguments work with coefficients in any commutative ring.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/06/2022

Formalizing the Ring of Adèles of a Global Field

The ring of adèles of a global field and its group of units, the group o...
research
12/08/2021

Formalising Lie algebras

Lie algebras are an important class of algebras which arise throughout m...
research
08/08/2022

Spectacularly large expansion coefficients in Müntz's theorem

Müntz's theorem asserts, for example, that the even powers 1, x^2, x^4,…...
research
06/09/2022

A computational framework for weighted simplicial homology

We provide a bottom up construction of torsion generators for weighted h...
research
05/22/2018

How To Solve Moral Conundrums with Computability Theory

Various moral conundrums plague population ethics: The Non-Identity Prob...
research
12/09/2022

The unstable formula theorem revisited

We first prove that Littlestone classes, those which model theorists cal...
research
10/07/2021

Formalizing Geometric Algebra in Lean

This paper explores formalizing Geometric (or Clifford) algebras into th...

Please sign up or login with your details

Forgot password? Click here to reset