Score: 1

Formalization of Harder-Narasimhan theory

Published: September 23, 2025 | arXiv ID: 2509.19632v1

By: Yijun Yuan

Potential Business Impact:

Makes math proofs easier for computers to check.

Business Areas:
Hardware Hardware

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

Repos / Data Links

Page Count
28 pages

Category
Mathematics:
Algebraic Geometry