# Find the determinant of $I + A$ [closed]

What is the determinant of an $n \times n$ matrix $B=A+I$, where $I$ is the $n\times n$ identity matrix and $A$ is the $n\times n$ matrix $$A=\begin{pmatrix} a_1 & a_2 & \dots & a_n \\ a_1 & a_2 & \dots & a_n \\ \vdots & \vdots & \ddots & \vdots \\ a_1 & a_2 & \dots & a_n \\ \end{pmatrix}$$

## closed as off-topic by user26857, Parcly Taxel, Pragabhava, Claude Leibovici, user223391 Oct 24 '16 at 2:12

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – user26857, Parcly Taxel, Pragabhava, Claude Leibovici, Community
If this question can be reworded to fit the rules in the help center, please edit the question.

• @EugenCovaci: I have tried to expand the determinant using combinatorial technique....but i'm unable to find a solution....... How to find...?..... – Chinnapparaj R Oct 16 '16 at 11:11
• If you haven't seen eigenvalues I have posted an answer expanding the determinant – marwalix Oct 16 '16 at 11:53

Here is a proof using eigenvalues, wishing you have already seen this notion.

Clearly, as all the columns of $A$ are proportional, the kernel has dimension $n-1$, thus eigenvalue $0$ is of order $n-1$.

The sum of the eigenvalues being equal to the trace $\sum_i a_i$, the $n$-th eigenvalue is:

$$\lambda:=\sum_i a_i.$$

Thus as the spectrum of $A+xI$ is equal to the spectrum of $A$ shifted by x (here with $x=1$), it is constituted of $1$ (with multiplicity $n-1$) and $\lambda+1$.

The determinant of a matrix being equal to the product of its eigenvalues, the final result is:

$$\det(A+I)=1+\sum_i a_i$$

$$\det (\mathrm I_n + 1_n \mathrm a^{\top}) = \det (1 + \mathrm a^{\top} 1_n) = 1 + \mathrm a^{\top} 1_n = 1 + \sum_{i=1}^n a_i$$

• No proof can be shorter ! [+1] Besides, thanks for the editing det $\rightarrow$ \det. – Jean Marie Oct 16 '16 at 12:30

First look at what happens when $n=2$, $n=3$, renaming our matrix $B_n(a_1,\cdots,a_n)$ one gets

\begin{align}\det{B_2(a_1,a_2)}&=1+a_1+a_2\\\det{B_3(a_1,a_2,a_3)}&=1+a_1+a_2+a_3\end{align}

Assume that $\det{B_{n-1}(a_1,\cdots,a_{n-1})}=1+a_1+\cdots a_{n-1}$ and consider

$$\begin{vmatrix}1+a_1 & a_2 & \cdots & a_n\\ a_1 & 1+a_2 & \cdots & a_n\\ \vdots & \vdots & \ddots & \vdots\\ a_1 & a_2 & \cdots & 1+a_n \end{vmatrix}$$

Substract the second row from the first to get

$$\begin{vmatrix} 1 & -1 & 0 & \cdots & 0\\ a_1 & 1+a_2 & a_3 &\cdots & a_n\\ a_1 & a_2 & 1+a_3 & \cdots & a_n\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ a_1 & a_2 & a_3 &\cdots & 1+a_n \end{vmatrix}$$

Then add the first column to the second and get

$$\begin{vmatrix} 1 & 0 & 0 & \cdots & 0\\ a_1 & 1+a_1+a_2 & a_3 &\cdots & a_n\\ a_1 & a_1+a_2 & 1+a_3 & \cdots & a_n\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ a_1 & a_1+a_2 & a_3 &\cdots & 1+a_n \end{vmatrix}$$

Developing along the first row one gets

$$\det{B_n(a_1,\cdots,a_n)}=\det{B_{n-1}(a_1+a_2,\cdots ,a_n)}$$

And this by the induction assumption is $$1+a_1+a_2+\cdots+a_n$$