Linear algebra matrix problem

Question

I was unable to prove the following statement. Let $A,B$ are both matrices of $n\times n$ of real numbers. We know that the matrix $ A$ is invertible. Then, we have to prove that there are $n$ diferent $\lambda_i$ so that the matrix $C=\lambda_iA+B $is invertible. ($\lambda_i$ are real numbers)

Answer 1

The question seems to have some issues:

If $C$ is supposed to be invertible: It suffices that $\lambda I + BA^{-1}$ is invertible. As long as $\lambda$ is not negative of any of the eigenvalues of $BA^{-1}$ this matrix is invertible. So there are infinitely many valid $\lambda$s.

If $C$ is supposed to be non-invertible: Take $A=B=I$, then any $C$ is a multiple of the identity and it can only be non-invertible when $\lambda = -1$. So there is only one $\lambda$ satisfying the claim not $n$ different $\lambda$s.

Answer 2

Uzing the QZ (generalized Schur) decomposition, we see that $$A = QSZ^*, \quad B = QTZ^*,$$ for some unitary $Q$ and $Z$, and upper triangular $S$ and $T$. Then $$C = \lambda_i A + B = Q(\lambda_iS + T)Z^*.$$ Edit: As egreg corrected my initial silly statement, $C$ is invertible if and only if $X := \lambda_iS+T$ is invertible (since unitary matrices $Q$ and $Z$ are invertible), and $X$ is invertible if and only if all its diagonal elements (which also happen to be its eigenvalues, because $X$ is upper triangular) are non-zero.