- Jacobian MatrixANA
Square case (m=n): if J(xˉ) is an invertible matrix and f is continuously differentiable, then f is locally invertible around xˉ (inverse function theorem). Newton’s method for f(x)=0 needs J(xk) invertible in ev… §
- Multivariable DifferentiationANA
| MSI Sheet 00, task 2 | compute J and check invertibility at xˉ | Jacobian Matrix, Invertible Matrix | §
- Determinant
See Invertible Matrix for the other equivalent conditions. Geometrically, det(A)=0 means the columns are linearly dependent, so they span a flat parallelepiped with volume 0. §
The sign tells whether A keeps or flips orientation. Turning from e1 to e2 goes counterclockwise. If the turn from a1 to a2 does too, det(A)>0 and the letter F stays readable. If the turn is clockwise (here: the columns… §
- Eigenvalue
Singular ⇔ eigenvalue 0: det(A)=∏iλi=0 iff some λi=0. So A is invertible iff 0 is not an eigenvalue, and then A−1 has the eigenvalues 1/λi (from… §
- Linear Map
bijective ⟺rank(A)=n=m, i.e. A is an invertible matrix §
- Matrix Rank
Gram matrix: rank(A⊤A)=rank(A). So the n×n matrix A⊤A (always PSD) is invertible iff A has full column rank. MSI uses this for least squares: (Φ⊤Φ)−1 exists iff… §
- Positive Semidefinite Matrix
Positive definite ⇒ invertible: B≻0 has no zero eigenvalue, so it is an invertible matrix. A PSD matrix is invertible iff it is positive definite. §
- System of Linear Equations
Square, invertible case: if m=n and A is an invertible matrix, the unique solution is x=A−1b. In practice it is computed by Gaussian elimination, not by forming A−1. §
- Determinants and Eigenvalues
Singularity tests. For A∈Rn×n these are all the same statement (Invertible Matrix, Rank and Invertibility): §
- Rank and Invertibility
The rank counts the linearly independent columns of a matrix. Comparing it with the number of rows and columns tells you whether the matrix is invertible and how many solutions Ax=b has. In MSI this decides whether a least squares prob… §
Invertible Matrix — the square, full-rank case §