Sums of idempotent matrices sums of ldempotent matrices pei yuan wu department of applied mathematics national chiao tung university hsinchu, taiwan, peoples republic of china. Radhakrishnan and others published on kidempotent circulant matrices find, read and cite all the research you need on researchgate. We also determine the maximum number of nonzero entries in kidempotent 01 matrices of a given order as well as the kidempotent 01 matrices attaining this maximum. I came across a pdf file on the internet today about an idempotent matrix. Let k be a xed product of disjoint transposition in s. If a square 01 matrix a satisfies a k a, then a is said to be k idempotent. A matrix a is idempotent if and only if all its eigenvalues are either 0 or 1. Introduction and preliminaries matrices provide a very powerful tool for dealing with linear models. Bimatrices are an advanced tool which can handle over one linear models at a time. In this paper, the authors explored the kpotent matrices using the definition in 9 or the case 1, k in 8 and generalize the work done by wu and slowik in 2 and 3 respectively and show. In other words, a matrix is orthogonal if it is its own inverse. In this paper, we give a characterization of k idem. On spectral theory of kn arithmetic mean idempotent. Some basic results in skidempotent matrices and their properties are give.
We also determine the maximum number of nonzero entries in k idempotent 01 matrices of a given order as well as the k idempotent 01 matrices attaining this maximum number. This means that there is an index k such that bk o. Suppose a is an n n matrix such that aa ka for some k 2r. Proof for any two k idempotent matrices and we have commutes with the permutation matrix by theorem 2. A is idempotent matrix, at is called transpose of a. An idempotent a in r is called a central idempotent if ax xa for all x in r. If a square 01 matrix a satisfies aka, then a is said to be kidempotent. Contributions to the study on k idempotent matrices. In this paper, we introduce and study the concept of.
Idempotency of linear combinations of two idempotent matrices. Some of our proofs are suggested by the fact that idempotent matrices represent projection operators, and by the known properties of such operators see e. If u, v is an edge of a digraph da corresponding to an idempotent matrix a, then there exists a path u, w1, w2. A matrix is idempotent if it is both symmetric and aa a. Proof for any two kidempotent matrices and we have commutes with the permutation matrix by theorem 2.
If t is a linear transformation whose matrix is an idempotent matrix, then we prove that rn is the direct sum of the image of t and the kernel of t. A local idempotent is an idempotent a such that ara is a local ring. The concept of skidempotent and sidempotent are introduced. Rank equalities for idempotent matrices with applications core. Recall that an idempotent in an algebra is an element esuch that e2 e. The individual values in the matrix are called entries. Baksalary linear algebra and its applications 321 2000 37. From the similarity theory of matrices, any idempotent matrix a. The aim of this note is to give shorter proofs of some of these. In this paper, we give a characterization of kidempotent 01 matrices. Chapter 3 spectral and spectral theory of idempotent. In this paper, we give a characterization of k idempotent 01 matrices. The relationship between idempotent matrices and kgroup periodic.
A primitive idempotent is an idempotent a such that ar is directly indecomposable. This video lecture on idempotent, involutory and nilpotent matrix will help students to understand following concepts of gate engineering mathematics. Introduction a kidempotent matrix is defined and some of its basic characterization are derived, 2. We prove if ataa, then a is a symmetric idempotent matrix.
On the equality of rank of a fifthidempotent matrix. The concept of kidempotent matrices was introduced in 4. Matrix algebra, matrix relations, matrix identities, derivative of determinant, derivative of inverse matrix, di erentiate a. The idempotency of necessarily implies that it is a null matrix. Then ais a product of nonnegative idempotent matrices. Example the identity matrix is idempotent, because i2 i i i. Other functions of idempotent matrices p1 and p2 studied quite intensively in the literature are the products p 1 p 2 and p 2 p 1. Idempotent matrix, idempotent bimatrix, sk idempotent, sk idempotent bimatrix, eigen value of sk idempotent bimatrix.
If a square 01 matrix a satisfies a k a, then a is said to be kidempotent. The category of commutative associative kalgebras with 1 will be denoted by kalg. Pdf idempotency of linear combinations of an idempotent matrix. In this research work, the concept of idempotent matrices is introduced and. Note that this result implies the trace of an idempotent matrix is equal. Idempotent linear transformation and direct sum of image. Pdf some basic properties of idempotent matrices researchgate. Algebra consider the algebra m 2k of 2 2 matrices over a eld k. If a square 01 matrix a satisfies aka, then a is said to be k idempotent. Provided that they have the same size each matrix has the same number of rows and the same number. We also determine the maximum number of nonzero entries in kidempotent 01 matrices of a given order as well as the kidempotent 01 matrices attaining this maximum number.
Let a be the pola of matrices described in the example above. A trivial idempotent refers to either of the elements 0 and 1, which are always idempotent. Spectral and spectral theory of idempotent matrices. When nonnegative matrices are product of nonnegative. If e is an idempotent in m nft, we say that e has rank k if the dimension in any sense of ce is k. There is a positive integer k such that v has pure tropical dimension k, generator dimension k and dual dimension k if and only if v is the column space of an idempotent if and only if v is projective as an ftmodule. Idempotency of linear combinations of an idempotent matrix. In this paper, the authors explored the k potent matrices using the definition in 9 or the case 1, k in 8 and generalize the work done by wu and slowik in 2 and 3 respectively and show. The key notion of the paper is that of an elementary idempotent. In linear algebra, an idempotent matrix is a matrix which, when multiplied by itself, yields itself. A ring r is called strongly separative if if for all. A necessary and sufficient condition for the equation axb c to have a solution is aa k idempotent matrices. In mathematics, a matrix plural matrices is a rectangular array see irregular matrix of numbers, symbols, or expressions, arranged in rows and columns. Viewed this way, idempotent matrices are idempotent elements of matrix rings.
1470 399 8 1456 271 1459 1517 131 177 1400 1536 497 348 31 598 907 174 871 854 994 1166 416 408 379 220 51 689 376 1407 420 161 48 666