What matrices preserve the $L_1$ norm for positive, unit norm vectors? It's easy to show that orthogonal/unitary matrices preserve the $L_2$ norm of a vector, but if I want a transformation that preserves the $L_1$ norm, what can I deduce about the matrices that do this?  I feel like it should be something like the columns sum to 1, but I can't manage to prove it.
EDIT:
To be more explicit, I'm looking at stochastic transition matrices that act on vectors that represent probability distributions, i.e. vectors whose elements are positive and sum to 1.  For instance, the matrix
$$
M = \left(\begin{array}{ccc}1 & 1/4 & 0 \\0 & 1/2 & 0 \\0 & 1/4 & 1\end{array}\right)
$$
acting on
$$
x=\left(\begin{array}{c}0 \\1 \\0\end{array}\right)
$$
gives
$$
M \cdot x = \left(\begin{array}{c}1/4 \\1/2 \\1/4\end{array}\right)\:,
$$
a vector whose elements also sum to 1.
So I suppose the set of vectors whose isometries I care about is more restricted than the completely general case, which is why I was confused about people saying that permutation matrices were what I was after.
Sooo... given the vectors are positive and have entries that sum to 1, can we say anything more exact about the matrices that preserve this property?

The matrices that preserve the set $P$ of probability vectors are those whose columns are members of $P$.  This is obvious since if $x \in P$, $M x$ is a convex combination of the columns of $M$ with coefficients given by the entries of $x$.  Each column of $M$ must be in $P$ (take $x$ to be a vector with a single $1$ and all else $0$), and $P$ is a convex set.
