Scribd
Upload
63 views5 pages

Matrices

1. Matrices can be defined as an arrangement of elements aij in rows and columns. Common types include row matrices, column matrices, square matrices, diagonal matrices, lower/upper triangular matrices, symmetric/antisymmetric matrices, and zero matrices. 2. Basic operations on matrices include addition, scalar multiplication, matrix multiplication, and taking the transpose. The determinant of a square matrix provides a measure of its scale and orientation. 3. For an invertible square matrix, the inverse matrix exists such that when multiplied together they equal the identity matrix. The rank of a matrix is defined as the maximum number of linearly independent rows or columns.

Uploaded by

cristieva
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
63 views5 pages

Matrices

1. Matrices can be defined as an arrangement of elements aij in rows and columns. Common types include row matrices, column matrices, square matrices, diagonal matrices, lower/upper triangular matrices, symmetric/antisymmetric matrices, and zero matrices. 2. Basic operations on matrices include addition, scalar multiplication, matrix multiplication, and taking the transpose. The determinant of a square matrix provides a measure of its scale and orientation. 3. For an invertible square matrix, the inverse matrix exists such that when multiplied together they equal the identity matrix. The rank of a matrix is defined as the maximum number of linearly independent rows or columns.

Uploaded by

cristieva
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

MATRICES AND DETERMINANT

MATRICES AND DETERMINANT


1. DEFINITION

Defined us matrix of order m x n in E is an expresion:



With a
ij
e , = ,, ., ; = ,, ., n.

%he elements a
ij
are called an elements of the matrix. According to the arrangement of the
elements of the matrix, to say that a matrix has 2 rows (of 3 elements) and 3 columns (of 2
elements), being a
ij
to the elements matrix of a row and a column . We denoted ((a
i)
)), or A
so a matrix whose elements are a
ij
. s referred to by 2x 3 () all matrices of order 2x 3
with elements in .

2. TYPES OF MATRICES

. Row matrix: is a matrix with only one row.
(I

.I
n
) e2x 3 ()

2. CoIumn matrix: is a matrix with only one column.

.
I

_ e2x 3 ()

3. Square matrix of order n: has an equal number of rows and columns, 23.



- a
ii
= ,, ., n., are called diagonaI eIements.
- A is a diagonaI matrix if has all its elements zero except for those in the diagonal:
= - I

= 0.
- A matrix is scaIar if and only if is a diagonal matrix in which all of the diagonal
elements are equal.


- A matrix is Iower trianguIar if and only if the elements below the main diagonal are
zero: < - I

= 0.
- A matrix is upper if and only if the elements above the main diagonal are zero:
> - I

= 0.

4. A e 2x 3 () is idempotent if and only if A
2
= A.

5. A e 2x 3 () is niIpotent if and only if there is m e so that A
m
= O.

6. A e 2x 3 () is symmetric if A
t
= A, then, if
A (a
ij
) 1 | ; 1 : i, j {, ., n] a
Ij
= a
Ij


7. A e 2x 3 () is antisymmetric if A
t
= -A then, if
A (a
ij
) 1 | ; 1 : i, j {, ., n] a
Ij
= -a
Ij


8. A matrix 0 e N x n (E) that has all its elements zero, is a zero matrix of order m x n.


3. OPERATIONS WITH MATRICES

3.2. ADD MATRICES

A,B e 2x 3 (),
A (a
ij
) 1 | ; 1 , B (T
ij
) 1 | ; 1 ,
Defined us A+B= C e 2x 3 (), with C (U
ij
) 1 | ; 1
so i {, ., m] j {, ., n] U
Ij
= a
Ij
+ T
Ij


3.3. SCALAR MULTIPLICATION OF MATRICES

et A e 2x 3 (),
A (a
ij
) 1 | ; 1 , y e E
Defined us A = C e 2x 3 (), con C (U
ij
) 1 | ; 1
so i {, ., m] j {, ., n] U
Ij
= a
Ij


3.4. MULTIPLICATION OF MATRICES

et A e 2x 3 (), B e 2x 3 (), where
A (a
ij
) 1 | ; 1 , B (T
ij
) 1 | ; 1 ,
Defined us A*B= C e 2x 3 (), con C (U
ij
) 1 | ; 1
so i {, ., m] j {, ., p] U
Ij
= _ a
Ik
n
k=1
T
kj






3.5. TRANSPOSE MATRIX

et A e 2x 3 (), with
A (a
ij
) 1 | ; 1 ,
Defined us transpose matrix of A, is shown by A
t
= e 2x 3 (), with A
t
(a
ij
)
1 | ; 1
so i {, ., m] j {, ., n] a
Ij
= a
Ij



4. DETERMINANT

%he determinant is an application det : 2x 3 () , A det A
so
- For n= y A = (a): det A = a.

- For n= 2 y A =
I

uet A = I

- I

.

- For n=3 y A
I

_: uet A = I

+ I

+ I

-
I

- I

- I

.

Definitions:
- Lowers square matrix are ideterminants of the submatrices obtained by removing several
rows and the same number of columns.
- One defines minor compIementary to an eIement a
Ij
of a square matrix, is denoted by
Mij, to determinant of the matrix obtained by omitting the row and the column
- s called adjugate eIement a
Ij
to A

= (-)
+
H


- s called adjugate matrix of A e 2x 3 (), to the matrix A* e 2x 3 () that have
for elements los adjuntos de los elementos de A.

Calculation of determinants for the elements in any row or column:

et A (a
ij
) 1 | ; 1 , For n > 3 the determinat viene dado por:
- development to the elements of a row : det A= _ a
ik
n
k=
A
ik

- development to the elements of a columna j: det A= _ a
kj
n
k=
A
kj


5. INVERSE MATRIX

et A e 3 (), A is called invertible, if
B e 3 (), A.B = B.A = I
n
%he matrix B denoted by A
-1
and is called inverse matrix of A.
t is easy to show that the inverse of a invertible matrix is unique.
%he following properties are true:
- f A is invertible, A
-1
too and (A
-1
)
-1
= A
- f , A,B e 3 (), are too invertible, A.B and (A. B )
-1
= B
-1
. A
-1

- f A is invertible, A
t
too, and (A
t
)
-1
= (A
-1
)
t


%he diagonal matrices, upper triangular or lower triangular are invertible matrices if and only if
the diagonal elements are non-zero. Also the inverse of these matrices remain diagonal
matrices, upper triangular or lower triangular.


. RANK OF A MATRIX

et A e 2x 3 (), with
A (a
ij
) 1 | ; 1 , i {, ., m] j {, ., p]
We have vector

= (I

.I
n
)
i-tj row vector A y I

= (I

.I

) , j-th column vector f A.


%he rank of a matrix A, denoted by rg(A).

We called row rank of A as the maximum number of linearly independent row vectors.
Analogously we called coIumn rank of A as the maximum number of linearly independent
column vectors.
Since the column rank and the row rank are always equal.

You might also like