Search arXivSearch

arXiv · 1103.5020

Décomposition effective de Jordan-Chevalley et ses retombées en enseignement

Abstract

The purpose of this paper is to point the effectiveness of the Jordan-Chevalley decomposition, i.e. the decomposition of a square matrix $U$ with coefficients in a field $k$ containing the eigenvalues of $U$ as a sum $U=D+N,$ where $D$ is a diagonalizable matrix and $N$ a nilpotent matrix which commutes with $D.$ The most general version of this decomposition shows that every separable element $u$ of a $k$-algebra $A$ can be written in a unique way as a sum $u=d+n,$ where $d \in A$ is absolutely semi-simple and where $n\in A$ is nilpotent and commutes with $d.$ In fact an algorithm, due to C. Chevalley, allows to compute this decomposition: this algorithm is an adaptation to this context of the Newton method, which gives here the exact value of the absolutely semi-simple part $d$ of $u$ after a finite number of iterations. We illustrate the effectiveness of this method by computing the decomposition of a $15 \times 15$ matrix having eigenvalues of multiplicity 3 which are not computable exactly. We also discuss the other classical method, based on the chinese remainder theorem, which gives the Jordan-Chevalley decomposition under the form $u=q(u) +[u-q(u)],$ with $q(u)$ absolutely semi-simple, $u-q(u)$ nilpotent, where $q$ is any solution of a system of congruence equations related to the roots of a polynomial $p\in k[x]$ such that $p(u)=0.$ It is indeed possible to compute $q$ without knowing the roots of $p$ by applying the algorithm discussed above to $π(x),$ where $π: k[x] \to k[x]/pk[x]$ is the canonical surjection. We obtain this way after 2 iterations the polynomial $q$ of degree 14 associated to the $15\times 15$ matrix mentioned above. We justify by historical considerations the use of the name "Jordan-Chevalley decomposition", instead of the name "Dunford decomposition" which also appears in the literature, and we discuss multiplicative versions of this decomposition in semi-simple Lie groups. We conclude this paper showing why this decomposition should play a central role in a linear algebra course, even at a rather elementary level. Our arguments are based on a teaching experience of more than 10 years in an engineering school located on the Basque Coast.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Danielle Couty, Jean Esterle, Rachid Zarouf. 2013-01-15. Décomposition effective de Jordan-Chevalley et ses retombées en enseignement. https://arxiv.org/abs/1103.5020

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

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA