How to compute the determinant of this matrix?

  • Context: Graduate 
  • Thread starter Thread starter Charles49
  • Start date Start date
  • Tags Tags
    Determinant Matrix
Click For Summary

Discussion Overview

The discussion revolves around computing the determinant of a specific \( n \times n \) matrix characterized by 2s along the diagonal and 1s elsewhere. Participants explore various methods for calculating the determinant, including series expansions, inductive reasoning, and matrix factorization techniques.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Exploratory

Main Points Raised

  • One participant proposes using the Taylor series expansion of the determinant for the matrix expressed as \( A = I + B \), where \( B \) is a matrix of all ones, leading to a conclusion that the determinant is \( n + 1 \).
  • Another participant suggests an inductive approach, noting that the determinant can be computed by manipulating the rows of the matrix and applying known results for smaller matrices.
  • A different method is introduced involving the factorization of \( A \) into \( LU \) form, where the determinant is derived from the product of the diagonal elements of the upper triangular matrix \( U \), resulting in the same conclusion of \( n + 1 \).

Areas of Agreement / Disagreement

Participants do not express disagreement on the final result of the determinant being \( n + 1 \); however, they present multiple methods to arrive at this result, indicating a variety of approaches rather than a single consensus on the best method.

Contextual Notes

Some methods rely on specific properties of matrix operations and series expansions, which may not be universally applicable without additional assumptions or context. The discussion does not resolve the potential limitations of each method presented.

Who May Find This Useful

This discussion may be useful for students and practitioners interested in linear algebra, particularly in methods for calculating determinants and exploring different mathematical techniques.

Charles49
Messages
87
Reaction score
0
Let $$A$$ be the $$n\times n$$ matrix:
\begin{equation}
A= \begin{bmatrix} % or pmatrix or bmatrix or Bmatrix or ...
2 & 1&\dots & 1 & 1 \\
1 & 2&\dots & 1 & 1 \\
\vdots&\ddots & \ddots & 2 & 1 \\
1 & & \dots & 1&2 \\
\end{bmatrix}
\end{equation}
(2s along the diagonal and 1s everywhere else.) Compute the determinant of $$A$$.

Here is what I did.

As usual, let $$I$$ be the identity matrix. Observe that $$A=I+B$$ where $$B$$ is a square matrix such that every element is 1. Next we can use the Taylor series expansion of the determinant
\begin{align} \det(I + B) = \sum_{k=0}^{\infty} \frac{1}{k!} \left( - \sum_{j=1}^{\infty} \frac{(-1)^j}{j}\mathrm{tr}(B^j) \right) ^k.\end{align}
Note that $$\mathrm{tr}\left(B^j\right)$$ is always $$n^j$$, and so it follows that
\begin{align} \det(A)& = \sum_{k=0}^{\infty} \frac{1}{k!} \left( - \sum_{j=1}^{\infty} \frac{(-1)^j}{j}n^j \right) ^k\, , \end{align}
The well known series expansions
\begin{equation}
-\sum _{j=1}^{\infty }{\frac { \left( -1 \right) ^{j}}{j}}{n}^{j}=\log(n+1)
\end{equation}
and
\begin{equation}
\sum_{k=0}^\infty\frac{f(n)^k}{k!}=\exp{f(n)}
\end{equation}

allow us to conclude that the determinant is $$n+1.$$

I was wondering if there was a simpler way to do this problem.
 
Physics news on Phys.org
Charles49 said:
Let $$A$$ be the $$n\times n$$ matrix:
\begin{equation}
A= \begin{bmatrix} % or pmatrix or bmatrix or Bmatrix or ...
2 & 1&\dots & 1 & 1 \\
1 & 2&\dots & 1 & 1 \\
\vdots&\ddots & \ddots & 2 & 1 \\
1 & & \dots & 1&2 \\
\end{bmatrix}
\end{equation}
(2s along the diagonal and 1s everywhere else.) Compute the determinant of $$A$$.

Here is what I did.

As usual, let $$I$$ be the identity matrix. Observe that $$A=I+B$$ where $$B$$ is a square matrix such that every element is 1. Next we can use the Taylor series expansion of the determinant
\begin{align} \det(I + B) = \sum_{k=0}^{\infty} \frac{1}{k!} \left( - \sum_{j=1}^{\infty} \frac{(-1)^j}{j}\mathrm{tr}(B^j) \right) ^k.\end{align}
Note that $$\mathrm{tr}\left(B^j\right)$$ is always $$n^j$$, and so it follows that
\begin{align} \det(A)& = \sum_{k=0}^{\infty} \frac{1}{k!} \left( - \sum_{j=1}^{\infty} \frac{(-1)^j}{j}n^j \right) ^k\, , \end{align}
The well known series expansions
\begin{equation}
-\sum _{j=1}^{\infty }{\frac { \left( -1 \right) ^{j}}{j}}{n}^{j}=\log(n+1)
\end{equation}
and
\begin{equation}
\sum_{k=0}^\infty\frac{f(n)^k}{k!}=\exp{f(n)}
\end{equation}

allow us to conclude that the determinant is $$n+1.$$

I was wondering if there was a simpler way to do this problem.



1) It's easy to see, inductively, that
\begin{equation}\left|\begin{pmatrix} 1&1&1&...&1\\1&2&1&...&1\\...&...&...&...&...\\1&1&1&...&2\end{pmatrix}\right|\end{equation}=1Say, substract first row from second, develop by minors of the new 2nd row, etc.

So substracting the third row from the 2nd one in the original matrix, we get:

\begin{equation}\left|\begin{matrix} 2&1&1&...&1\\1&2&1&...&1\\0&\!\!\!-1&1&...&0\\...&...&...&...&...\\1&1&1&...&2 \end{matrix}\right|\end{equation}
Developing wrt the third row, using the above fact and induction we get what we want.

DonAntonio
 
Thanks DonAntonio
 
Another way is to factorize A = LU where L is unit lower triangular and U is upper triangular. Use Crout's verison of Gaussian elimination.

The diagonals of U are 2, 3/2, 4/3, 5/4, ... (n+1)/n. The determinant is the product of the diagonals = n+1
 
Thanks AlephZero, I am going to learn about Crouts version.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 24 ·
Replies
24
Views
3K