%% if you are submitting an initial manuscript then you should have submission as an option here
%% if you are submitting a revised manuscript then you should have revision as an option here
%% otherwise options taken by the article class will be accepted
\documentclass[finalversion]{FPSAC2023}
\articlenumber{12}
%% but DO NOT pass any options (or change anything else anywhere) which alters page size / layout / font size etc

%% note that the class file already loads {amsmath, amsthm, amssymb}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%  Environments 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\newtheorem{theorem}{Theorem}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{conjecture}[theorem]{Conjecture}

\theoremstyle{definition}
\newtheorem{definition}[theorem]{Definition}

\newtheorem{example}{Example}
\renewcommand*{\theexample}{\Alph{example}}

\theoremstyle{remark}
\newtheorem{remark}[theorem]{Remark}

\numberwithin{equation}{section}


\usepackage{comment}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%  MACROS for this particular document
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\newcommand{\g}{\mathfrak{g}}


\newcommand{\B}{\mathcal{B}}
\newcommand{\I}{\mathcal{I}}
\newcommand{\W}{\mathcal{W}}
\newcommand{\D}{\mathfrak{D}}
\newcommand{\Z}{\mathbb{Z}}

\newcommand{\E}{\mathcal{E}}
\newcommand{\F}{\mathcal{F}}

\newcommand{\wt}{\mathrm{wt}}
\newcommand{\KD}{\mathrm{KD}}
\newcommand\Hom{\mathrm{Hom}}

\newcommand{\twt}{\tilde{\otimes}}

\usepackage{mathtools}
\DeclarePairedDelimiter{\ceiling}{\lceil}{\rceil}
\DeclarePairedDelimiter{\floor}{\lfloor}{\rfloor}

%%%%%%%%%%%%%%%%%%%%%%
% xy pic hackcenter and tikz
%%%%%%%%%%%%%%%%%%%%%%
\input xy
\usepackage[all]{xy}
\xyoption{line}
\xyoption{arrow}
\xyoption{color}
\SelectTips{cm}{}
%%

%%% tikz
\usepackage{tikz}
\usetikzlibrary{decorations.markings}
\usetikzlibrary{decorations.pathreplacing}
\newcommand{\hackcenter}[1]{
 \xy (0,0)*{#1}; \endxy}

\tikzstyle directed=[postaction={decorate,decoration={markings,
    mark=at position #1 with {\arrow{>}}}}]
\tikzstyle rdirected=[postaction={decorate,decoration={markings,
    mark=at position #1 with {\arrow{<}}}}]

\usetikzlibrary{calc}
\usepackage{relsize}

\tikzset{fontscale/.style = {font=\relsize{#1}}
    }
\newcommand{\bbullet}{
\begin{tikzpicture}
  \draw[fill=black] circle (0.55ex);
\end{tikzpicture}
}
%%%%%%%%%%%%%%%%%%%%%%
%%
%%%%%%%%%%%%%%%%%%%%%%

%%%%%%%%%%%%%%%%%%%%%%
% macreau for tableaux
%%%%%%%%%%%%%%%%%%%%%%
\newlength\cellsize \setlength\cellsize{10\unitlength}

\savebox2{%
\begin{picture}(10,10)
\put(0,0){\line(1,0){10}}
\put(0,0){\line(0,1){10}}
\put(10,0){\line(0,1){10}}
\put(0,10){\line(1,0){10}}
\end{picture}}

\newcommand\cellify[1]{\def\thearg{#1}\def\nothing{}%
\ifx\thearg\nothing\vrule width0pt height\cellsize depth0pt%
  \else\hbox to 0pt{\usebox2\hss}\fi%
  \vbox to 10\unitlength{\vss\hbox to 10\unitlength{\hss$#1$\hss}\vss}}

\newcommand\tableau[1]{\vtop{\let\\=\cr
\setlength\baselineskip{-10000pt}
\setlength\lineskiplimit{10000pt}
\setlength\lineskip{0pt}
\halign{&\cellify{##}\cr#1\crcr}}}

\savebox7{% CIRCLE
\begin{picture}(10,10)
  \put(5,5){\circle{9.4}}
\end{picture}}

\newcommand{\cirfy}[1]{\def\thearg{#1}\def\nothing{}%
\ifx\thearg\nothing\vrule width0pt height\cellsize depth0pt%
  \else\hbox to 0pt{\usebox7\hss}\fi%
  \vbox to 10\unitlength{\vss\hbox to 10\unitlength{\hss$#1$\hss}\vss}}

\newcommand\cirtab[1]{\vtop{\let\\=\cr
\setlength\baselineskip{-10000pt}
\setlength\lineskiplimit{10000pt}
\setlength\lineskip{0pt}
\halign{&\cirfy{##}\cr#1\crcr}}}




%% define your title in the usual way
\title[Extremal Crystals]{Extremal tensor products of Demazure crystals \\ are direct sums of Demazure crystals}

%% define your authors in the usual way
%% use \addressmark{1}, \addressmark{2} etc for the institutions, and use \thanks{} for contact details
%\author[Optional shorter names]{Longer names me\thanks{\href{mailto:hello@world.c}{hello@world.c}. Longer names me was partially supported by Grant 2017.11.14.$\partial$\;supp.}\addressmark{1}, \and you\addressmark{2}}

%% then use \addressmark to match authors to institutions here
%\address{\addressmark{1}Department of This, University of That, There \\ \addressmark{2}School of Something, University of Something Else, Somewhere}

\author{Sami Assaf\thanks{\href{mailto:shassaf@usc.edu}{shassaf@usc.edu} S.A. supported by Simons Award 953878.}\addressmark{1}, Anne Dranowski\thanks{\href{mailto:dranowsk@usc.edu}{dranowsk@usc.edu}}\addressmark{1}, \and Nicolle Gonz\'{a}lez\thanks{\href{mailto:nicolle@math.berkeley.edu}{nicolle@math.berkeley.edu}}\addressmark{2}}

\address{\addressmark{1}Department of Mathematics, University of Southern California, Los Angeles, USA   \\ \addressmark{2}Department of Mathematics,  University of California,  Berkeley, USA}




%% put the date of submission here
\received{\today}

%% leave this blank until submitting a revised version
%\revised{}

%% put your English abstract here, or comment this out if you don't have one yet
%% please don't use custom commands in your abstract / resume, as these will be displayed online
%% likewise for citations -- please don't use \cite, and instead write out your citation as something like (author year)
% \abstract{We give a necessary and sufficient for when tensor products of Demazure crystals decompose as sums of Demazure crystals. This new local criterion depends on the so called string property of extremal crystal, of which Demazure crystals are a proper subclass. In particular, this characterization relies an easily checked local property.}
\abstract{We give a new necessary and sufficient condition for when tensor products of Demazure crystals decompose as direct sums of Demazure crystals. Our local criterion depends on the string property which Demazure crystals, and more generally, extremal crystals, exhibit. Our characterization implies that tensor products of Demazure crystals are direct sums of Demazure crystals if and only if they are extremal.}

%% put your French abstract here, or comment this out if you don't have one
%\resume{\lipsum[2]}

%% put your keywords here, or comment this out if you don't have them yet
\keywords{Demazure crystals, extremal crystals, excellent filtrations, tensor products.}

%% you can include your bibliography however you want, but using an external .bib file is STRONGLY RECOMMENDED and will make the editor's life much easier
%% regardless of how you do it, please use numerical citations; i.e., [xx, yy] in the text

%% this sample uses biblatex, which (among other things) takes care of URLs in a more flexible way than bibtex
%% but you can use bibtex if you want
\usepackage[backend=bibtex]{biblatex}
\addbibresource{Extremal.bib}
%% note the \printbibliography command at the end of the file which goes with these biblatex commands

\begin{document}

\maketitle
%% note that you DO NOT have to put your abstract here -- it is generated by \maketitle and the \abstract and \resume commands above

\section{Introduction}


In his study of the representations of quantum groups $U_q(\g)$ for $\g$ a complex semisimple Lie algebra, Kashiwara \cite{Kas91}, based on work of Lusztig \cite{Lus90}, introduced \emph{crystal bases} upon which, in the $q \to 0$ limit, the action of the Chevalley operators could be easily described. The crystal bases form the vertices of a \emph{crystal graph}, a directed, colored graph with edges given by deformed Chevalley operators. The combinatorial structure of the crystal encodes the highest weight theory of the corresponding $U_q(\g)$-modules. Thus to any irreducible highest weight representation $V(\lambda)$, we associate the highest weight crystal $\B(\lambda)$ whose character agrees with the Weyl character of the module. 

Given the monoidal structure of the category of $U_q(\g)$-modules, Kashiwara defined a crystal structure on the set $\B_1 \otimes \B_2$ which aligns with the tensor product of the corresponding modules. In particular, the fact that $V(\lambda) \otimes V(\mu)$ admits a \emph{good filtration}, i.e.\ a filtration by Weyl modules, is reflected in the fact that $\B(\lambda) \otimes \B(\mu)$ decomposes as a direct sum of highest weight crystals. 

Demazure \cite{Dem74} considered a family of submodules generated by \emph{extremal weight elements} under the Borel subalgebra, known eponymously as \emph{Demazure modules}. The associated \emph{Demazure crystals}, introduced by Littelmann \cite{Lit95} and generalized by Kashiwara \cite{Kas93}, arise as truncations of the crystals for $U_q(\g)$-modules. As in the classical case, Demazure crystals encode the combinatorial structure of the corresponding Demazure modules. Hence, each Demazure module $V_w(\lambda)$ has an associated crystal $B_w(\lambda)$, indexed by a highest weight $\lambda$ and an element $w$ of the Weyl group $W$ of $\g$. 

Filtrations by Demazure modules are known as \emph{excellent filtrations}. Unlike with tensor products of Weyl modules, tensor products of Demazure modules do not always admit excellent filtrations \cite{vdK89}. Thus a natural question to consider is when can $V_w(\lambda) \otimes V_u(\nu)$ be filtered by Demazure modules.

In this paper we answer this question from a crystal theoretic perspective by considering a larger family of subcrystals, which we call \emph{extremal subsets}. Extremal subsets are characterized by the string property which states that every $i$-string of the crystal which intersects the subset is either entirely contained in the subset or intersects in only the top element. Kashiwara \cite{Kas93} showed every Demazure crystal is extremal, though the converse does not hold. We show that tensor products of Demazure crystals $\B_w(\lambda) \otimes \B_u(\nu)$ decompose as sums of Demazure crystals if and only if $\B_w(\lambda) \otimes \B_u(\nu)$ is extremal. By studying tensor products of extremal subcrystals, we give a local criterion for when tensor products of Demazure crystals are extremal, thus giving a local characterization of precisely when $\B_w(\lambda) \otimes \B_u(\nu)$ decomposes as a sum of Demazure crystals.

Our results generalize work of Lakshimbai, Littelmann, and Magyar \cite{LLM02} and Joseph \cite{Jos85} in which they prove $\{u_\lambda \}\otimes \B_u(\nu)$ decomposes as a direct sum of Demazure crystals. Our local criterion also provides an alternative characterization to Kouno's global condition \cite{Kou20} for when $\B_w(\lambda) \otimes \B_u(\nu)$ remains Demazure. For full details, see \cite{ADG}.


\section{Crystal graphs}

Let \(\g\) be a complex semisimple Lie algebra. In this section, we review normal $\g$-crystals. For a thorough treatment of crystals, see \cite{Kas94}.

\subsection{Highest weight crystals}
\label{subsec:crystals}

Let $P$ be the weight lattice of $\g$ and let $I$ be the vertex set of the Dynkin diagram. For every $i\in I$ we have a simple root $\alpha_i \in P$ and a simple coroot $\alpha^{\vee}_i\in P^\vee=\Hom_{\mathbb{Z}}(P,\mathbb{Z})$.
Given \(\lambda\in P \) and \(\mu^\vee\in P^\vee\) we write \(\langle \mu^\vee, \lambda\rangle\) for the integer obtained by the natural symmetric pairing on weights and coweights.
Write $W$ for the Weyl group generated by the set of of simple reflections $s_i$ associated to \(\alpha^\vee_i\in P^\vee\) and $P^+$ for the set of dominant weights $\{\lambda\in P : \langle \lambda, \alpha^\vee_i\rangle \in{\mathbb Z}_{\ge 0}\text{ for all }\alpha^\vee_i \in P^\vee\}$.
% For additional details we refer the reader to \cite{Kas94}.

\begin{definition} 
A (finite) normal \emph{$\g$-crystal} is a nonempty set $\B$, together with \emph{crystal operators} $e_i, f_i : \B \to \B \sqcup \{ 0\}$, a \emph{weight map} $\wt: \B \to P$, and \emph{string operators} $\varepsilon_i(b) := \max\left\{k \in \Z_{\geq 0}\mid e_i^k(b)\in \B\right\}$ and $\varphi_i(b) := \max\left\{k \in \Z_{\geq 0} \mid f_i^k(b)\in \B\right\}$, such that for every $i \in I$ and for every $b,b' \in \B$: 
\begin{enumerate}
\item[(1)]$b' = e_i(b)$ if and only if $b = f_i(b')$ in which case $\wt(b') = \wt(b) + \alpha_i$;
\item[(2)] $\varphi_i(b) - \varepsilon_i(b) = \langle \alpha^{\vee}_i , \wt(b) \rangle$.
\end{enumerate}
\end{definition} 

The finite-dimensional, irreducible, integrable representations of 
% the quantum group 
$U_q(\g)$ are naturally indexed by the integral dominant weights. For each $\lambda \in P^+$, let $\B(\lambda)$ denote the crystal for the irreducible highest weight representation $V(\lambda)$. %We refer to direct sums of irreducible highest weight crystals as highest weight crystals.

Given a highest weight crystal $\B$, the associated \emph{crystal graph} is the directed, $I$-colored graph with vertex set $\B$ and with an $i$-edge from $b$ to $f_i(b)$ provided the latter is nonzero.

A crystal is \emph{connected} if its underlying (undirected) graph is connected. Henceforth, we refer to (elements of) crystals and (vertices of) their graphs interchangeably.

\begin{example}
  The \emph{standard crystal} $\B(1,0^{n-1})$ for $\mathfrak{sl}_n(\mathbb C)$ has basis $\left\{ i \mid i=1,\ldots,n\right\}$, weight map $\wt\left(\, i\,\right) = (0^{i-1},1,0^{n-i-1})$, and lowering operators $f_j(i) =i+1$ if $j=i+1$ and $f_j (i) = 0$ otherwise.
  % raising (resp. lowering) operators $e_j$ (resp.\ $f_j$) that act by $e_j(i) = i-1$ (resp.\ $f_j(i) =i+1$) if $j=i+1$ (resp. $j=i$), and by $0$ otherwise. 
  We draw the crystal graph for $\B(1,0^{n-1})$ as shown in \cref{fig:standard}.
\end{example}

\begin{figure}[ht]
  \begin{displaymath}
    \begin{tikzpicture}[xscale=1.5,yscale=1]
      \node at (0,0)   (a) {$1$};
      \node at (1,0)   (b) {$2$};
      \node at (2,0)   (c) {$3$};
      \node at (3,0)   (d) {$\cdots$};
      \node at (4,0)   (e) {$n$};
      \draw[thick,color=blue  ,->] (a) -- (b) node[midway,above] {$1$} ;
      \draw[thick,color=purple,->] (b) -- (c) node[midway,above] {$2$} ;
      \draw[thick,color=violet,->] (c) -- (d) node[midway,above] {$3$} ;
      \draw[thick,color=orange,->] (d) -- (e) node[midway,above] {$n-1$} ;
    \end{tikzpicture}
  \end{displaymath}
  \caption{\label{fig:standard}The $\mathfrak{sl}_n(\mathbb C)$-crystal $\B(1,0^{n-1})$.}
  % with edges given by the lowering operators $\{f_i\mid i=1,\dots,n-1\}$
\end{figure}
For any $i \in I$  and $X \subseteq \B$, let $\F_i(X) = \left\{ f_{i}^{m}(x) \; \vert \;   x \in X \text{ and } m\in \Z_{\geq 0} \right\}\setminus \{0\}.$
For $s_{i_1} \cdots s_{i_{\ell}}$ a reduced expression for $w \in W$, let $\F_w(X) = \F_{i_1}\cdots \F_{i_\ell}(X)$. When \(w = w_0\) is the longest element we write omit the subscript and write \(\F(X)\).

Joseph \cite{Jos03} proves that the set $\F_w(X)$ is independent of the choice of reduced expression for $w$ and so is well-defined.
%When $w_0 \in W$ is the longest word, we write $\F$ instead of $\F_{w_0}$. 
% Hence, $\F(X)$ is explicitly given by
% \[\F(X) = \{ f_{i_1}^{m_1}\dots f_{i_k}^{m_k} (x) \; \vert \;   k \in \Z_{\geq 0}, x \in X \text{ and }  i_j \in I, m_j \in \Z_{\geq 0} \text{ for all } 1\leq j \leq k \} \setminus \{0\}.\]
%\[\E(X) = \{ e_{i_1}^{m_1}\dots e_{i_k}^{m_k} (x) \; \vert \; k \in \Z_{\geq 0}, x \in X \text{ and }  i_j \in I, m_j \in \Z_{\geq 0} \text{ for all } 1\leq j \leq k \}.\]
The sets $\E_i(X)$, $\E_w(X)$ and \(\E(X)\) are similarly defined using raising operators.

An element $b \in \B$ is a \emph{highest weight element} if $\E_i(\{b\})=\{b\}$ for all $i$. Let $b_\lambda$ denote the highest weight element of the irreducible highest weight crystal $\B(\lambda)$.



\subsection{Demazure crystals}
\label{sec:excellent-crystals}

% For any Lie algebra $\g$, with corresponding Weyl group $W$, we 
The Weyl group $W$ is equipped with a partial order $\prec$ called \emph{Bruhat order} defined on any \(u,v\in W\) by $u\prec v$ if and only if there exists a reduced word for $v$ which contain a reduced word for $u$ as a subword. See \cite{BB05} for a reference on Bruhat order. % contains a subword which is reduced for

Demazure crystals are subsets $\B_w(\lambda) \subseteq \B(\lambda)$ depending on a choice of $w\in W$. They were introduced by Littelmann who showed for classical $\g$ that their characters are the characters of Demazure modules $V_w(\lambda)$ \cite{Dem74a,Jos85}. 

% More precisely, a Demazure crystal is the following subset. 

\begin{definition}[\cite{Kas93}] \label{def:Dem}
  For $\lambda\in P^+$ and $w\in W$, the \emph{Demazure crystal}  $\B_w(\lambda)$ is
  \begin{equation} \label{eq:Dem-definition}
    \B_w(\lambda) = \F_{w}( \{ b_\lambda \} ).
  \end{equation}
\end{definition}

Kashiwara \cite{Kas93} generalized Littelmann construction to arbitrary $\g$ and showed $\B_w(\lambda)$ satisfies the following properties.

\begin{enumerate}
\item[(1)] $\E \left( \B_w(\lambda) \right) \subset \B_w(\lambda)$;
% $e_i \left( \B_w(\lambda) \right) \subset \B_w(\lambda) \sqcup \{0\}$;
\item[(2)] if $s_i w \prec w$, then $\B_w(\lambda) = \{ f_{i}^{m} (b) \mid m \ge 0, b\in \B_{s_iw}(\lambda), e_i(b)=0\}\setminus\{0\}$; 
\item[(3)] for any $i$-string $S$, $S \cap \B_w(\lambda)$ is either $\varnothing$ or $S$ or $\{b\}$, where $b\in S$ and $e_i(b)=0$.
\end{enumerate}

For any $i \in I$, an \emph{$i$-string} is any connected subset of a crystal closed under both $\E_i$ and $\F_i$. 
% Thus, a non-empty $i$-string can be thought of as a subset $S \subset B(\lambda)$ for which $S =\F_i(\{b\})$ for some $b \in S$ satisfying $e_i(b)=0$.
Equivalently, an $i$-string is a subset of the form $\F_i(\{b\})$ where $e_i(b) =0$. 
% Also \F_i(\{b\})\cup \E_i(\{b\})
% 
% More generally, a
% An element $b \in \B$ is called \emph{highest weight} if $\E(\{b\})=\{b\}$. 
% The irreducible highest weight crystal with highest weight $\lambda \in P^+$ is a connected crystal $B$ with highest weight element $b_\lambda$ of weight $\lambda$ that is generated by $b_\lambda$ under the action of $\F$, that is, $B = \F(\{b\}).$ Thus, we denote by $B(\lambda)$ the highest weight crystal with highest weight $\lambda$ (up to isomorphism). 


Demazure crystals are nested according to Bruhat order \cite{Kas93}, i.e. $\B_v(\lambda) \subseteq \B_w(\lambda)$ whenever $v \prec w$. We tighten this result as follows.

Given $\lambda \in P^+$, let $W_\lambda$ be the stabilizer subgroup of $\lambda$ in $W$. The minimal (resp.\ maximal) length coset representatives of $wW_\lambda$ are denoted by $\floor{w}^\lambda$ (resp.\ $\ceiling{w}^\lambda$).
% the minimal and maximal length coset representatives of $wW_\lambda$, respectively. 
 
 \begin{proposition}\label{prop:minimal}
  Let $\lambda\in P^+$ and $v, w\in W$. Then $v \preceq \ceiling{w}^\lambda$ if and only if $\B_v(\lambda) \subseteq \B_w(\lambda)$. Moreover, $\B_v(\lambda) = \B_w(\lambda)$ only when $v \in wW_\lambda$. % or ceil v = ceil w or floor v = floor w 
\end{proposition}

\begin{example}
Consider $\B_{s_2}(2,2,0) \subset \B(2,2,0)$ in \cref{fig:Bruhat-ex}. Here $w = s_1$ and $\lambda = (2,2,0)$. Since $s_1 \in W_\lambda$, we have $\ceiling{w}^\lambda =  s_2 s_1\succ s_1$, and so $\B_{s_2s_1}(2,2,0) = \B_{s_2}(2,2,0)$. Likewise, since $\ceiling{w}^\lambda \prec s_1s_2s_1 $, we have $\B_{s_2s_1}(2,2,0) \subsetneqq \B_{s_1s_2s_1}(2,2,0) = \B_{s_1s_2}(2,2,0) = \B(2,2,0)$.
\end{example}

\subsection{Extremal crystals}

Following work of the extremal authors \cite{AG21}, we consider subsets satisfying property $(3)$. 

\begin{definition}
  A subset $X \subseteq \B(\lambda)$ is \emph{extremal} if $X$ is nonempty and for any $i$-string $S$ of $\B(\lambda)$, $S \cap X$ is either $\varnothing$ or $S$ or $\{b\}$ where $b\in S$ and $e_i(b)=0$.
  \label{def:extremal-crystal}
\end{definition}

Notice any subset of $\B(\lambda)$ satisfying Kashiwara's property $(3)$ necessarily satisfies property $(1)$ as well. In particular, if $X \subset \B(\lambda)$ is extremal, then $\E X \subset X$, and so $b_\lambda \in X$. 

As Kashiwara proves \cite{Kas93}, all Demazure crystals are extremal subsets. The converse, however, is false. Not all extremal subsets are Demazure crystals.

\begin{figure}[ht]
\center
\begin{tikzpicture}
\node (a) at (2,2){$\bullet$};
\node (b) at (1,1) {$\bullet$};
\node (c) at (0,0){$\bullet$};
\node (d) at (2,0){$\bullet$};
\node (e) at (1,-1){$\bullet$};
\node (f) at (2,-2){$\bullet$};
%%
\draw[very thick, red, ->] (a) to (b);
\draw[very thick, red, ->] (b) to (c);
\draw[very thick, red, ->] (d) to (e);
%%
\draw[very thick, blue, ->] (b) to (d);
\draw[very thick, blue, ->] (c) to (e);
\draw[very thick, blue, ->] (e) to (f);
\end{tikzpicture}
\qquad \qquad 
\begin{tikzpicture}
\node (a) at (2,2){$\bullet$};
\node (b) at (1,1){$\bullet$};
\node (c) at (0,0){$\bullet$};
\node (d) at (2,0){$\bullet$};
% \node (e) at (1,-1)[gray]{$\bullet$};
% \node (f) at (2,-2)[gray]{$\bullet$};
\node (e) at (1,-1){$\circ$};
\node (f) at (2,-2){$\circ$};
%%
\draw[very thick, red, ->] (a) to (b);
\draw[very thick, red, ->] (b) to (c);
\draw[very thick, red, ->,dotted] (d) to (e);
%%
\draw[very thick, blue, ->] (b) to (d);
\draw[very thick, blue, ->,dotted] (c) to (e);
\draw[very thick, blue, ->,dotted] (e) to (f);
\end{tikzpicture}
\qquad \qquad 
\begin{tikzpicture}
\node (a) at (2,2){$\bullet$};
\node (b) at (1,1){$\bullet$};
\node (c) at (0,0){$\bullet$};
% \node (d) at (2,0)[gray]{$\bullet$};
% \node (e) at (1,-1)[gray]{$\bullet$};
% \node (f) at (2,-2)[gray]{$\bullet$};
\node (d) at (2,0){$\circ$};
\node (e) at (1,-1){$\circ$};
\node (f) at (2,-2){$\circ$};
%%
\draw[very thick, red, ->] (a) to (b);
\draw[very thick, red, ->] (b) to (c);
\draw[very thick, red, ->,dotted] (d) to (e);
%%
\draw[very thick, blue, ->,dotted] (b) to (d);
\draw[very thick, blue, ->,dotted] (c) to (e);
\draw[very thick, blue, ->,dotted] (e) to (f);
\end{tikzpicture}
\caption{The $\mathfrak{sl}_3$-crystal $B(2,2,0)$ (left), an extremal subset (middle), and the Demazure crystal $B_{s_2}(2,2,0)$ (right) with $f_1$ and $f_2$ depicted by blue and red arrows, respectively.}\label{fig:Bruhat-ex}
\end{figure}


\begin{example}
Let $\g = \mathfrak{sl}_3$ and $\lambda = (2,2,0)$. Then $X = \{b_{\lambda}, f_2(b_{\lambda}), f_2^2(b_\lambda), f_1f_2(b_{\lambda})\}$ (seen in the middle of \cref{fig:Bruhat-ex}) is extremal, but not Demazure. In particular, $B_{s_2}(2,2,0) \subsetneqq X \subsetneqq B(2,2,0)$. Similarly, $Y = \{ b_{\lambda}, f_2(b_{\lambda}), f_2^2(b_{\lambda}), f_1f_2^2(b_{\lambda}), f_1^2f_2^2(b_{\lambda}) \}$ is also an extremal subset of $B(2,2,0)$ containing $B_{s_1}(2,2,0)$ that is not Demazure. 
\end{example}
   
\section{Tensor products of crystals}
   
\subsection{Kashiwara's tensor product rule}

Given $\g$-crystals $\B_1$ and $\B_2$, the \emph{direct sum} $\B_1 \oplus \B_2$ is their disjoint union with corresponding operators. Since any graph decomposes into the disjoint union of its connected components, every $\g$-crystal decomposes as a direct sum of highest weight crystals.

\begin{definition}
The \emph{tensor product} $\B_1 \otimes \B_2$ has vertex set $\{ b_1 \otimes b_2 \mid b_1\in\B_1 \mbox{ and } b_2\in\B_2 \}$, crystal operator $f_i$ defined by
\begin{align*}
  f_i(b_1 \otimes b_2) &= 
  \begin{cases}
    f_i(b_1) \otimes b_2 & \mbox{if } \varepsilon_i(b_2) < \varphi_i(b_1), \\
    b_1 \otimes f_i(b_2) & \mbox{if } \varepsilon_i(b_2) \geq \varphi_i(b_1),
  \end{cases}
  % e_i(b_1 \otimes b_2) &=
 % \begin{cases}
 %   e_i(b_1) \otimes b_2 & \mbox{if } \varepsilon_i(b_2) \le \varphi_i(b_1), \\
  %  b_1 \otimes e_i(b_2) & \mbox{if } \varepsilon_i(b_2) > \varphi_i(b_1);
% \end{cases}\\
\end{align*}
$e_i$ defined analogously, $\wt_i(b) = \langle \alpha^{\vee}_i , \wt(b) \rangle$,  $\wt(b_1 \otimes b_2)  = \wt(b_1) + \wt(b_2),$ and $\varepsilon_i(b_1 \otimes b_2)  = \max( \varepsilon_i(b_1), \varepsilon_i(b_2) - \wt_i(b_1) )$ and $\varphi_i(b_1 \otimes b_2)  = \max( \varphi_i(b_2), \varphi_i(b_1) + \wt_i(b_2) )$.
\end{definition}

%Kashiwara \cite{Kas91} and later Henriquez and Kamnitzer \cite{HK04} showed this tensor product is noncommutative and gives $\mathfrak{g}$-crystals the structure of a coboundary category. In particular, Kashiwara \cite{Kas91} proves  $\B(\lambda) \otimes \B(\mu)$ is a crystal for $V(\lambda)\otimes V(\mu)$.

Kashiwara \cite{Kas91} proves this tensor product is associative and noncommutative and proves  $\B(\lambda) \otimes \B(\mu)$ is a crystal for $V(\lambda)\otimes V(\mu)$.

\begin{example}
Consider the tensor product $\B(1,1,0) \otimes \B(1,0,0)$, where 
\[ \B(1,1,0) = a_1\; {\color{red}\rightarrow} \; a_2 \; {\color{blue}\rightarrow} \;  a_3 \;
\hspace{1em} \mbox{and} \hspace{1em}
 \B(1,0,0) = b_1\; {\color{blue}\rightarrow} \; b_2 \; {\color{red}\rightarrow} \;  b_3 \; .\]
Then, $\varphi_2(a_1)=\varphi_1(a_2)=\varepsilon_1(b_2)=\varepsilon_2(b_3)=1$ and $\varphi_1(a_1)=\varphi_2(a_2) = \varepsilon_2(b_2) = \varepsilon_1(b_3) =0$. Thus, as seen in \cref{fig:NotDem},  $\B(1,1,0) \otimes\B(1,0,0)$ will decompose into two connected components with highest weights $(2,1,0)$ and $(1,1,1)$, respectively. Thus $\B(1,1,0) \otimes \B(1,0,0) \cong \B(2,1,0) \oplus \B(1,1,1)$, as expected from the decomposition of the tensor product of the corresponding modules. 

\end{example}

\subsection{Tensor products of Demazure crystals}

The tensor product $\B_w(\lambda)\otimes\B_u(\mu)$ is not always a direct sum of Demazure crystals.

\begin{example}
  Consider the $\mathfrak{sl}_3$-crystals $\B_{s_2}(1,1,0)$ and $\B_{s_1}(1,1,0)$. Their tensor product, show in the middle diagram of \cref{fig:NotDem}, is not a direct sum of Demazure crystals. In fact, it is not even extremal.
\end{example}

Kouno \cite{Kou20} characterized $w,u,\lambda,\mu$ such that $\B_w(\lambda)\otimes\B_u(\mu)$ is a direct sum of Demazure crystals.

Recall that for any $\lambda \in P^+$, we denote by $W_\lambda$ be the stabilizer subgroup of $\lambda$ in $W$ and by $\floor{w}^\lambda$ and $\ceiling{w}^\lambda$ the minimal and maximal length coset representatives of $w W_\lambda$, respectively.  For any $\sigma \in W$, let $W_\sigma \subseteq W$ denote the parabolic subgroup 
  \[W_\sigma = \langle \; s_i \in W \; | \; s_i \sigma \prec \sigma \; \rangle.\]
 
 
 \begin{theorem}[Kouno~\cite{Kou20}] 
  \label{thm:Kouno}
 Let $\lambda, \mu \in P^+$ and $u, w \in W$. Then $B_w(\lambda) \otimes B_u(\mu)$ is a direct sum of Demazure crystals if and only if $\floor{w}^\lambda \in W_{\ceiling{u}^\mu}$.
 \end{theorem}
 
% This theorem effectively characterizes when the tensor product of Demazure crystals decomposes as a direct sum of Demazure crystals. 
 
\begin{figure}[ht]
\center{
\begin{tikzpicture}
\node (a) at (0,0) {$\bullet$};
\node (b) at (0,1) {$\bullet$};
\node (c) at (0,2) {$\bullet$};
%
\node (d) at (1,0){$\bullet$};
\node (e) at (1,1) {$\bullet$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
\node (h) at (2,0){$\bullet$};
\node (i) at (2,1) {$\bullet$};
\node (j) at (2,2) {$\bullet$};
\node (k) at (2,3) {$\bullet$};
%
\node (l) at (3,0) {$\bullet$};
\node (m) at (3,1) {$\bullet$};
\node (n) at (3,2) {$\bullet$};
\node (o) at (3,3) {$\bullet$};
%
\draw[->, red, very thick] (c) to (b);
\draw[->, red, very thick] (f) to (e);
\draw[->, red, very thick] (j) to (i);
\draw[->, red, very thick] (i) to (m);
\draw[->, red, very thick] (h) to (l);
\draw[->, red, very thick] (k) to (o);
%
\draw[->, blue, very thick] (b) to (a);
\draw[->, blue, very thick] (e) to (d);
\draw[->, blue, very thick] (d) to (h);
\draw[->, blue, very thick] (f) to (j);
\draw[->, blue, very thick] (m) to (l);
\draw[->, blue, very thick] (g) to (k);
\end{tikzpicture}
\qquad  \qquad
\begin{tikzpicture}
%\node (a) at (0,0) [gray]{$\bullet$};
\node (a) at (0,0)  {$\circ$};
\node (b) at (0,1) {$\bullet$};
\node (c) at (0,2) {$\bullet$};
%
%\node (d) at (1,0) [gray]{$\bullet$};
\node (d) at (1,0)  {$\circ$};
\node (e) at (1,1) {$\bullet$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
%\node (h) at (2,0) [gray]{$\bullet$};
\node (h) at (2,0) {$\circ$};
\node (i) at (2,1) {$\bullet$};
\node (j) at (2,2) {$\bullet$};
\node (k) at (2,3) {$\bullet$};
%
% \node (l) at (3,0) [gray]{$\bullet$};
% \node (m) at (3,1) [gray]{$\bullet$};
% \node (n) at (3,2) [gray]{$\bullet$};
% \node (o) at (3,3) [gray]{$\bullet$};
\node (l) at (3,0) {$\circ$};
\node (m) at (3,1) {$\circ$};
\node (n) at (3,2) {$\circ$};
\node (o) at (3,3) {$\circ$};
%
\draw[->, red, very thick] (c) to (b);
\draw[->, red, very thick] (f) to (e);
\draw[->, red, very thick] (j) to (i);
\draw[->, red, very thick,dotted] (i) to (m);
\draw[->, red, very thick,dotted] (h) to (l);
\draw[->, red, very thick,dotted] (k) to (o);
%
\draw[->, blue, very thick,dotted] (b) to (a);
\draw[->, blue, very thick,dotted] (e) to (d);
\draw[->, blue, very thick,dotted] (d) to (h);
\draw[->, blue, very thick] (f) to (j);
\draw[->, blue, very thick,dotted] (m) to (l);
\draw[->, blue, very thick] (g) to (k);
\end{tikzpicture}
\qquad  \qquad
\begin{tikzpicture}
% \node (a) at (0,0) [gray]{$\bullet$};
\node (a) at (0,0) {$\circ$};
\node (b) at (0,1) {$\bullet$};
\node (c) at (0,2) {$\bullet$};
%
% \node (d) at (1,0) [gray]{$\bullet$};
\node (d) at (1,0) {$\circ$};
\node (e) at (1,1) {$\bullet$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
% \node (h) at (2,0) [gray]{$\bullet$};
\node (h) at (2,0) {$\circ$};
\node (i) at (2,1) {$\bullet$};
\node (j) at (2,2) {$\bullet$};
\node (k) at (2,3) {$\bullet$};
%
% \node (l) at (3,0) [gray]{$\bullet$};
\node (l) at (3,0) {$\circ$};
\node (m) at (3,1) {$\bullet$};
\node (n) at (3,2) {$\bullet$};
\node (o) at (3,3) {$\bullet$};
%
\draw[->, red, very thick] (c) to (b);
\draw[->, red, very thick] (f) to (e);
\draw[->, red, very thick] (j) to (i);
\draw[->, red, very thick] (i) to (m);
\draw[->, red, very thick,dotted] (h) to (l);
\draw[->, red, very thick] (k) to (o);
%
\draw[->, blue, very thick,dotted] (b) to (a);
\draw[->, blue, very thick,dotted] (e) to (d);
\draw[->, blue, very thick,dotted] (d) to (h);
\draw[->, blue, very thick] (f) to (j);
\draw[->, blue, very thick,dotted] (m) to (l);
\draw[->, blue, very thick] (g) to (k);
\end{tikzpicture}
}
\caption{The tensor products $B(1,1,0) \otimes B(1,0,0)$ (left), $B_{s_2}(1,1,0) \otimes B_{s_1}(1,0,0)$ (middle), and $B_{s_2}(1,1,0) \otimes B(1,0,0) = B_{s_2s_1}(2,1,0) \oplus B_e(1,1,1)$ (right) with $f_1$ and $f_2$ depicted by blue and red arrows, respectively.}\label{fig:NotDem}
\end{figure}
  
\begin{example}
  Consider $\lambda, \mu \in P^+$, and suppose $W$ has a longest element, which we denote by $w_0$. Then $\floor{w}^\lambda \in W = W_{w_0}$ for any $w \in W$, and so $B_w(\lambda) \otimes B(\mu)$ always decomposes into Demazure crystals; see \cref{fig:NotDem}. 
\end{example}
 
 \begin{example}
 Let $\mathfrak{g} = \mathfrak{sl}_3$, and consider $B_{s_2}(1,1,0) \otimes B_{s_1}(1,0,0)$. Then $W_{(1,0,0)} = \lbrace s_2, e\rbrace$, thus $\ceiling{s_1}^{(1,0,0)} = s_1s_2$ and so $W_{s_1s_2} = \lbrace s_1 \rbrace$. However, $W_{(1,1,0)} = \lbrace s_1,e \rbrace$ so that $\floor{s_2}^{(1,1,0)} = s_2 \notin W_{s_1s_2}$. As seen in \cref{fig:NotDem}, $B_{s_2}(1,1,0) \otimes B_{s_1}(1,1,0)$ is indeed not Demazure. 
 \end{example}

 Recall the tensor product of crystals is not commutative, though Kashiwara \cite{Kas93} showed $\B(\lambda) \otimes \B(\mu)$ is isomorphic to $\B(\mu) \otimes \B(\lambda)$. We remark this does \emph{not} hold for Demazure crystals; that is, $\B_w(\lambda) \otimes \B_u(\mu)$ is \emph{not} isomorphic to $\B_u(\mu) \otimes \B_w(\lambda)$ in general. Indeed, by Kouno's characterization $B_w(\lambda) \otimes \lbrace u_\mu \rbrace$ is a direct sum of Demazure crystals only when $w \in W_\mu$. However, Joseph \cite{Jos03} proved $\lbrace u_\mu \rbrace \otimes B_w(\lambda)$ always decomposes as a direct sum of Demazure crystals.

 \begin{example}
Take $\g =\mathfrak{sl}_3$, then $B_e(1,1,0) \otimes B_{s_2}(1,1,0) \cong B_e(2,2,0) \oplus B_e(2,1,1)$, as seen in \cref{fig:DemNotExtremal} (middle) , is a direct sum of Demazure crystals. However, $B_{s_2}(1,1,0) \otimes B_e(1,1,0)$ in \cref{fig:DemNotExtremal} (right) is not even extremal, let alone Demazure. 
\end{example}



\subsection{Tensor products of extremal crystals}
   
  Just as tensor products of Demazure crystals are not always Demazure, tensor products of extremal subsets are not always extremal. For instance, in the rightmost diagram of \cref{fig:DemNotExtremal}, we see that $B_{s_1}(1,1,0) \otimes B_e(1,1,0)$ is not extremal even though both factors are.

\begin{example}
Consider $X = \{ b_\lambda, f_2(b_\lambda), f_2^2(b_\lambda), f_1f_2(b_\lambda)\} \subset B_{(2,2,0)}$, an extremal though not Demazure subset. As seen in \cref{fig:NotExtremal}, $X \otimes X$ decomposes into connected components $Y_1 \oplus Y_2 \oplus Y_3 \subset B_{(4,4,0)} \oplus B_{(4,3,1)} \oplus B_{(4,2,2)}$ where neither $Y_1$ nor $Y_2$ are extremal subsets. 
\end{example}

However, if the resulting tensor product of two subsets of crystals is itself extremal, this imposes some structure on the underlying subsets themselves.

\begin{proposition}\label{prop:extreme}
  If $X \otimes Y \subset \B(\lambda) \otimes \B(\mu)$ is an extremal subset, then $\E (X) \subset X \sqcup \{0\}$. Furthermore, if $\E (Y) \subset Y \sqcup \{0\}$, then $X \subset \B(\lambda)$ is an extremal subset.
\end{proposition} 

\begin{example}
Let $\g=\mathfrak{sl}_3$, $\lambda=(4,4,0)$, and consider $X = \{b_\lambda\}$ and $Y=\{ b_\lambda, f_2(b_\lambda), f_2^2(b_\lambda)\}$ subsets of $B(4,4,0)$. Then $X \otimes Y \cong B_e(8,8,0) \oplus B_e(8,7,1) \oplus B_e(8,6,2)$ is a sum of Demazure subsets, though $Y$ is not extremal (but it is closed under $\mathcal{E}$). 
\end{example}

\begin{figure}[ht]
\begin{tikzpicture}[scale=.8]
\begin{scope}[shift={(-3.5,0)}]
\node (a) at (2,2){$\bullet$};
\node (b) at (1,1) {$\bullet$};
\node (c) at (0,0){$\bullet$};
\node (d) at (2,0){$\bullet$};
% \node (e) at (1,-1)[gray]{$\bullet$};
\node (e) at (1,-1){$\circ$};
% \node (f) at (2,-2)[gray]{$\bullet$};
\node (f) at (2,-2){$\circ$};
%%
\draw[thick, red, ->] (a) to (b);
\draw[thick, red, ->] (b) to (c);
\draw[thick, red, ->,dotted] (d) to (e);
%%
\draw[thick, blue, ->] (b) to (d);
\draw[thick, blue, ->,dotted] (c) to (e);
\draw[thick, blue, ->,dotted] (e) to (f);
%
\node at (2.7,0){$\otimes$};
\end{scope}
%%
\node (a) at (2,2){$\bullet$};
\node (b) at (1,1) {$\bullet$};
\node (c) at (0,0){$\bullet$};
\node (d) at (2,0){$\bullet$};
% \node (e) at (1,-1)[gray]{$\bullet$};
\node (e) at (1,-1){$\circ$};
% \node (f) at (2,-2)[gray]{$\bullet$};
\node (f) at (2,-2){$\circ$};
%%
\draw[thick, red, ->] (a) to (b);
\draw[thick, red, ->] (b) to (c);
\draw[thick, red, ->,dotted] (d) to (e);
%%
\draw[thick, blue, ->] (b) to (d);
\draw[thick, blue, ->,dotted] (c) to (e);
\draw[thick, blue, ->,dotted] (e) to (f);
%%
\node at (3.2,0){$\cong$};
\begin{scope}[shift={(4,-2)}]
\node (a) at (4,4){$\bullet$};
\node (b) at (3,3){$\bullet$};
\node (c) at (2,2){$\bullet$};
\node (d) at (1,1){$\bullet$};
\node (o) at (0,0){$\bullet$};
\node (e) at (4,2){$\bullet$};
% \node (f) at (3,1)[gray]{$\bullet$};
% \node (g) at (2,0)[gray]{$\bullet$};
% \node (h) at (1,-1)[gray]{$\bullet$};
\node (f) at (3,1){$\circ$};
\node (g) at (2,0){$\circ$};
\node (h) at (1,-1){$\circ$};
\node (x) at (3.75,.25){};
\node (y) at (2.75,-.75){};
\node (z) at (1.75,-1.75){};
%%
\draw[thick, red, ->] (a) to (b);
\draw[thick, red, ->] (b) to (c);
\draw[thick, red, ->] (c) to (d);
\draw[thick, red, ->] (d) to (o);
\draw[thick, red, ->,dotted] (e) to (f);
\draw[thick, red, ->,dotted] (f) to (g);
\draw[thick, red, ->,dotted] (g) to (h);
%%
\draw[thick, blue, ->] (b) to (e);
\draw[thick, blue, ->,dotted] (c) to (f);
\draw[thick, blue, ->,dotted] (d) to (g);
\draw[thick, blue, ->,dotted] (o) to (h);
\draw[thick, blue, -,dotted] (f) to (x);
\draw[thick, blue, -,dotted] (g) to (y);
\draw[thick, blue, -,dotted] (h) to (z);
%%
\node at (4.7,2){$\oplus$};
\end{scope}
\begin{scope}[shift={(8.5,-1)}]
\node (b) at (3,3){$\bullet$};
\node (c) at (2,2){$\bullet$};
\node (d) at (1,1){$\bullet$};
\node (e) at (4,2){$\bullet$};
\node (f) at (2.75,1.25){$\bullet$};
\node (g) at (1.75,.25){$\bullet$};
\node (h) at (3.25,1.25){$\bullet$};
% \node (i) at (2.25,.25) [gray]{$\bullet$};
\node (i) at (2.25,.25) {$\circ$};
%
% \node (x) at (3.5,.5)[gray]{$\bullet$};
% \node (y) at (2.5,-.5)[gray]{$\bullet$};
% \node (w) at (4,0)[gray]{}; % curious - 
% \node (u) at (3,-1)[gray]{}; % what is this for?
\node (x) at (3.5,.5){$\circ$};
\node (y) at (2.5,-.5){$\circ$};
%
\draw[thick, red, ->] (b) to (c);
\draw[thick, red, ->] (c) to (d);
\draw[thick, red, ->] (e) to (h);
\draw[thick, red, ->] (f) to (g);
\draw[thick, red, ->,dotted] (3.25,1.25) to (i);
%
\draw[thick, blue, ->] (b) to (e);
\draw[thick, blue, ->] (c) to (f);
\draw[thick, blue, ->] (d) to (g);
\draw[thick, blue, -,dotted](2.75,1.25) to (x);
\draw[thick, blue, -,dotted] (g) to (y);
\draw[thick, blue, -,dotted] (x) to (4,0);
\draw[thick, blue, -,dotted] (y) to (3,-1);
%%
\node at (4.7,1){$\oplus$};
\end{scope}
%
\begin{scope}[shift={(14,0)}]
\node (a) at (2,2){$\bullet$};
% \node (b) at (1,1)[gray] {$\bullet$};
% \node (c) at (0,0)[gray]{$\bullet$};
% \node (d) at (2,0)[gray]{$\bullet$};
% \node (e) at (1,-1)[gray]{$\bullet$};
% \node (f) at (2,-2)[gray]{$\bullet$};
\node (b) at (1,1){$\circ$};
\node (c) at (0,0){$\circ$};
\node (d) at (2,0){$\circ$};
\node (e) at (1,-1){$\circ$};
\node (f) at (2,-2){$\circ$};
%%
\draw[thick, blue, ->,dotted] (a) to (b);
\draw[thick, blue, ->,dotted] (b) to (c);
\draw[thick, blue, ->,dotted] (d) to (e);
%%
\draw[thick, red, ->,dotted] (b) to (d);
\draw[thick, red, ->,dotted] (c) to (e);
\draw[thick, red, ->,dotted] (e) to (f);
\end{scope}
\end{tikzpicture}
\caption{The summands of the extremal but not Demazure subgraph of $B_{(2,2,0)} \otimes B_{(2,2,0)}\cong B_{(4,4,0)} \oplus B_{(4,3,1)} \oplus B_{(4,2,2)}$ with $f_1$ and $f_2$ depicted by blue and red arrows. }\label{fig:NotExtremal}
\end{figure}

 
\section{Characterization of extremal tensor products}

Determining when the tensor product of extremal subsets remains extremal depends solely on the following elements. 

\begin{definition}
  For $i\in I$, an element $x \otimes y \in \B(\lambda)\otimes\B(\mu)$ is called an \emph{$i$-hinge} if $e_i(x \otimes y)$ and $f_i(x\otimes y)$ are both nonzero with $e_i(x \otimes y) = e_i(x) \otimes y$ and $f_i(x\otimes y) = x \otimes f_i(y)$.
\end{definition}

We say $x \otimes y \in X \otimes Y \subset \B(\lambda)\otimes\B(\mu)$ is a \emph{broken $i$-hinge} if $f_i(y) \not\in Y$.

\begin{example}
Consider $ B(1,1,0) = a_1\; {\color{red}\rightarrow} \; a_2 \; {\color{blue}\rightarrow} \;  a_3 $. Then the element $a_2 \otimes a_1 \in B(1,1,0)\otimes B(1,1,0)$ (seen in the leftmost diagram of \cref{fig:DemNotExtremal}) is a $2$-hinge since $\varepsilon_2(a_2)=1$ and $\varphi_2(a_2)=0$ but $\varepsilon_2(a_1) =0$ with $\varphi_2(a_1)=1$. In particular, the subset $B_{s_2}(1,1,0) \otimes B_e(1,1,0)$ (rightmost in \cref{fig:DemNotExtremal}) contains a broken 2-hinge since $ f_2(a_1) \not\in B_e(1,1,0)$. 
\end{example}

\begin{theorem}\label{thm:badguy}
  Let $X\subset \B(\lambda)$ and $Y\subset\B(\mu)$ be extremal subsets. Then $X \otimes Y$ is an extremal subset of $\B(\lambda) \otimes \B(\mu)$ if and only if $X\otimes Y$ contains no broken $i$-hinge for any $i \in I$.
\end{theorem}


In particular, if $X = \{b_\lambda \} \subset \B(\lambda)$ has only the highest weight element or if $Y = \B(\mu)$ contains all possible elements, then $X \otimes Y$ contains no $i$-hinges for any $i$. Thus both $\{b_\lambda\}\otimes\B_u(\mu)$ and $\B_w(\lambda) \otimes \B(\mu)$ are extremal subsets of $\B(\lambda) \otimes \B(\mu)$.


Recall every Demazure subset is extremal, though the converse is false.

Any subset $\B_w(\lambda) \otimes \B_u(\mu) \subset \B(\lambda) \otimes \B(\mu)$ which is a direct sum of Demazure crystals is also an extremal subset. Amazingly, the converse of this statement is also true. 

\begin{theorem}
  For $\lambda,\mu\in P^+$ and $w,u\in W$, we have $\B_w(\lambda) \otimes \B_u(\mu)$ is an extremal subset of $\B(\lambda) \otimes \B(\mu)$ if and only if $\floor{w}^\lambda \in W_{\ceiling{u}^\mu}$.
\end{theorem}

Combining this with \cref{thm:Kouno}, we derive the following result. 

\begin{corollary}\label{cor:extreme-demazure}
 For $\lambda,\mu\in P^+$ and $w,u\in W$, the tensor product $\B_v(\lambda) \otimes \B_w(\mu)$ is a direct sum of extremal subsets if and only if $\B_w(\lambda) \otimes \B_u(\mu)$ is a direct sum of Demazure crystals.
\end{corollary}

Thus, $\B_v(\lambda) \otimes \B_w(\mu)$ is a sum of Demazure crystals precisely when it doesn't contain a broken $i$-hinge for any $i \in I$. Hence \cref{cor:extreme-demazure} gives a local characterization of tensor products of Demazure crystals that does not rely on the values of $\lambda,\mu, w,u$.

\begin{example}
Take $\lambda=(1,1,0)$ and $w=e$ and $v=s_2$ as in \cref{fig:DemNotExtremal}. Then $\floor{w}^\lambda =e$ and $\ceiling{v}^\lambda = s_2s_1$, thus $\floor{w}^\lambda \in W_{\ceiling{v}^\lambda}$ so $B_e(1,1,0) \otimes B_{s_2}(1,1,0)$ is extremal. 
Conversely, $\floor{v}^\lambda = s_2$ and $\ceiling{w}^\lambda = s_1$ so $\floor{v}^\lambda \not\in W_{\ceiling{w}^\lambda}$ and thus $B_{s_2}(1,1,0)  \otimes B_e(1,1,0)$ is not extremal. 
\end{example}

It is important to note that \cref{cor:extreme-demazure} is false if we replace $\B_v(\lambda) $ and $ \B_w(\mu)$ with arbitrary extremal subsets. This can seen in \cref{fig:NotExtremal}, where $X=Y$ is extremal and non-Demazure but the tensor product is neither.    
    
\begin{figure}[ht]
\center{
\begin{tikzpicture}
\node (a) at (0,0) {$\bullet$};
\node (b) at (0,1) {$\bullet$};
\node (c) at (0,2) {$\bullet$};
%
\node (d) at (1,0){$\bullet$};
\node (e) at (1,1) {$\bullet$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
\node (h) at (2,0){$\bullet$};
\node (i) at (2,1) {$\bullet$};
\node (j) at (2,2) {$\bullet$};
\node (k) at (2,3) {$\bullet$};
%
\node (l) at (3,0) {$\bullet$};
\node (m) at (3,1) {$\bullet$};
\node (n) at (3,2) {$\bullet$};
\node (o) at (3,3) {$\bullet$};
%
\draw[->, red, very thick] (c) to (b);
\draw[->, red, very thick] (f) to (e);
\draw[->, red, very thick] (e) to (i);
\draw[->, red, very thick] (n) to (m);
\draw[->, red, very thick] (d) to (h);
\draw[->, red, very thick] (g) to (k);
%
\draw[->, blue, very thick] (b) to (a);
\draw[->, blue, very thick] (e) to (d);
\draw[->, blue, very thick] (i) to (h);
\draw[->, blue, very thick] (h) to (l);
\draw[->, blue, very thick] (j) to (n);
\draw[->, blue, very thick] (k) to (o);
\end{tikzpicture}
\qquad  \qquad
\begin{tikzpicture}
% \node (a) at (0,0)  [gray]{$\bullet$};
% \node (b) at (0,1)  [gray]{$\bullet$};
\node (a) at (0,0)  {$\circ$};
\node (b) at (0,1)  {$\circ$};
\node (c) at (0,2) {$\bullet$};
%
% \node (d) at (1,0)  [gray]{$\bullet$};
% \node (e) at (1,1) [gray]{$\bullet$};
\node (d) at (1,0)  {$\circ$};
\node (e) at (1,1) {$\circ$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
% \node (h) at (2,0) [gray]{$\bullet$};
% \node (i) at (2,1)    [gray]{$\bullet$};
\node (h) at (2,0) {$\circ$};
\node (i) at (2,1) {$\circ$};
\node (j) at (2,2) {$\bullet$};
\node (k) at (2,3) {$\bullet$};
%
% \node (l) at (3,0) [gray]{$\bullet$};
% \node (m) at (3,1) [gray]{$\bullet$};
% \node (n) at (3,2) [gray]{$\bullet$};
% \node (o) at (3,3) [gray]{$\bullet$};
\node (l) at (3,0) {$\circ$};
\node (m) at (3,1) {$\circ$};
\node (n) at (3,2) {$\circ$};
\node (o) at (3,3) {$\circ$};
%
\draw[->, red, very thick,dotted] (c) to (b);
\draw[->, red, very thick,dotted] (f) to (e);
\draw[->, red, very thick,dotted] (e) to (i);
\draw[->, red, very thick,dotted] (n) to (m);
\draw[->, red, very thick,dotted] (d) to (h);
\draw[->, red, very thick] (g) to (k);
%
\draw[->, blue, very thick,dotted] (b) to (a);
\draw[->, blue, very thick,dotted] (e) to (d);
\draw[->, blue, very thick,dotted] (i) to (h);
\draw[->, blue, very thick,dotted] (h) to (l);
\draw[->, blue, very thick,dotted] (j) to (n);
\draw[->, blue, very thick,dotted] (k) to (o);
\end{tikzpicture}
\qquad  \qquad
\begin{tikzpicture}
% \node (a) at (0,0) [gray]{$\bullet$};
\node (a) at (0,0) {$\circ$};
\node (b) at (0,1) {$\bullet$};
\node (c) at (0,2) {$\bullet$};
%
% \node (d) at (1,0) [gray]{$\bullet$};
\node (d) at (1,0) {$\circ$};
\node (e) at (1,1) {$\bullet$};
\node (f) at (1,2) {$\bullet$};
\node (g) at (1,3) {$\bullet$};
%
% \node (h) at (2,0) [gray]{$\bullet$};
% \node (i) at (2,1)  [gray] {$\bullet$};
% \node (j) at (2,2)  [gray]{$\bullet$};
% \node (k) at (2,3)  [gray]{$\bullet$};
\node (h) at (2,0) {$\circ$};
\node (i) at (2,1)  {$\circ$};
\node (j) at (2,2)  {$\circ$};
\node (k) at (2,3)  {$\circ$};
%
% \node (l) at (3,0) [gray]{$\bullet$};
% \node (m) at (3,1) [gray]{$\bullet$};
% \node (n) at (3,2) [gray]{$\bullet$};
% \node (o) at (3,3) [gray]{$\bullet$};
\node (l) at (3,0) {$\circ$};
\node (m) at (3,1) {$\circ$};
\node (n) at (3,2) {$\circ$};
\node (o) at (3,3) {$\circ$};
%
\draw[->, red, very thick] (c) to (b);
\draw[->, red, very thick] (f) to (e);
\draw[->, red, very thick,dotted] (e) to (i);
\draw[->, red, very thick,dotted] (n) to (m);
\draw[->, red, very thick,dotted] (d) to (h);
\draw[->, red, very thick,dotted] (g) to (k);
%
\draw[->, blue, very thick,dotted] (b) to (a);
\draw[->, blue, very thick,dotted] (e) to (d);
\draw[->, blue, very thick,dotted] (i) to (h);
\draw[->, blue, very thick,dotted] (h) to (l);
\draw[->, blue, very thick,dotted] (j) to (n);
\draw[->, blue, very thick,dotted] (k) to (o);
\end{tikzpicture}
}
\caption{The tensor products $B(1,1,0) \otimes B(1,1,0)$ (left), $B_{e}(1,1,0) \otimes B_{s_2}(1,1,0)$ (middle), and $B_{s_2}(1,1,0) \otimes B_{e}(1,1,0)$ (right) with $f_1$ and $f_2$ depicted by blue and red arrows.}\label{fig:DemNotExtremal}
\end{figure}

   
\section{Application to tensor squares}

Even when $\B_{w}(\lambda) \otimes \B_{u}(\mu)$ is not a direct sum of Demazure crystals, some connected components of it may be. For instance, in \cref{ex:tensor square} and \cref{fig:tensorsquare}, $B_{s_2s_1}(2,1,0)^{\otimes 2}$ decomposes into four connected components, two of which are Demazure and two of which are not even extremal. In particular, the component of weight $(4,2,0)$ is a Demazure crystal. Using \cref{cor:extreme-demazure}, we show that the highest weight component is always Demazure.

%That is, the connected component with highest weight $2\lambda$ of the tensor square $\B_{w}(\lambda) \otimes \B_{w}(\lambda)$ is always a Demazure crystal, even when $\B_{w}(\lambda) \otimes \B_{w}(\lambda)$ is not a direct sum of Demazure crystals. 
%
%For any $\lambda,\mu \in P^+$ and $w\in W$, Joseph proved that $B_{w}(\lambda+\mu)$ is isomorphic to the connected component $\F_w \left(b_{\lambda}\otimes b_{\mu}\right) \subset \B(\lambda) \otimes \B(\mu)$ \cite{Jos03}. Thus, using with Corollary~\ref{cor:extreme-demazure}, we can show that the connected component with highest weight $2\lambda$ in $B_{u}(\lambda) \otimes \B_{v}(\lambda)$ is always Demazure. 
%

\begin{theorem}\label{thm:square}
  For $\lambda \in P^+$ and $w\in W$, the $m$-fold tensor product
  \[ \F \left(\{b_{\lambda}\otimes \cdots \otimes b_{\lambda}\}\right) \cap \B_{w}(\lambda) \otimes \cdots \otimes \B_{w}(\lambda) \subset \B(\lambda) \otimes \cdots \otimes \B(\lambda) \]
  is isomorphic to $\B_{w}(m\lambda)$. In particular, it is a Demazure crystal.
\end{theorem}

\begin{example}
Let $\g = \mathfrak{sl}_3$ and consider $B(2,1,0) \otimes B(2,1,0) \cong B(4,2,0) \oplus B(3,3,0) \oplus B(4,1,1) \oplus B(3,2,1)^{\oplus 2} \oplus B(2,2,2)$. The subset $B_{s_2s_1}(2,1,0) \otimes B_{s_2s_1}(2,1,0)$ decomposes into four connected components; see \cref{fig:tensorsquare}. Only the components with highest weights $(4,2,0)$ and $(3,3,0)$ are Demazure. The components with highest weights $(3,2,1)$ and $(4,1,1)$ are not even extremal. The remaining two highest weights do not appear. \label{ex:tensor square}
\end{example}

\begin{figure}[ht]
\center{
\begin{tikzpicture}[scale=.9]
\begin{scope}[shift={(14,4)}, scale=1.2]
\begin{scope}[shift={(-8,0)}]
\node (a) at (-2,2) {$\bullet$};
\node (b) at (-3,1) {$\bullet$};
%
\node (d) at (-1,1) {$\bullet$};
\node (e) at (-2,0) {$\bullet$};
\node (f) at (-3,-1) {$\bullet$};
%%
%%
\draw [->, very thick, red] (a) to (b);
%
\draw [->, very thick, red] (d) to (e);
\draw [->, very thick, red] (e) to (f);
%
\draw [->, very thick, blue] (a) to (d);
\end{scope}
\node at (-8.25,1) {$\otimes$};
\begin{scope}[shift={(-4.5,0)}]
\node (a) at (-2,2) {$\bullet$};
\node (b) at (-3,1) {$\bullet$};
%
\node (d) at (-1,1) {$\bullet$};
\node (e) at (-2,0) {$\bullet$};
\node (f) at (-3,-1) {$\bullet$};
%%
%%
\draw [->, very thick, red] (a) to (b);
%
\draw [->, very thick, red] (d) to (e);
\draw [->, very thick, red] (e) to (f);
%
\draw [->, very thick, blue] (a) to (d);
%
\end{scope}
\end{scope}
%
\node at (-5,0) {$\cong$};
\node (a) at (-2,2) {$\bullet$};
\node (b) at (-3,1) {$\bullet$};
\node (c) at (-4,0) {$\bullet$};
%
\node (d) at (-1,1) {$\bullet$};
\node (e) at (-2,0) {$\bullet$};
\node (f) at (-3,-1) {$\bullet$};
\node (g) at (-4,-2) {$\bullet$};
%%
\node (h) at (0,0) {$\bullet$};
\node (i) at (-1,-1) {$\bullet$};
\node (j) at (-2,-2) {$\bullet$};
\node (k) at (-3,-3) {$\bullet$};
\node (l) at (-4,-4) {$\bullet$};
%%
\draw [->, very thick, red] (a) to (b);
\draw [->, very thick, red] (b) to (c);
%
\draw [->, very thick, red] (d) to (e);
\draw [->, very thick, red] (e) to (f);
\draw [->, very thick, red] (f) to (g);
%
\draw [->, very thick, red] (h) to (i);
\draw [->, very thick, red] (i) to (j);
\draw [->, very thick, red] (j) to (k);
\draw [->, very thick, red] (k) to (l);
%
\draw [->, very thick, blue] (a) to (d);
\draw [->, very thick, blue] (d) to (h);
\draw [->, very thick, blue] (e) to (i);
%
\node at (1,0) {$\oplus$};
%
\begin{scope}[shift={(5,0)}]
\node (d) at (-1,1) {$\bullet$};
\node (e) at (-2,0) {$\bullet$};
\node (f) at (-3,-1) {$\bullet$};
\node (g) at (-4,-2) {$\bullet$};
%%
%%
%
\draw [->, very thick, red] (d) to (e);
\draw [->, very thick, red] (e) to (f);
\draw [->, very thick, red] (f) to (g);
%
\end{scope}
%
\begin{scope}[shift={(7,4)}]
\node at (-2,-4) {$\oplus$};
%
\begin{scope}[shift={(-3,-6)}]
\node (b) at (3,3){$\bullet$};
\node (c) at (2,2){$\bullet$};
%\node (d) at (1,1){$\bullet$};
\node (e) at (4,2){$\bullet$};
\node (f) at (2.75,1.25){$\bullet$};
%\node (g) at (1.75,.25){$\bullet$};
\node (h) at (3.25,1.25){$\bullet$};
\node (i) at (2.25,.25) {$\bullet$};
%
%\node (x) at (3.5,.5)[gray]{$\bullet$};
%\node (y) at (2.5,-.5)[gray]{$\bullet$};
%\node (w) at (4,0)[gray]{};
% \node (u) at (3,-1)[gray]{};
\node (u) at (3,-1){};
%%
\draw[very thick, red, ->] (b) to (c);
%\draw[very thick, red, ->] (c) to (d);
\draw[very thick, red, ->] (e) to (h);
%\draw[very thick, red, ->] (f) to (g);
\draw[very thick, red, ->] (3.15,1.15) to (i);
%%
\draw[very thick, blue, ->] (b) to (e);
\draw[very thick, blue, ->] (c) to (f);
%\draw[very thick, blue, ->] (d) to (g);
\draw[very thick, blue, -,dotted](2.75,1.25) to (3.5,.5);
\draw[very thick, blue, -,dotted] (i) to (3,-.5);
%\draw[very thick, blue, -,dotted] (x) to (4,0);
%\draw[very thick, blue, -,dotted] (y) to (3,-1);
%%
\node at (5,2){$\oplus$};
\end{scope}
%%
\begin{scope}[shift={(6,-6)}]
\node (o) at (-3,3){$\bullet$};
%
\node (a) at (-2,2) {$\bullet$};
\node (b) at (-3,1) {$\bullet$};
%
\node (d) at (-1,1){};
\node (e) at (-2,0){};
%%
\draw [->, very thick, red] (a) to (b);
%
%
%
\draw [->, very thick, blue] (o) to (a);
\draw [-, very thick, blue,dotted] (a) to (d);
\draw [-, very thick, blue,dotted] (b) to (e);
\end{scope}
\end{scope}
\end{tikzpicture}}
\caption{The tensor product of $B_{s_2s_1}(2,1,0)\otimes B_{s_2s_1}(2,1,0)$ decomposed into connected components, some of which are Demazure and some of which are not extremal.}\label{fig:tensorsquare}
\end{figure}

%% if you use biblatex then this generates the bibliography
%% if you use some other method then remove this and do it your own way

\printbibliography



\end{document}

.