\documentclass[JEP,XML,SOM,Unicode,NoEqCountersInSection]{cedram}
\datereceived{2018-08-22}
\dateaccepted{2019-11-28}
\dateepreuves{2019-12-02}

\usepackage{mathrsfs}
\let\mathcal\mathscr
\let\epsilon\varepsilon
\newcommand{\Changel}{\mathcode`l="7160}
\newcommand{\Changelback}{\mathcode`l="716C}
\newcommand{\NNoChangel}[1]{%
\expandafter\let\csname old\string#1\endcsname=#1
\let#1=\relax
\newcommand{#1}{\mathcode`l="716C\csname old\string#1\endcsname\mathcode`l="7160 }%
}

\NNoChangel{\log}
\NNoChangel{\ln}
\NNoChangel{\lim}
\NNoChangel{\limsup}
\NNoChangel{\liminf}
\NNoChangel{\varlimsup}
\NNoChangel{\varliminf}
\NNoChangel{\varinjlim}
\NNoChangel{\varprojlim}


\theoremstyle{plain}
\newtheorem{teo}{Theorem}[section]
\newtheorem{prop}[teo]{Proposition}
\newtheorem{lema}[teo]{Lemma}
\newtheorem{coro}[teo]{Corollary}

\theoremstyle{definition}
\newtheorem{obs}[teo]{Remark}
\newtheorem{ej}[teo]{Example}

\newcommand{\NN}{\mathbb{N}}
\newcommand{\CC}{\mathbb{C}}
\newcommand{\RR}{\mathbb{R}}

\newcommand{\Isom}{\mathit{Isom}}

\newcommand{\ccl}[3]{#1^{#2}(#3)}
\newcommand{\corchete}[1]{\left\{{#1}\right\}}

\DeclareMathOperator{\Char}{char}
\DeclareMathOperator{\End}{End}
\DeclareMathOperator{\mdeg}{mdeg}
\DeclareMathOperator{\Nil}{\mathcal{N}}
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\Tr}{Tr}
\DeclareMathOperator{\Wedge}{\mathsf{\Lambda}}

\begin{document}
\frontmatter
\title{A new inequality about matrix products and a~Berger-Wang formula}

\author[\initial{E.} \lastname{Oregón-Reyes}]{\firstname{Eduardo} \lastname{Oregón-Reyes}}
\address{Department of Mathematics, University of California at Berkeley\\
848 Evans Hall, Berkeley, CA 94720-3860, U.S.A.}
\email{eoregon@berkeley.edu}
\urladdr{https://math.berkeley.edu/~eoregon/}

\thanks{This article was supported by CONICYT scholarship 22172003, and partially supported by CONICYT PIA ACT172001.}

\begin{abstract}
We prove an inequality relating the norm of a product of matrices $A_n\cdots A_1$ with the spectral radii of subproducts $A_j\cdots A_i$ with $1\leq i\leq j\leq n$. Among the consequences of this inequality, we obtain the classical Berger-Wang formula as an immediate corollary, and give an easier proof of a characterization of the upper Lyapunov exponent due to I.\,Morris. As main ingredient for the proof of this result, we prove that for a large enough $n$, the product $A_n\cdots A_1$ is zero under the hypothesis that $A_j\cdots A_i$ are nilpotent for all $i,j$ such that $1\leq i \leq j\leq n$.
\end{abstract}

\subjclass{37H15, 15A42}

\keywords{Linear cocycle, joint spectral radius, Berger-Wang formula, Lyapunov exponent, product of nilpotent matrices}

\alttitle{Une nouvelle inégalité sur les produits de matrices et une formule de Berger-Wang}

\altkeywords{Cocycle linéaire, rayon spectral joint, formule de Berger-Wang, exposant de Liapounov, produit de matrices nilpotentes}

\begin{altabstract}
Nous montrons une inégalité reliant la norme d'un produit $A_n\cdots A_1$ de matrices aux rayons spectraux des sous-produits $A_j\cdots A_i$ avec $1\leq i\leq j\leq n$. Comme conséquences de cette inégalité, nous obtenons la formule classique de Berger-Wang comme corollaire immédiat, et nous donnons une preuve plus simple de la caractérisation, due à I.\,Morris, de l'exposant de Liapounov supérieur. Nous montrons, comme ingrédient principal de la preuve de ce résultat, que pour $n$ assez grand, le produit $A_n\cdots A_1$ est nul si les $A_j\cdots A_i$ sont nilpotents pour tout $i,j$ tel que $1\leq i \leq j\leq n$.
\end{altabstract}

\maketitle
\tableofcontents
\mainmatter
\Changel

\section{Introduction}
Let $k$ be a field, and let $M_{d}(k)$ be the algebra of $d\times d$ matrices with coefficients in~$k$. If $k=\RR$ or $\CC$, let $\|.\|$ be any norm on $k^d$, with the corresponding operator norm on $M_{d}(k)$ also denoted by $\|.\|$. The spectral radius of a matrix $A$ will be denoted by~$\rho(A)$. Given a bounded set $\mathcal{M}\subset M_{d}(k)$, the \textit{joint spectral radius} of $\mathcal{M}$ is defined by the formula
\begin{equation}\label{jsr}
\mathfrak{R}(\mathcal{M})=\lim_{n\to \infty}{\left(\sup \corchete{\|A_{1}\cdots A_{n}\| : A_{i}\in \mathcal{M} }\right)^{1/n}}.
\end{equation}
By a submultiplicative argument, this quantity is well defined and finite, and the limit in the right hand side of \eqref{jsr} can be replaced by the infimum over $n$.

The joint spectral radius was introduced by Rota and Strang \cite{rota}, and for a set $\mathcal{M}\subset M_{d}(k)$, represents the maximal exponential growth rate of the partial sequence of products $(A_1\cdots A_n)_{n}$ of a sequence of matrices $A_1,A_2,\dots$ with $A_i\in \mathcal{M}$. For this reason, this quantity has appeared in several mathematical contexts, making it an important object of study (see \eg \cite{gur,jun,mathermorris,tsblo}). In particular, the question of whether the joint spectral radius may be approximated by periodic sequences plays an important role. The Berger-Wang formula gives a positive answer to this question in the case of bounded sets of matrices \cite{bw}:

\begin{teo}[Berger-Wang formula]\label{bergerwangantiguo}
If $\mathcal{M}\subset M_{d}(\CC)$ is bounded, then
\begin{equation}\label{formulabwantiguo}
\mathfrak{R}(\mathcal{M})=\limsup_{n\to \infty}{\left(\sup\corchete{\rho(A_{1}\cdots A_{n}) : A_{i}\in \mathcal{M}}\right)^{1/n}}.
\end{equation}
\end{teo}
This result has been generalized by Morris, to the context of linear cocycles (including infinite dimensional ones) \cite{morrisbw}, by using multiplicative ergodic theory. In the finite dimensional case, the problem of finding a formula similar to \eqref{formulabwantiguo}, when there is a Markov-type constraint on the allowed products was presented by Kozyakin \cite{kozyakin}. Although the result of Morris already applies to this kind of constraints, the novelty in Kozyakin's proof is that his arguments are purely linear algebraic, and are consequences of Theorem \ref{bergerwangantiguo}.

Another tool to obtain results related to joint spectral radius was found by Bochi in \cite{bociineq}. In that work, he proved some inequalities that may be seen as lower bounds for joint spectral radii of sets of matrices in terms of the norms of such matrices. Following that method, the purpose of this article is to present an inequality relating the norm of the product of matrices with the spectral radii of subproducts. We will give an upper bound for the norm of the product of matrices $A_N\cdots A_1$ in terms of the spectral radii of its subproducts $A_{\beta}A_{\beta-1}\cdots A_{\alpha+1}A_{\alpha}$. This inequality will allow us to obtain relations similar to \eqref{formulabwantiguo}. It holds in an arbitrary local field where the notions of absolute value, norm, and spectral radius are well defined (see Section \ref{pruebadesigualdad} for a detailed explanation). Our main result is the following:

\begin{teo}\label{desigualdad} Let $d \in \NN$, $k$ be a local field, and $\|.\|$ be a submultiplicative norm on $M_{d}(k)$. There exist constants $N = N(d)\leq \prod^{d}_{i=1}{\binom{d}{i}}$, $r = r(d,N) \leq (Nd+1)^{Nd^2+2}$, and $C = C(d,\|.\|) > 1$ such that for all $n\geq N$ and $A_1,\dots, A_n \in M_{d}(k)$:
\begin{equation}\label{eqdesigualdad}
\|A_n\cdots A_1\| \leq C \biggl(\prod_{1\leq i\leq n}{\|A_i\|}\biggr)\max_{1\leq \alpha\leq \beta\leq n}{ \Bigl( \frac{\rho(A_{\beta}\cdots A_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|A_i\|}} \Bigr)^{1/r}},
\end{equation}
where the right hand side is treated as zero if one of the $A_{i}$ is the zero matrix.
\end{teo}
So for large enough $n$, if the norm of the product $A_n\cdots A_1$ is comparable to (that is, not much smaller than) the product of the norms, then there exists a subproduct $A_{\beta}\cdots A_{\alpha}$ whose spectral radius is comparable to (that is, not much smaller than) $\prod_{\alpha\leq i \leq \beta}{\|A_{i}\|}$.

Note that inequality \eqref{eqdesigualdad} is homogeneous in each variable $A_{i}$. We will later show that the upper bound $N(d)\leq \prod^{d}_{i=1}{\binom{d}{i}}$ is not sharp, because $N(3)\leq 5$ (see Proposition~\ref{casotres}). In addition, when $k=\CC$, the constant $C$ in \eqref{eqdesigualdad} may be chosen independent of the norm $\|.\|$ and found explicitly, provided that $\|.\|$ is an operator norm (see Proposition \ref{independ} and Remark \ref{effective}).

The approach of using inequalities to prove results similar to \eqref{formulabwantiguo} was first used by Elsner \cite{elsner} in his proof of the Berger-Wang formula (with an inequality of a different nature from Bochi's work). Inequalities like \eqref{eqdesigualdad} also have been applied by I.\,Morris to study matrix pressure functions \cite{morrispr} and by the author in the context of isometries in Gromov hyperbolic spaces \cite{yo}. The novelty of the inequality presented here is that it respects the order in which the matrices are multiplied. While previous works considered a sum or a maximum over \textit{all} possible subproducts of length $N$ with respect to a given alphabet of matrices, in Theorem \ref{desigualdad} we consider just one product of length $N$ together with its subproducts, hence our inequality does not follow from previously known Bochi-type results. In addition, our error in the upper bound in terms of spectral radii is multiplicative (the constant $C$) and not additive as in the case of Elsner's work. These distinctions allow inequality \eqref{eqdesigualdad} to be used in cases where only some specific kinds of products are allowed (see Theorem \ref{bergerwangnuevo} below), as well to relate asymptotic quantities (like the joint spectral radius) to non-asymptotic expressions, in a uniformly controlled way (see Theorem \ref{detodos}).

The proof of this inequality is based on the non trivial case of equality, where the right hand side of \eqref{eqdesigualdad} is zero but the matrices $A_i$ are non-zero. This occurs when $\rho(A_{j}\cdots A_{i})=0$ for all $1\leq i \leq j \leq N$, that is, when $A_{j}\cdots A_{i}$ are all nilpotent. Denote by $\Nil_{d}(k)$ the set of nilpotent elements of $M_{d}(k)$. Then define, for $n\geq 1$, the set $\Nil_{d}^{n}(k)$ of $n$-tuples $(A_1,\dots,A_n)\in {M_{d}(k)}^{n}$ such that $A_{j}\cdots A_{i}\in \Nil_{d}(k)$ for all $1\leq i \leq j \leq n$.
The particular case of \eqref{eqdesigualdad} that we highlighted can be restated as follows:

\begin{teo}\label{nilpotentes} For all $d\geq 1$ there exists an integer $N=N(d)\geq 1$ such that, for every field $k$, if $(A_1,\dots,A_N) \in \Nil_{d}^{N}(k)$, then the product $A_{N}\cdots A_{1}$ is zero.
\end{teo}
The proof of Theorem \ref{nilpotentes} is purely linear algebraic, exploiting the properties of the $n$-exterior power functor. This result may be compared with Levitzki's Theorem \cite[Th.\,2.1.7]{raro}, that asserts that for an algebraically closed field $k$, every semigroup $S\subset M_{d}(k)$ of nilpotent matrices is simultaneously triangularizable. That is, there is some $B\in \mathrm{GL}_{d}(k)$ such that $BAB^{-1}$ is upper triangular with zero diagonal for every $A \in S$ (compare also with the Burnside-Schur Theorem for semigroups of matrices \cite{mcnaugh}). In particular, if $A_1,\dots,A_d\in S$, then the product $A_1 \cdots A_d$ is zero. As we show in Section~\ref{computos}, the optimal $N(d)$ in Theorem \ref{nilpotentes} is in general larger than~$d$, therefore the result presented here does not follow from Levitzki's Theorem nor Burnside-Schur Theorem, and we don't expect to obtain any information about the semigroup generated by $A_1,\dots,A_N$. In general, the matrices satisfying the hypothesis of Theorem~\ref{nilpotentes} admit no normal form as simple as in Levitzki's Theorem.

\subsubsection*{Applications to Ergodic theory.} Let $(X,\mathcal{F},\mu)$ be a probability space, and let $T:X\rightarrow X$ be a measure preserving map. By a \textit{linear cocycle} over $X$, we mean a measurable map $A:X\rightarrow M_{d}(k)$ together with the family of maps $A^{n}$ defined by the formula
\begin{equation*}
\ccl{A}{n}{x}=A(T^{n-1}x)\cdots A(Tx)A(x), \hspace{2mm} \text{ for }n\geq 1,\;x\in X.
\end{equation*}
These maps satisfy the multiplicative cocycle relation $A^{m+n}(x)=A^{m}(T^{n}x)A^{n}(x)$ for all $m,n\geq 1,x \in X$.

We usually denote a linear cocycle by $\mathcal{A}=(X,T,A)$, and say that $\mathcal{A}$ is \textit{integrable} if $\max(\log{\|A\|},0)$ is integrable. In this case, Kingman's theorem implies that, for $\mu$-almost all $x\in X$, the limit $\lambda(x)=\lim_{n \to \infty}{\frac{\log{\|\ccl{A}{n}{x}\|}}{n}}\in [-\infty,\infty)$ exists, and moreover, $\lambda$ is $T$-invariant. This function is the upper \textit{Lyapunov exponent} of $A$, and is one of the most important concepts in multiplicative ergodic theory.

As an application of our inequality, we reprove the following theorem due to I.\,Morris (first tested numerically in \cite{fisicos} and proved by Avila-Bochi for $\mathrm{SL}_{2}(\RR)$ in \cite[Th.\,15]{avibochi}).

\begin{teo}\label{bergerwangnuevo}\cite[Th.\,1.6]{morrisbw}
Let $T$ be a measure-preserving transformation of a probability space $(X,\mathcal{F},\mu)$ and let $A: X \rightarrow M_{d}(k)$ be an integrable linear cocycle. If $\lambda$ is as before, then for $\mu$-almost all $x\in X$ we have
\begin{equation}\label{bww}
\limsup_{n\to \infty}{\frac{\log(\rho(\ccl{A}{n}{x}))}{n}=\lambda(x)}.
\end{equation}
\end{teo}

While Morris's proof of this result relies on Oseledets Theorem, we will mainly use Theorem \ref{desigualdad} and a quantitative version of Poincaré's Recurrence Theorem.

\subsubsection*{Organization of the paper.} In Section \ref{secciondos} we prove Theorem \ref{nilpotentes} and compute $N(d)$ for $d=2,3$. Then in Section \ref{secciontres}, via Nullstellensatz we translate this theorem into a polynomial identity, from which we deduce Theorem \ref{desigualdad} in Section \ref{pruebadesigualdad}. We prove Theorem \ref{bergerwangnuevo} in Section \ref{seccioncinco}, and discuss some geometric consequences and analogies of this result in Section \ref{seccionseis}.

\subsubsection*{Acknowledgment}
I am very grateful to J.\,Bochi for very interesting and valuable discussions throughout all this work. I also thank G.\,Urzúa for valuable discussions about Nullstellensatz, and the referee for the detailed report and the suggestions and corrections to the text.

\section{Proof of Theorem \ref{nilpotentes}}\label{secciondos}

We begin the proof of Theorem \ref{nilpotentes} with some useful results. For a given vector space $V$ (over an arbitrary field), let $\End(V)$ be the algebra of linear endomorphisms of $V$. The dimension of the image of a linear transformation $T\in \End(V)$ will be denoted as $\rank(T)$. Also, let $\mathcal{N}^{n}(V)$ be the set of $n$-tuples $(T_1,\dots,T_n)\in \End(V)^{n}$ such that $T_{j}\cdots T_{i}$ is nilpotent for all $1\leq i \leq j \leq n$. With our previous notation, we have $\mathcal{N}^{n}(k^{d})=\mathcal{N}^{n}_{d}(k)$.

\begin{prop}\label{proprango}
Let $n\geq 1$ and $(T_1,\dots,T_n)\in \Nil^{n}(V)$ be such that $\rank(T_j)\leq 1$ for all $1\leq j\leq n-1$. If $v\in V$ and $T_n\cdots T_{1}v\neq 0$, then $v$, $T_1{v}$, $T_{2}T_{1}v$, $\dots,T_{n}\cdots T_{1}v$ are all distinct and form a linearly independent set.
\end{prop}
\begin{proof} We will use induction on $n$. The case $n=1$ comes from the nilpotence of $T_1$. So, assume that the result holds for tuples in $\Nil^{n-1}(V)$ and let $(T_1,\dots,T_{n})\in \Nil^{n}(V)$ and $v\in V$ be as in the hypothesis.
Take a linear combination of $v$, $T_1{v}$, $\dots,T_{n}\cdots T_{1}$ of the form\vspace*{-3pt}\enlargethispage{\baselineskip}%
\begin{equation}\label{desigualdadpropo}
\lambda_{0}v+\lambda_{1}T_1{v}+\dots+\lambda_{n-1}T_{n-1}\cdots T_{1}v+\lambda_{n}T_{n}\cdots T_{1}v=0,
\end{equation}
and suppose that this linear combination is non trivial. As $(T_1,\dots,T_{n-1})\in \Nil^{n-1}(V)$ also satisfies the hypothesis with respect to $v$, by our inductive assumption we have $\lambda_{n}\neq 0$.
Now, apply $T_{n}\cdots T_{1}$ in \eqref{desigualdadpropo}. The rank condition over the maps $T_{j}$ and the fact that $(T_1,\dots,T_n)\in \Nil^{n}(V)$ imply that $(T_{j}\cdots T_{1})^{2}=0$, for all $1\leq j \leq n$. Hence, the left hand side of \eqref{desigualdadpropo} becomes $\lambda_{0}T_{n}\cdots T_{1}v$, forcing $\lambda_{0}=0$. But in that case, equation \eqref{desigualdadpropo} would be a non trivial linear combination of $\corchete{w,T_{2}{w},T_{3}T_{2}w,\dots,T_{n}\cdots T_{2}w}$, with $w=T_{1}v$. This is impossible by our inductive assumption, since $(T_{2},\dots,T_{n})\in \Nil^{n-1}(V)$ satisfies the hypothesis of the proposition with respect to $w$. We conclude that all linear combinations of $v$, $T_1{v}$, $T_{2}T_{1}v$, $\dots,T_{n}\cdots T_{1}v$ of the form \eqref{desigualdadpropo} are trivial, and hence this set is linearly independent with exactly $n+1$ elements.
\end{proof}

\begin{coro}\label{cororango}
If $(T_1,\dots,T_d)\in \Nil^{d}(V)$ and $\rank(T_j)\leq 1$ for all $1 \leq j\leq d-1$, then $T_d\cdots T_1=0$.
\end{coro}
\begin{proof}
Assume the contrary and let $v\in V$ be such that $T_{d}\cdots T_{1}v\neq 0$. Then by Proposition \ref{proprango}, the set $\corchete{v,T_1{v},T_{2}T_{1}v,\dots,T_{d}\cdots T_{1}v}$ would be a linearly independent set of cardinality greater than $\dim{V}$. A contradiction.
\end{proof}

For the next steps in our proof we need some fact about exterior powers. Recall that if $V$ is a vector space of dimension $d$, the \textit{r-fold exterior power} $\Wedge^{r}{V}$ is the vector space of alternating $r$-linear forms on the dual space $V^*$ (see \eg \cite[XIX.1]{langalg}). Given a basis $\corchete{v_1,\dots, v_d}$ of $V$, the set
$\corchete{v_{i_1}\wedge \cdots \wedge v_{i_r} : 1\leq i_1<\dots <i_r\leq d}$ is a basis of $\Wedge^{r}{V}$. Hence $\dim {\Wedge^{r}V}=\binom{d}{r}$.

The exterior power also induces a map $\Wedge^{r}: \End(V) \rightarrow \End(\Wedge^{r}{V})$ given by the linear extension of $(\Wedge^{r}T)(w_1\wedge \cdots \wedge w_r)=(Tw_1\wedge \cdots \wedge Tw_r)$. This map is functorial: The relation $\Wedge^{r}(ST)=\Wedge^{r}(S)\Wedge^{r}(T)$ holds for all $S,T \in \End(V)$. This functor also induces a map $\Wedge^{r}: \Nil(V)\rightarrow \Nil(\Wedge^{r}{V})$ that extends to $\Nil^{n}(V)\rightarrow \Nil^{n}(\Wedge^{r}{V})$ for all $n\geq 1$.

Another important fact is that, when $T\in \Nil(V)$ and $\rank(T)=r>0$, then $\rank(\Wedge^{r}{T})=1$. This is because the image of $\Wedge^{r}{T}$ is generated by any $r$-form associated to the $r$-dimensional subspace $T(V)$. This remark is crucial in the end of our proof.

\begin{lema}\label{lemaa}
Let $1\leq r\leq d$ and $m=\binom{d}{r}$. Given $(T_1,\dots,T_m)\in \Nil^{m}(V)$, with $\rank(T_j) \leq r$ for all $1\leq j\leq m-1$, we have $\rank(T_{m}\cdots T_{1})<r$.
\end{lema}
\begin{proof}
If that is the case then we will have $\rank(T_{j}T_{j-1}\cdots T_{i})\leq r$ for all $1\leq i\leq j\leq m-1$. Then the tuple $(\Wedge^{r}{T_1},\dots,\Wedge^{r}{T_m})\in \Nil^{m}(\Wedge^{r}{V})$ will satisfy the hypothesis of Corollary \ref{cororango}, and hence $\Wedge^{r}(T_m\cdots T_1)=0$, which implies that \hbox{$\rank(T_m\cdots T_1 )<r$}.
\end{proof}

\begin{proof}[Proof of Theorem \ref{nilpotentes}]
Let $1\leq l< d$ and $r(l)= \binom{d}{1}\cdots \binom{d}{l}$. We claim that for all $(T_1,\dots,T_{r(l)})\in \Nil^{r(l)}(V)$ we have $\rank(T_{r(l)} \cdots T_{1})<d-l$. If so, the result follows with $N=r(d-1)=\binom{d}{1}\cdots \binom{d}{d-1}$.

We will argue by induction. The case $l=1$ is Lemma \ref{lemaa} with $r=d-1$. Now, assume the result for some $l<d$, and for $1\leq j \leq \binom{d}{l+1}$, define $\hat{T}_j=T_{r(l)j}\cdots T_{r(l)(j-1)+1}$. Then $(\hat{T}_1,\dots,\hat{T}_{\binom{d}{l+1}})\in \Nil^{\binom{d}{l+1}}(V)$, and by our inductive hypothesis, we obtain $\rank(\hat{T}_j)\leq d-l-1$. So, we are in the assumption of \ref{lemaa} with $r=d-l-1$ and we conclude that $\rank(T_{r(l+1)}\cdots T_{1})=\rank(\hat{T}_{\binom{d}{l+1}}\cdots \hat{T}_{1})<d-l-1$. This proves the claim and concludes the proof of the theorem.
\end{proof}

\subsection{Some computations in low dimension}\label{computos}
Let $N(d)$ be the least value of $N$ for which Theorem \ref{nilpotentes} (and therefore also Theorem \ref{desigualdad}) holds true. From the proof of Theorem \ref{nilpotentes}, we can obtain the bound $N(d)\leq \binom{d}{1}\binom{d}{2}\cdots \binom{d}{d-1}$ for all $d$. Also, since for all $d$ we can construct a matrix $A\in \mathcal{N}_{d}(k)$ of rank $d-1$, the tuple $(A,\dots,A)\in \mathcal{N}^{d-1}(k^{d})$ satisfies $A^{d-1}\neq 0$ and hence we have the lower bound $N(d)\geq d$. In particular, we conclude that $N(2)=2$, and for higher dimensions we get the bounds $3\leq N(3)\leq 9$ and $4\leq N(4)\leq 96$. We end this section by finding a better bound for $N(3)$.

\begin{prop}\label{casotres}
For any field $k$, we have $N(3)\leq 5$. In addition, if $\Char{k}\neq 2$, then $N(3)=5$.
\end{prop}
To prove this, we need a lemma:
\begin{lema}\label{lema3}
Let $(C,B,A)\in \mathcal{N}^{3}(k^{3})$. If $\rank{B}=1$, then $AB=\lambda B$ or $BC=\lambda B$ for some $\lambda \in k$.
\end{lema}
\begin{proof}
Assume that
\[\arraycolsep3.5pt
B=\begin{pmatrix}
0 & 0 & 0\\
0 & 0 & 1\\
0 & 0 & 0\\
\end{pmatrix},\quad A=\begin{pmatrix}
a & b & c\\
d & e & f\\
g & h & i\\
\end{pmatrix}\quad\text{and}\quad C=\begin{pmatrix}
p & q & r\\
s & t & u\\
v & w & x\\
\end{pmatrix}. 
\]
Then
\[\arraycolsep3.5pt
AB=\begin{pmatrix}
0 & 0 & b\\
0 & 0 & e\\
0 & 0 & h\\
\end{pmatrix}\quad\text{and}\quad BC=\begin{pmatrix}
0 & 0 & 0\\
v & w & x\\
0 & 0 & 0\\
\end{pmatrix}.
\]
The nilpotence of $AB$ and $BC$ implies $h=\Tr{AB}=w=\Tr{BC}=0$. Then
\[\arraycolsep3.5pt
ABC=\begin{pmatrix}
bv & 0 & bx\\
ev & 0 & ex\\
0 & 0 & 0\\
\end{pmatrix},
\]
and by the nilpotence of $ABC$, $bv=\Tr{ABC}=0$.
The case $b=0$ is $AB=eB$ and the case $v=0$ is $BC=xB$.
\end{proof}

\begin{coro}\label{cororango3}
If $(C,B,A) \in \mathcal{N}^{3}(k^{3})$ and $\rank(B)\leq 1$, then $ABC=0$.
\end{coro}
\begin{proof}
Assume that $\rank(B)=1$, and $AB, BC\neq 0$. By Lemma \ref{lema3} and after rescaling $A$ or $C$, we may suppose that $BC=B$ or $AB=B$. In the first case we will have $(C^2,B,A) \in \mathcal{N}^{3}(k^{3})$, and by Corollary \ref{cororango}, $ABC=A(BC)C=ABC^{2}=0$. For the case $AB=B$, applying a similar argument to the tuple $(A^{t},B^{t},C^{t})$ of the transposes of $A,B,C$, we will obtain $(ABC)^{t}=C^{t}B^{t}(A^{t})^{2}=0$, and hence \hbox{$ABC=0$}.
\end{proof}

\begin{proof}[Proof of Proposition \ref{casotres}]
Let $(E,D,C,B,A)\in \Nil^{5}(k^{3})$. Then $(E,BCD,A)$ belongs to $\Nil^{3}(k^{3})$, and by Lemma \ref{lemaa} with $d=3, r=2$, $\rank(BCD)\leq 1$. Then, by Corollary \ref{cororango3}, $ABCDE=0$ and $N(3)\leq 5$.
Moreover, when $\Char{k}\neq 2$, it is a straightforward computation to show that $(D,C,B,A)\in \Nil^{4}(k^{3})$, with
\begin{equation*}
\arraycolsep3.5pt
A\!=\!\begin{pmatrix}
-2 & -6 & 1\\
3 & 9 & 16\\
-1 & -3 & -7\\
\end{pmatrix},\ B\!=\!\begin{pmatrix}
0 & 1 & 0\\
0 & 0 & 1\\
0 & 0 & 0\\
\end{pmatrix},\ C\!=\!\begin{pmatrix}
1 & 1 & 0\\
1 & 1 & 4\\
-1 & -1 & -2\\
\end{pmatrix},\ D\!=\!\begin{pmatrix}
-1 & 3 & 16\\
1 & -3 & -16\\
1 & 2 & 4\\
\end{pmatrix}
\end{equation*}
and
\[\arraycolsep3.5pt
ABCD=\begin{pmatrix}
4 & 8 & 16\\
-6 & -12 & -24\\
2 & 4 & 8\\
\end{pmatrix}\neq 0.\qedhere
\]
\end{proof}

\begin{obs} This last proposition shows that, in general we cannot expect \hbox{$N(d)=d$}. For that reason, the hypothesis of Theorem \ref{nilpotentes} does not imply any kind of simultaneous triangularization or nilpotency of the semigroup generated by sequences in $\mathcal{N}^{n}(k^{d})$. In fact, it is not hard to prove that the matrices in the last example we gave in $\mathcal{N}^{4}(k^{3})$ are not simultaneously triangularizable, since $A$ and $B$ do not have a common invariant subspace of dimension $1$.
\end{obs}
\section{A polynomial identity}\label{secciontres}

For the proof of Theorem \ref{desigualdad} we need some notation. Let $k$ be a field with algebraic closure $\overline{k}$. For $d,N\in \NN$, consider $Nd^2$ variables $x_{i,j}$ with $1\leq i\leq N$, $1 \leq j \leq d^{2}$ and let $R_{d,N}$ be the polynomial ring $k[x_{i,j}]$. If $A_1,\dots,A_N \in M_{d}(\overline{k})$ and $f\in R_{d,N}$, by $f(A_1,\dots,A_N)$ we mean the element $f((a_{i,j})_{i,j})$ where $(a_{i,j})_{j}$ are the coefficients of~$A_i$ in some fixed order.

Recall that a polynomial $f\in k[y_1,\dots,y_m]$ is \textit{homogeneous} of degree $\lambda\geq 0$ if it is of the form $\sum_{i_1+\dots+i_m=\lambda}{c_{i_1\dots i_m}y_{1}^{i_1}\dots y_{m}^{i_m}}$ for some $c_{i_1\dots i_m}\in k$, \hbox{$i_1,\dots,i_m\geq 0$}. We~say~that a monomial $f\in R_{d,N}$ is \textit{multihomogeneous} of \textit{multidegree} $\mdeg{f}=(\lambda_1,\dots,\lambda_N) \in {\NN}^{N}$ if it is of the form $f((x_{i,j})_{i,j})=c\prod_{i,j}x^{u_{i,j}}_{i,j}$, where $c\in k$, $u_{i,j}\geq 0$ and $\sum_{j}{u_{i,j}}=\lambda_{i}$ for all $1\leq i\leq N$, and that a polynomial $p\in R_{d,N}$ is multihomogeneous of multidegree $\mdeg{p}$ if it is a finite sum of multihomogeneous monomials of multidegree $\mdeg{p}$. This is equivalent to say that, for each $1\leq i\leq N$, $p$ is homogeneous of degree $\lambda_i$ in the variables $x_{i,1} \dots x_{i,d^2}$. Note there is a direct sum decomposition
\begin{equation}\label{directsum}
R_{d,N}=\bigoplus_{\lambda \in {\NN}^{N}}{R_{d,N,\lambda}},
\end{equation} where $R_{d,N,\lambda}$ denotes the vector space of multihomogeneous polynomials of multidegree $\lambda$.

For $1\leq j\leq d^2$ denote by $f_{j}$ the polynomial in $R_{d,N}$ representing the map that sends the $N$-tuple $(A_1,\dots,A_N)\in \overline{k}^{Nd^2}$ to the $j$-th entry of $A_N\cdots A_1$. Also, for $1\leq \ell \leq d$ and $1\leq \alpha \leq \beta \leq N$, let $T^{\ell}_{\alpha,\beta} \in R_{d,N}$ be the polynomial that represents the map $(A_1,\dots,A_N)\mapsto \Tr{\Wedge^{\ell}(A_{\beta}\cdots A_{\alpha})}$.

It is not hard to see that $f_{j}$ are multihomogeneous of multidegree $(1,1,\dots,1,1)$ and that $T_{\alpha,\beta}^{\ell}$ are multihomogeneous of multidegree $(0,\dots,0,\ell,\dots,\ell,0,\dots,0)$, with the $\ell$'s in positions $\alpha,\alpha+1,\dots,\beta$.

Our purpose is to prove the following:
\begin{teo}\label{traduccion}
If $N\!=\!N(d)$ is given by Theorem \ref{nilpotentes}, there is some \hbox{$r\!\leq\!(Nd\!+\!1)^{Nd^2+2}$} such that for all $1\leq j\leq d^2$ there exist multihomogeneous polynomials $p^{\alpha,\beta}_{j,\ell} \in R_{d,N}$ of multidegree $r\mdeg{f_{j}}-\mdeg{T^{\ell}_{\alpha,\beta}}\in {\NN}^{N}$ such that
\begin{equation}\label{idpolinomial}
(f_{j})^{r}=\sum_{\alpha,\beta,\ell}{p^{\alpha,\beta}_{j,\ell}T^{\ell}_{\alpha,\beta}}.
\end{equation}
\end{teo}

The natural tool to prove this result is Hilbert's Nullstellensatz. If $I\subset k[y_1,\dots,y_m]$ is an ideal, let $Z(I)$ be its zero locus in ${\overline{k}}^m$. Also, for $Z\subset \overline{k}^m$, let $I(Z)\in k[y_1,\dots,y_m]$ be the ideal of polynomials $f$ that vanish on $Z$. The effective version of Nullstellensatz that we will use comes from applying Rabinowitsch's proof of Nullstellensatz by assuming weak Nullstellensatz (see \eg \cite[\S 1.7]{fulton}) and an effective version of weak Nullstellensatz \cite{som}):

\begin{teo}[Effective Nullstellensatz]\label{effnul} If $I=\subset k[y_1,\dots,y_m]$ is an ideal, then $I(Z(I))$ is equal to $\sqrt{I}$, the radical ideal of $I$. Moreover, if $g\in \sqrt{I}$ and $I$ is generated by polynomial $f_1,\dots,f_s$ satisfying $\max(\deg{f_1},\dots,\deg{f_s},\deg{g})=k$, then there is some $r\leq (k+1)^{m+2}$ and $p_1,\dots,p_s\in k[y_1,\dots,y_m]$ such that
\begin{equation*}
g^r=p_1f_1+p_2f_2+\dots+p_sf_s.
\end{equation*}
\end{teo}
\begin{proof}[Proof of Theorem \ref{traduccion}]
Let $I\subset R_{d,N}$ be the ideal generated by the polynomials $T_{\alpha,\beta}^{\ell}$ and let $W=Z(I)$.
Note that for a matrix $A$ of order $d\times d$, the non leading coefficients of its characteristic polynomial are precisely $(-1)^{\ell}\Tr{\Wedge^{\ell}(A)}$, with $1\leq \ell \leq d$. By this observation, the set $W$ is precisely the set of $N$-tuples $(A_1,\dots,A_N)\in \mathcal{N}_{d}^{N}(\overline{k})$. Hence, by our choice of $N$, Theorem \ref{nilpotentes} guarantees us that $f_{j}(P)=0$ for all $P\in W$. Then Nullstellensatz applies and $f_{j}\in I(Z(W))=\sqrt{I}$.

Since $\max(\deg{f_j},\deg{T_{\alpha,\beta}^{\ell}})=Nd$, by Theorem \ref{effnul} there is some $r\leq (Nd+1)^{Nd^2+2}$ and polynomials $p_{j,\ell}^{\alpha,\beta,\gamma}\in R_{d,N}$ satisfying \eqref{idpolinomial} for all $j$. Finally, by the direct sum decomposition \eqref{directsum} and by comparing multidegrees, we may assume that $p^{\alpha,\beta,\gamma}_{j,\ell}$ are multihomogeneous of multidegree $r\mdeg{f_{j}}-\mdeg{T^{\ell}_{\alpha,\beta,\gamma}}$.
\end{proof}

\section{Proof of Theorem \ref{desigualdad}}\label{pruebadesigualdad}

Theorem \ref{traduccion} is the fundamental relation that we will need to prove inequality \eqref{eqdesigualdad}. For the next we will assume that $k$ is a \textit{local field}. That is, a field together with an absolute value $|.|:k\rightarrow \RR^{+}$ that induces a non-discrete locally compact topology on~$k$ via the induced metric. Examples of these include $\RR,\CC$ with the standard absolute values and fields of $p$-adic numbers $\mathbb{Q}_{p}$ for a prime $p$. For more information about local fields, see \cite{lorentz}.

We will work on the finite dimensional vector space $k^d$, where $k$ is a local field with absolute value $|.|$. In this situation, we consider the norm on $M_{d}(k)$ given by $\|A\|_{0}=\max_{1\leq j\leq d^2}{|a_{j}|}$, where $a_j$ are the entries of $A$. Since the absolute value on~$k$ extends in a unique way to an absolute value on $\overline{k}$ (see Lang's Algebra \cite[XII.2, Prop.\,2.5]{langalg}), the spectral radius of a matrix $A\in M_{d}(k)$ is then defined in the usual way.
The \emph{height} $h(f)$ of a polynomial $f\in k[y_1,\dots,y_m]$ is defined as the logarithm of the maximum modulus of its coefficients.

We begin with a lemma.

\begin{lema}\label{cotahomo}If $f \in R_{d,N}$ is a multihomogeneous polynomial of multidegree $(\lambda_1,\dots,\lambda_{N})$ and height $h(f)\leq H$, then
\begin{equation*}
|f(A_1,\dots,A_N)|\leq e^H\prod_{i=1}^{N}{\binom{d^2-1+\lambda_i}{\lambda_i}}\|A_1\|_{0}^{\lambda_1}\cdots\|A_{N}\|_{0}^{\lambda_N}
\end{equation*}
for all $A_1,\dots,A_N\in M_{d}(k)$.
\end{lema}

\begin{proof}
If $f$ is a multihomogeneous monomial with $h(f)\!\leq\!H$, then
$f(X_1,\dots,X_N)=c\prod_{i=1}^{N}{\prod_{j=1}^{\lambda_{i}}{X_{i ,\ell_{i,j}}}}$, for some $1\leq\ell_{i,j} \leq d^2$ and $c\in k$ with $|c|\leq e^H$. So, given $A_1,\dots,A_N\in M_{d}(k)$,
\begin{equation*}
|f(A_1,\dots,A_N)|=|c|\prod_{i=1}^{N}{\prod_{j=1}^{\lambda_{i}}{|A_{i ,\ell_{i,j}}}|}\leq e^H\prod_{i=1}^{N}{\|A_i\|_{0}^{\lambda_{i}}}.
\end{equation*}
The lemma then follows by noting that a multihomogeneous polynomial of multidegree $(\lambda_1,\dots,\lambda_N)$ is sum of at most $\prod_{i=1}^{N}{\binom{d^2-1+\lambda_i}{\lambda_i}}$ multihomogeneous monomials of the same multidegree.
\end{proof}

\begin{proof}[Proof of Theorem \ref{desigualdad}]
Let $N=N(d)$ and $r>1$ be given by Theorems \ref{nilpotentes} and~\ref{traduccion} respectively, and consider first $n=N$ and the norm $\|.\|_{0}$. Let $A_1,\dots, A_N \in M_{d}(k)$. First, note that for $1\leq \alpha\leq \beta\leq N$ and $1\leq \ell\leq d$, $T_{\alpha,\beta}^{\ell}(A_1,\dots,A_N)$ is the $\ell$\nobreakdash-th symmetric polynomial evaluated at the eigenvalues of $A_{\beta}\cdots A_{\alpha}$. Hence we have $|T_{\alpha,\beta}^{\ell}(A_1,\dots,A_N)|\leq \binom{d}{\ell}\rho(A_{\beta}\cdots A_{\alpha})^{\ell}$. Also, as the polynomials $p^{\alpha,\beta}_{j,\ell}$ in the statement of Theorem \ref{traduccion} have multidegree $(r,\dots,r,r-\ell,\dots,r-\ell,r,\dots,r)$, by Lemma \ref{cotahomo} we have
\begin{multline*}
|p^{\alpha,\beta}_{j,\ell}(A_1,\dots,A_N)| \leq e^H{\binom{d^2-1+r}{r}}^{N-\beta+\alpha-1}{\binom{d^2-1+r-\ell}{r-\ell}}^{\beta-\alpha+1} \\
\times \biggl(\prod_{s=1}^{N}{\|A_s\|_{0}}\biggr)^{r}\biggl(\prod_{t=\alpha}^{\beta}{\|A_{t}\|_{0}}\biggr)^{-\ell}
\end{multline*}
for all $j,\alpha,\beta,\ell$.
Thus, from \eqref{idpolinomial} we obtain the following:
\begin{equation*}
\begin{split}
\|A_N\cdots A_1\|_{0}^{r} & = \max_{j}|f_{j}(A_1,\dots,A_N)|^{r} \\
& \leq \max_{j} \sum_{\alpha,\beta,\ell}|p_{j,\ell}^{\alpha,\beta}(A_1,\dots,A_N)||T_{\alpha,\beta}^{\ell}(A_1,\dots,A_N)| \\
& \leq C_{1}\biggl(\prod_{i=1}^{N}{\|A_i\|_{0}}\biggr)^{r}\max_{\alpha,\beta,\ell}{\biggl(\frac{\rho(A_{\beta}\cdots A_{\alpha})}{\prod_{t=\alpha}^{\beta}{\|A_{t}\|_{0}}}\biggr)^{\ell}},
\end{split}
\end{equation*}
for
\[
C_1=e^H\sum_{\alpha,\beta,\ell}{{\binom{d^2-1+r}{r}}^{{N-\beta+\alpha-1}}{\binom{d^2-1+r-\ell}{r-\ell}}^{{\beta-\alpha+1}}\binom{d}{\ell}}.
\]

Now, let
\[
\Lambda=\max_{\alpha,\beta}{\Bigl(\frac{\rho(A_{\beta}\cdots A_{\alpha})}{\prod_{t=\alpha}^{\beta}{\|A_{t}\|_{0}}}\Bigr)}.
\]
An easy computation shows that $\|AB\|_{0}\leq d\|A\|_{0}\|B\|_{0}$ for all $A,B\in M_{d}(k)$. Moreover, by the Gelfand's formula $\rho(A)=\lim_{n\to \infty}{{\|A^n\|_0}^{1/n}}$ we obtain $\rho(A)\leq d\|A\|_{0}$ for all $A\in M_{d}(k)$. These facts together imply that $\Lambda\leq d^{N+1}$, and hence \hbox{$\Lambda^{d}\leq d^{(N+1)(d-1)}\Lambda$}. Also, depending on whether $\Lambda$ is greater than $1$ or not, we have $\Lambda^{\ell}\leq \max(\Lambda,\Lambda^{d})\leq d^{(N+1)(d-1)}\Lambda$ for all $1\leq \ell \leq d$. Thus we conclude
\begin{equation*}
\|A_N\cdots A_1\|_{0}^{r} \leq d^{(N+1)(d-1)}C_1\biggl(\prod_{i=1}^{N}{\|A_i\|_{0}}\biggr)^{r}\cdot\Lambda.
\end{equation*}
Applying $r$-th root to the last inequality, we obtain \eqref{eqdesigualdad} with
\[
C=C(\|.\|_0):={C_1}^{1/r}d^{(N+1)(d-1)/r}.
\]

Now, consider an arbitrary submultiplicative norm $\|.\|$ on $M_d(k)$. Since in a finite dimensional vector space over a local field all norms are equivalent \cite[XII.2, Prop.\,2.2]{langalg}, there is some $D\geq 1$ such that $D^{-1}\|A\| \leq \|A\|_0\leq D\|A\|$ for all $A\in M_d(k)$. This implies
\begin{equation*}
\begin{split}
\|A_N\cdots A_1\| & \leq D\|A_N\cdots A_1\|_{0} \\
& \leq DC \biggl(\prod_{1\leq i\leq N}{\|A_i\|_0}\biggr)\max_{1\leq \alpha\leq \beta\leq N}{ \Bigl( \frac{\rho(A_{\beta}\cdots A_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|A_i\|_0}} \Bigr)^{1/r}} \\
& \leq D^{N+1}C\biggl(\prod_{1\leq i\leq N}{\|A_i\|}\biggr)\max_{1\leq \alpha\leq \beta\leq N}{ \Bigl( \frac{\rho(A_{\beta}\cdots A_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|A_i\|}} \Bigr)^{1/r}} \\
\end{split}
\end{equation*}
and proves the statement for $n=N$. For a general $n\geq N$ the result follows by applying \eqref{eqdesigualdad} to the sequence $A_1,\dots,A_{N-1},A_NA_{N+1}\cdots A_n$, and then using the submultiplicativity of $\|.\|$.
\end{proof}
\subsection{The case of the complex numbers}\label{casoc} When the base field is $k=\CC$ we can say a little more. Recall that for a norm $\|.\|$ on $\CC^{d}$, the \textit{operator norm} on $M_{d}(\CC)$ (also denoted by $\|.\|$) is defined by $\|A\|=\sup_{v\in \CC^{d}\backslash \{ 0\}}{\sfrac{\|Av\|}{\|v\|}}$.
\begin{prop}\label{independ} For $d\in \NN$ and $N(d)$ given by Theorem \ref{desigualdad}, there is a constant $C=C(d)>1$ such that if $n\geq N$, the inequality \eqref{eqdesigualdad} holds for all operator norms $\|.\|$ on $M_{d}(\CC)$ and $A_1,\dots,A_n\in M_{d}(\CC)$.
\end{prop}
We will need the following lemma which is a consequence of John's ellipsoid theorem \cite[Th.\,10.12.2]{schr} (see also \cite[Lem.\,3.2]{bociineq}):
\begin{lema}\label{lemadeljairo}
For all $d\in \NN$ and for every two operator norms $\|.\|$ and $\|.\|_{1}$ on $M_{d}(\CC)$ there exists some $S\in\mathrm{GL}_{d}(\CC)$ such that for every $A \in M_{d}(\CC)$:
\begin{equation*}\label{kk}
d^{-1}\|A\|\leq\|SAS^{-1}\|_{1}\leq d\|A\|.
\end{equation*}
\end{lema}
\begin{proof}[Proof of Proposition \ref{independ}]
Since operator norms are submultiplicative, we may assume that $n=N$. Fix the $\ell^1$-operator norm $\|A\|_{1}=\max_{j}{\sum_{i=1}^{d}|a_{ij}|}$ on $M_{d}(\CC)$, where $a_{ij}$ are the entries of $A$. Since $\|A\|_1 \leq \|A\|_0 \leq d\|A\|_1$ for all $A$, by the proof of Theorem \ref{desigualdad} we have $C(\|.\|_1)=d^{N+1}C(\|.\|_0)$ with $C(\|.\|_0)$ as in the end of the proof of Theorem \ref{desigualdad}. If $\|.\|$ is an arbitrary operator norm on $M_{d}(\CC)$, let $S\in \mathrm{GL}_{d}(\CC)$ be relating $\|.\|$ and $\|.\|_{1}$ as in Lemma \ref{lemadeljairo}.

Given $A_{1},\dots,A_{N}\in M_{d}(\CC)$ let $B_{i}=SA_{i}S^{-1}$ for all $i$. We have
\begin{equation*}
\begin{split}
\|A_N\cdots A_1\| & \leq d\|B_N\cdots B_1\|_{1} \\
& \leq d^{N+2}C(\|.\|_0) \biggl(\prod_{1\leq i\leq N}{\|B_i\|_1}\biggr)\max_{1\leq \alpha\leq \beta\leq N}{ \Bigl( \frac{\rho(B_{\beta}\cdots B_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|B_i\|_1}} \Bigr)^{1/r}} \\
& \leq d^{2N+2}C(\|.\|_0)\biggl(\prod_{1\leq i\leq N}{\|A_i\|}\biggr)\max_{1\leq \alpha\leq \beta\leq N}{ \Bigl( \frac{{d}^{\beta-\alpha+1}\rho(A_{\beta}\cdots A_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|A_i\|}} \Bigr)^{1/r}} \\
& \leq d^{3N+2}C(\|.\|_0)\biggl(\prod_{1\leq i\leq N}{\|A_i\|}\biggr)\max_{1\leq \alpha\leq \beta\leq N}{ \Bigl( \frac{(\rho(A_{\beta}\cdots A_{\alpha}) }{ \prod_{\alpha\leq i\leq \beta}{\|A_i\|}} \Bigr)^{1/r}}.
\end{split}
\end{equation*}
It is clear that $C(d):=d^{3N+2}C(\|.\|_0)$ does not depend on $\|.\|$.
\end{proof}
Proposition \ref{independ} allows us to conclude the following inequality:
\begin{teo}\label{detodos} Given $d\in \NN$, let $C(d)$ be as in Proposition \ref{independ}. Then the following inequality is valid for all bounded sets $\mathcal{M}\subset M_{d}(\mathbb{C})$:
\begin{equation*}
\mathfrak{R}(\mathcal{M})\leq C(d)\max_{1\leq j\leq N(d)}{\left(\sup\corchete{\rho(A_{1}\cdots A_{j}) : A_{i}\in \mathcal{M}}\right)^{1/j}}.
\end{equation*}
\end{teo}
This inequality was first proved by Bochi in \cite{bociineq} (without giving and effective bound on $N(d)$), and it has Theorem \ref{bergerwangantiguo} as an immediate consequence. In \cite[Lem.\,2.1]{bro}, Breuillard gave another proof of this inequality valid for arbitrary local fields: in the Archimedean case the same conclusion of Theorem \ref{detodos} holds with $N(d)=d^2$, while for a non Archimedean field $k$ and for every bounded set $\mathcal{M}\subset M_d(k)$ we have the identity
\begin{equation*}
\inf_{S\in \mathrm{GL}_d(k)}{\|S\mathcal{M}S^{-1}\|_0}=\max_{1\leq j\leq d^2}{\left(\sup\corchete{\rho(A_{1}\cdots A_{j}) : A_{i}\in \mathcal{M}}\right)^{1/j}}.
\end{equation*}
Breuillard used this result to study semigroups of invertible matrices.
\begin{proof}[Proof of Theorem \ref{detodos}]
For $1\leq j\leq N(d)$, define $\rho_{j}=\sup\corchete{\rho(A_{1}\cdots A_{j}) : A_{i}\in \mathcal{M}}$. For an arbitrary operator norm $\|.\|$ on $M_{d}(\CC)$, take supremum for $A_{i}\in \mathcal{M}$ in both sides of \eqref{eqdesigualdad}. We obtain
\begin{alignat}{2}
\mathfrak{R}(\mathcal{M})^{N} & \leq\sup_{A_{i}\in \mathcal{M}}{\|A_{N}\cdots A_{1}\|} \notag\\
& \leq C(d) \max_{1\leq j\leq N}\Bigl(\sup_{A\in \mathcal{M}}{\|A\|}^{N-j/r}\cdot (\rho_{j})^{1/r}\Bigr). &\quad \label{keke}
\end{alignat}
Now, recall that $\mathfrak{R}(\mathcal{M})=\inf_{\|.\|}{\sup_{A\in \mathcal{M}}{\|A\|}}$, where the infimum is taken over all operator norms on $M_{d}(\CC)$ (for a proof, see \cite{rota}), and let $\|.\|_{n}$ be a sequence of operator norms on $M_{d}(\CC)$ such that $\sup_{A\in \mathcal{M}}{\|A\|_{n}}\to \mathfrak{R}(\mathcal{M})$. Taking a subsequence, we may assume that for all $\|.\|_{n}$, the maximum in the right hand side of \eqref{keke} is achieved by the same index $j\in \{1,\dots, N \}$. Then, taking limit as $n$ tends to infinity in \eqref{keke} we will have
\begin{equation}\label{kiki}
\mathfrak{R}(\mathcal{M})^{N}\leq C(d)(\rho_{j})^{1/r}\cdot\mathfrak{R}(\mathcal{M})^{N-j/r }
\end{equation}
(here is where we use Proposition \ref{independ} since $C(d)$ does not depend on $n$). If $\mathfrak{R}(\mathcal{M})=0$ the conclusion is obvious. Otherwise, dividing by $\mathfrak{R}(\mathcal{M})^{N-j/r}$ and taking $j/r$-th root in \eqref{kiki} we obtain the desired inequality.
\end{proof}

\begin{obs}\label{effective} In the proof of Theorem \ref{desigualdad} the constant $C(\|.\|_0)$ depends on $H$, the maximum on the heights of the polynomials $p_{j,\ell}^{\alpha,\beta}$. In the case of the complex numbers we can give an effective upper bound on $H$ by means of the effective arithmetic Nullstellensatz \cite[Th.\,1]{klpasom}. Applied to our case, we obtain $r\leq 4(Nd^2+1)(dN)^{Nd^2+1}$ and
\begin{equation*}
H\!\leq\!\log{2}(Nd^2+(N(d^2+1))r)+r(Nd^2+2)(\log(d\tbinom{N+1}{2}+1)+(Nd^2+8)\log(Nd^2+2)dN).
\end{equation*}
\end{obs}
Hence
\begin{equation*}
\begin{split}
C(d)& =d^{3N+2}C(\|.\|_0) \\[-5pt]
& =e^{H/r}d^{3N+2+(N+1)(d-1)/r}\biggl( \sum_{\alpha,\beta,\ell}{{\tbinom{d^2-1+r}{r}}^{{N-\beta+\alpha-1}}{\tbinom{d^2-1+r-\ell}{r-\ell}}^{{\beta-\alpha+1}}\tbinom{d}{\ell}}\biggr)^{1/r}.
\end{split}
\end{equation*}

\section{Ergodic-theoretical consequences}\label{seccioncinco}
For the proof of Theorem \ref{bergerwangnuevo}, we will need the following result which may be seen as a quantitative version of Poincaré's Recurrence theorem for measure preserving transformations. It is a consequence of Birkhoff Ergodic Theorem, and the fact that for a measurable set $U$ of positive measure, for almost all points $x$ in $U$, the frequency of points of the sequence $x,Tx,T^{2}x,\dots$ that belong to $U$ is positive (compare with the subbaditive ergodic theorem of Karlsson-Gouëzel \cite[Th.\,1.1]{goukar}). For a detailed proof, see \cite[Lem.\,3.12]{bochilya}.
\begin{lema}\label{superpoincare}
Let $T:X\rightarrow X$ be a measure preserving map over the probability space $(X,\mathcal{F},\mu)$, and let $U\in \mathcal{F}$ have positive measure. Given $\gamma>0$, there exists a measurable map $N_0:U\rightarrow \NN$ such that, for $\mu$-a.e. $x\in U$ and for every $n\geq N_{0}(x)$ and $t\in [0,1]$ there is some $\ell \in \corchete{1,\dots,n}$ with $T^{\ell}(x)\in U$ and $|(\ell/n)-t|<\gamma$.
\end{lema}
\begin{proof}[Proof of Theorem \ref{bergerwangnuevo}]
Fix an operator norm $\|.\|$ on $M_{d}(k)$, and let
\[
Y=\{x\in X : \lambda(x)\in \RR\}.
\]
This is a measurable $T$-invariant set, and since $\rho(A)\leq \|A\|$ for all $A\in M_{d}(k)$, we~have that both sides of\eqref{bww} equal $-\infty$ for $\mu$-almost all $x\in X\backslash Y$. So we only have to check the result $\mu$-a.e. in $Y$.

Assume the contrary. That is, assume the existence of some $\epsilon>0, K\in \NN$ and a measurable set $U\subset Y$ of positive measure such that, for all $x\in U$, if $n\geq K$, then $\log{\rho(\ccl{A}{n}{x})}/n+\epsilon \leq \lambda(x)$.
By Egorov's theorem, and restricting to a smaller subset if necessary, we may assume that on $U$, $\log{\|\ccl{A}{n}{x}\|}/n$ converges uniformly to $\lambda(x)$.

Let $N,r$ and $C$ be as in the statement of Theorem \ref{desigualdad} and let $\epsilon'=\epsilon/(2+6Nr)$. By~the uniform convergence assumption, there is some $M\geq 1$ such that, $ n\geq M$ implies
\begin{equation}\label{necesaria1}
|\log{\|\ccl{A}{n}{x}\|}-n\lambda(x)|<n\epsilon' \text{ for all }x\in U.
\end{equation}
Take $x\in U$ and $N_0(x)\in \NN$ such that Lemma \ref{superpoincare} holds with $\gamma=1/3N$, and let $n\geq \max(3NM,3NK,3Nr\log{C}/\epsilon',N_0(x))$. Let $m_0=0$, and given $1\leq i\leq N$ let $m_i$ be such that $1\leq m_i \leq n$ and
\begin{equation}\label{fracrecu}
\left|\frac{m_i}{n}-\frac{i}{N}\right|<\frac{1}{3N}
\end{equation}
and $T^{m_i}x\in U$. We have
\[
m_{i}-m_{i-1}>(in/N-n/3N)-((i-1)/N+n/3N)=n/3N\geq \max(M,K,r\log{C}/\epsilon')
\]
for all $1\leq i\leq N$.

Now apply Theorem \ref{desigualdad} to $A_{i}=\ccl{A}{m_i-m_{i-1}}{T^{m_{i-1}}x}$. By the cocycle relation, we obtain $A_{N}\cdots A_{1}=\ccl{A}{m_N}{x}$, and hence
\begin{multline}\label{necesaria2}
\log{\|\ccl{A}{m_N}{x}\|} \leq \log{C}+\sum_{i=1}^{N}{\log{\|\ccl{A}{m_i-m_{i-1}}{T^{m_{i-1}}x}\|}} \\[-5pt]
+ \frac{1}{r}\biggl(\log{\rho(\ccl{A}{m_{\beta}-m_{\alpha-1}}{T^{m_{\alpha-1}}x})}-\sum_{i=\alpha}^{\beta}{\log{\|\ccl{A}{m_i-m_{i-1}}{T^{m_{i-1}}x}\|}}\biggr)
\end{multline}
for some $1\leq \alpha\leq \beta\leq N$. But, by definition, $T^{m_i}x\!\in\!U$ for all $i$, and as \hbox{$m_i-m_{i-1}\!\geq\!M$}, \eqref{necesaria1} applies. Combining it with \eqref{necesaria2} we have
\begin{equation*}
\begin{split}
\log\rho(\ccl{A}m_{\beta}-m_{\alpha-1}T&^{m_{\alpha-1}}x) \geq
\sum_{i=\alpha}^{\beta}{\log{\|\ccl{A}{m_i-m_{i-1}}{T^{m_{i-1}}x}\|}} \\[-5pt]
& +r\biggl( \log{\|\ccl{A}{m_N}{x}\|}-\sum_{i=1}^{N}{\log{\|\ccl{A}{m_i-m_{i-1}}{T^{m_{i-1}}x}\|}} -\log{C} \biggr)\\
& > (m_{\beta}-m_{\alpha-1})(\lambda(x)-\epsilon')-r(\log{C}+2\epsilon'm_N)\\
& = (m_{\beta}-m_{\alpha-1})\lambda(x)-( \epsilon'((m_{\beta}-m_{\alpha-1})+2rm_N))+r\log{C}).
\end{split}
\end{equation*}
On the other hand, by \eqref{fracrecu} we have
\begin{equation*}
\frac{m_N}{m_{\beta}-m_{\alpha-1}}<\frac{n}{\sfrac{n(\beta-\alpha+1)}{N}-\sfrac{2n}{3N}}\leq 3N.
\end{equation*}
But, since $T^{m_{\alpha-1}}x\in U$, and $(m_{\beta}-m_{\alpha-1})\geq \max(K,r\log{C}/\epsilon')$ we conclude
\begin{equation*}
\begin{split}
\frac{\epsilon'((m_{\beta}-m_{\alpha-1})+2r(m_N))+r\log{C} }{m_{\beta}-m_{\alpha-1}} & = \epsilon'+\frac{\epsilon'2r(m_N)}{(m_{\beta}-m_{\alpha-1})}+\frac{r\log{C}}{(m_{\beta}-m_{\alpha-1})} \\
& \leq \epsilon'+\epsilon'6Nr+\frac{r\log{C}}{(m_{\alpha}-m_{\alpha-1})}\\
& \leq (2+6Nr)\epsilon'=\epsilon.
\end{split}
\end{equation*}
This is the desired contradiction and the proof is complete.
\end{proof}

\section{Geometric remarks}\label{seccionseis}

We can observe that the main ingredients of the proof of Theorem \ref{bergerwangnuevo} are Theorem \ref{desigualdad} and Poincaré's recurrence Theorem. Therefore, if we have another situation where an analogue of inequality \eqref{eqdesigualdad} holds, then we should obtain a result similar to Theorem \ref{bergerwangnuevo}. This is the case of cocycles of isometries of Gromov hyperbolic spaces. For definition and further properties of Gromov hyperbolicity see \cite{bri,papa,geodyn}.

As it was proved in \cite[Th.\,1.2]{yo}, if $M$ is a Gromov hyperbolic space with distance~$d$, then there is a constant $C>0$ such that, for all $o\in M$ and $f,g$ isometries of $M$ we have
\begin{equation*}
d(fgo,o)\leq C+\max \Bigl(d(fo,o)+d^{\infty}(g),d^{\infty}(f)+d(go,o),\frac{d(fo,o)+d(go,o)+d^{\infty}(fg)}{2}\Bigr),
\end{equation*}
where $d^{\infty}(h)=\lim_{n\to \infty}\sfrac{d(h^{n}o,o)}{n}$ is the stable length.

In this context, given a probability space $(X,\mathcal{F},\mu)$ and a measure preserving map $T:X\rightarrow X$, a \textit{cocycle of isometries} of $M$ is a measurable map $A:X\rightarrow \Isom(M)$, where $\Isom(M)$ is the group of isometries of $M$, endowed with the Borel $\sigma-$algebra induced by the compact-open topology. We say that the cocycle $A$ is \textit{integrable} if the map $x\mapsto d(A(x)o,o)$ is integrable for some (and hence all) $o \in M$. In the same way as for linear cocycles, we define the family of maps $A^{n}:X\rightarrow \Isom(M)$. For references about cocycles of isometries, see \eg \cite{goukar,karmar}.

Following the same steps of the proof of Theorem \ref{bergerwangnuevo}, we can obtain the following:

\begin{prop}\label{bewagromov}Let $M$ be a Gromov hyperbolic space, $o\in M$, and let $T$ be a measure-preserving transformation of a probability space $(X,\mathcal{F},\mu)$. Also, let $A: X \rightarrow \Isom(M)$ be an integrable cocycle of isometries of $M$. Then for $\mu$-almost all $x\in X$ and we have the following limits exist in $\RR^{+}_{0}$ and are equal:\vspace*{-3pt}\enlargethispage{\baselineskip}%
\begin{equation*}
\limsup_{n\to \infty}{\frac{d^{\infty}(\ccl{A}{n}{x})}{n}}=\lim_{n \to \infty}{\frac{d(\ccl{A}{n}{x}o,o)}{n}}.
\end{equation*}
\end{prop}

A result similar to Proposition \ref{bewagromov} is far from being true if we do not assume a negative curvature condition on $M$.
\begin{ej}Let $X=\mathbb{S}^1$ and $\mu$ be the Lebesgue measure on $X$. If $T(z)=z^{2}$ is the doubling map on $X$, which preserves $\mu$, and $R_{a}(p)=p+a$ is the translation by $a\neq 0$ on $\RR^{2}$, define a cocycle $A:\mathbb{S}^1 \rightarrow \Isom(\mathbb{R}^{2})$ by $A(z)p=T(z)R_{a}(z^{-1}p)$ for all $p\in \RR^2$. Note that $\ccl{A}{n}{z}p=T^{n}(z)R^{n}_{a}(z^{-1}p)$ and hence the limit
$\lim_{n \to \infty}{\sfrac{d(\ccl{A}{n}{z}p,p)}{n}}$ exists and equals $|a|>0$ for all $z\in \mathbb{S}^1$ and $p\in \RR^2$. On the other hand, if $z$ is not a periodic point for $T$, then $\ccl{A}{n}{z}$ is not a translation and hence has a fixed point. Thus we have that $d^{\infty}(\ccl{A}{n}{z})=0$ for all $n\in \NN$ and all $z$ in the set of non periodic point of $T$, which is a full measure set with respect to $\mu$.
\end{ej}

\Changelback
\backmatter
\bibliographystyle{jepplain+eid}
\bibliography{oregon-reyes}
\end{document}

