Some basic properties of idempotent matrices

Similar documents
Prove proposition 68. It states: Let R be a ring. We have the following

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

Review Let A, B, and C be matrices of the same size, and let r and s be scalars. Then

Some results on the reverse order law in rings with involution

Linear Algebra and its Applications

Matrix operations Linear Algebra with Computer Science Application

arxiv: v1 [math.ra] 25 Jul 2013

Quasi Duo Rings whose Every Simple Singular Modules is YJ-Injective حلقات كوازي ديو والتي كل مقاس بسيط منفرد عليها غامر من النمط- YJ

The Moore-Penrose inverse of differences and products of projectors in a ring with involution

On pairs of generalized and hypergeneralized projections on a Hilbert space

Multiplicative Perturbation Bounds of the Group Inverse and Oblique Projection

On the Moore-Penrose and the Drazin inverse of two projections on Hilbert space

On Generalized Simple P-injective Rings. College of Computers Sciences and Mathematics University of Mosul

of a Two-Operator Product 1

Math 3191 Applied Linear Algebra

Moore Penrose inverses and commuting elements of C -algebras

Product of Range Symmetric Block Matrices in Minkowski Space

Math 407: Linear Optimization

Dragan S. Djordjević. 1. Introduction

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Operators with Compatible Ranges

Nonsingularity and group invertibility of linear combinations of two k-potent matrices

3.4 Elementary Matrices and Matrix Inverse

Math 1B03/1ZC3 - Tutorial 2. Jan. 21st/24th, 2014

EP elements in rings

Chapter 2 Notes, Linear Algebra 5e Lay

Math 2331 Linear Algebra

Representation for the generalized Drazin inverse of block matrices in Banach algebras

Additive results for the generalized Drazin inverse in a Banach algebra

arxiv: v1 [math.ra] 28 Jan 2016

Math 4377/6308 Advanced Linear Algebra

On Sums of Conjugate Secondary Range k-hermitian Matrices

Linear Algebra Practice Problems

CHAPTER 2 -idempotent matrices

Applied Matrix Algebra Lecture Notes Section 2.2. Gerald Höhn Department of Mathematics, Kansas State University

International Journal of Algebra, Vol. 4, 2010, no. 2, S. Uma

On Sum and Restriction of Hypo-EP Operators

Drazin Invertibility of Product and Difference of Idempotents in a Ring

Minkowski Inverse for the Range Symmetric Block Matrix with Two Identical Sub-blocks Over Skew Fields in Minkowski Space M

On EP elements, normal elements and partial isometries in rings with involution

Moore-Penrose inverse in

EP elements and Strongly Regular Rings

arxiv: v1 [math.ra] 21 Jul 2013

Math 4377/6308 Advanced Linear Algebra

Strongly Nil -Clean Rings

Commuting nilpotent matrices and pairs of partitions

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

New concepts: rank-nullity theorem Inverse matrix Gauss-Jordan algorithm to nd inverse

Note on paranormal operators and operator equations ABA = A 2 and BAB = B 2

Dragan S. Djordjević. 1. Introduction and preliminaries

Drazin invertibility of sum and product of closed linear operators

Inverses and Elementary Matrices

Moore-Penrose-invertible normal and Hermitian elements in rings

Perturbation of the generalized Drazin inverse

HYPO-EP OPERATORS 1. (Received 21 May 2013; after final revision 29 November 2014; accepted 7 October 2015)

arxiv: v1 [math.ra] 27 Jul 2013

Formulae for the generalized Drazin inverse of a block matrix in terms of Banachiewicz Schur forms

ORIE 6300 Mathematical Programming I August 25, Recitation 1

Jim Lambers MAT 610 Summer Session Lecture 1 Notes

EXPLICIT SOLUTION OF THE OPERATOR EQUATION A X + X A = B

Section 12.4 Algebra of Matrices

SOLUTIONS TO PROBLEMS

On Regularity of Incline Matrices

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

Math 544, Exam 2 Information.

1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det

Linear Algebra and Matrix Inversion

Review of Vectors and Matrices

Chapter 1. Matrix Algebra

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

Abel rings and super-strongly clean rings

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

(AA-A = A) and A + be the Moore-Penrose inverse of A [4]. A matrix A is called EP r

Maximal Elements and Prime Elements in Lattice Modules

4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

The Moore-Penrose inverse of 2 2 matrices over a certain -regular ring

Mathematics I. Exercises with solutions. 1 Linear Algebra. Vectors and Matrices Let , C = , B = A = Determine the following matrices:

Chapter 2 Subspaces of R n and Their Dimensions

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

What is the Matrix? Linear control of finite-dimensional spaces. November 28, 2010

On V-orthogonal projectors associated with a semi-norm

HAVE STABLE RANGE ONE

Lecture notes: Applied linear algebra Part 1. Version 2

Strongly nil -clean rings

A revisit to a reverse-order law for generalized inverses of a matrix product and its variations

Linear Algebra, Vectors and Matrices

Linear Systems and Matrices

MOORE-PENROSE INVERSE IN AN INDEFINITE INNER PRODUCT SPACE

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Applied Mathematics Letters. Comparison theorems for a subclass of proper splittings of matrices

~ g-inverses are indeed an integral part of linear algebra and should be treated as such even at an elementary level.

Partial isometries and EP elements in rings with involution

ELA

Generalized Principal Pivot Transform

ADDITIVE RESULTS FOR THE GENERALIZED DRAZIN INVERSE

Determinant Worksheet Math 113

Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications

RIGHT SELF-INJECTIVE RINGS IN WHICH EVERY ELEMENT IS A SUM OF TWO UNITS

Section 4.5. Matrix Inverses

FROM GROUPS TO GALOIS Amin Witno

Transcription:

J. Edu. & Sci., Vol. (21), No. (4) 2008 Some basic properties of idempotent matrices Alaa A. Hammodat Ali A. Bilal Akram S. Mohammed Dept. of Math. Dept. of Math. Dept. of Math. College of Education College of Education College of Science University of Mosul University of Mosul University of Tikrit Received 25 / 12 / 2006 Accepted 03 / 10 / 2007 الخلاصة في هذا البحث قدمنا بعض الخواص للمصفوفات المتحايدة المتبادلة صفري ا وا عطينا بعض الخواص للمصفوفات غير المنفردة. Abstract In this paper we give some properties of the zero commut idempotent matrices,and give some properties of non-singular matrices. 124

Some basic properties of idempotent matrices. 1. Introduction Throughout, this paper all matrices considered are square and commutative unless other wise stated. In [2], Koliha, Racocevic and Straskraba present new results on the invertibility of the sum of projectors, new relations between the nonsingularity of the difference and the sum of projectors, and present a simple proof of the invertibility of n n matrix A exists by showing that N(A)={0}. In this paper we present some basic properties of an idempotent matrices and relations between the range and the null spaces and give some results on the non-singularity of the difference and sum of idempotent matrices.we recall that; 1) A matrix A is said to be idempotent if A 2 =A. 2) A two matrices A and B are said to be zero commut if AB = BA =0. 3) A null space of a matix A is the set of all solutions to the equation A x v =0, Null(A)={ x v R n : A x v =0}, and we denote that N(A). 4) A range space of a matrix A is the set of all solutions to the equation A x v = x v, and we denote that R(A). 2. Idempotent matrices In this section we give some basic properties of the idempotent matrices. Lemma 2.1 : If A is idempotent matrix, then (I-A) is idempotent. Trivial. Proposition 2.2 [2] : If A is a matrix, then N(A)=R(I- A), also N(I-A)=R(A). Proposition 2.3 : If A is a matrix, then R(A) N(A) ={0}. Let x v R(A) N(A), then x v R(A) and x v N(A). Then x v =A x v and A x v =0, so, x v =0. Hence R(A) N(A)={0}. Proposition 2.4 : If A and B be are idempotent matrices, then R(A) R[B(I-A)]={0}. Let y v R(A) R[B(I-A)], then y v =A y v and y v =B(I-A) y v. 125

Alaa A. Hammodat & Ali A. Bilal & Akram S. Mohammed So A y v =AB(I-A) y v =AB y v -ABA y v =0. But A y v = y v,so y v =0. Hence R(A) R[B(I-A)]={0}. Proposition 2.5 : If A and B be are matrices, with AB=A and BA=B. Then N(A)=N(B). Let x v N(A), then A x v =0, so BA x v =0, but BA=B. Therefore B x v =0 and x v N(B). Hence N(A) N(B). Similarly N(B) N(A). Therefore N(A)=N(B). Proposition 2.6 : If A and B be are idempotent matrices, then R(AB) = R(A) R(B). Let x v R(AB), then x v =AB x v. So (I-A) x v = (I-A)AB x v =0. Hence x v N(I-A)=R(A) [by Proposition2.2]. Similarly x v R(B),so x v R(A) R(B). Therefore R(AB) R(A) R(B). Now, let y v R(A) R(B),then y v =A y v and y v =B y v. So A y v =B y v. That is A y v =AB y v, but y v =A y v,therefore y v =AB y v R(AB). So R(A) R(B) R(AB). Hence R(AB) = R(A) R(B). Proposition 2.7 : If A and B be are idempotent matrices, and R(A) R(B)={0}, then N(A-B)=N(A) N(B). Let x v N(A-B), then (A-B) x v =0 and A x v =B x v. So A x v =A 2 x v =AB x v =BA x v. Now, from A x v =BA x v we get (B-I)Ax v =0, so A x v N(B-I)=R(B) [by Proposition2.2], but A x v =B x v,so B x v R(B). Similarly from B x v =AB x v we get A x v,b x v R(A). So A x v,b x v R(A) R(B)={0}, therefore x v N(A). Also, x v N(B), so x v N(A) N(B). Hence N(A-B) N(A) N(B). Now, let y v N(A) N(B), then A y v =0 and B y v =0. So (A-B) y v =0, therefore y v N(A-B). So N(A) N(B) N(A-B). Hence N(A-B)=N(A) N(B). 126

Some basic properties of idempotent matrices. Proposition 2.8 : If A and B be are idempotent matrices, then R[B(I-A)]=N(A) R(B). Let x v R[B(I-A)], then x v =B(I-A) x v. So A x v =AB(I-A) x v =AB x v -ABA x v =0. So x v N(A). Also, (I-B) x v =(I-B)B(I-A) x v =0, so x v =B x v, therefore x v R(B). So x v N(A) R(B). Hence R[B(I-A)] N(A) R(B). Now, let y v N(A) R(B) then A y v =0 and y v =B y v. So A y v =AB y v =0. Now, B(I-A) y v = B(I-A)B y v = B y v -BAB y v. Therefore B(I-A) y v = B y v = y v, so y v R[B(I-A)]. Hence N(A) R(B) R[B(I-A)]. Therefore R[B(I-A)]=N(A) R(B). Proposition 2.9 : If A and B be are idempotent matrices, then R(A)=R(B) if and only if N(A)=N(B). Let R(A)=R(B), then A x v =B x v and let x v N(A), then A x v =0, so B x v =0. Then x v N(B), therefore N(A) N(B). Similarly N(B) N(A), so N(A)=N(B). Now, let N(A)=N(B) and let y v R(A), then y v =A y v. So B y v =BA y v =AB y v. From B(I-B) y v =0, we get (I-B)y v N(B)=N(A) and A(I-B) y v =0. So A y v =AB y v, but y v =A y v and B y v =AB y v. Therefore y v =B y v and y v R(B), so R(A) R(B). Similarly R(B) R(A). Hence R(A)=R(B). Proposition 2.10 : If A and B be are idempotent matrices, then N(A) N(B)=N(A+B-AB). Let x v N(A) N(B), then A x v =0 and B x v =0, so AB x v =0. Therefore (A+B-AB) x v =0 and x v N(A+B-AB). So N(A) N(B) N(A+B-AB). Now, let y v N(A+B-AB), then (A+B-AB) y v =0, so A y v +B y v =AB y v. Hence A 2 y v +ABy v =A 2 By v. So Ay v =0 and y v N(A). 127

Alaa A. Hammodat & Ali A. Bilal & Akram S. Mohammed Similarly By v =0 and y v N(B). So y v N(A) N(B). Hence N(A+B-AB) N(A) N(B). Therefore N(A) N(B)=N(A+B-AB). 3. Basic properties of zero commut idempotent matrices. In this section we present some basic properties of the zero commut idempotent matrices. Proposition 3.1 : N(A-B) =N(A) N(B). Let x v N(A-B), then (A-B) x v =0 and A x v =B x v. So A x v =AB x v =0. Hence x v N(A). Similarly x v N(B), so x v N(A) N(B). Hence N(A-B) N(A) N(B). Now, let y v N(A) N(B), then A y v =0 and B y v =0, so (A-B) y v =0. Therefore y v N(A-B), so N(A) N(B) N(A-B). Hence N(A-B) =N(A) N(B). Proposition 3.2 : N(A+B) =N(A) N(B). Similar to the proof of proposition 3.1 Corollary 3.3 : N(A+B)=N(A-B). Proposition 3.4 : R(A+B) = R(A)+R(B). Let y v = y v + yv R(A) +R(B), where y v R(A) and yv R(B). So (A+B)( y v + yv )=A yv +A yv +B yv +B yv = y v + yv +A yv +B yv -0 2 1 = y v + yv +A yv +B yv -AB( yv +yv ) 2 1 128

Some basic properties of idempotent matrices. = y v + y v +A( y v -By v )+B( y v -Ay v ) 2 2 1 1 = y v + yv =yv. Therefore y v = y v +yv R(A+B), so R(A)+R(B) R(A+B). Now, let x v R(A+B), then x v =(A+B) x v =A x v +B x v. Let x v =A xv, then A x v =A xv = x v, so xv R(A). 1 1 1 1 Also, let x v =B x v, then B x v =B x v = x v, so x v R(B). 2 2 2 2 Therefore x v = x v + xv R(A)+R(B), so R(A+B) R(A)+R(B). Hence R(A+B) = R(A)+R(B). Corollary 3.5 : If A is an idempotent matrix, then R n =R(A)+N(A). Since A(I-A)=(I-A)A=0. Then A and I-A are zero commut idempotent matrices. Now, from [Proposition3.4] we get R(A+I-A)=R(A)+R(I-A). Hence R(I)=R(A)+N(A). Therefore R n = R(A)+N(A). Proposition 3.6 : If A is an idempotent matrix, then R n =R(A) N(A). By [Corollary3.5] we get R n =R(A)+N(A), and by [Proposition2.3] we get R(A) N(A) ={0}. Hence R n =R(A) N(A). 4. Basic properties of non-singular matrices. In this section we give some basic properties of a non-singular matrices. Remark: The only nonsingular idempotent matrix is identity matrix (I n ). Every idempotent matrix (except I n ) is singular but a singular matrix may not be idempotent. Theorem 4.1 [1]: An n n matrix A over a number field F has rank n if and only if A 1 exists, that is, if and only if A is non-singular. Theorem 4.2 [2]: If A and B be are idempotent matrices, then the following conditions are equivalent: 1) A-B is non-singular. 2) A+B and I-AB are non-singular. 129

Alaa A. Hammodat & Ali A. Bilal & Akram S. Mohammed Proposition4.3: Let A and B be are idempotent matrices and AB is non-singular, then N(A) R(B)={0}. Let x v N(A) R(B), then A x v =0 and x v =B x v. So A x v =AB x v. Hence AB x v =0. Therefore x v N(AB)={0} (since AB is non-singular), so x v =0. Hence N(A) R(B)={0}. Theorem 4.4 : If A and B be are zero commut idempotent matrices, and A-B is non-singular, then R n = R(A) R(B). Let x v R(A) R(B), then x v R(A) and x v R(B). Therefore x v =A x v and x v =B x v, so A x v =B x v, then (A-B) x v =0. Hence x v N(A-B)=0 (since A-B is non-singular). So x v =0,hence R(A) R(B)={0}. Since (A-B)(I-A-B) x v =0, then (I-A-B) x v N(A-B)=0, and (I-A-B) x v =0.Hence x v =A x v +B x v R(A)+R(B) by [Proposition3.4]. So R n =R(A)+R(B). Hence R n = R(A) R(B). Proposition 4.5 : the following conditions are equivalent : 1) A-B is non-singular. 2) N(A) N(B)={0}. (1 2) let x v N(A) N(B), then A x v =0 and B x v =0. So (A-B) x v =0, therefore x v N(A-B)=0 (since A-B is non-singular). So x v =0. Hence N(A) N(B)={0}. (2 1) from [Proposition3.1] we get N(A) N(B)=N(A-B), but N(A) N(B)={0}, then N(A-B)={0}. Hence A-B is non-singular. References:- 1) F. E. Hohn, "Introduction to linear algebra", The Macmillan Company, New York, (1972). 2) J. J. Koliha, V. Rakocevic and I. Straskraba, "The difference and sum of projectors", Linear Algebra Appl. 388(2004),279-288. 3) J. J. Koliha, "Power bounded and exponentially bounded matrices", Applications of Math., 44(1999), 289-308. 130