I was assigned this problem in class: Let $f: M(n, \mathbb R) \rightarrow \mathbb R $ be given by $f(X) = det(X)$. Identify the sets $f^{-1}(0)$ and $f^{-1}(\mathbb R^*)$, where $\mathbb R^*$ denotes the set of nonzero real numbers.
For $f^{-1}(0)$, I understand that I'm looking for the set of all $n \times n$ matrices with determinant 0, but how do I express this in set theoretic notation that works for matrices of any order? I mean, for a matrix of order 2, $f^{-1}(0) = \{(a_{ij})| a_{11} a_{22} - a_{12} a_{21} =0, a_{ij} \in \mathbb R \}$. But this can't be extended to higher orders. I'm having the same issue with $f^{-1}(\mathbb R^*)$, where I'm looking for the set of all matrices with nonzero determinant. But how do I express this in set theoretic notation?
Is there any neat way that captures all such matrices, for both $f^{-1}(\mathbb R^*)$ and $f^{-1}(0)$?
We usually denote the set of $n\times n$ real matrices with non-zero determinant by $GL(n, \mathbb{R})$ - this is called the general linear group, hence the $GL$. Doing this we'd have $f^{-1}(\mathbb{R}^*) = GL(n, \mathbb{R})$ and $f^{-1}(0) = M(n, \mathbb{R})\setminus GL(n, \mathbb{R})$.