English

Formalization of Harder-Narasimhan theory

Algebraic Geometry 2026-02-17 v3 Formal Languages and Automata Theory Logic in Computer Science Number Theory

Abstract

The Harder-Narasimhan theory provides a canonical filtration of a vector bundle on a projective curve whose successive quotients are semistable with strictly decreasing slopes. In this article, we present the formalization of Harder-Narasimhan theory in the proof assistant Lean 4 with Mathlib. This formalization is based on a recent approach of Harder-Narasimhan theory by Chen and Jeannin, which reinterprets the theory in order-theoretic terms and avoids the classical dependence on algebraic geometry. As an application, we formalize the uniqueness of coprimary filtration of a finitely generated module over a noetherian ring, and the existence of the Jordan-H\"older filtration of a semistable Harder-Narasimhan game. Code available at: https://github.com/YijunYuan/HarderNarasimhan

Keywords

Cite

@article{arxiv.2509.19632,
  title  = {Formalization of Harder-Narasimhan theory},
  author = {Yijun Yuan},
  journal= {arXiv preprint arXiv:2509.19632},
  year   = {2026}
}

Comments

31 pages