
What are the properties of matrices?
Answer
482.4k+ views
Hint: In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns. An \[m \times n\] matrix A is a rectangular array of elements \[{a_{ij}}\] consisting of \[m\] rows and \[n\] columns.
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
Complete step-by-step solution:
A square matrix of order\[n\] has \[n\] rows and \[n\] columns.
A square matrix\[\left[ {{a_{ij}}} \right]\] is called a symmetric matrix if \[{a_{ij}} = {a_{ji}}\] i.e. the elements of the matrix are symmetric with respect to the main diagonal.
A square matrix \[\left[ {{a_{ij}}} \right]\] is called a skew-symmetric if\[{a_{ij}} = - {a_{ji}}\].
A square matrix is called diagonal if all its elements outside the main diagonal are equal to zero.
A diagonal matrix is called the identity matrix if the elements on its main diagonal are all equal to \[1\] (All other elements are zero).
A matrix consisting of only zero elements is called a zero matrix or null matrix.
Two matrices A and B are equal if and only if they have the same size \[m \times n\] and their corresponding elements are equal.
Two matrices A and B can be added (or subtracted) if and only if they have the same size\[m \times n\]. If
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
and
$B = \left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{b_{11}}}& \ldots &{{b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{b_{m1}}}& \cdots &{{b_{mn}}}
\end{array}} \right)$
Then the sum of these matrices is defined as
$A+B = \left[ {{a_{ij}}} \right] +\left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}+b_{11}}}& \ldots &{{a_{1n}+b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}+b_{m1}}}& \cdots &{{a_{mn}+b_{mn}}}
\end{array}} \right)$
Given a constant number k and a matrix\[A = \left[ {{a_{ij}}} \right]\]
$kA = \left[ {{ka_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{ka_{11}}}& \ldots &{{ka_{1n}}} \\
\vdots & \ddots & \vdots \\
{{ka_{m1}}}& \cdots &{{ka_{mn}}}
\end{array}} \right)$
Let A and B be two matrices. The product of the matrices AB exists if and only if the number of columns in the first matrix is equal to the number of rows in the second matrix. If
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
and
$B = \left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{b_{11}}}& \ldots &{{b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{b_{m1}}}& \cdots &{{b_{mn}}}
\end{array}} \right)$
Then the product AB is represented as a matrix
$AB=C = \left( {\begin{array}{*{20}{c}}
{{c_{11}}}& \ldots &{{c_{1n}}} \\
\vdots & \ddots & \vdots \\
{{c_{m1}}}& \cdots &{{c_{mn}}}
\end{array}} \right)$
If the rows and columns in a matrix A are interchanged, the new matrix is called the transpose of the original matrix A. The transposed matrix is denoted by \[{A^T}\].
A square matrix A is called orthogonal if \[A{A^T} = I\] where I is the identity matrix.
If the matrix product AB is defined, then\[{\left( {AB} \right)^T} = {B^T}{A^T}\]
If A is a square matrix of order \[n\], then the corresponding adjoint matrix, denoted as \[{C^*}\] is a matrix formed by the cofactors \[{A_{ij}}\] of the elements of the transposed matrix \[{A^T}\]
If A is a square matrix of order \[n\], then its trace, denoted as tr A, is the sum of the elements on the main diagonal.
If the matrix product AB is defined, then \[{\left( {AB} \right)^{ - 1}} = {B^{ - 1}}{A^{ - 1}}\]
If A is a square matrix, its eigenvectors X satisfy the matrix equation \[AX = \lambda X\] and the eigenvalues \[\lambda \] are determined by the characteristic equation \[\left| {A - \lambda I} \right| = 0\].
Note: The inverse of a matrix A is defined as a \[{A^{ - 1}}\] such that the result of multiplication of the original matrix A by \[{A^{ - 1}}\] is the identity matrix I:
\[A{A^{ - 1}} = I\]
An inverse matrix exists only for square nonsingular matrices (whose determinant is not zero). If A is a square nonsingular matrix of order n, the inverse matrix \[{A^{ - 1}}\] is given by
\[{A^{ - 1}} = {C^*}\det A\]
where \[{C^*}\] is the adjoint of the matrix and detA is the determinant of the matrix A.
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
Complete step-by-step solution:
A square matrix of order\[n\] has \[n\] rows and \[n\] columns.
A square matrix\[\left[ {{a_{ij}}} \right]\] is called a symmetric matrix if \[{a_{ij}} = {a_{ji}}\] i.e. the elements of the matrix are symmetric with respect to the main diagonal.
A square matrix \[\left[ {{a_{ij}}} \right]\] is called a skew-symmetric if\[{a_{ij}} = - {a_{ji}}\].
A square matrix is called diagonal if all its elements outside the main diagonal are equal to zero.
A diagonal matrix is called the identity matrix if the elements on its main diagonal are all equal to \[1\] (All other elements are zero).
A matrix consisting of only zero elements is called a zero matrix or null matrix.
Two matrices A and B are equal if and only if they have the same size \[m \times n\] and their corresponding elements are equal.
Two matrices A and B can be added (or subtracted) if and only if they have the same size\[m \times n\]. If
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
and
$B = \left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{b_{11}}}& \ldots &{{b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{b_{m1}}}& \cdots &{{b_{mn}}}
\end{array}} \right)$
Then the sum of these matrices is defined as
$A+B = \left[ {{a_{ij}}} \right] +\left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}+b_{11}}}& \ldots &{{a_{1n}+b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}+b_{m1}}}& \cdots &{{a_{mn}+b_{mn}}}
\end{array}} \right)$
Given a constant number k and a matrix\[A = \left[ {{a_{ij}}} \right]\]
$kA = \left[ {{ka_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{ka_{11}}}& \ldots &{{ka_{1n}}} \\
\vdots & \ddots & \vdots \\
{{ka_{m1}}}& \cdots &{{ka_{mn}}}
\end{array}} \right)$
Let A and B be two matrices. The product of the matrices AB exists if and only if the number of columns in the first matrix is equal to the number of rows in the second matrix. If
$A = \left[ {{a_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{a_{11}}}& \ldots &{{a_{1n}}} \\
\vdots & \ddots & \vdots \\
{{a_{m1}}}& \cdots &{{a_{mn}}}
\end{array}} \right)$
and
$B = \left[ {{b_{ij}}} \right] = \left( {\begin{array}{*{20}{c}}
{{b_{11}}}& \ldots &{{b_{1n}}} \\
\vdots & \ddots & \vdots \\
{{b_{m1}}}& \cdots &{{b_{mn}}}
\end{array}} \right)$
Then the product AB is represented as a matrix
$AB=C = \left( {\begin{array}{*{20}{c}}
{{c_{11}}}& \ldots &{{c_{1n}}} \\
\vdots & \ddots & \vdots \\
{{c_{m1}}}& \cdots &{{c_{mn}}}
\end{array}} \right)$
If the rows and columns in a matrix A are interchanged, the new matrix is called the transpose of the original matrix A. The transposed matrix is denoted by \[{A^T}\].
A square matrix A is called orthogonal if \[A{A^T} = I\] where I is the identity matrix.
If the matrix product AB is defined, then\[{\left( {AB} \right)^T} = {B^T}{A^T}\]
If A is a square matrix of order \[n\], then the corresponding adjoint matrix, denoted as \[{C^*}\] is a matrix formed by the cofactors \[{A_{ij}}\] of the elements of the transposed matrix \[{A^T}\]
If A is a square matrix of order \[n\], then its trace, denoted as tr A, is the sum of the elements on the main diagonal.
If the matrix product AB is defined, then \[{\left( {AB} \right)^{ - 1}} = {B^{ - 1}}{A^{ - 1}}\]
If A is a square matrix, its eigenvectors X satisfy the matrix equation \[AX = \lambda X\] and the eigenvalues \[\lambda \] are determined by the characteristic equation \[\left| {A - \lambda I} \right| = 0\].
Note: The inverse of a matrix A is defined as a \[{A^{ - 1}}\] such that the result of multiplication of the original matrix A by \[{A^{ - 1}}\] is the identity matrix I:
\[A{A^{ - 1}} = I\]
An inverse matrix exists only for square nonsingular matrices (whose determinant is not zero). If A is a square nonsingular matrix of order n, the inverse matrix \[{A^{ - 1}}\] is given by
\[{A^{ - 1}} = {C^*}\det A\]
where \[{C^*}\] is the adjoint of the matrix and detA is the determinant of the matrix A.
Recently Updated Pages
Master Class 12 Business Studies: Engaging Questions & Answers for Success

Master Class 12 Social Science: Engaging Questions & Answers for Success

Master Class 12 English: Engaging Questions & Answers for Success

Master Class 12 Chemistry: Engaging Questions & Answers for Success

Class 12 Question and Answer - Your Ultimate Solutions Guide

Master Class 12 Economics: Engaging Questions & Answers for Success

Trending doubts
What are the major means of transport Explain each class 12 social science CBSE

Which are the Top 10 Largest Countries of the World?

Draw a labelled sketch of the human eye class 12 physics CBSE

How much time does it take to bleed after eating p class 12 biology CBSE

Explain sex determination in humans with line diag class 12 biology CBSE

When was the first election held in India a 194748 class 12 sst CBSE

