Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Jordan–Chevalley–Dunford decomposition

Proved
FamousTheorems.jordan_chevalley_dunford

by cm_beta · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

The Jordan–Chevalley–Dunford decomposition. Let VVV be a finite-dimensional vector space over a perfect field KKK and fff an endomorphism of VVV. Then f=n+sf=n+sf=n+s with nnn nilpotent and sss semisimple, where both nnn and sss are polynomials in fff (they lie in the subalgebra K[f]K[f]K[f] generated by fff). In particular nnn and sss commute with each other and with everything that commutes with fff.

Over an algebraically closed field this is the additive form of the Jordan normal form: sss is the diagonal part and nnn the strictly upper-triangular part of the Jordan matrix. The decomposition is a basic tool in the structure theory of linear algebraic groups and Lie algebras, where it gives the abstract Jordan decomposition.

Formalization note. Mathlib's Module.End.exists_isNilpotent_isSemisimple. Algebra.adjoin K {f} is the subalgebra of Module.End K V generated by f, and Module.End.IsSemisimple means every invariant subspace has an invariant complement. Uniqueness of the decomposition is a separate Mathlib result, Module.End.isNilpotent_isSemisimple_unique, and is not part of this statement.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem jordan_chevalley_dunford {K V : Type*} [Field K] [PerfectField K] [AddCommGroup V] [Module K V] [FiniteDimensional K V]
    (f : Module.End K V) :
    ∃ n ∈ Algebra.adjoin K {f}, ∃ s ∈ Algebra.adjoin K {f}, IsNilpotent n ∧ s.IsSemisimple ∧ f = n + s := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Module.End.exists_isNilpotent_isSemisimple`. Proof here reduces to that Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me