FACTOID # 171: Want to go to the United States? Try going to Albania first. Albania has more U.S visa lottery winners per capita than anywhere else in the world.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Nilpotent matrix

In mathematics, a nilpotent matrix is an n×n square matrix M such that For other meanings of mathematics or uses of math and maths, see Mathematics (disambiguation) and Math (disambiguation). ... For the square matrix section, see square matrix. ...

M^q = 0,

for some positive integer q. Similarly, a nilpotent transformation is a linear transformation L with Lq = 0 for some integer q. In mathematics, a linear transformation (also called linear map or linear operator) is a function between two vector spaces that preserves the operations of vector addition and scalar multiplication. ...


These are special cases of a more general concept of nilpotence that applies not only to matrices and linear transformations but to members of rings. In mathematics, an element x of a ring R is called nilpotent if there exists some positive integer n such that xn = 0. ... In ring theory, a branch of abstract algebra, a ring is an algebraic structure in which addition and multiplication are defined and have similar properties to those familiar from the integers. ...

Contents

Examples

Consider the following matrix:

 N = begin{bmatrix} 0 & 1 & 0 & 0 0 & 0 & 1 & 0 0 & 0 & 0 & 1 0 & 0 & 0 & 0 end{bmatrix}.

This is an example of a 4×4 nilpotent matrix (in fact, matrices of this form are called shift matrices). Notice the non-zero superdiagonal. The characteristic feature of this matrix is: In mathematics, a shift matrix is a binary matrix with ones only on the superdiagonal or subdiagonal, and zeroes elsewhere. ... In mathematics, diagonal has a geometric meaning, and a derived meaning as used in square tables and matrix terminology. ...

 N^2 = begin{bmatrix} 0 & 0 & 1 & 0 0 & 0 & 0 & 1 0 & 0 & 0 & 0 0 & 0 & 0 & 0 end{bmatrix} ; N^3 = begin{bmatrix} 0 & 0 & 0 & 1 0 & 0 & 0 & 0 0 & 0 & 0 & 0 0 & 0 & 0 & 0 end{bmatrix} ; N^4 = begin{bmatrix} 0 & 0 & 0 & 0 0 & 0 & 0 & 0 0 & 0 & 0 & 0 0 & 0 & 0 & 0 end{bmatrix}.

The super-diagonal keeps 'shifting' diagonally up, until one gets the null matrix. In mathematics, a zero matrix is a matrix with all its entries being zero. ...


The corresponding nilpotent transformation L : R4R4 is defined by:

 L(x_1,x_2,x_3,x_4) = (x_2,x_3,x_4,0). ,

There is a classification theorem showing that this is typical: a nilpotent matrix is similar to a block matrix, with diagonal square blocks generalizing this type, and other blocks zero. Several equivalence relations in mathematics are called similarity. ... In the mathematical discipline of matrix theory, a block matrix or a partitioned matrix is a partition of a matrix into rectangular smaller matrices called blocks. ...


Properties

Let M be an n×n nilpotent matrix.

  • The smallest integer q such that Mq = 0 is smaller than or equal to n.
  • Over an algebraically closed field, a matrix M is nilpotent if and only if its eigenvalues are all zero. Therefore the determinant and trace of M are both zero, and nilpotent matrices are not invertible.
  • Suppose A and B are matrices. If A is invertible, then A − 1B is nilpotent if and only if det(A + tB) does not depend on t. This follows since
det(A+tB)=det A cdot det (I+t A^{-1}B)=det A cdot prod_k (1+lambda_k t)
when lambda_1, ldots, lambda_n are eigenvalues of A − 1B.

In mathematics, a number is called an eigenvalue of a matrix if there exists a nonzero vector such that the matrix times the vector is equal to the same vector multiplied by the eigenvalue. ... In algebra, a determinant is a function depending on n that associates a scalar, det(A), to every n×n square matrix A. The fundamental geometric meaning of a determinant is as the scale factor for volume when A is regarded as a linear transformation. ... In linear algebra, the trace of an n-by-n square matrix A is defined to be the sum of the elements on the main diagonal (the diagonal from the upper left to the lower right) of A, i. ... In linear algebra, an n-by-n (square) matrix A is called invertible or non-singular if there exists an n-by-n matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. ... In linear algebra, one associates a polynomial to every square matrix, its characteristic polynomial. ... In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix where the entries below or above the main diagonal are zero. ... In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix where the entries below or above the main diagonal are zero. ... In mathematics and especially linear algebra, an n-by-n matrix A is called invertible, non-singular or regular if there exists another n-by-n matrix B such that AB = BA = In, where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. ...

Classification theorem

The above example is typical, as the following result shows. Every nilpotent matrix is similar to a block diagonal matrix Several equivalence relations in mathematics are called similarity. ... In mathematics, a block diagonal matrix is a block matrix which is a square matrix, and having main diagonal blocks square matrices, such that the off-diagonal blocks are zero matrices. ...

 begin{bmatrix} N_1 & 0 & 0 & ldots & 0  0 & N_2 & 0 & ldots & 0  0 & 0 & N_3 & ldots & 0  vdots & vdots & vdots & ddots & vdots  0 & 0 & 0 & ldots & N_k end{bmatrix}

where the blocks Ni have ones on the superdiagonal and zeros everywhere else:

 N_i = begin{bmatrix} 0 & 1 & 0 & ldots & 0 & 0  0 & 0 & 1 & ldots & 0 & 0  vdots & vdots & vdots & ddots & vdots & vdots  0 & 0 & 0 & ldots & 1 & 0  0 & 0 & 0 & ldots & 0 & 1  0 & 0 & 0 & ldots & 0 & 0 end{bmatrix}.

This fact follows from the Jordan decomposition theorem, together with the result that every matrix similar to a nilpotent matrix is also nilpotent. In linear algebra, the Jordan normal form, also called the Jordan canonical form, named in honor of the 19th and early 20th-century French mathematician Camille Jordan, answers the question, for a given square matrix M over a field K containing the eigenvalues of M, to what extent can M...


Flag of subspaces

A nilpotent transformation L on Rn naturally determines a flag of subspaces In mathematics, a flag is an increasing sequence of subspaces of a vector space. ...

 {0} subset ker L subset ker L^2 subset ldots subset ker L^{q-1} subset ker L^q = U

and a signature

 0 = n_0 < n_1 < n_2 < ldots < q_{k-1} < q_k = n,qquad n_i = dim ker L^i.

The signature characterizes L up to an invertible linear transformation. Furthermore, it satisfies the inequalities Look up Up to on Wiktionary, the free dictionary In mathematics, the phrase up to xxxx indicates that members of an equivalence class are to be regarded as a single entity for some purpose. ... In mathematics, a linear transformation (also called linear map or linear operator) is a function between two vector spaces that preserves the operations of vector addition and scalar multiplication. ...

 n_{j+1} - n_j leq n_j - n_{j-1}, qquad mbox{for all } j = 1,ldots,q-1.

Conversely, any sequence of natural numbers satisfying these inequalities is the signature of a nilpotent transformation.


References

  1. ^ R. Sullivan, Products of nilpotent matrices, Linear and Multilinear Algebra, Vol. 56, No. 3

External links

  • Nilpotent matrix and nilpotent transformation on PlanetMath.
PlanetMath is a free, collaborative, online mathematics encyclopedia. ...

  Results from FactBites:
 
PlanetMath: nilpotent matrix (185 words)
Theorem 1 (Characterization of nilpotent matrices)   A matrix is nilpotent iff its eigenvalues are all 0.
One class of nilpotent matrices are the strictly triangular matrices (lower or upper), this follows from the fact that the eigenvalues of a triangular matrix are the diagonal elements, and thus are all zero in the case of strictly triangular matrices.
This is version 14 of nilpotent matrix, born on 2002-10-16, modified 2006-06-13.
3x3 Octonion Matrix Models (0 words)
R C H O R A1 A2 C3 F4 C A2 A2xA2 A5 E6 H C3 A5 B6 E7 O F4 E6 E7 the [first three] rows can be interpreted as analogues of the matrix Lie algebras su(3), sl(3) and sp(6) defined for each division algebra.
HERE is quant-ph/9503009 on 3x3 Octonion Nilpotent Heisenberg Algebra Matrix Model.
The fermion creation and annihilation operators in the 3x3 octonion nilpotent matrices are related to Spin Networks.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.