Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

calculate generally the determinant of $A = a_{ij} = \begin{cases}a & i \neq j \\ 1 & i=j \end{cases} = \begin{pmatrix} 1 & a & a & · & a \\ · & · & · & · \\ a & a & a & · & 1 \\ \end{pmatrix}$

Any hints?

share|cite|improve this question
What did you try? Where are you stucked in the obvious recursion? – Did Jun 17 '12 at 17:10
Use row operations to get a triangular matrix formm, and then the determinant is simply the product of the diagonal elements. – Zachi Evenor Jun 17 '12 at 17:11

There is a more direct argument using eigenvalues: since the rank of $A - (1-a)I$ is $1$ (or $0$ if $a=0$), the eigenvalue $1-a$ has multiplicity at least $n-1$. The sole remaining eigenvalue $\lambda$ is determined by $n = \operatorname{tr}(A) = \lambda + (n-1)(1-a)$.

share|cite|improve this answer

First add all collumns to the first one and so $ \displaystyle{ C_1 \to \left((n-1)a+1, (n-1)a+1 , \cdots , (n-1)a+1 \right)^T }$

now the determinant $\det A=[(n-1)a+1] \cdot$

\begin{pmatrix} 1 & a & a & \cdots & a \\ 1& 1& a & \cdots &a \\ · & · & · & · \\ 1 & a & a & \cdots & 1 \\ \end{pmatrix} subtracking now from each row the first row you get an upper triangular matrix with principal diagonal $\displaystyle{\operatorname{diag} (1, 1-a, 1-a, \cdots ,1-a)}$ so we get that

$$ \det A= [(n-1)a +1] (1-a)^{n-1}.$$

P.S Can someone fix the latex and write the coefficinent $[(n-1)a+1]$ in front of the determinant? Thank's!

share|cite|improve this answer
I changed \text{detA} to \det A. Notice that this not only causes "det" not to be italicized; it also results in proper spacing between $\det$ and $A$. And also in things like $5\det A$, it makes proper spacing appear between $5$ and $\det$. – Michael Hardy Jun 17 '12 at 17:46
@MichaelHardy: O.K thank's! – passenger Jun 17 '12 at 17:48

One way to find this determinant is to realize that if all diagonal elements are equal to each other and all off-diagonal elements are equal to each other, then the matrix is a linear combination of two complementary symmetric idempotent matrices, one of rank $1$ and one of rank $n-1$ (where $n$ is the number of rows or of columns).

Let $P$ be the $n\times n$ matrix whose every entry is $1/n$, and let $Q=I-P$. Then you can check that $P^2=P$, $Q^2=Q$, and $PQ=QP=0$. If $x=[x_1,\ldots,x_n]^T$, then $Px=[\bar x,\ldots,\bar x]$ where $\bar x = (x_1+\cdots+x_n)/n$, and $Qx = [x_1-\bar x,\ldots,x_n-\bar x]$. So $P$ projects $x$ orthogonally onto a one-dimensional subspace and $Q$ project orthogonally onto the $(n-1)$-dimensional complement of that space. We can write your matrix as $cP+dQ$. Suppose we have an orthonormal basis consisting of a vector in the $1$-dimensional column space of $P$ and $n-1$ vectors orthogonal to it, spanning the column space of $Q$. With respect to that basis, the matrix becomes $$ \begin{bmatrix} c \\ & d \\ & & d \\ & & & d \\ & & & & \ddots \\ & & & & & d \end{bmatrix}, $$ so its determinant is $cd^{n-1}$.

Now find $c$ and $d$.

share|cite|improve this answer

Try for a $n=1,2,3$ and find the pattern. You can then claim that the determinant in general is $((n-1)a+1)(1-a)^{n-1}$. Prove this by induction now.

share|cite|improve this answer

It's a special case of where I gave a calculation of $$\left|\begin{array}{cccc}a & b & \cdots & b \\ c & a & \ddots & \vdots\\ \vdots & \ddots & \ddots & b \\ c & \cdots & c & a\end{array}\right|$$ So your determinant is $(1-a)^{n-1}(1-a+na)$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.