\documentclass[ALCO,published]{cedram} %PACKAGES \usepackage{amssymb, mathrsfs, verbatim} %\usepackage{fullpage} %\usepackage{eucal} \usepackage{array} %\usepackage{hyperref} \usepackage{tikz} \usetikzlibrary{arrows,backgrounds} \pgfdeclarelayer{bg} \pgfsetlayers{bg,main} \numberwithin{equation}{section} \begin{DefTralics} \newcommand{\arxiv}[1]{\href{http://arxiv.org/abs/#1}{{\tt arXiv:#1}}} \end{DefTralics} \newcommand{\arxiv}[1]{\href{http://arxiv.org/abs/#1}{{\tt arXiv:#1}}} %MACROS \newcommand{\st}{\bigm\vert} \newcommand{\fst}{\mvert} \renewcommand{\theenumi}{\roman{enumi}} \renewcommand{\labelenumi}{(\theenumi)} \renewcommand{\theenumii}{\alph{enumii}} \renewcommand{\labelenumii}{\theenumi.~\theenumii} \newcommand{\R}{\mathbb{R}} \newcommand{\C}{\mathbb{C}} \newcommand{\sC}{\mathscr{C}} \newcommand{\Z}{\mathbb{Z}} \newcommand{\N}{\mathbb{N}} %\newcommand{\Q}{\mathbb{Q}} \newcommand{\A}{\mathcal{A}} \newcommand{\B}{\mathcal{B}} \newcommand{\D}{\mathtt{Del}} \newcommand{\E}{\mathcal{E}} \newcommand{\F}{\mathbb{F}} \newcommand{\G}{\mathcal{G}} \renewcommand{\H}{\mathcal{H}}%\H usually gives Hungarian umlaut \newcommand{\I}{\mathcal{I}} \renewcommand{\L}{\mathcal{L}}%\L usually gives Polish slashed L \newcommand{\M}{\mathcal{M}} \newcommand{\U}{\mathcal{U}} \renewcommand{\P}{\mathscr{P}} \newcommand{\X}{\mathcal{X}} \newcommand{\Y}{\mathcal{Y}} \renewcommand{\phi}{\varphi} \renewcommand{\epsilon}{\varepsilon} \renewcommand{\emptyset}{\varnothing} \newcommand{\e}{\epsilon} \newcommand{\dee}{\partial} \newcommand{\Aut}{\mathrm{Aut}} \DeclareMathOperator{\card}{\mathrm{card}} \newcommand{\ch}{\mathrm{ch}} \DeclareMathOperator{\cone}{\mathrm{cone}} \newcommand{\Cone}{\mathtt{Cone}} \DeclareMathOperator{\del}{\mathrm{del}} \DeclareMathOperator{\ess}{\mathrm{ess}} \newcommand{\Hom}{\mathrm{Hom}} \renewcommand{\Im}{\mathrm{Im}} \DeclareMathOperator{\In}{\mathrm{in}} \newcommand{\Inn}{\mathrm{Inn}} \DeclareMathOperator{\link}{\mathrm{link}} \newcommand{\Link}{\mathtt{Link}} \DeclareMathOperator{\nulls}{\mathrm{null} \,} \DeclareMathOperator{\ord}{\mathrm{ord}} \newcommand{\PSL}{\mathrm{PSL}} \DeclareMathOperator{\range}{\mathrm{range} \,} \renewcommand{\Re}{\mathrm{Re}} \newcommand{\SL}{\mathrm{SL}} \DeclareMathOperator{\sgn}{\mathrm{sgn}} \DeclareMathOperator{\spans}{\mathrm{span}} \newcommand{\Sym}{\mathrm{Sym}} \newcommand{\1}{^{-1}} \newcommand{\icap}[1]{\bigcap_{#1 = 1}^\infty} \newcommand{\icup}[1]{\bigcup_{#1 = 1}^\infty} \newcommand{\isum}[1]{\sum_{#1 = 1}^\infty} \newcommand{\la}{\langle} \newcommand{\ra}{\rangle} \renewcommand{\mod}[1]{\,(\mathrm{mod}\,#1)} \newcommand{\sdiff}{\triangle} \renewcommand{\Tilde}{\widetilde} %%THEOREMS %\newtheorem{thm}[equation]{Theorem} %\newtheorem{prop}[equation]{Proposition} \equalenv{lem}{lemm} \equalenv{cor}{coro} % %\theoremstyle{definition} %\newtheorem{ax}[equation]{Axiom} \equalenv{defn}{defi} \equalenv{ex}{exem} %ALCO THEOREMS %% Theorems should be defined using amsthm syntax %\theoremstyle{plain} % \newtheorem{thm}{Theorem}[section] % %\newtheorem{conj}[theo]{Conjecture} % \newtheorem{cor}[thm]{Corollary} % \newtheorem{lem}[thm]{Lemma} % \newtheorem{prop}[thm]{Proposition} % \newtheorem{axio}{Axiom} % \theoremstyle{definition} % \newtheorem{defn}{Definition}[section] % \theoremstyle{remark} % \newtheorem{rema}{Remark}[section] % \newtheorem{ex}{Example}[section] % \newtheorem*{nota*}{Notation} %Added by Greg %\usepackage{setspace} %\onehalfspacing \def\ZZ{\mathbb{Z}} \newcommand{\garrow}[1]{\stackrel{#1}{\longrightarrow}} \def\Q{\mathsf{Q}} \tikzstyle{mutable}=[inner sep=0.5mm,circle,draw,minimum size=2mm] \tikzstyle{frozen}=[inner sep=.9mm,rectangle,draw] %\theoremstyle{definition} \equalenv{rem}{rema} \equalenv{rems}{remas} \newcommand{\gmat}[2][ccccccccccccccccccccccccccccccccc]{\left(\begin{array}{#1} #2\\ \end{array}\right)} %End added by Greg %HEADER \title[Lower bound cluster algebras]{Lower bound cluster algebras:\\ presentations, Cohen--Macaulayness,\\ and normality} \author{\firstname{Greg} \lastname{Muller}} \address%[Greg Muller] {University of Oklahoma} \email{gmuller@ou.edu} \author{\firstname{Jenna} \lastname{Rajchgot}} \address%[Jenna Rajchgot] {University of Saskatchewan} \email{rajchgot@math.usask.edu} \author{\firstname{Bradley} \lastname{Zykoski}} \address%[Bradley Zykoski] {University of Michigan} \email{zykoskib@math.edu} %\date{} \subjclass{13F60, 05E40, 13F55} \keywords{Cluster algebras, lower bound cluster algebras, combinatorial commutative algebra, Stanley--Reisner complexes} \thanks{The third author was supported by NSF grant DMS-1001764, as an REU project at the University of Michigan in 2015.} \setcounter{section}{0} \begin{document} \begin{abstract} We give an explicit presentation for each lower bound cluster algebra. Using this presentation, we show that each lower bound algebra Gr\"obner degenerates to the Stanley--Reisner scheme of a vertex-decomposable ball or sphere, and is thus Cohen--Macaulay. Finally, we use Stanley--Reisner combinatorics and a result of Knutson--Lam--Speyer to show that all lower bound algebras are normal. \end{abstract} \maketitle \section{Introduction and statement of results} Cluster algebras are a family of combinatorially-defined commutative algebras which were introduced by Fomin and Zelevinsky at the turn of the millennium to axiomatize and generalize patterns appearing in the study of dual canonical bases in Lie theory \cite{FZ02}. Since their introduction, cluster algebras have been discovered in the rings of functions on many important spaces, such as semisimple Lie groups, Grassmannians, flag varieties, and Teichm\"uller spaces \cite{BFZ05,Sco06,GLS08,GSV05}.\footnote{A more interesting and morally correct statement is that each of these spaces possesses a stratification such that each stratum naturally has a cluster algebra in its ring of functions.} In each of these examples, the cluster algebra is realized as the coordinate ring of a smooth variety. This makes it all the more surprising that the varieties associated to general cluster algebras can be singular; in fact, they can possess such nightmarish pathologies as a non-Noetherian singularity \cite{MulLA}. Various approaches have been introduced to mitigate this. %either restricting to a subclass of cluster algebras,\footnote{Examples: acyclic \cite{BFZ05}, locally acyclic \cite{MulLA,BRMS}, or existence of a maximal green sequence \cite{???,MulMGS}.} or replacing the cluster algebra with \begin{itemize} \item Restricting to a subclass of cluster algebras with potentially better behavior: acyclic cluster algebras \cite{BFZ05}, locally acyclic cluster algebras \cite{MulLA,BMRS15}, or cluster algebras with a maximal green sequence \cite{BDP14,MulMGS}. \item Replacing the cluster algebra by a closely-related algebra with potentially better behavior: upper cluster algebras \cite{BFZ05,BMRS15}, the span of convergent theta functions \cite{GHKK}, or \textit{lower bound algebras} \cite{BFZ05}. \end{itemize} In this note, we study the algebraic and geometric behavior of lower bound algebras.\footnote{More specifically, we consider lower bound algebras \emph{defined by a quiver} in the body of the paper, and consider the more general context of \emph{geometric type} in Appendix \ref{section: skew}.} \subsection{Lower bound algebras} Lower bound algebras were introduced in \cite{BFZ05} as a kind of ``lazy approximation'' of a cluster algebra, in the following sense. A cluster algebra is defined to be the subalgebra of a field of rational functions generated by a (usually infinite) set of \emph{cluster variables}, produced by a recursive procedure called \emph{mutation}. A lower bound algebra is defined to be the subalgebra generated by truncating this process at a specific finite set of steps. The resulting algebra is contained in the associated cluster algebra and is manifestly finitely generated. A lower bound algebra is constructed from an \textit{ice quiver} $\Q$: this is a quiver (i.e. a finite directed graph) without loops or directed $2$-cycles, in which each vertex is designated \textit{unfrozen} or \textit{frozen}. As a matter of convenience, we assume the vertices of $\Q$ have been indexed by the numbers $\{1,2,\dots,n\}$. To each unfrozen vertex $i$, we associate a pair of monomials $p_i^+,p_i^-\in \ZZ[x_1,x_2,\dots,x_n]$ as follows. \begin{equation} p_i^+ \coloneqq \prod_{\stackrel{\text{arrows }a\in \Q}{\text{source}(a)=i}}x_{\text{target}(a)},\hspace{1cm} p_i^- \coloneqq \prod_{\stackrel{\text{arrows }a\in \Q}{\text{target}(a)=i}}x_{\text{source}(a)} \end{equation} Each vertex then determines a Laurent polynomial $x_i'$, called the \textit{adjacent cluster variable at $i$}, which is defined by the following formula.\footnote{This is an abuse of terminology. Technically speaking, a frozen vertex $i$ should not have an adjacent cluster variable $x_i'$, and instead we should include $x_i^{-1}$ as a generator (though this latter step is a matter of some debate). We are streamlining the process by calling the inverse $x_i^{-1}$ ``the adjacent cluster variable at $i$''.} \begin{equation}%\label{eq: mutation} x_i' \coloneqq \left\{\begin{array}{cc} x_i^{-1}(p_i^++p_i^-) & \text{if $i$ is unfrozen} \\ x_i^{-1} & \text{if $i$ is frozen} \end{array}\right\} %x_i' := x_i^{-1} \left( \prod_{\stackrel{\text{arrows }a\in \Q}{\text{source}(a)=i}}x_{\text{target}(a)}+\prod_{\stackrel{\text{arrows }a\in \Q}{\text{target}(a)=i}}x_{\text{source}(a)}\right) \in \ZZ[x_1^{\pm1},\dots,x_n^{\pm1}] \end{equation} The \textit{lower bound algebra} $\L(\Q)$ defined by $\Q$ is the subalgebra of $\ZZ[x_1^{\pm1},\dots,x_n^{\pm1}]$ generated by the variables $x_1,\dots,x_n$ and the adjacent cluster variables $x_1',\dots,x_n'$. %\[ \L(\Q) := \text{subalgebra of }\ZZ[x_1^{\pm1},\dots,x_n^{\pm1}]\text{ generated by }\{x_1,x_2,\dots,x_n,x_1',x_2',\dots,x_n'\} \] %The set $\{x_1,x_2,\dots,x_n,x_1',x_2',\dots,x_n'\}$ is a subset of the set of cluster variables of the cluster algebra associated to $\Q$.\footnote{We remark that a lower bound algebra is determined by a \emph{seed} in a cluster algebra, and not just by the cluster algebra itself. Hence, a single cluster algebra may be associated to many non-isomorphic lower bound algebras.} \begin{figure}[h!t] \begin{tikzpicture}[scale=1.5] \node[mutable] (1) at (-1,0) {$1$}; \node[mutable] (2) at (0,0) {$2$}; \node[mutable] (3) at (1,.5) {$3$}; \node[frozen] (4) at (1,-.5) {$4$}; \draw[-angle 90,relative,out=15,in=165] (1) to (2); \draw[-angle 90,relative,out=-15,in=-165] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (2) to (4); \end{tikzpicture} \caption{An ice quiver (the unique frozen vertex is depicted as a square)} \label{fig: mutationexample} \end{figure} \begin{ex} Consider the ice quiver $\Q$ in Figure \ref{fig: mutationexample}. The four adjacent cluster variables are below. \[ x_1' = \frac{x_2^2+1}{x_1},\;\;\; x_2'=\frac{x_3x_4+x_1^2}{x_2},\;\;\; x_3'=\frac{1+x_2}{x_3},\;\;\; x_4'=\frac{1}{x_4} \] \end{ex} %\subsection{Relations in lower bound algebras} % %A lower bound algebra comes equipped with a canonical set of generators, and so it is natural to consider what relations hold among these generators. For each vertex $i$, the corresponding mutation $x_i'$ satisfies a \textbf{defining relation}. %\begin{equation} %\forall i \text{ unfrozen} ,\; \;\; x_i'x_i - (p_i^++p_i^-) =0 %\end{equation} %\begin{equation} %\forall i \text{ frozen} ,\; \;\;x_i'x_i -1 =0 %\end{equation} \subsection{Relations in $\L(\Q)$} We first consider the problem of finding relations among the generators of $\L(\Q)$. % %A key first step in understanding a lower bound algebra $\L(\Q)$ is to express it as quotient of a polynomial ring by an explicit ideal; that is, to find generators and relations for $\L(\Q)$. Since a lower bound algebra is constructed by means of an explicit generating set, the interesting problem is to compute the ideal of relations among these generators. % Each adjacent cluster variable satisfies a \textit{defining relation} immediately from its definition. \begin{equation} \forall i \text{ unfrozen} ,\; \;\; x_i'x_i = (p_i^++p_i^-) \end{equation} \begin{equation} \forall i \text{ frozen} ,\; \;\;x_i'x_i =1 \end{equation} A more interesting class of relations is given by the following proposition. \begin{prop}[The cycle relations]\label{prop: cyclerels} For each directed cycle of unfrozen vertices $v_1\rightarrow v_2 \rightarrow \cdots \rightarrow v_k\rightarrow v_{k+1}=v_1$ in $\Q$, the following \textit{cycle relation} holds. \begin{equation}%\label{eq: cyclerel} %y_{v_1}y_{v_2}\cdots y_{v_k} - \prod_{i=1}^k\frac{p_{v_i}^+}{x_{v_i}}- \prod_{i=1}^k\frac{p_{v_i}^-}{x_{v_i}} - \sum_{\stackrel{S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} (-1)^{|S|}\left(\prod_{i\in S} \frac{p_i^+}{x_{i+1}}\frac{p_{i+1}^-}{x_i}\right)\left(\prod_{i\not\in S\cup (S+1)} y_i\right) \sum_{\stackrel{S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} (-1)^{|S|}\left(\prod_{i\in S} \frac{p_{v_i}^+p_{v_{i+1}}^-}{x_{v_i}x_{v_{i+1}}}\right)\left(\prod_{i\not\in S\cup (S+1)} x'_{v_i}\right) = \prod_{i=1}^k\frac{p_{v_i}^+}{x_{v_i}}+ \prod_{i=1}^k\frac{p_{v_i}^-}{x_{v_i}} \end{equation} \end{prop} \noindent We note that the expressions on either side reduce to polynomials in the generators, despite the presence of fractions. Also note that choosing a different initial vertex $v_1$ in the same directed cycle does not change the corresponding cycle relation. %Also note that reparametrizing a directed cycle does not change the corresponding cycle relation. \begin{figure}[h!t] \begin{tikzpicture}[scale=1] \node[mutable] (1) at (90:1) {$1$}; \node[mutable] (2) at (-30:1) {$2$}; \node[mutable] (3) at (210:1) {$3$}; \draw[-angle 90] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (3) to (1); \end{tikzpicture} \caption{An ice quiver (no frozen vertices)} \label{fig: 3cycle} \end{figure} \begin{rem} A quiver $\Q$ is called \textit{acyclic} if it has no directed cycles of unfrozen vertices. The unifying theme of this paper is the use of the cycle relations to generalize results about $\L(\Q)$ which were previously known only when $\Q$ is acyclic (that is, when there are no cycle relations). \end{rem} \begin{ex} Let $\Q$ be the ice quiver in Figure \ref{fig: 3cycle}. The three adjacent cluster variables are \[ x_1'= \frac{x_2+x_3}{x_1},\;\;\; x_2'=\frac{x_3+x_1}{x_2},\;\;\; x_3'=\frac{x_1+x_2}{x_3} \] The defining relations here are obtained by clearing the denominators above. A non-trivial directed $3$-cycle starting at any vertex determines the cycle relation \[ x_1'x_2'x_3' - x_1'-x_2'-x_3'=2\] which may be verified by direct computation. \end{ex} \subsection{A presentation of $\L(\Q)$} We may ask whether there are other relations in $\L(\Q)$ that are not an immediate consequence of the preceding relations; or more concretely, whether the defining relations and the cycle relations generate the entire ideal of relations among the generators. Explicitly, we consider the homomorphism of rings\footnote{The $y$-variables introduced here have no relation to the \emph{$y$-variables} or \emph{coefficient variables} introduced in \cite{FZ07}.} \[ \pi :\ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]\longrightarrow \ZZ[x_1^{\pm1},x_2^{\pm1},\dots,x_n^{\pm1} ]\] \[ \forall i, \;\;\; \pi(x_i) = x_i,\;\;\; \pi(y_i)=x_i'\] The image of this homomorphism is $\L(\Q)$, and so $K_\Q \coloneqq \ker(\pi)$ is the \textit{ideal of relations} among the generators of $\L(\Q)$, where each adjacent cluster variable $x_i'$ has been replaced by the abstract variable $y_i$. The homomorphism $\pi$ descends to an isomorphism \[ \ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]/K_\Q\garrow{\sim} \L(\Q) \] We will say a directed cycle $v_1\rightarrow v_2 \rightarrow \cdots \rightarrow v_k\rightarrow v_{k+1}=v_1$ is \textit{vertex-minimal} if no vertex appears more than once and there is no directed cycle whose vertex set is a proper subset of $\{v_1,v_2\dots,v_k\}$. \begin{thm}\label{thm: relations} The ideal of relations $K_\Q$ is generated by the following elements. \begin{itemize} \item For each unfrozen vertex $i$, \begin{equation}\label{eq: mutationrel} y_ix_i - p_i^+-p_i^- \end{equation} \item For each frozen vertex $i$, \begin{equation}\label{eq: inverserel} y_ix_i-1 \end{equation} \item For each vertex-minimal %\footnote{A cycle is \textit{vertex-minimal} if no vertex appears in the cycle more than once (excluding $v_{k+1}=v_1$). This condition has been introduced to ensure the finiteness of the given generators of $K_\Q$.} directed cycle of unfrozen vertices $v_1\rightarrow v_2 \rightarrow \cdots \rightarrow v_k\rightarrow v_{k+1}=v_1$, \begin{equation}%\label{eq: cyclerel} \sum_{\stackrel{S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} (-1)^{|S|}\left(\prod_{i\in S} \frac{p_{v_i}^+p_{v_{i+1}}^-}{x_{v_i}x_{v_{i+1}}}\right)\left(\prod_{i\not\in S\cup (S+1)} y_{v_i}\right) - \prod_{i=1}^k\frac{p_{v_i}^+}{x_{v_i}}- \prod_{i=1}^k\frac{p_{v_i}^-}{x_{v_i}} \end{equation} which simplifies to a polynomial. \end{itemize} \end{thm} \noindent The theorem is true without the vertex-minimal condition, which is used here to reduce the set of relations. \begin{ex}\label{ex:3vertexgrobner} Let $\Q$ be the ice quiver in Figure \ref{fig: 3cycle}. By Theorem \ref{thm: relations}, $\L(\Q)$ is isomorphic to the quotient of $\ZZ[x_1,x_2,x_3,y_1,y_2,y_3]$ by the ideal $K_\Q$ generated by the following $4$ relations. \[ K_\Q =\langle y_1x_1-x_2-x_3,y_2 x_2-x_3-x_1, y_3x_3-x_1-x_2, y_1y_2y_3-y_1-y_2-y_3-2\rangle \] \end{ex} \subsection{A Gr\"obner basis for $K_\Q$} We prove Theorem \ref{thm: relations} by means of a stronger result, that the given generators are a Gr\"obner basis for the ideal of relations $K_\Q$. Recall that, given a polynomial ring with a monomial order $<$, a \textit{Gr\"obner basis} of an ideal $I$ is a generating set $\{g_1,g_2,..,g_k\}$ of $I$ satisfying the additional condition that $\{\text{in}_<(g_1),\text{in}_<(g_2),\dots,\text{in}_<(g_k)\}$ is a generating set of $\text{in}_<(I)$. The monomial orders relevant to us are those in which the $y$-variables are much more expensive than the $x$-variables, that is $\mathbf{x}^{\mathbf{\alpha}}\mathbf{y}^{\mathbf{\beta}}> \mathbf{x}^{\mathbf{\gamma}}\mathbf{y}^{\mathbf{\delta}}$ whenever $\sum_i \beta_i$ is larger than $\sum_i \delta_i$. %\[ %x_1^{\alpha_1}x_2^{\alpha_2}\cdots x_n^{\alpha_n}y_1^{\beta_1}y_2^{\beta_2}\cdots y_n^{\beta_n} > x_1^{\gamma_1}x_2^{\gamma_2}\cdots x_n^{\gamma_n}y_1^{\delta_1}y_2^{\delta_2}\cdots y_n^{\delta_n} %\] %whenever $\beta_1+\dots+\beta_n$ is larger than $\delta_1+\dots+\delta_n$. An example of such a monomial order is the lexicographical order where the variables are ordered by \[ y_1>y_2>\cdots>y_n>x_1>x_2>\cdots>x_n. \] %Given a monomial order of $\ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]$, we say that the `$y$-variables are much more expensive than the $x$-variables'%\marginpar{I don't like how this is phrased; is there a better way to say this? -GM} if a monomial with more $y$-variables is always greater in the monomial order than a monomial with fewer $y$-variables. \begin{thm}\label{thm: grobner} For any monomial order of $\ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]$ in which all of the $y$-variables are much more expensive than all of the $x$-variables, the polynomials given in Theorem \ref{thm: relations} are a Gr\"obner basis for $K_\Q$. Consequently, the initial ideal $\text{in}_< K_\Q$ is squarefree monomial ideal with generating set \begin{align*} \{x_iy_i \mid 1\leq i\leq n\}\cup \{ y_{v_1}y_{v_2}\cdots &y_{v_k}\st v_1\rightarrow v_2\rightarrow \cdots \rightarrow\\ &\rightarrow v_k\rightarrow v_{k+1} = v_1 \textrm{ is a vertex-minimal cycle in }\Q\}. \end{align*} \end{thm} \begin{rem} %\begin{enumerate} When $\Q$ is acyclic, Theorem \ref{thm: grobner} specializes to Corollary 1.17 in \cite{BFZ05}. The proof of Theorem \ref{thm: grobner} given in Section \ref{sect:generators} uses \cite[Corollary 1.17]{BFZ05} in an essential way, so our proof is not independent of the original result. % %While the proof of Theorem \ref{thm: grobner} given in Section \ref{sect:generators} follows a different structure than \cite{BFZ05}, it uses \cite[Corollary 1.17]{BFZ05} in an essential way (see \ref{reference to step of proof}), so our proof is not independent of theirs.%\marginpar{We could instead use the direct proof that we came up with that does not reference BFZ. -JR} %\item To prove Theorem \ref{thm: grobner} we make use of the fact that all lower bound cluster algebras are ``combinatorially Frobenius split'' [[explain, give reference to BMRS]]. Consequently, we know that the ideal $K_Q$ is radical and must Gr\"obner degenerate to a \emph{squarefree} monomial ideal, even though, a priori, it is not clear what this ideal should be. %\end{enumerate} \end{rem} \subsection{Simplicial complexes and Cohen--Macaulayness of lower bound algebras} From here on, we work over a field $\mathbb{K}$, and consider the $\mathbb{K}$-algebra $\mathcal{L}(\Q)\otimes_\mathbb{Z}\mathbb{K}$. We will still refer to this algebra as a lower bound algebra and, though a slight abuse of notation, will simply denote it by $\mathcal{L}(\Q)$. Similarly, we let $K_\Q$ denote the associated lower bound ideal, so that it is the kernel of the map $\pi:\mathbb{K}[x_1,\dots,x_n,y_1\dots,y_n]\rightarrow \mathcal{L}(\Q)$. To a squarefree monomial ideal $I\subseteq \mathbb{K}[z_1,\dots,z_n]$, one can associate a simplicial complex $\Delta$ on the vertex set $\{z_1,\dots,z_n\}$. This simplicial complex is called the \textit{Stanley--Reisner complex} and is defined as follows: $\{z_{i_1},\dots z_{i_r}\}$ is a face of $\Delta$ if and only if the monomial $z_{i_1}\cdots z_{i_r}\notin I$. Observe that the minimal non-faces of $\Delta$ are in one-to-one correspondence with a minimal generating set of $I$. For further information on Stanley--Reisner complexes, see the textbook \cite[Chapter 1]{MillerSturmfels}. Whenever the Stanley--Reisner complex is a simplicial ball or a sphere,\footnote{More precisely, we mean the geometric realization of the simplicial complex is homeomorphic to a ball or sphere, respectively. Whenever we refer to a simplicial complex as a topological object, we more precisely mean its geometric realization.} the corresponding face ring $\mathbb{K}[z_1,\dots, z_n]/I$ is a Cohen--Macaulay ring \cite{Munkres}. Furthermore, when $I = \textrm{in}_< J$ for some ideal $J\subseteq \mathbb{K}[z_1,\dots, z_n]$, we may also conclude that $J$ itself is Cohen--Macaulay (see eg. \cite[Proposition 3.1]{BC03}). \begin{ex} We continue Example \ref{ex:3vertexgrobner} and observe that the initial ideal $\textrm{in}_< K_\Q$ (for a term order $<$ as in Theorem \ref{thm: grobner}) is $\langle x_1y_1, x_2y_2, x_3y_3, y_1y_2y_3\rangle$. The facets (i.e. the maximal faces) of the associated Stanley--Reisner complex are precisely those $\{z_1,z_2,z_3\}$ where $z_i$ is either $x_i$ or $y_i$ and at least one of $z_1, z_2, z_3$ is an $x_i$. This Stanley--Reisner complex is readily seen to be a simplicial ball, and is pictured in Figure \ref{fig:3vertexball}. \begin{figure} \begin{tikzpicture} \begin{scope} \draw[fill=blue!20] (0,0) circle (2); \clip (0,0) circle (2); \draw (90:1) circle (1.732); \draw (-30:1) circle (1.732); \draw (210:1) circle (1.732); \end{scope} \node[draw,circle,fill=white] at (90:1) {$x_1$}; \node[draw,circle,fill=white] at (210:1) {$x_2$}; \node[draw,circle,fill=white] at (330:1) {$x_3$}; \node[draw,circle,fill=white] at (150:2) {$y_1$}; \node[draw,circle,fill=white] at (30:2) {$y_2$}; \node[draw,circle,fill=white] at (270:2) {$y_3$}; \end{tikzpicture} %\begin{tikzpicture}[auto,node distance=2cm, % main node/.style={circle,draw}] % % \begin{pgfonlayer}{main} % \node[main node,fill=white] (x1) {\small $x_1$}; % \node[main node,fill=white] (x2) [below left of=x1] {\small $x_2$}; % \node[main node,fill=white] (x3) [below right of=x1] {\small $x_3$}; % \node[main node,fill=white] (y1) [below right of=x2] {\small $y_1$}; % \node[main node,fill=white] (y2) [above right of=x3] {\small $y_2$}; % \node[main node,fill=white] (y3) [above left of=x2] {\small $y_3$}; % \end{pgfonlayer} % % \begin{pgfonlayer}{bg} % \path (x1) edge node {} (x2); % \path (x2) edge node {} (x3); % \path (x3) edge node {} (x1); % \path (y1) edge node {} (x2); % \path (y1) edge node {} (x3); % \path (y3) edge node {} (x1); % \path (y3) edge node {} (x2); % \path (y2) edge node {} (x1); % \path (y2) edge node {} (x3); % \path (y1.center) edge [bend right] (y2.center); % \path (y1.center) edge [bend left] (y3.center); % \path (y3.center) edge [bend left] (y2.center); % \path[fill=blue!40,opacity=0.5] (x1.center) to (x2.center) to (x3.center) to (x1.center); % \path[fill=blue!40,opacity=0.5] (x1.center) to (y2.center) to (x3.center) to (x1.center); % \path[fill=blue!40,opacity=0.5] (y1.center) to (x2.center) to (x3.center) to (y1.center); % \path[fill=blue!40,opacity=0.5] (x1.center) to (x2.center) to (y3.center) to (x1.center); % \path[fill=blue!40,opacity=0.5] (y1.center) to [bend right] (y2.center) to (x3.center) to (y1.center); % \path[fill=blue!40,opacity=0.5] (y1.center) to (x2.center) to (y3.center) to [bend right] (y1.center); % \path[fill=blue!40,opacity=0.5] (x1.center) to (y2.center) to [bend right] (y3.center) to (x1.center); % \end{pgfonlayer} % %\end{tikzpicture} \caption{The Stanley--Reisner complex for $\la x_1y_1, x_2y_2, x_3y_3, y_1y_2y_3 \ra$} \label{fig:3vertexball} \end{figure} \end{ex} This example generalizes, and we are able to conclude that all lower bound algebras are Cohen--Macaulay. \begin{thm}\label{thm:CM} Let $\Q$ be a quiver with $n$ vertices, let $K_\Q\subseteq \mathbb{K}[x_1,\dots,x_n,y_1,\dots,y_n]$ be its ideal of relations, and let $<$ be any monomial order where the $y$-variables are much more expensive than the $x$-variables. Let $\Delta_\Q$ be the Stanley--Reisner complex of the squarefree monomial ideal $\textrm{in}_< K_\Q$. \begin{enumerate} %\item If $\Q$ contains no cycle of unfrozen vertices, then $\Delta_\Q$ can be embedded in Euclidean space as the boundary sphere of a cross polytope. %\item If $\Q$ contains at least one cycle of unfrozen vertices, then $\Delta_\Q$ is a vertex-decomposable simplicial ball. \item If $\Q$ is acyclic, then $\Delta_\Q$ is a simplicial sphere. \item If $\Q$ is not acyclic, then $\Delta_\Q$ is a simplicial ball. \end{enumerate} %Consequently, the lower bound algebra $\L(\Q)$ over a field $\mathbb{K}$ is Cohen--Macaulay. \end{thm} \noindent We show additional properties of $\Delta_\Q$. If $\Q$ is acyclic, then $\Delta_\Q$ is the boundary of a cross-polytope. In both cases, $\Delta_\Q$ satisfies the stronger condition of \emph{vertex-decomposibility}. Details are in Section \ref{sect:combinatorics}. \begin{cor} For any $\Q$ the lower bound algebra $\L(\Q)$ over a field $\mathbb{K}$ is Cohen--Macaulay. \end{cor} %We actually obtain stronger characterizations of $\Delta_\Q$. In the acyclic case, $\Delta_\Q$ is the boundary of \emph{cross polytope}; in the non-acyclic case, $\Delta_\Q$ is a \emph{vertex-decomposable} ball. Details may be found in Section \ref{sect:combinatorics}. %Definitions of the combinatorial terminology appearing in the above theorem appear in section \ref{sect:combinatorics}. \begin{rems}~\\*[-\baselineskip] \begin{enumerate} \item We prove Theorem \ref{thm:CM} by way of a more general result, which gives a larger class of simplicial complexes which are automatically vertex-decomposable balls (see Theorem \ref{homeo}). \item When $\Q$ is acyclic, $\L(\Q)$ was already known to be Cohen--Macaulay; specifically, \cite[Corollary 1.17]{BFZ05} implies that $\L(\Q)$ is a complete intersection, and, consequently, that it is Cohen--Macaulay. \end{enumerate} \end{rems} \subsection{Normality of lower bound algebras} Our last main result is the normality of the $\mathbb{K}$-algebra $\L(\Q)$. \begin{thm}\label{thm:normalityOfLowerBounds} Every lower bound cluster algebra defined by a quiver is normal. \end{thm} Since $\L(\Q)= \mathbb{K}[x_1,\dots,x_n,y_1,\dots,y_n]/K_\Q$ is finitely-generated, Serre's Criterion reduces normality to a pair of geometric conditions on the variety $\mathbb{V}(K_\Q)$. \begin{itemize} \item (R1) The variety $\mathbb{V}(K_\Q)$ has no codimension\--$1$ singularities. \item (S2) Any regular function on an open subset in $\mathbb{V}(K_\Q)$ with codimension\--$2$ complement extends to a regular function on all of $\mathbb{V}(K_\Q)$. \end{itemize} The Cohen--Macaulay property implies the S2 condition, and so normality of $\L(\Q)$ reduces to proving there are no codimension\--$1$ singularities. As with Cohen--Macaulayness, this geometric question will be reduced to Stanley--Reisner combinatorics, along with a result of Knutson--Lam--Speyer \cite[Proposition 8.1]{KLS-Richardson}. See Section \ref{sect:normality} for further information. %The last of our main results is the following: % %\begin{thm}\label{thm:normalityOfLowerBounds} %Every lower bound cluster algebra defined by a quiver is normal. %\end{thm} % %To prove Theorem \ref{thm:normalityOfLowerBounds}, we use Stanley--Reisner combinatorics, along with a result of Knutson-Lam-Speyer \cite[Proposition 8.1]{KLS-Richardson}. See section \ref{sect:normality} for further information. \begin{rem} Like our other results, Theorem \ref{thm:normalityOfLowerBounds} is only new in the case of non-acyclic $\Q$. In the acyclic setting, $\L(\Q)$ is equal to its upper cluster algebra\footnote{This was proven with an additional assumption in \cite[Thm. 1.18]{BFZ05}, and without said assumption in \cite{MulAU}.}, which is a normal domain by \cite[Prop. 2.1]{MulLA}. \end{rem} \subsection*{Structure of paper} Section \ref{section: algebra} considers relations in $\L(\Q)$ and proves the associated results: Proposition \ref{prop: cyclerels}, Theorem \ref{thm: relations} and Theorem \ref{thm: grobner}. Section \ref{sect:combinatorics} introduces the relevant combinatorial tools, leading to the proof of Theorem \ref{thm:CM}. Section \ref{sect:normality} addresses normality, proving Theorem \ref{thm:normalityOfLowerBounds}. The paper concludes with a pair of appendices which frame the scope of the paper. Appendix \ref{section: singularity} considers the singularities of lower bound algebras directly, and provides an example to suggest this is a difficult problem. Appendix \ref{section: skew} explains how the results of the paper can be extended to \emph{skew-symmetrizable} lower bound algebras, which are more general but also somewhat less intuitive. \section{Presentations and Gr\"obner Bases}\label{section: algebra} %Note: I will later assimilate my labels into the style of \label{[type of ref]: [name of ref]} \subsection{Choice graphs and cycle relations} \noindent To every cycle of $\Q$ there exists a corresponding relation in $\L(\Q)$. Let $\Q$ have a directed cycle $v_1 \to v_2 \to \cdots \to v_{k-1} \to v_k \to v_1$. By giving an alternate presentation for the product \begin{equation}\label{Product} \prod_{i=1}^k x_{v_i}' = \prod_{i=1}^k x_{v_i}\1 (p_{v_i}^+ + p_{v_i}^-), \end{equation} we acquire a nontrivial relation that holds in $\L(\Q)$. It is our goal to expand the right-hand product as a sum, and from this, Proposition \ref{prop: cyclerels} will follow. Each term of the expansion of this product represents a choice, for each $i$, of either $p_{v_i}^+$ or $p_{v_i}^-$ from $x_{v_i}\1(p_{v_i}^+ + p_{v_i}^-)$. Therefore, to each term, we associate a directed graph with $\Z/k\Z$ as its vertex set and $\{(i,i\pm1)\}_{i=1}^n$ as its set of arrows, where the sign of $\pm$ corresponds to the abovementioned choice of $p_{v_i}^+$ (corresponding to the positive sign because $x_{v_{i+1}}$ divides $p_{v_i}^+$) or $p_{v_i}^-$ (negative sign, since $x_{v_{i-1}}$ divides $p_{v_i}^-$). Call these graphs the \textit{choice graphs} of the terms of the expansion of \eqref{Product}, and let $\mathfrak C$ denote the set of all choice graphs. Formally, we write the correspondence between choice graphs and terms as a function \begin{equation} M: \mathfrak C \to \{\text{monomials in }\Z[x_1^{\pm1},\dots,x_k^{\pm1}]\},\quad M(\mathsf g) = \prod_{i=1}^k x_{v_i}\1p_{v_i}^{\mathrm{sign}_{\mathsf g}(i)}, \end{equation} where \begin{equation} \mathrm{sign}_{\mathsf g}(i) = \begin{cases} + & \text{if } (i,i+1) \in \mathsf g,\\ - & \text{if } (i,i-1) \in \mathsf g. \end{cases}. \end{equation} \begin{ex} Let $\Q$ be the quiver on $\Z/6\Z$ whose set of arrows is $\{(j,j+1)\}_{j=1}^6$. The choice graph in Figure \ref{fig: choice graph} represents the term \[ (x_{1}\1 p_{1}^+)(x_{2}\1 p_{2}^+)(x_{3}\1 p_{3}^-)(x_{4}\1 p_{4}^-)(x_{5}\1 p_{5}^-)(x_{6}\1 p_{6}^-) = x_{1}\1 p_{1}^+ \frac{p_{2}^+ p_{3}^-}{x_3 x_2} p_4^+ \frac{p_5^-}{x_4} \frac{p_6^-}{x_5} x_{6}\1. \] \end{ex} \begin{figure} \begin{tikzpicture}[scale=1] \node[mutable] (1) at (120:1) {$1$}; \node[mutable] (2) at (60:1) {$2$}; \node[mutable] (3) at (0:1) {$3$}; \node[mutable] (4) at (300:1) {$4$}; \node[mutable] (5) at (240:1) {$5$}; \node[mutable] (6) at (180:1) {$6$}; \draw[-angle 90] (2) to [bend left] (3); \draw[-angle 90] (1) to (2); \draw[-angle 90] (5) to (4); \draw[-angle 90] (4) to (3); \draw[-angle 90] (6) to (5); \draw[-angle 90] (3) to [bend left] (2); \end{tikzpicture} \caption{The choice graph for $(x_{1}\1 p_{1}^+)(x_{2}\1 p_{2}^+)(x_{3}\1 p_{3}^-)(x_{4}\1 p_{4}^-)(x_{5}\1 p_{5}^-)(x_{6}\1 p_{6}^-)$} \label{fig: choice graph} \end{figure} By our construction of $\mathfrak C$ and $M$, we have that \eqref{Product} may be written as \begin{equation}\label{eq: choice sum} \prod_{i=1}^k x_{v_i}\1 (p_{v_i}^+ + p_{v_i}^-) = \sum_{\mathsf g \in \mathfrak C} M(\mathsf g), \end{equation} and so it is our goal to expand the sum on the right of \eqref{eq: choice sum}. The following proposition gives us such an expansion. \begin{prop}\label{cycle} We may expand \eqref{eq: choice sum} as follows: \begin{align}\label{cyclerel-eq} \prod_{i=1}^k x_{v_i}\1 (p_{v_i}^+ + p_{v_i}^-) &= \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} + \prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}} \nonumber\\ &+ \sum_{\stackrel{\emptyset \neq S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}}(-1)^{|S|+1} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} x_{v_i}'\right) \end{align} %\begin{equation}\label{cyclerel-eq} %\sum_{\mathsf g \in \mathfrak C} M(\mathsf g) = \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} + \prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}} + \sum_{\stackrel{\emptyset \neq S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} \left((-1)^{|S|+1} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} x_{v_i}'\right)\right). %\end{equation} \end{prop} \begin{proof} Note that a choice graph has a directed 2-cycle if and only if its associated term has a factor of the form $(x_{v_i}\1 p_{v_i}^+)(x_{v_{i+1}}\1 p_{v_{i+1}}^-)$, which is a monomial $\frac{p_{v_i}^+}{x_{v_{i+1}}} \frac{p_{v_{i+1}}^-}{x_{v_i}}$ in the variables $x_{v_1},\dots,x_{v_n}$ since $x_{v_{i+1}}$ divides $p_{v_i}^+$ and $x_{v_i}$ divides $p_{v_{i+1}}^-$. Also notice that no two 2-cycles may share vertices, since each vertex meets the tail of one and only one arrow. It follows that a choice graph may have at most $\lfloor \frac k2 \rfloor$ 2-cycles. Finally notice that a 2-cycle may only exist on adjacent vertices. Now, let $\mathfrak S_j$ denote the collection of subsets $S$ of $\{1,\dots,k\}$ of size $j\geq1$ such that $S \cap (S+1) = \emptyset$, and let $\mathfrak S = \bigcup_{j=1}^{\lfloor \frac k2 \rfloor} \mathfrak S_j$. These subsets $S$ correspond to the ``left endpoints'' of the 2-cycles in choice graphs with $j$ 2-cycles. \pagebreak Let $C(S)$ be the set of all choice graphs with a 2-cycle on every pair $\{i,i+1\}$ for $i \in S \in \mathfrak S$, and let $C_0$ be the set of choice graphs with no 2-cycles, then we have \begin{equation}\label{eq: separation} \mathfrak C = C_0 \cup \left(\bigcup_{S \in \mathfrak S_1}C(S)\right) \cup \left(\bigcup_{S \in \mathfrak S_2}C(S)\right) \cup \cdots \cup \left(\bigcup_{S \in \mathfrak S_{\lfloor \frac n2 \rfloor}} C(S)\right). \end{equation} Since every $\mathsf g \in C(S)$ has a pair of arrows $(i,i+1), (i+1,i)$ for every $i \in S$, we have \begin{equation}\label{eq: partial choice} \sum_{\mathsf g \in C(S)} M(\mathsf g) = \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} x_{v_i}\1\left(p_{v_i}^+ + p_{v_i}^-\right)\right). \end{equation} We also have \[ \sum_{\mathsf g \in C_0} M(\mathsf g) = \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} + \prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}}, \] since there are precisely two choice graphs with no 2-cycles, corresponding to a consistent choice of either $+$ or $-$. We wish use \eqref{eq: separation} to write \eqref{eq: choice sum} as a sum with summands of the form \eqref{eq: partial choice}. Such a sum must have precisely one term corresponding to each member of $\mathfrak C$. However, there is a certain amount of overcounting involved in \eqref{eq: separation}, since for any $S \in \mathfrak S$, we have \begin{equation}\label{overcounting} C(S) \subseteq C(S \smallsetminus \{i\}) \quad \text{for every } i \in S. \end{equation} We therefore proceed iteratively by way of the inclusion-exclusion principle. We first include a summand corresponding to $C(S)$ for every $S \in \mathfrak S_1$: \[ T_1 = \sum_{S \in \mathfrak S_1} \sum_{\mathsf g \in C(S)} M(\mathsf g). \] As (\ref{overcounting}) shows, for every $S \in \mathfrak S_2$, the summand $T_1$ contains two terms corresponding to each element of $C(S)$. Therefore, we now exclude a summand for each $C(S)$, $S \in \mathfrak S_2$: \[ T_2 = T_1 - \sum_{S \in \mathfrak S_2} \sum_{\mathsf g \in C(S)} M(\mathsf g). \] Again, (\ref{overcounting}) shows us that, for every $S \in \mathfrak S_3$, the summand $T_2$ excludes one term too many for each element of $C(S)$. We therefore define $T_3$ accordingly, and continue the process of inclusion and exclusion until we obtain \[ T_{\lfloor \frac k2 \rfloor} = \sum_{j=1}^{\lfloor \frac k2 \rfloor}\left((-1)^{j+1} \sum_{S \in \mathfrak S_j} \sum_{\mathsf g \in C(S)} M(\mathsf g)\right). \] Finally, we must include a term of $\sum_{\mathsf g \in C_0} M(\mathsf g)$ corresponding to $C_0$, and we conclude that \begin{align*} \sum_{\mathsf g \in \mathfrak C} M(\mathsf g) =&\sum_{\mathsf g \in C_0} M(\mathsf g) + T_{\lfloor \frac k2 \rfloor}\\ \prod_{i=1}^k x_{v_i}\1 (p_{v_i}^+ + p_{v_i}^-) =& \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} + \prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}} +\\ &\sum_{j=1}^{\lfloor \frac k2 \rfloor}\left((-1)^{j+1} \sum_{S \in \mathfrak S_j} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} \!\!\!x_{v_i}'\right)\right) \\ =& \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} +\prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}} + \\ &\sum_{\stackrel{\emptyset \neq S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} \left((-1)^{|S|+1} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} \!\!\!x_{v_i}'\right)\right). \end{align*} \end{proof} Proposition \ref{prop: cyclerels} follows, since we now have \begin{align*} \prod_{i=1}^k x_{v_i}\1 (p_{v_i}^+ + p_{v_i}^-) - \sum_{\stackrel{\emptyset \neq S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} &\left((-1)^{|S|+1} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} \!\!\!x_{v_i}'\right)\right)=\\ \prod_{i=1}^k \frac{p_{v_i}^+}{x_{v_{i-1}}} + \prod_{i=1}^k \frac{p_{v_i}^-}{x_{v_{i+1}}} \sum_{\stackrel{S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} &\left((-1)^{|S|} \left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right) \left(\prod_{i \notin S \cup (S+1)} \!\!\!x_{v_i}'\right)\right) =\\ & \prod_{i=1}^k\frac{p_{v_i}^+}{x_{v_{i-1}}}+ \prod_{i=1}^k\frac{p_{v_i}^-}{x_{v_{i+1}}}. \end{align*} %\noindent %We may associate to any lower bound algebra a corresponding \emph{lower bound ideal} $L$. %\begin{defn} %Given a lower bound algebra $\mathcal L$ determined by a quiver $Q$ on $n$ vertices, we define the \emph{lower bound ideal} $L$ to be the kernel of the surjective ring homomorphism %\begin{equation}\label{homomorphism} %\phi: R = \C[x_1,\dots,x_n,y_1,\dots,y_n] \to \mathcal L, \quad %x_i \mapsto x_i, \quad y_i \mapsto x_i'. %\end{equation} %\end{defn} \subsection{Generators for $K_\Q$}\label{sect:generators} Now, in addition to the \textit{defining polynomials} $y_ix_i - (p_i^+ + p_i^-)$, $y_ix_i - 1$ given by the defining relations \eqref{eq: mutationrel} and \eqref{eq: inverserel}, we have by Proposition \ref{cycle} that the ideal of relations $K_\Q$ also contains the \textit{cycle polynomials}. We define the cycle polynomials in $\Z[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]$ to be those polynomials coming from vertex-minimal directed cycles whose images under $\pi$ vanish by virtue of (\ref{cyclerel-eq}). That is, for every vertex-minimal directed cycle of unfrozen vertices $v_1 \to v_2 \to \cdots \to v_k \to v_1$ in $\Q$, we have the cycle polynomial \[ \sum_{\stackrel{S\subset \{1,2,\dots,k\}}{S\cap (S+1)=\emptyset}} (-1)^{|S|}\left(\prod_{i\in S} \frac{p_{v_i}^+}{x_{v_{i+1}}}\frac{p_{v_{i+1}}^-}{x_{v_i}}\right)\left(\prod_{i\not\in S\cup (S+1)} y_{v_i}\right) - \prod_{i=1}^k\frac{p_{v_i}^+}{x_{v_{i-1}}}- \prod_{i=1}^k\frac{p_{v_i}^-}{x_{v_{i+1}}}. \] Note again that this expression reduces to a polynomial in the $x$- and $y$-variables because each $x_{v_{i+1}}$ divides $p_{v_i}^+$ and each $x_{v_i}$ divides $p_{v_{i+1}}^-$. In Table 1, we present the cycle polynomials given by some basic ice quivers. \begin{table} \begin{center} \caption{Cycle polynomials in several examples} \begin{tabular}{| >{\centering\arraybackslash}m{2in} | >{\centering\arraybackslash}m{2in} |} \hline\vspace{.1cm} \begin{tikzpicture}[scale=1] \node[mutable] (1) at (90:1) {$1$}; \node[mutable] (2) at (330:1) {$2$}; \node[mutable] (3) at (210:1) {$3$}; \draw[-angle 90] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (3) to (1); \end{tikzpicture} & $y_1y_2y_3 - y_1 - y_2 - y_3 - 2$ \\ \hline\vspace{.1cm} \begin{tikzpicture}[scale=1] \node[mutable] (1) at (135:1) {$1$}; \node[mutable] (2) at (45:1) {$2$}; \node[mutable] (3) at (315:1) {$3$}; \node[mutable] (4) at (225:1) {$4$}; \draw[-angle 90] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (3) to (4); \draw[-angle 90] (4) to (1); \end{tikzpicture} & $y_1y_2y_3y_4 - y_1y_2 - y_1y_4 - y_2y_3 - y_3y_4$ \\ \hline\vspace{.1cm} \begin{tikzpicture}[scale=1] \node[mutable] (1) at (90:1) {$1$}; \node[mutable] (2) at (18:1) {$2$}; \node[mutable] (3) at (306:1) {$3$}; \node[mutable] (4) at (234:1) {$4$}; \node[mutable] (5) at (162:1) {$5$}; \draw[-angle 90] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (3) to (4); \draw[-angle 90] (4) to (5); \draw[-angle 90] (5) to (1); \end{tikzpicture} & $y_1y_2y_3y_4y_5 - y_1y_2y_3 - y_1y_2y_5 - y_2y_3y_4 - y_3y_4y_5 + y_1 + y_2 + y_3 + y_4 + y_5 - 2$ \\ \hline\vspace{.1cm} \begin{tikzpicture}[scale=1] \node[mutable] (2) {$2$}; \node[mutable] (1) [above left of=2] {$1$}; \node[mutable] (4) [above right of=2] {$4$}; \node[mutable] (3) [below right of=2] {$3$}; \node[mutable] (5) [below left of=2] {$5$}; \draw[-angle 90] (1) to (2); \draw[-angle 90] (2) to (3); \draw[-angle 90] (3) to (4); \draw[-angle 90] (4) to (2); \draw[-angle 90] (2) to (5); \draw[-angle 90] (5) to (1); \end{tikzpicture} & $y_1y_2y_5 - y_1x_3 - y_2 - y_5x_4 - x_3 - x_4$ and $y_2y_3y_4 - y_2 - y_3x_1 - y_4x_5 - x_1 - x_5$ \\ \hline \end{tabular} \end{center} \label{table: polynomials} \end{table} \\ \indent We now obtain a presentation for the ideal of relations $K_\Q$ and for the initial ideal $\In_< K_\Q$, where $<$ is a monomial order in which the $y$-variables are much more expensive than the $x$-variables. This presentation will suffice to prove Theorems \ref{thm: relations} and \ref{thm: grobner}. We first require the following standard lemma. \begin{lem}\label{basislemma} Let $J$ and $L$ be ideals in a polynomial ring. Suppose that $J \subseteq L$ and $\In_< J = \In_< L$. Then $J = L$. \end{lem} \begin{proof} Let $G$ be a Gr\"obner basis for $J$ and let $f \in L$. Since $\In_< G$ generates $\In_< L$, dividing $f$ by $G$ gives a remainder of $0$, and so $f \in J$. \end{proof} \begin{thm}\label{basisthm} Given an ice quiver $\Q$ on $n$ vertices, the defining polynomials together with the cycle polynomials form a Gr\"obner basis for $K_\Q = \ker \pi$, where \[ \pi :\ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]\longrightarrow \ZZ[x_1^{\pm1},x_2^{\pm1},\dots,x_n^{\pm1} ]\] \[ \forall i, \;\;\; \pi(x_i) = x_i,\;\;\; \pi(y_i)=x_i'.\] \end{thm} \begin{proof} Let $J$ be the ideal of $\Z[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]$ that is generated by the set $G$ of defining and cycle polynomials. We know that $J \subseteq K_\Q$, and therefore that $\In_< J \subseteq \In_< K_\Q$. Let $M$ be the monomial ideal generated by the initial terms of the polynomials in $G$. We know that $M \subseteq \In_< J \subseteq \In_< K_\Q$, so we would like to show that $\In_< K_\Q \subseteq M$. Assume (for the purpose of contradiction) that there is some $f\in K_\Q$ such that $\In_<(f)\not\in M$. We may write (assume all $a$, $b$ and $\lambda$ non-zero for simplicity) \begin{equation}\label{form} \In_<(f)= \lambda x_{i_1}^{a_{i_1}} x_{i_2}^{a_{i_2}} \cdots x_{i_k}^{a_{i_k}} y_{j_1}^{b_{j_1}} y_{j_2}^{b_{j_2}} \cdots y_{j_\ell}^{b_{j_\ell}} \end{equation} Note that $\{j_1,j_2,\dots,j_\ell\}$ cannot contain the indices of a directed cycle of unfrozen vertices. Otherwise, it would also contain the indices of a vertex-minimal directed cycle, and $\In_<(f)$ would be a multiple of the initial term of a cycle polynomial, contradicting the assumption that $\In_<(f)\not\in M$. %There cannot be two $\alpha, \beta$ such that $i_\alpha=j_\beta$; otherwise, $\In_<(f)$ would be a multiple of the initial term of a defining polynomial. There cannot be the indices of a directed cycle of unfrozen vertices in $\{j_1,j_2,\dots,j_\ell\}$; otherwise, it would also contain the indices of a vertex-minimal directed cycle, and $\In_<(f)$ would be a multiple of the initial term of a cycle polynomial. % Let $Y\subset [n]$ be the indices of unfrozen vertices which are not in $\{j_1,j_2,\dots,j_\ell\}$, and let $\Q'$ be the ice quiver obtained by freezing the vertices in $\Q$ indexed by $Y$. By the preceding observation, $\Q'$ is an acyclic quiver. % %Notice that the unfrozen vertices of $\Q'$ are indexed by $\{j_1,j_2,\dots,j_\ell\}$; in particular, $\Q'$ does not have a directed cycle of unfrozen vertices; that is, it is acyclic. % There is a natural inclusion \[ \L(\Q)\hookrightarrow \L(\Q') \] induced by inclusions into $\ZZ[x_1^{\pm1},\dots,x_n^{\pm1}]$. This inclusion may be lifted to a ring homomorphism \[ \mu: \ZZ[x_1,\dots,x_n,y_1,\dots,y_n]\rightarrow \ZZ[x_1,\dots,x_n,y_1,\dots,y_n]\] \[ \mu(x_i)=x_i,\;\;\; \mu(y_i) = \left\{\begin{array}{cc} y_i(p_i^++p_i^-) & \text{if }i\in Y \\ y_i & \text{otherwise} \end{array}\right\}\] with the property that $\pi'\circ \mu = \pi$, where $\pi'$ is the map \[ \ZZ[x_1,x_2,\dots,x_n,y_1,y_2,\dots,y_n]\longrightarrow \ZZ[x_1^{\pm1},x_2^{\pm1},\dots,x_n^{\pm1} ]\] defined by $\Q'$ instead of $\Q$. %In particular, $\mu(f)$ must lie in the kernel $K_{\Q'}$ of $\pi'$. We observe that $\In_<(\mu(f))=\In_<(f)$, Each of the variables appearing in the initial term of $f$ are fixed by $\mu$. In lower-order terms of $f$, $\mu$ may introduce monomials in $x$; however, this will never create a term greater than $\In_<(f)$. Hence, %$\In_<(\mu(f))=\In_<(f)$. \[ \In_<(f) = \In_<(\mu(f)) \in \In_<(K_{\Q'})\] Since $\Q'$ is acyclic, it was shown in \cite[Corollary 1.17]{BFZ05} that $\In_<(K_{\Q'})$ is generated by $\{x_iy_i \mid i\in [n]\}$. Hence, $\In_<(f)$ is a multiple of $x_iy_i$ for some $i$. However, this implies that $\In_<(f)$ is a multiple of the initial term of the $i$th defining polynomial in $K_\Q$, contradicting the assumption that $\In_<(f)\not\in M$. It follows that $\In_<(K_\Q)\subset M$. This consequently implies that $\In_<(J)=\In_<(K_\Q)$ and, by the preceding lemma, that $J=K_\Q$. Furthermore, since $\In_<(G)$ generates $\In_<(K_\Q)$, the set $G$ is a Gr\"obner basis for $K_\Q$. % %Consider a monomial (assume all $a$ and $b$ non-zero for simplicity) %\begin{equation}\label{form} %m := x_{i_1}^{a_{i_1}} x_{i_2}^{a_{i_2}} \cdots x_{i_k}^{a_{i_k}} y_{j_1}^{b_{j_1}} y_{j_2}^{b_{j_2}} \cdots y_{j_\ell}^{b_{j_\ell}} %\end{equation} %in $\In_0$, $f^{p-1}$ (mod $p$) has a unique term which is divisible by $z_1^{p-1}z_2^{p-1}\cdots z_n^{p-1}$; and %\item there exists a monomial order $<$ for which $\textrm{in}_< f = z_1z_2\cdots z_n$. %\end{itemize} %To build our collection of radical ideals, decompose $\langle f \rangle\subseteq \mathbb{Q}[z_1,\dots,z_n]$\footnote{something about choice of fields} into its prime components $I_1,\dots, I_r$. Then decompose each sum $I_i+I_j$ into its minimal primes $I_{(i,j),1},\dots, I_{(i,j),s}$. Then decompose all of the various sums $I_{(i_1,j_1),k_1}+I_{(i_2,j_2),k_2}$ into their minimal primes, and so on, until it is no longer possible to obtain new ideals by adding and decomposing. We say that an ideal $J$ is obtained by the sum/decompose process if $J$ is the intersection or sum of any collection of prime ideals obtained at some point during this process. %For example, if we start with $f = xyz$, we get the following prime ideals through the sum/decompose process: $\langle x\rangle, \langle y \rangle, \langle z \rangle, \langle x, y \rangle, \langle x, z \rangle, \langle y, z\rangle, \langle x, y, z\rangle$. We of course also obtain the non-prime ideals $\langle xyz\rangle$, $\langle xy\rangle$, $\langle xz\rangle$, and $\langle yz\rangle$. %\begin{thm}\label{thm:Knutson}(cf. Theorem 2, Lemma 6, Corollary 2 of \cite{Knu09})\footnote{The statement given here is less general than the one that appears in \cite[Theorem 2]{Knu09} and \cite[Lemma 6]{Knu09}. We also change the hypotheses of \cite[Theorem 2]{Knu09}, however, this is harmless as the proof goes through in the exact same way. %} %Let $S := K[z_1,\dots,z_n]$, and let $<$ be a monomial order on $S$. Let $f\in S$ be such that, $\textrm{in}_< f = z_1z_2\cdots z_n$, and, for any prime $p>0$, $f^{p-1}$ (mod $p$) has a unique term which is divisible by $z_1^{p-1}z_2^{p-1}\cdots z_n^{p-1}$. %Let $f\in \mathbb{Z}[z_1,\dots,z_n]$ satisfy the two assumptions given in the description of the sum/decompose process, and let $<$ be a weighting of the variables for which $\textrm{in}_< f = z_1z_2\cdots z_n$. Then, any ideal $J\subseteq \mathbb{Q}[z_1,\dots,z_n]$ obtained via the sum/decompose process is radical and $\textrm{in}_< J$ is a squarefree monomial ideal. Furthermore, if $L$ is another ideal obtained by ``sum/decompose'' then $\textrm{in}_<(J\cap L) = \textrm{in}_< J \cap \textrm{in}_< L$, and $\textrm{in}_<(J+L) = \textrm{in}_< J+\textrm{in}_< L$. %Write $f$ as a product of irreducible polynomials $f = f_1\cdots f_r$, and let $I := \langle f_1,\dots, f_r\rangle$. The $I$ is a radical ideal and $\textrm{in}_< I$ is a Stanley--Reisner ideal. Furthermore, %\begin{enumerate} %\item if $L$ is the intersection or sum of any collection of prime components of $I$ then $L$ is a radical ideal, and $\textrm{in}_0$, $f^{p-1}$ (mod $p$) has a unique term which is divisible by $z_1^{p-1}z_2^{p-1}\cdots z_n^{p-1}$. Write $f$ as a product of irreducible polynomials $f = f_1\cdots f_r$, and let $I := \langle f_1,\dots, f_r\rangle$. Then $I$ is a radical ideal and $\textrm{in}_< I$ is a Stanley--Reisner ideal. Furthermore, if we write %\[ %I = P_1\cap P_2\cap\cdots \cap P_r %\] %where each $P_i$ is a minimal prime then, %\begin{enumerate} %\item any intersection $P_{i_1}\cap\cdots\cap P_{i_k}$ is radical and Gr\"obner degenerates to a squarefree monomial ideal; %\item any sum $P_{i_1}+\cdots+P_{i_k}$, or any component thereof, is radical and Gr\"obner degenerates to a squarefree monomial ideal %\item if $L$ and $M$ are intersections of prime components of $I$, sums of prime components of $I$, or prime components of sums of prime components of $I$, then $\textrm{in}_<(L\cap M) = \textrm{in}_< L \cap \textrm{in}_< M$, and $\textrm{in}_<(L+M) = \textrm{in}_< L+\textrm{in}_< M$. %\end{enumerate} %\end{thm} We will make use of this theorem in the case where $f = \prod_{i=1}^n (x_iy_i-p_i^+-p_i^-)$. Here we take $<$ to be a weighting of the variables where the $y$-variables are much more expensive than the $x$-variables. Observe that $f$ and $<$ satisfy the assumptions of Theorem \ref{thm:Knutson} and the ideal \[ I_\Q := \langle x_iy_i-p_i^+-p_i^-\mid 1\leq i\leq n \rangle. \] lies in the collection of ideals $\mathcal{J}$ from the theorem. %is obtained by the sum/decompose process, and so $I$ is radical. It has an %One easily checks that we are in the context of this theorem for any monomial order of $K[x_1,\dots, x_n,y_1,\dots,y_n]$ where the $y_i$ variables are much more expensive than the $x_i$ variables. Fix such an order $<$, and write down an %$K_Q$ is a minimal prime of $I$ \cite[Lemma 5.7]{BMRS}, and we can write down an Consequently $I$ is radical. We may then write an irredundant prime decomposition \begin{equation}\label{primeDecompositionl} I_\Q = K_\Q\cap P_1\cap\cdots \cap P_r \end{equation} where each $P_i$ is a minimal prime, and $K_\Q$ is the lower bound ideal \cite[Lemma 5.7]{BMRS15}. Consequently, each $P_i+K_\Q\in \mathcal{J}$ and so each $P_i+K_\Q$ is radical and degenerates to a squarefree monomial ideal. \begin{prop}\label{prop:boundarySphere} %Fix a term order $<$ of $S = K[x_1,\dots, x_n,y_1,\dots, y_n]$ where the $y_i$ variables are much more expensive that the $x_i$ variables, and let $K_Q$ and $P_1,\dots, P_r$ be as above. Let $\Q$ be a quiver with a directed cycle, so that there is at least one prime $P_i$ in \eqref{primeDecompositionl}. With respect to a term order where the $y$-variables are much more expensive than the $x$-variables, each prime component of $P_i+K_\Q$ Gr\"obner degenerates to the Stanley--Reisner ideal of a sub-simplicial complex of $\partial \Delta_{K_\Q}$. Furthermore, $\textrm{in}_< ((P_1\cap\cdots \cap P_r) + K_\Q)$ is the Stanley--Reisner ideal of the entire boundary $\partial \Delta_{K_\Q}$. \end{prop} \begin{proof} By Theorem \ref{thm:Knutson}, we have that $P_i+K_\Q$ is radical and Gr\"obner degenerates to a squarefree monomial ideal. Let \[ K_\Q+P_i = \cap_J J \] be a decomposition of $K_\Q+P_i$ into minimal primes. By Theorem \ref{thm:Knutson}, each $\textrm{in}_< J$ is a squarefree monomial ideal. Applying the second part of Theorem \ref{thm:Knutson} and translating into the language of simplicial complexes yields the equality \[ \Delta_{K_\Q+P_i} = \Delta_{K_\Q}\cap \Delta_{P_i} = \cup_J \Delta_J \] where $\Delta_J$ denotes the Stanley--Reisner complex $\textrm{in}_< J$. To prove the first claim of the proposition, we must show that every face of each $\Delta_J$ is contained in the boundary sphere of the simplicial ball $\Delta_{K_\Q}$. So, suppose otherwise, and let $F$ be a face of some $\Delta_J$ which is not contained in the boundary $\partial \Delta_{K_\Q}$. Assume that $F$ is a maximal such face. We claim that $F$ must be a facet of $\Delta_{P_i}$. %, and the union on the right-most side is taken over all minimal primes $J$ of $K_Q+P_i$. To prove this claim, we first apply Theorem \ref{thm:Knutson} to the prime decomposition in equation \eqref{primeDecompositionl} to get %\[ %\langle x_iy_i-p_i^+-p_i^-\mid 1\leq i\leq n \rangle = K_Q\cap P_1\cap\cdots \cap P_r %\] %along with Theorem \ref{thm:Knutson}, we see that \begin{equation}\label{eq:simplicialEquality} \textrm{in}_< I = \textrm{in}_< (K_\Q)\cap \textrm{in}_<(P_1)\cap\cdots \cap \textrm{in}_<(P_r) \end{equation} which, after translating into the language of simplicial complexes, says that $\Delta_{K_\Q}$ and every $\Delta_{P_i}$ is contained in the Stanley--Reisner complex associated to $\textrm{in}_< I = \langle x_iy_i \mid 1\leq i\leq n \rangle$, which can be geometrically realized as the $(n-1)$-dimensional boundary sphere of a cross-polytope on $2n$ vertices. Decompose this simplicial sphere into the union of two $(n-1)$-dimensional simplicial balls: \[ \Delta_I = \Delta_{K_\Q}\cup C, \textrm{ where } C \coloneqq \overline{\Delta_I\smallsetminus \Delta_{K_\Q}}. \] Observe that, by construction, $\Delta_{K_\Q}\cap C$ is the boundary sphere of $\Delta_{K_\Q}$. %Because $\Delta_{K_Q}$ is an $(n-1)$-ball on this $(n-1)$-sphere, we observe the boundary sphere of the cross polytope can be decomposed into the union of two ba% that if $E$ is an interior face of $\Delta_{K_Q}$, $x$ is a vertex not in $E$, and $E\cup \{x\}$ is a face %We now consider the sum $P_i+K_Q$ and show that each face of the Stanley--Reisner complex of its initial ideal lies on the boundary sphere of $K_Q$. %Applying (2), we see that %\[ %\Delta_{K_Q+P_i} = \Delta_{K_Q}\cap \Delta_{P_i} = \cup_J \Delta_J %\] %where the union on the right side is taken over all minimal primes $J$ of $K_Q+P_i$. %So, we must show that every face of each $\Delta_J$ is contained in the boundary of the simplicial ball $\Delta_{K_Q}$. %Suppose otherwise, and let $F$ be a face of some $\Delta_J$ which is interior to $\Delta_{K_Q}$. Assume that $F$ is a maximal such face. %Because $\Delta_{K_Q}$ is an $(n-1)$-ball, Now, suppose that $F$ is not a facet of $\Delta_{P_i}$. Then there is a vertex $z$ such that $F\cup\{z\}$ is a face of $\Delta_{P_i}$. Then, using the decomposition of $\Delta_I$, we see that either $F\cup\{z\}$ is contained in $\Delta_{K_\Q}$, or it is contained in $C$. If $F\cup \{z\}\subseteq \Delta_{K_\Q}$, we contradict the maximality of $F$. If $F\cup\{z\}\in C$, we contradict that $F$ was not contained in the boundary of $\Delta_{K_\Q}$ (since $\Delta_{K_\Q}$ and $C$ only intersect along the boundary of $\Delta_{K_\Q}$). Thus, our maximal face $F$ must be a facet of $\Delta_{P_i}$, which, since $P_i$ is prime, must have dimension one less than the dimension $\mathrm{dim}(S/P_i)$. But this is not possible because $\mathrm{dim}(S/J)$ is strictly smaller than $\mathrm{dim}(S/P_i)$. To obtain the last statement, we translate equality (\ref{eq:simplicialEquality}) into the language of simplicial complexes to see that the union $\cup_{i=1}^r \Delta_{P_i}$ necessarily contains the boundary sphere $\partial \Delta_{K_\Q}$. Thus, so does \[\Delta_{(P_1\cap\cdots \cap P_r)+K_\Q)} = \Delta_{(P_1\cap\cdots\cap P_r)}\cap \Delta_{K_\Q} = \cup_{i=1}^r (\Delta_{P_i}\cap \Delta_{K_\Q}). \] But, as already shown, each $\Delta_{P_i}\cap \Delta_{K_\Q}$ is contained inside of the boundary sphere of $\Delta_{K_\Q}$ and so we are done. \end{proof} We next show that (iii) of Proposition \ref{prop:normalityInGeneral} holds for lower bound algebras. \begin{prop}\label{prop:openSetIsNormal} Let $\mathbb{V}(K_\Q)$ denote the lower bound variety of a quiver $\Q$. Then $\mathbb{V}(K_\Q)\smallsetminus \mathbb{V}(P_1\cap P_2 \cap \cdots \cap P_r)$ is normal\footnote{We note that $\mathbb{V}(P_1\cap P_2\cap\cdots\cap P_r)$ is empty when $\Q$ is acyclic.}. \end{prop} \begin{proof} Consider $q\in \mathbb{V}(K_\Q)$, and define the (possibly empty) set % let $S_q\subset\{1,2,\dots,n\}$ be the set of indices $i$ such that $x_i(q)=0$. \[ S_q \coloneqq \{ i\in \{1,2,\dots,n \} \mid x_i(q) =0 \} \] The vertices indexed by $S_q$ must be unfrozen, since frozen $x$-variables are invertible. First, assume $S_q$ does not contain a directed cycle, and consider the open set \[ U_q \coloneqq \{ q'\in \mathbb{V}(K_\Q) \mid \forall i\not\in S_q,\;x_i(q)\neq 0\} \] The coordinate ring of $U_q$ is the localization of $\L(\Q)$ at the set of $x$-variables which are not in $S_q$; hence, it is isomorphic to the lower bound algebra of the ice quiver $\Q^\dagger$ obtained by freezing the vertices not in $S_q$. This ice quiver is \emph{acyclic}, and so the lower bound algebra coincides with the upper cluster algebra \cite{BFZ05}, which is normal \cite{MulLA}. Hence, $\mathbb{V}(K_\Q)$ is normal at $q$. Next, assume $S_q$ contains a directed cycle, and consider the affine space \[ \mathbb{W}_q \coloneqq \{ q' \in \mathbb{K}^{2n} \mid \forall i, \;x_i(q')=x_i(q),\text{ and } \forall i \not\in S_q,\; y_i(q')=y_i(q)\} \] This contains $q$ and is contained in $\mathbb{V}(K_\Q\cap P_1 \cap \cdots \cap P_r)$. Since $S_q$ contains a directed cycle, there is some cycle polynomial whose leading term is a product of $y$-variables whose indices are contained in $S_q$, and hence cannot vanish on $\mathbb{W}_q$. Hence, $\mathbb{W}_q\not\subset \mathbb{}V(K_\Q)$. By the irreducibility of $\mathbb{W}_q$, we have that $q\in\mathbb{W}_q\subset \mathbb{V}(P_1\cap \cdots\cap P_r)$, and so $q\not\in \mathbb{V}(K_\Q)\smallsetminus \mathbb{V}(P_1\cap \cdots \cap P_r)$. \end{proof} We can now prove that all lower bound algebras are normal. \begin{proof}[Proof of Theorem \ref{thm:normalityOfLowerBounds}] We have already treated the case when $\Q$ is acyclic (i.e. $\mathcal{L}(\Q)$ equals its associated upper cluster algebra, and is hence normal). So assume that $\Q$ contains a cycle. Let $K_\Q$ be the relevant lower bound ideal, and let $P_1,\dots, P_r\subseteq S$ be minimal primes of $\langle x_iy_i-p_i^+-p_i^-\mid 1\leq i\leq n \rangle$ such that \[ \langle x_iy_i-p_i^+-p_i^-\mid 1\leq i\leq n \rangle = K_\Q\cap P_1\cap\cdots \cap P_r. \] Now apply Proposition \ref{prop:normalityInGeneral} with $X = \mathbb{V}(K_\Q)$, and $Y_1,\dots,Y_s$ the irreducible components of the various $\mathbb{V}(P_j + K_\Q)$, $1\leq j\leq r$. Observe that item (i) of Proposition \ref{prop:normalityInGeneral} follows from Theorem \ref{thm:CM}, item (ii) follows from Proposition \ref{prop:boundarySphere}, and item (iii) holds by Proposition \ref{prop:openSetIsNormal}. \end{proof} \appendix \section{The singular locus of $\L(\Q)$}\label{section: singularity} The Cohen--Macaulayness and normality of $\L(\Q)$ may both be regarded as constraints on the singularities of the variety $\mathbb{V}(K_\Q)$. It is then natural to directly consider the singularities of $\mathbb{V}(K_\Q)$. This appendix provides an example to demonstrate that, even in the most elementary cases, even the existence of singularities in $\mathbb{V}(K_\Q)$ can be difficult to predict, suggesting a direct study of of the singularities of $\mathbb{V}(K_\Q)$ may be daunting. Fix an algebraically closed field $\mathbb{K}$. Let $\Q_n$ denote the ice quiver with vertex set $\{1,2,\dots,n\}$, an arrow from $i$ to $i+1$ for each $1\leq i m$, the element $x_i'$ is not technically a cluster variable, but treating it as one streamlines the process.} \begin{equation}%\label{eq: mutation} x_i' \coloneqq \left\{\begin{array}{cc} x_i^{-1}(p_i^++p_i^-) & \text{if $i\in \{1,2,\dots, m\}$} \\ x_i^{-1} & \text{if $i\in \{m+1,m+2,\dots,n\}$} \end{array}\right\} \end{equation} The \textit{lower bound algebra} $\L(\B)$ defined by $\B$ is the subalgebra of $\ZZ[x_1^{\pm1},\dots,x_n^{\pm1}]$ generated by the variables $x_1,\dots,x_n$ and the adjacent cluster variables $x_1',\dots,x_n'$. \begin{ex} Consider the following $3\times 2$ matrix $\B$, which is skew-symmetrizable with the given $\mathsf{D}$. \[ \B := \gmat{0 & 3 \\ -2 & 0 \\ 1 & 2},\;\;\; \mathsf{D}:= \gmat{ 3 & 0 \\ 0 & 2} \] The three adjacent cluster variables are below. \[ x_1' = \frac{x_3 + x_2^2}{x_1} ,\;\;\; x_2' = \frac{x_1^3x_3^2+1}{x_2},\;\;\; x_3' = x_3^{-1} \] \end{ex} %\[ \L(\Q) := \text{subalgebra of }\ZZ[x_1^{\pm1},\dots,x_n^{\pm1}]\text{ generated by }\{x_1,x_2,\dots,x_n,x_1',x_2',\dots,x_n'\} \] %The set $\{x_1,x_2,\dots,x_n,x_1',x_2',\dots,x_n'\}$ is a subset of the set of cluster variables of the cluster algebra associated to $\Q$.\footnote{We remark that a lower bound algebra is determined by a \emph{seed} in a cluster algebra, and not just by the cluster algebra itself. Hence, a single cluster algebra may be associated to many non-isomorphic lower bound algebras.} %\begin{figure}[h!t] %\begin{tikzpicture}[scale=1.5] % \node[mutable] (1) at (-1,0) {$1$}; % \node[mutable] (2) at (0,0) {$2$}; % \node[mutable] (3) at (1,.5) {$3$}; % \node[frozen] (4) at (1,-.5) {$4$}; % \draw[-angle 90,relative,out=15,in=165] (1) to (2); % \draw[-angle 90,relative,out=-15,in=-165] (1) to (2); % \draw[-angle 90] (2) to (3); % \draw[-angle 90] (2) to (4); %\end{tikzpicture} %\caption{An ice quiver (the unique frozen vertex is depicted as a square)} %\label{fig: mutationexample} %\end{figure} % %\begin{ex} %Consider the ice quiver $\Q$ in Figure \ref{fig: mutationexample}. The four adjacent cluster variables are below. %\[ x_1' = \frac{x_2^2+1}{x_1},\;\;\; x_2'=\frac{x_3x_4+x_1^2}{x_2},\;\;\; x_3'=\frac{1+x_2}{x_3},\;\;\; x_4'=\frac{1}{x_4} \] %\end{ex} To translate prior results into the generality of exchange matrices, we associate an ice quiver $\Q(\B)$ to $\B$. The vertex set of $\Q(\B)$ is the set $\{1,2,\dots,n\}$, the frozen vertex set is $\{m+1,m+2,\dots,n\}$, and there is an arrow from $i$ to $j$ if $\B_{ji}>0$ or $\B_{ij}<0$ (and no other arrows). The lower bound algebra $\L(\B)$ is \emph{not} the lower bound algebra of the ice quiver $\Q(\B)$; the arrows in $\Q(\B)$ only keep track of the sign of entries in $\B$. The results and proof in this paper hold verbatim for $\L(\B)$, using $\Q(\B)$ in place of $\Q$, for two key reasons. \begin{itemize} \item Our arguments never use the specific exponent of the monomials $p_i^\pm$; rather, we only need to know \emph{if} a variable $x_j$ divides $p_i^\pm$, which corresponds to the existence of an arrow in $\Q(\B)$. \item When $\Q(\B)$ is acyclic, the presentation of $\L(\B)$ given in \cite[Corollary 1.17]{BFZ05} and used in the proof of Theorem \ref{thm: grobner} is still valid in the larger generality of skew-symmetrizable cluster algebras. \end{itemize} \begin{rem} The body of the paper is not in this larger generality for reasons of clarity and exposition, rather than any mathematical limitations. \end{rem} %\footnote{We emphasize that $\L(\B)$ is \emph{not} the lower bound algebra defined by the quiver $\Q(\B)$. The quiver $\Q(\B)$ can have at most one arrow between any pair of vertices.} % %\begin{prop} %Given any directed cycle of unfrozen vertices in $\Q(\B)$, the cycle relation in $\L(\B)$ given by the formula \eqref{eq: cycle} holds. %\end{prop} %\begin{proof} %The proof of Proposition \ref{???} holds verbatim. The key facts are that $x_{v_{i+1}}$ divides $p_i^+$ and $x_{v_{i-1}}$ divides $p_i^-$. %\end{proof} % %\begin{prop} %The defining polynomials, together with the cycle polynomials of vertex-minimal directed cycles in $\Q(\B)$, form a Gr\"obner basis for the ideal of relations in $\L(\B)$, with respect to any term order in which the $y$-variables are much more expensive than the $x$-variables. %\end{prop} % %\begin{prop} %For any exchange matrix $\B$, the algebra $\L(\B)$ is Cohen--Macaulay and normal. %\end{prop} \subsubsection*{Acknowledgements} This paper is the result of a summer 2015 REU project at the University of Michigan. This project was supported by Karen Smith's NSF grant DMS-1001764. We are also grateful to Sergey Fomin for numerous helpful comments on an early draft of this note. \bibliography{ALCO_Muller_13-e} \bibliographystyle{mersenne-plain} %\begin{thebibliography}{9} %\bibitem{decomp} % Knutson, \emph{Geometric Vertex Decompositions}. Talk given at FPSAC '04. \textbf{[url?]} %\bibitem{acyclic} % Benito, Muller, Rajchgot, and Smith, % \emph{Singularities of Locally Acyclic Cluster Algebras}. % \url{http://arxiv.org/abs/1404.4399}. %\bibitem{cluster} % Berenstein, Fomin, and Zelevinsky,`% \emph{Cluster Algebras III: Upper Bounds and Double Bruhat Cells}. % \url{http://arxiv.org/abs/math/0305434}. %\end{thebibliography} \end{document}