3

If you have an injective linear map between two free modules of equal dimension, is the determinant of the matrix representing the map necessarily nonzero? If not is there an obvious counterexample? (Everything is over a multivariate polynomial ring over a field.)

Thanks!

squiggles
  • 1,903
  • 1
    For commutative domains such as multivariate polynomial rings over fields: free modules are flat, so you can tensor with the field of fractions of the ring while retaining an injective map. Then you have an injective linear map over a (large) field, so of course its determinant is nonzero. – Jack Schmidt Jun 22 '12 at 02:50
  • @Arturo: your first statement is false. Consider the inclusion $2 \mathbb{Z} \to \mathbb{Z}$. – Qiaochu Yuan Jun 22 '12 at 03:01
  • @Qiaochu: Hmmm... That's what I get for not checking Lam's book first... Thanks. – Arturo Magidin Jun 22 '12 at 03:02
  • @Jack: in infinite dimensions what would you mean by the determinant? – Qiaochu Yuan Jun 22 '12 at 03:40

2 Answers2

2

Over an integral domain $D$ this is straightforward as Jack Schmidt says in the comments. Suppose $T : D^n \to D^n$ is a morphism such that $\det(T) = 0$. Then $T \otimes \text{Frac}(D) : \text{Frac}(D)^n \to \text{Frac}(D)^n$ has the same property, where $\text{Frac}(D)$ is the fraction field. Since we are now over a field, $T \otimes \text{Frac}(D)$ is not injective, and so it annihilates some nonzero vector in $\text{Frac}(D)^n$. Scaling this vector suitably puts it in $D^n$, and so $T$ is not injective.

Over a general commutative $R$ I have a proof for $n = 2$ (consider the adjugate) but it doesn't seem to generalize. I'll get back to you.

Qiaochu Yuan
  • 419,620
-1

Let $T: A^n \to A^n$ be a morphism and let's use the same notation for its matrix, $T=(t_{ij})$. Let us assume that $det(T)=0$ and I will prove that $T$ fails to be injective.

There must be an integer $k$ such that there exists a minor of rank $k$ with nonzero determinant and any minor of larger rank has determinant zero. Without loss of generality, we can assume that the minor sits in the first $k$ rows and first $k$ columns. If $k=0$, then $T=0$, which is trivial. Since our task is to find a non-zero vector $x=(x_1,\cdots,x_n)$ killed by $T$ and inparticular our vector can be chosen to have the form $(x_1,\cdots,x_{k+1},0,\cdots,0)$, it suffices to assume that n=k+1.

Having adopted these assumptions, since $TT^*=det(T)I=0$, we just have to find a vector $x\neq 0$ such that $T^*x=0$, where $T^*$ is the adjugate matrix of $T$. Now $T^*$ is obviously nonzero since the first $k\times k$ minor of $T$ has nonzero determinant. Hence, such an $x$ must exist(assuming that the ring in question has a unit) and we are home!

YZhou
  • 2,223
  • I do not see why you can assume that $n = k+1$. Can you please move discussion of the question over arbitrary rings to http://math.stackexchange.com/questions/161523/does-an-injective-endomorphism-of-a-finitely-generated-free-r-module-have-nonzer ? – Qiaochu Yuan Jun 22 '12 at 06:15
  • @Qiaochu Yuan: Suppose we have proved our statement in the case $n=k+1$. In a general case, denote the fisrt $(k+1)\times (k+1)$ entry by $A$ and assume that $AX=0$ for some nonzero $X=(x_1,\cdots,x_{k+1})$, then $TY=0$ where $0\neq Y:=(x_1,\cdots,x_{k+1},0,\cdots,0)$. Actually I borrowed the argument here:http://mathoverflow.net/questions/136/atiyah-macdonald-exercise-2-11 – YZhou Jun 22 '12 at 06:33
  • As far as I can tell, this does not follow (you have neglected the entries below the $(k+1) \times (k+1)$ subsquare in $T$). – Qiaochu Yuan Jun 22 '12 at 06:51
  • @QiaochuYuan:I am sorry that I made a terribly stupid mistake. Now I don't know the answer. By far we have known that the statement is true if it has a nonzero $(n-1)\times (n-1)$ minor. But I have no idea when all $(n-1)\times (n-1)$ minors are zero. This might be false. I guess. In the case of integral domains, one accutally first solves the equation in the field and then clear denominator. If the ring is not an integral domain, I guess this might kill the vector. – YZhou Jun 22 '12 at 15:38
  • @QiaochuYuan:I cannot find a counterexample either. Can we first write down a matrix with entries in $k[x_1,\cdots,x_n]$ and then kill some polynomial (e.g. the determinant of the matrix) to pass to the coordinate ring of a variety? This at least gives us some geometry intuition and might be a possible way to find a counterexample. Hope you can find the answer soon! – YZhou Jun 22 '12 at 15:42
  • See the other thread. In fact the statement is true! – Qiaochu Yuan Jun 22 '12 at 22:22
  • @QiaochuYuan: Oh sure! That's wooonderful! The proof can also be stated in the more elementary language of matrices: k rows are linearly independant if and only if only of its $k\times k$ minor is not a zero divisor. Shall I delete my wrong answer? – YZhou Jun 23 '12 at 01:53