1

The question I'm working on is, given a matrix $A = (a_{i,j})_{i,j = 1}^n$ and the polynomial \begin{gather*} P(x) : = \det\begin{bmatrix}a_{1,1} + x & a_{1,2} + x & ... & a_{1,n} + x\\a_{2,1} + x & a_{2,2} + x & ... & a_{2,n} + x\\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} + x & a_{n,2} + x & ... & a_{n,n} + x \end{bmatrix} \end{gather*} Express the coefficients of $P(x)$ in terms of $A$.

So far, using $n$-linearity of the determinant, I have found that \begin{gather*} P(x) = \det(A) + \begin{vmatrix}x & a_{1,2} &... & a_{1,n} \\x & a_{2,2} & ... & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ x & a_{n,2} & ... & a_{n,n} \end{vmatrix} + \begin{vmatrix}a_{1,1} & x & ... & a_{1,n}\\a_{2,1}& x & ... & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} &x & ... & a_{n,n} \end{vmatrix} +...+ \begin{vmatrix}a_{1,1} & a_{1,2} & ... & x\\a_{2,1}& a_{2,2} & ... & x \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} &a_{n,2} & ... & x \end{vmatrix}\\ = \det(A) + x \left(\begin{vmatrix}1 & a_{1,2} &... & a_{1,n} \\1 & a_{2,2} & ... & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ 1 & a_{n,2} & ... & a_{n,n} \end{vmatrix} + \begin{vmatrix}a_{1,1} & 1 & ... & a_{1,n}\\a_{2,1}& 1 & ... & a_{2,n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} &1 & ... & a_{n,n} \end{vmatrix} +...+ \begin{vmatrix}a_{1,1} & a_{1,2} & ... & 1\\a_{2,1}& a_{2,2} & ... & 1 \\ \vdots & \vdots & \ddots & \vdots \\ a_{n,1} &a_{n,2} & ... & 1 \end{vmatrix}\right) \end{gather*} However, I am not sure how to simplify this further. Is there a nice way to write this remaining coefficient of $x$ in terms of $A$, or should I approach this problem in a completely different way?

pongdini
  • 121

1 Answers1

3

If we use notation $\bf{1}$ for the column vector with entries $1$, your expression can be given the form :

$$A+x\bf{1}\bf{1}^T$$

which is called a "rank-one update" of matrix $A$.

Its determinant is connected to the determinant of $A$ through the "Sylvester determinant formula" (see for example answers here) :

$$P(x)=\det(A+x\bf{1}\bf{1}^T)=\det(A)(1+x\underbrace{\bf{1}^TA^{-1}\bf{1}}_{\in \mathbb{R}})$$

which is a first degree polynomial in $x$.

Moreover, $\bf{1}^TA^{-1}\bf{1}$ is plainly the sum of entries of $A^{-1}$ !

Edit : you weren't that far with your last expression between big parentheses. Indeed if you expand each of the determinants wrt to the column of $1$, you get the sum of $n$ cofactors ; summing all of them is equivalent to summing all the entries of the "adjugate" matrix" of $A$ which is $\det(A)A^{-1}$.

Jean Marie
  • 81,803
  • See the edit I just wrote. – Jean Marie Mar 20 '23 at 10:16
  • i see! so in the case where $A$ is not invertible, would the correct simplification just be $P(x) = \det(A) + x * \sum adj(A)$? – pongdini Mar 20 '23 at 19:04
  • is it not the constant (not the vector) $x$ times the sum of the entries of the adjugate? sorry if the notation is messy, is $P(x) = \det(A) + x \sum_{i,j=1}^n adj(A)_{i,j}$ not correct? – pongdini Mar 20 '23 at 19:13
  • My remark about the $\Sigma$ was silly. I erase it. But I was disagreeing with this first expression, whereas I agree with this second expression. – Jean Marie Mar 20 '23 at 19:20