Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2303.12404

Un experimento de demostraci\'on formal de un teorema de nivel intermedio en \'algebra (Formalizing the proof of an intermediate-level algebra theorem -- An experiment)

Antoine Chambert-Loir
View original source ↗Read source document ↗Export metadata ↓

Abstract

Proof assistants are computer softwares that allow us to write mathematical proofs so as to assess their correctness. In November 2021, I started the project of checking the simplicity of the alternating groups within the Lean theorem prover and its mathlib library. This text aims at reviewing this experiment. -- (French) Les assistants de preuves sont des logiciels qui permettent de r\'ediger des d\'emonstrations math\'ematiques et d'en garantir leur correction. En novembre 2021, j'ai d\'ebut\'e un projet de v\'erification de la simplicit\'e des groupes altern\'es au sein de l'assistant de preuve Lean, et de sa librairie mathlib. Ce texte est un essai de compte rendu de cette exp\'erience. -- Published version in Spanish

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Antoine Chambert-Loir. 2023-03-22. Un experimento de demostraci\'on formal de un teorema de nivel intermedio en \'algebra (Formalizing the proof of an intermediate-level algebra theorem -- An experiment). https://arxiv.org/abs/2303.12404

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗