# How to show that the determinant of this matrix is in a nice product factorization,

Show that

$$det \begin{bmatrix} 1 & 1 & \cdots &1 \\ \lambda_1 & \lambda_2 & \cdots &\lambda_n \\ \lambda^2_1 & \lambda^2_2 & \cdots &\lambda^2_n \\ \vdots & \vdots & \vdots & \vdots \\ \lambda^{n-1}_1 & \lambda^{n-1}_2 & \cdots &\lambda^{n-1}_n \\ \end{bmatrix} =\prod_{n\ge i>j\ge1}(λ_i−λ_j)$$

My work so far,

I am trying to use induction on $n$. For the base case n=2, the claim is true, since we have $(\lambda_2 - \lambda_1)$.

I'm not sure how to carry out the inductive step.

Any hints or suggestions are welcome.

Thanks,

Use transformation $C_i=C_i-C_1, 2\le i\le n$ (leaving $(1,0,0,...0)$ in first row) and then try induction?
There a second operation, namely $a_{ij}=a_{ij}-x_1\times a_{i-1,j-1}$ after above transformation is used to prove $V_n=\prod_{k=2}^n (x_k-x_1)V_{n-1}$, where we know $V_{n-1}$ by induction hypothesis.