Let $k$ be an algebraically closed field of characteristic $0$.


For $\alpha :=(a\_1,\dots,a\_{n+1})\in \mathbb N^{n+1}\_{\ge 0}$ , let $\bar x^{\alpha}:= x\_1^{a\_1} \dots x\_{n+1}^{a\_{n+1}} \in k[x\_1,\dots, x\_{n+1}]$. 


Consider a rational map $f=(f\_1: \dots : f\_{n+1}): \mathbb P^n \to \mathbb P^n$ where each 


$f\_i =\bar x^{\alpha\_i}$ for some $\alpha\_i \in \mathbb N^{n+1}\_{\ge 0}$ and each $f\_i$ has same degree say $d \ge 1$. 


I am looking for a moderately elementary proof of the fact that $f$ is birational if and only if $\det (\alpha\_1\dots\alpha\_{n+1} ) = \pm d$ . So basically I'm looking for an elementary proof of Proposition 2.1 of [this paper](https://www.ams.org/journals/proc/2003-131-07/S0002-9939-02-06790-4/S0002-9939-02-06790-4.pdf) (Simis-Villarreal, Proc AMS 2002) when $m=n$ . 


I would very much appreciate it if I can at least get such a proof for $n=2$. 



When is a monomial rational map on the projective space birational?
There is no characteristic restriction needed.


Here's a direct proof for $n=2$ (below the general case is proved based on elementary linear algebra). I write coordinates $(x:y:z)$.


Since your monomials are coprime, the degree of $x$ in one of the coordinates vanishes. Similarly for $y$ and $z$. If they all vanish at the same coordinate, we have $d=0$ which is excluded since $f$ is not constant. Otherwise, we have two cases (A) they vanish at distinct coordinates, (B), two vanish at one coordinate and the third at another. Then, after permuting the coordinates (which only affects the given determinant by change of sign), we have:


Case (A):
$$(x:y:z)\mapsto (y^{D-a}z^{D+a}:x^{D-b}z^{D+b},x^{D+c}z^{D-c}),$$
with degree $d=2D$, and $D\pm a,D\pm b,D\pm c$ non-negative integers;


Case (B):
$$(x:y:z)\mapsto (x^d:y^az^{d-a}:x^by^cz^{d-b-c}),$$
with degree $d$, and $a,b,c$ non-negative integers with $a,b+c\le d$.


In both cases, I will use affine coordinates ($(x,y)\mapsto (x:y:1)$). A monomial map in affine coordinates $(x,y)\mapsto (x^sy^t,x^uy^v)$ with $M=\begin{pmatrix}s & t\\ u & v\end{pmatrix}\in\mathrm{Mat}\_2(\mathbf{Z})$ is dominant if and only $\det M\neq 0$ (clear), and birational if and only if $\det M=\pm 1$ (indeed when $|\det(M)|\neq 0$ generic fibers have cardinal $|\det(M)|$ by an easy linear algebra argument).


In case (A), in affine coordinates ($(x,y)\mapsto (x:y:1)$) it writes as 
$$(x,y)\mapsto (x^{-D-c}y^{c-a},x^{b-c}y^{c-D}).$$
In this case the affine determinant is $\delta=\begin{vmatrix}-d-c & c-a\\ b-c & c-d\end{vmatrix}=D^2+ab-ac-bc$. While the original determinant (as in the question) is $$\Delta=\begin{vmatrix}0 & D+b & D+c\\ D-a & 0 & D-c \\ D+a & D-b & 0 & \end{vmatrix}=(D-a)(D-b)(D+c)+(D+a)(D+b)(D-c)=2D\delta=d\delta.$$ 


In case (B), in affine coordinates, it writes as
$$(x,y)\mapsto (x^{d-b}y^{-c},x^{-b}y^{a-c}).$$
In this case the affine determinant is $\delta=\begin{vmatrix}d-b & -b\\ -c & a-c\end{vmatrix}=da-dc-ab$; the original determinant is 
$$\Delta=\begin{vmatrix}d & 0 & b\\ 0 & a & c\\ 0 & d-a & d-b-c\end{vmatrix}=d\begin{vmatrix}a & c\\ d-a & d-b-c\end{vmatrix}=d\delta.$$


In both cases we deduce $\Delta=d\delta=\pm d$, since $\delta=\pm 1$.




---


Now let's prove the general case.


First start with the necessary purely linear-algebraic elementary background. let $K$ be a field (or even ring) of coefficients. Define $\Psi:\mathrm{M}\_n(K)\to\mathrm{M}\_{n+1}(K)$ by $$\Psi((a\_{ij})\_{1\le i,j\le n})=(b\_{ij})\_{1\le i,j\le n+1}
,\quad b\_{ij}=a\_{ij},\;b\_{i,n+1}=0,\;b\_{n+1,j}=-\sum\_{\ell=1}^na\_{\ell j}.$$
That is, $\Psi(A)$ is obtained from $A$ by adding a zero last column and filling the last line so as to make all columns have sum zero.


Define $\mathrm{M}\_{n+1}^\sharp(K)$ be the subalgebra of matrices $A$ all of whose columns have the same sum $d(A)$. If $v$ is the line-matrix $(1,\dots,1)$, then $\mathrm{M}\_{n+1}^\sharp(K)$ is the set of $A\in\mathrm{M}\_{n+1}(K)$ such that $Av$ is collinear to $v$, and then $Av=d(A)v$. In particular, $d:\mathrm{M}\_{n+1}^\sharp(K)\to K$ is a $K$-algebra homomorphism.


Let $Q(K)$ be the set of matrices in $\mathrm{M}\_{n+1}(K)$ all of whose lines are constant. Clearly $Q(K)\subset\mathrm{M}\_{n+1}^\sharp(K)$, and, restricted to $Q(K)$, $d$ equals the trace.



> 
> Then $\det(\Psi(A)+q)=\mathrm{Trace}(q)\det(A)$ for all $A\in\mathrm{M}\_n(K)$ and all $q\in Q(K)$.
> 
> 
> 


[Indeed, after a change of basis, this amounts to the same formula, when instead $(\Psi,Q(K))$ is replaced with $(\Psi',Q'(K))$, where $\Psi'$ is defined as the standard embedding (adding only zeros on both the last column and last line) and $q'(K)$ is the set of matrices that is zero outside the last column, and in this case this the formula is obvious.]


Now assume that there is a total ordering on $K$, invariant under addition, and define $q(A)$ by $q\_{ij}=-\min(b\_{i1},\dots,b\_{in})$, where $B=\Psi(A)$. Define $\Phi(A)=\Psi(A)+q(A)$. By construction, $\Phi(A)\in\mathrm{M}\_{n+1}^\sharp(K)$, it has entries $\ge 0$, and the min of each line is zero. From the last formula, we have



> 
> For every $A\in\mathrm{M}\_n(K)$, one has $\det(\Phi(A))=\mathrm{Trace}(q(A))\det(A)$.
> 
> 
> 


Now let us explain why this is exactly what we need, namely that $\Phi$ encodes the map that passes a monomial transformation from its affine to its projective form, and that $\mathrm{Trace}\circ q$ is precisely the degree.


Precisely, start from $A=(a\_{ij})\_{1\le i,j\le n}\in\mathrm{M}\_n(\mathbf{Z})$. It defines the monomial transformation $f\_A$ in affine coordinates $(z\_1,\dots,z\_n)\mapsto (w\_1,\dots,w\_n)$ with $w\_i=\prod\_{j=1}^n z\_j^{a\_{ij}}$ (which is defined at least when all $z\_i$ are nonzero). In projective coordinates this is $(z\_1:\dots:z\_n:1)\mapsto (w\_1:\dots:w\_n:1)$. Hence $f\_A$ maps 
$$(z\_1:\dots :z\_{n+1})\mapsto (w'\_1:\dots,w'\_n:1),\;w'\_i=\prod\_{j=1}^n (z\_j/z\_{n+1})^{a\_{ij}}$$
(defined at least when all $z\_i$ are nonzero).
Hence, $w'\_i=\prod\_{j=1}^{n+1}z\_j^{b\_{ij}}$ for all $1\le i\le i+1$, where $B=(b\_{ij})\_{1\le i,j\le n+1}=\Psi(A)$.


By multiplying by a suitable monomial, we can clear denominators and common factors in the numerators, and get $f\_A$ in the form. 
$$(z\_1:\dots :z\_{n+1})\mapsto (\xi\_1:\dots,\xi\_n:\xi\_{n+1}),\;\xi\_i=\prod\_{j=1}^{n+1} z\_j^{c\_{ij}}.$$
By definition $\Phi(A)$ is the matrix $(c\_{ij})\_{1\le i,j\le n+1}$. This is a matrix with entries in $\mathbf{N}$ and with the property that all its columns have the same sum $d=d(\Phi(A))=\deg(f\_A)$, which is the degree of the above monomial map, and all its lines have minimum zero. Hence by the previous formula (applied to $K=\mathbf{Z}$), we have



> 
> For every $A\in\mathrm{M}\_n(\mathbf{Z})$ we have $\det(\Phi(A))=\deg(f\_A)\det(A)$.
> 
> 
> 


As I wrote in the case $n=2$, if $\det(A)=0$ then $f\_A$ is not dominant. If $\det(A)\neq 0$ then $|\det(A)|$ is the cardinal of a generic fiber. Hence $f\_A$ is birational iff $\det(A)=\pm 1$. This is therefore (for $n\ge 1$) equivalent to $\det(\Phi(A))=\pm\deg(f\_A)\neq 0$.


(Not much to say about degree zero, i.e., $f\_A$ constant: it is birational iff $n=0$.)


