carlostoxtli's picture
Upload Conjecture Context Ablation v1.0.0 (part 6)
5eedb59 verified
Raw History Blame Contribute Delete
108 kB
[
{
"author": "Alexandra Seceleanu",
"expected_output": "\\label{thm: reg} Let $G$ be a bipartite graph with adjacency matrix $A$. Then \\[ \\reg(R/I_G)\\leq \\brank(A). \\]",
"actual_output": "\\begin{theorem}\nLet $G=(X\\sqcup Y,E)$ be a bipartite graph with edge ideal $I_G\\subset R$ and biadjacency matrix $A(G)$. Suppose that $\\{C_1,\\dots,C_r\\}$ is a biclique cover of $G$ so that $bc(G)=r$, where by definition $bc(G)=\\operatorname{brank}(A(G))$. Since each biclique $C_i$ has edge ideal $I_{C_i}$ satisfying $\\operatorname{reg}(R/I_{C_i})=1$ (by Lemma 2.2 of Nagel and Corso), it follows from Proposition [reg sum] that\n\n\\[\n\\operatorname{reg}(R/I_G)=\\operatorname{reg}\\bigl(R/(I_{C_1}+\\cdots+I_{C_r})\\bigr)\n\\le \\operatorname{reg}(R/I_{C_1})+\\cdots+\\operatorname{reg}(R/I_{C_r}) = r.\n\\]\n\nIn particular, the Castelnuovo--Mumford regularity of the edge ideal satisfies\n\n\\[\n\\operatorname{reg}(R/I_G)\\le bc(G)=\\operatorname{brank}(A(G)).\n\\]\n\\end{theorem}\n",
"input": "Given the following results, definitions, and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"\\\\begin{definition}\\nThe \\\\textit{Booleans}, $\\\\Bc$, are defined to be the semiring on $\\\\{0,1\\\\}$ equipped with operations $\\\\vee$ (logical ''or\\\") and $\\\\wedge$ (logical ''and\\\") specified in the tables below:\\n\\\\[ \\\\begin{tabular}{c|cc}\\n $\\\\vee$ & 0 & 1 \\\\\\\\\\n \\\\hline\\n 0 & 0 & 1\\\\\\\\\\n 1 & 1 & 1\\n\\\\end{tabular} \\\\qquad \\\\begin{tabular}{c|cc}\\n $\\\\wedge$ & 0 & 1 \\\\\\\\\\n \\\\hline\\n 0 & 0 & 0\\\\\\\\\\n 1 & 0 & 1\\n\\\\end{tabular} \\\\]\\n\\\\end{definition}\",\"Note that $\\\\Bc$ is \\\\textit{not} a field, or even a ring, as there is no additive inverse. This fact makes the notion of Boolean rank as well as the related problem of finding matrix factorizations for matrices with entries in $\\\\Bc$ difficult as many standard matrix factorization techniques fail to work outside the realm of rings and fields.\\n\\nDenote by $\\\\Bc^{m,n}$ the set of $m\\\\times n$ matrices with entries in $\\\\Bc$. For matrices $V\\\\in \\\\Bc^{m,r}, H\\\\in \\\\Bc^{r,n}$ we write $V\\\\wedge H$ to mean Boolean matrix multiplication. This is defined by analogy with matrix multiplication over a ring, with addition replaced by $\\\\vee$ and multiplication by $\\\\wedge$, that is, \\\\[ [V\\\\wedge H]_{ij}=\\\\bigvee_{\\\\ell=1}^r V_{i\\\\ell}\\\\wedge H_{\\\\ell j}. \\\\]\",\"\\\\begin{definition}\\\\label{def:brank}\\n The \\\\textit{Boolean rank} of an $m\\\\times n$ binary matrix $A\\\\in \\\\Bc^{m,n}$ is\\n \\n \\\\[\\n \\\\brank(A)=\\\\text{min}\\\\{r \\\\mid A = V\\\\wedge H,V\\\\in \\\\Bc^{m,r}, H\\\\in \\\\Bc^{r,n} \\\\}.\\n \\\\]\\n\\\\end{definition}\",\"\\\\begin{definition}\\nA \\\\textit{free resolution} of a finitely generated $R$-module $M$ is a sequence of homomorphisms of $R$-modules\\n\\\\[ F_\\\\bullet = 0 \\\\to F_r \\\\xrightarrow{d_{r}} \\\\ldots \\\\xrightarrow{d_1} F_0 \\\\xrightarrow{d_0} M \\\\to 0 \\\\]\\nsuch that $F_\\\\bullet$ is exact, each $F_i$ is a finitely generated free $R$-module and $M \\\\cong F_0/\\\\text{Im}(d_1)$.\\nThe ring $R$ and the $R$-module $M$ are \\\\textit{$\\\\mathbb{N}$-graded} if there exits decompositions $R= \\\\bigoplus_{i=0}^\\\\infty R_i$ and $M= \\\\bigoplus_{i=0}^\\\\infty M_i$ with $R_mR_n\\\\subseteq R_{m+n}$ and $R_mM_n\\\\subseteq M_{m+n}$ for all $m,n\\\\geq 0$.\\nIf $R$ and $M$ are graded, and the map $d_i$ preserves degrees, we call $F_\\\\bullet$ a \\\\textit{graded free resolution.}\\nA free resolution $F_\\\\bullet$ is called a \\\\textit{minimal free resolution} if\\n\\\\[ d_{i+1}(F_{i+1})\\\\subseteq (x_1,\\\\ldots,x_n)F_i \\\\text{ for all } i\\\\geq 0.\\n\\\\]\\n\\\\end{definition}\",\"\\\\begin{definition} Let $M$ be a graded $R$-module with minimal free resolution\\n\\\\[ F_\\\\bullet = 0 \\\\to F_r \\\\xrightarrow{d_{r}} \\\\ldots \\\\xrightarrow{d_1} F_0 \\\\xrightarrow{d_0} M \\\\to 0. \\\\]\\nThe number of elements of degree $j$ in any homogeneous basis of $F_i$, denoted $\\\\beta^R_{i,j}(M)$, is called the {\\\\em $i$-th graded Betti number of $M$ in degree $j$}.\\n\\\\end{definition}\",\"\\\\begin{definition} The \\\\textit{Castelnuovo-Mumford regularity} (or just \\\\textit{regularity}) of $M$ over $R$, denoted $\\\\reg_R(M)$, is defined as\\n\\\\[ \\\\reg_R(M)=\\\\text{max}\\\\{j\\\\mid \\\\beta_{i,i+j}^R(M)\\\\neq 0 \\\\text{ for some $i$}\\\\}. \\\\]\\nWe often drop the subscript $R$, writing $\\\\reg(M)$ when the ring $R$ is evident.\\n\\\\end{definition}\",\"\\\\begin{definition}\\n An ideal $I$ of a polynomial ring is a \\\\textit{monomial ideal} if it can be generated by monomials, that is $I = (f_1,\\\\ldots,f_k)$, where the generators, $f_i$, are monomials for all $i$.\\n\\\\end{definition}\",\"\\\\begin{definition} Let $G=(V,E)$ be a finite, simple graph with vertex set $V=\\\\{x_1,\\\\ldots, x_n\\\\}$ and edge set $E$. Meaning, we will not consider graphs with multiple edges between vertices or loops. Let $R=k[x_1,\\\\ldots,x_n]$ be the polynomial ring over a field $k$. The \\\\textit{edge ideal of $G$} in $R$ is defined as the ideal generated by monomials representing the edges of $G$, that is,\\n \\\\[\\n I_G=\\\\left(x_ix_j:\\\\{x_i,x_j\\\\} \\\\in E\\\\right)\\n \\\\]\\n\\\\end{definition}\",\"Castelnuovo-Mumford regularity of an edge ideal is related to the induced matching number of the graph. A matching is a set of edges where no two edges share a vertex. An \\\\textit{induced matching }in a graph $G$ is a matching which forms an induced subgraph of $G$. We denote by $\\\\text{indmatch}(G)$ the maximum number of edges in any induced matching.\",\"\\\\begin{definition}\\\\label{def:biclique} A \\\\textit{bipartite graph} is a graph whose vertices can be divided into disjoint sets $X$ and $Y$ so that every edge connects a vertex in $X$ to one in $Y$. We denote a bipartite graph with vertex sets $X$ and $Y$ as $G=(X\\\\sqcup Y,E)$. \\\\noindent A \\\\textit{biclique} is a complete bipartite graph. \\\\noindent A \\\\textit{biclique cover} of a bipartite graph $G$ is a collection of bicliques $\\\\{C_i =(X_i\\\\cup Y_i, E_i); i = 1,\\\\ldots, t\\\\}$ with each $X_i\\\\subseteq X$, $Y_i\\\\subseteq Y$ and $E_i\\\\subseteq E$ such that $\\\\bigcup_{i=1}^t E_i = E$. \\\\noindent The \\\\textit{biclique cover number} of a graph $G$, denoted $\\\\text{bc}(G)$, is the smallest number of bicliques in any biclique cover of $G$. \\\\end{definition}\",\"\\\\begin{definition} Let $G=(X\\\\sqcup Y,E)$ be a bipartite graph with vertex sets $X=\\\\{x_1,\\\\ldots,x_m\\\\}$ and $Y= \\\\{y_1,\\\\ldots,y_n\\\\}$. The \\\\textit{biadjacency matrix} is the $m\\\\times n$ matrix $A(G)$ in which $a_{i,j} = 1$ if $(x_i, y_j) \\\\in E$ and $a_{ij}=0$ otherwise. \\\\end{definition}\"] Results: [\"Within the class of monomial ideals, regularity behaves in a subaditive manner, as shown by the following result.\\n\\n\\\\begin{proposition}{\\\\cite{Herzog}}\\\\label{thm: reg sum} Let $I$ and $J$ be monomial ideals. Then \\\\[ \\\\reg(I+J)\\\\leq reg(I)+reg(J) \\\\] \\\\end{proposition}\",\"\\\\begin{corollary}\\\\label{2.9} For a finite collection $\\\\{I_\\\\lambda\\\\}$ of monomial ideals, \\\\[ \\\\reg\\\\left(\\\\sum_{\\\\lambda} I_\\\\lambda\\\\right)\\\\leq \\\\reg(I_1)+\\\\ldots + \\\\reg(I_\\\\lambda). \\\\] \\\\end{corollary}\",\"\\\\begin{lemma}\\\\cite[Lem.\\\\,2.2]{Katzman}\\\\label{lem:indmatch} For any graph $G$, we have $\\\\reg(R/I_G)\\\\geq \\\\text{indmatch}(G)$. \\\\end{lemma}\",\"For a bipartite graph $G$, the \\\\textit{biclique cover number} of $G$ is equal to the \\\\textit{Boolean rank} of $A(G)$; see \\\\cite{RecentDevs}. That is, \\\\begin{equation}\\\\label{eq: bc=brank} \\\\text{bc}(G)=\\\\brank(A(G)). \\\\end{equation}\",\"\\\\begin{lemma}\\\\cite[Cor.\\\\,2.2]{NagelCorso}\\\\label{lem: regularity biclique} If $C$ is a biclique with edge ideal $I_C$, then \\\\[ \\\\reg(R/I_C)=1. \\\\] \\\\end{lemma}\"] Notation: [\"\\\\newcommand{\\\\B}{\\\\mathbb{B}} \\\\newcommand{\\\\Bc}{\\\\mathcal{B}} \\\\newcommand{\\\\Dc}{\\\\mathcal{D}} \\\\DeclareMathOperator{\\\\reg}{reg} \\\\DeclareMathOperator{\\\\bc}{bc} \\\\DeclareMathOperator{\\\\sgn}{sgn} \\\\DeclareMathOperator{\\\\brank}{brank} \\\\DeclareMathOperator{\\\\sep}{sep} \\\\DeclareMathOperator{\\\\soc}{socle} \\\\DeclareMathOperator{\\\\indmatch}{indmatch} \\\\DeclareMathOperator{\\\\fc}{fc}\",\"The \\\\textit{Booleans}, $\\\\Bc$, are defined to be the semiring on $\\\\{0,1\\\\}$ equipped with operations $\\\\vee$ (logical ''or\\\") and $\\\\wedge$ (logical ''and\\\") specified in the tables below:\",\"Denote by $\\\\Bc^{m,n}$ the set of $m\\\\times n$ matrices with entries in $\\\\Bc$. For matrices $V\\\\in \\\\Bc^{m,r}, H\\\\in \\\\Bc^{r,n}$ we write $V\\\\wedge H$ to mean Boolean matrix multiplication. This is defined by analogy with matrix multiplication over a ring, with addition replaced by $\\\\vee$ and multiplication by $\\\\wedge$, that is, \\\\[ [V\\\\wedge H]_{ij}=\\\\bigvee_{\\\\ell=1}^r V_{i\\\\ell}\\\\wedge H_{\\\\ell j}. \\\\]\",\"Let $R=k[x_1,\\\\dots,x_n]$ denote a polynomial ring in $n$ variables, with $k$ a field.\",\"The \\\\textit{Boolean rank} of an $m\\\\times n$ binary matrix $A\\\\in \\\\Bc^{m,n}$ is \\\\[ \\\\brank(A)=\\\\text{min}\\\\{r \\\\mid A = V\\\\wedge H,V\\\\in \\\\Bc^{m,r}, H\\\\in \\\\Bc^{r,n} \\\\}. \\\\]\",\"Let $G=(V,E)$ be a finite, simple graph with vertex set $V=\\\\{x_1,\\\\ldots, x_n\\\\}$ and edge set $E$. Let $R=k[x_1,\\\\ldots,x_n]$ be the polynomial ring over a field $k$. The \\\\textit{edge ideal of $G$} in $R$ is defined as the ideal generated by monomials representing the edges of $G$, that is, \\\\[ I_G=\\\\left(x_ix_j:\\\\{x_i,x_j\\\\} \\\\in E\\\\right) \\\\]\",\"A \\\\textit{bipartite graph} is a graph whose vertices can be divided into disjoint sets $X$ and $Y$ so that every edge connects a vertex in $X$ to one in $Y$. We denote a bipartite graph with vertex sets $X$ and $Y$ as $G=(X\\\\sqcup Y,E)$. \\\\noindent A \\\\textit{biclique} is a complete bipartite graph. \\\\noindent A \\\\textit{biclique cover} of a bipartite graph $G$ is a collection of bicliques $\\\\{C_i =(X_i\\\\cup Y_i, E_i); i = 1,\\\\ldots, t\\\\}$ with each $X_i\\\\subseteq X$, $Y_i\\\\subseteq Y$ and $E_i\\\\subseteq E$ such that $\\\\bigcup_{i=1}^t E_i = E$. \\\\noindent The \\\\textit{biclique cover number} of a graph $G$, denoted $\\\\text{bc}(G)$, is the smallest number of bicliques in any biclique cover of $G$.\",\"Let $G=(X\\\\sqcup Y,E)$ be a bipartite graph with vertex sets $X=\\\\{x_1,\\\\ldots,x_m\\\\}$ and $Y= \\\\{y_1,\\\\ldots,y_n\\\\}$. The \\\\textit{biadjacency matrix} is the $m\\\\times n$ matrix $A(G)$ in which $a_{i,j} = 1$ if $(x_i, y_j) \\\\in E$ and $a_{ij}=0$ otherwise.\",\"\\\\begin{equation}\\\\label{eq: bc=brank} \\\\text{bc}(G)=\\\\brank(A(G)). \\\\end{equation}\",\"\\\\begin{proposition}{\\\\cite{Herzog}}\\\\label{thm: reg sum} Let $I$ and $J$ be monomial ideals. Then \\\\[ \\\\reg(I+J)\\\\leq reg(I)+reg(J) \\\\] \\\\end{proposition}\",\"\\\\begin{lemma}\\\\cite[Cor.\\\\,2.2]{NagelCorso}\\\\label{lem: regularity biclique} If $C$ is a biclique with edge ideal $I_C$, then \\\\[ \\\\reg(R/I_C)=1. \\\\] \\\\end{lemma}\",\"\\\\begin{lemma}\\\\cite[Lem.\\\\,2.2]{Katzman}\\\\label{lem:indmatch} For any graph $G$, we have $\\\\reg(R/I_G)\\\\geq \\\\text{indmatch}(G)$. \\\\end{lemma}\"]"
},
{
"author": "Alexandra Seceleanu",
"expected_output": "\\label{thm: identity complement} Let $A$ be an $n\\times n$ Boolean identity complement matrix and let $G$ be the corresponding bipartite graph. Then \\begin{enumerate} \\item The regularity of $R/I_G$ is 2. \\item The isolation number of $A$ is 3. \\end{enumerate}",
"actual_output": "\\begin{theorem}\nLet $G$ be a bipartite graph with no isolated vertices and let $A$ be its Boolean (i.e., $0$--$1$) adjacency matrix. Suppose that\n\\begin{enumerate}\n\\item the edge ideal $I_G$ of $G$ may be decomposed as a sum of biclique edge ideals---that is, there exists a cover $\\{C_1,\\dots,C_m\\}$ of $G$ by bicliques such that $I_G=I_{C_1}+\\cdots+I_{C_m}$; and\n\\item the isolation number of $A$ attains the Boolean rank, i.e. $\\iota(A)=\\operatorname{brank}(A)$.\n\\end{enumerate}\nThen, combining Proposition [Herzog] and Corollary 2.9 with Lemmas [indmatch] and [regularity biclique] and Theorem [isolation number = reg], we have\n\\[\n\\operatorname{indmatch}(G)\\le \\operatorname{reg}(R/I_G)=\\iota(A)=\\operatorname{brank}(A)=\\operatorname{bc}(G).\n\\]\nIn particular, under these conditions the Castelnuovo--Mumford regularity of the edge ideal of $G$ is completely determined by the isolation number (or, equivalently, the Boolean rank) of its adjacency matrix.\n\\end{theorem}\n",
"input": "Given the following previous results, write a theorem that will be useful in proving the paper. Previous results: [\"Proposition{\\\\cite{Herzog}}\\\\label{thm: reg sum} Let $I$ and $J$ be monomial ideals. Then \\\\[ \\\\reg(I+J)\\\\leq reg(I)+reg(J) \\\\]\",\"Corollary\\\\label{2.9} For a finite collection $\\\\{I_\\\\lambda\\\\}$ of monomial ideals, \\\\[ \\\\reg\\\\left(\\\\sum_{\\\\lambda} I_\\\\lambda\\\\right)\\\\leq \\\\reg(I_1)+\\\\ldots + \\\\reg(I_\\\\lambda). \\\\]\",\"Lemma\\\\cite[Lem.\\\\,2.2]{Katzman}\\\\label{lem:indmatch} For any graph $G$, we have $\\\\reg(R/I_G)\\\\geq \\\\text{indmatch}(G).$\",\"Lemma\\\\cite[Cor.\\\\,2.2]{NagelCorso}\\\\label{lem: regularity biclique} If $C$ is a biclique with edge ideal $I_C$, then \\\\[ \\\\reg(R/I_C)=1. \\\\]\",\"Theorem\\\\label{thm: reg} Let $G$ be a bipartite graph with adjacency matrix $A$. Then \\\\[ \\\\reg(R/I_G)\\\\leq \\\\brank(A). \\\\]\",\"Corollary Let $G$ be a bipartite graph with adjacency matrix $A$. Then \\\\begin{equation}\\\\label{eq: inequalities} \\\\indmatch(G) \\\\leq \\\\reg(R/I_G) \\\\leq \\\\brank(A) = \\\\bc(G). \\\\end{equation}\",\"Proposition\\\\cite[Prop.\\\\,2]{DeSantis21}\\\\label{prop: iso-brank} Let $A\\\\in \\\\Bc^{m,n}$. Then \\\\[ \\\\iota(A) \\\\leq \\\\brank(A). \\\\]\",\"Theorem\\\\label{thm: isolation number = reg} Let $A$ be a Boolean matrix and let $S=k[A]/J_A$ be the quotient ring of the isolation ideal. Then \\\\[ \\\\reg(S) = \\\\iota(A) = \\\\dim(\\\\Delta_A) +1 \\\\leq \\\\brank(A). \\\\]\",\"Theorem\\\\cite[Thm.\\\\,4.2]{NagelCorso}\\\\label{thm:FerrersIdealReg} Let $G$ be a bipartite graph without isolated vertices. Then its edge ideal, $I_G$, has regularity 2 (equivalently, $\\\\reg(R/I_G)=1$) if and only if $G$ is a Ferrers graph.\"]"
},
{
"author": "Alexandra Seceleanu",
"expected_output": "\\label{thm: isolation number = reg} Let $A$ be a Boolean matrix and let $S=k[A]/J_A$ be the quotient ring of the isolation ideal. Then \\[ \\reg(S) = \\iota(A) = \\dim(\\Delta_A) +1 \\leq \\brank(A). \\]",
"actual_output": "\\begin{theorem}[Regularity Equals the Isolation Number]\nLet $A$ be an $m\\times n$ Boolean matrix and let $J_A\\subset k[A]$ be its isolation ideal as defined in (\\ref{eq: J}). Suppose that $S= k[A]/J_A$ is the corresponding Artinian quotient. Then the Castelnuovo--Mumford regularity of $S$ is given by\n\\[\n\\operatorname{reg}(S)=\\iota(A).\n\\]\nEquivalently, a square\\-free monomial $m=x_{i_1j_1}\\cdots x_{i_sj_s}$ is of top degree in $S$ if and only if the set $\\{a_{i_1j_1},\\ldots,a_{i_sj_s}\\}$ is an isolated set of maximum cardinality in $A$.\n\\end{theorem}",
"input": "Given the following previous results, write a theorem that will be useful in proving the paper. Previous results: [\"{\\\\cite{Herzog}}\\\\label{thm: reg sum} Let $I$ and $J$ be monomial ideals. Then \\\\[ \\\\reg(I+J)\\\\leq reg(I)+reg(J) \\\\]\",\"\\\\begin{corollary}\\\\label{2.9} For a finite collection $\\\\{I_\\\\lambda\\\\}$ of monomial ideals, \\\\[ \\\\reg\\\\left(\\\\sum_{\\\\lambda} I_\\\\lambda\\\\right)\\\\leq \\\\reg(I_1)+\\\\ldots + \\\\reg(I_\\\\lambda). \\\\] \\\\end{corollary}\",\"\\\\begin{lemma}\\\\cite[Lem.\\\\,2.2]{Katzman}\\\\label{lem:indmatch} For any graph $G$, we have $\\\\reg(R/I_G)\\\\geq \\\\text{indmatch}(G)$. \\\\end{lemma}\",\"\\\\begin{definition}\\\\label{def: isolated} Let $A\\\\in \\\\Bc^{m\\\\times n}$. A pair of entries $\\\\{a_{ij},a_{k\\\\ell}\\\\}$ is called \\\\textit{isolated} if $a_{ij}=a_{k\\\\ell}=1$ and $a_{i\\\\ell}\\\\wedge a_{kj}=0$. A subset $T$ of the entries of $A$ which have value $1$ is an \\\\textit{isolated set} if it is of size one or all pairs of elements in $S$ are isolated. We say that $a_{ij}$ is \\\\textit{isolated from} $a_{k\\\\ell}$ if $\\\\{a_{ij},a_{k\\\\ell}\\\\}$ is an isolated pair.\\\\\\\\ \\\\noindent The \\\\textit{isolation number} of a Boolean matrix $A$, $\\\\iota(A)$ is the maximum of the sizes of all isolated sets in $A$. \\\\end{definition}\",\"\\\\begin{proposition}\\\\cite[Prop.\\\\,2]{DeSantis21}\\\\label{prop: iso-brank} Let $A\\\\in \\\\Bc^{m,n}$. Then \\\\[ \\\\iota(A) \\\\leq \\\\brank(A). \\\\] \\\\end{proposition}\",\"\\\\begin{definition}\\\\label{def: Delta} Let $\\\\Delta_A$ be the simplicial complex whose faces are the isolated sets of the matrix $A$. Since each entry of $A$ that is a 1 is an isolated set of size one, these will be the vertices of $\\\\Delta_A$. \\\\end{definition}\",\"\\\\begin{definition}\\\\label{def: A} Let $A\\\\in\\\\Bc^{m\\\\times n}$. Define the matrix $A[x]$ as follows \\\\[ A[x]_{i,j}=\\\\begin{cases} x_{ij}& a_{ij}=1\\\\\\\\ 0 & a_{ij}=0 \\\\end{cases}. \\\\] \\\\end{definition}\",\"\\\\begin{definition} Let $k[A]= k[x_{ij} \\\\mid a_{ij}=1]$ be a ring with indeterminates corresponding to the nonzero entries of $A[x]$. Denote $I_{\\\\Delta_A}\\\\subset k[A]$ the {\\\\em Stanley-Reisner ideal} of $\\\\Delta_A$ \\\\begin{equation}\\\\label{eq: SR ideal} I_{\\\\Delta_A}=\\\\left\\\\{ \\\\prod_{a_{ij}\\\\in S} x_{ij} \\\\mid S \\\\not \\\\in \\\\Delta\\\\right\\\\}. \\\\end{equation} This ideal is generated by monomials corresponding to non-faces of $\\\\Delta_A$, that is the \\\\textit{non-isolated} sets of $A$. \\\\end{definition}\",\"\\\\begin{lemma}\\\\label{lem: 2x2 minors} Let $A\\\\in \\\\Bc^{m,n}$. Entries $a_{ij}$ and $a_{k\\\\ell}$ are an isolated pair, if and only if $x_{ij}x_{k\\\\ell}\\\\in I_2(A)$. \\\\end{lemma}\",\"\\\\begin{theorem}\\\\label{thm: monomials=isolated} Let $A$ be an $m\\\\times n$ Boolean matrix. If for some integer $s\\\\geq 2$ the monomial $x_{i_1 j_1}\\\\cdots x_{i_sj_s}\\\\in I_s(A[x])$ then $\\\\{a_{i_k j_k}\\\\mid 1\\\\leq k\\\\leq s\\\\}$ is an isolated set. \\\\end{theorem}\",\"\\\\begin{corollary} Utilizing the notation in \\\\eqref{eq: SR ideal}, we have \\\\[ I_{\\\\Delta_A}= \\\\big (x_{ij}x_{k\\\\ell}:x_{ij}x_{k\\\\ell}\\\\not \\\\in I_2(A(x))\\\\big ). \\\\] \\\\end{corollary}\",\"\\\\begin{definition} The \\\\textit{isolation ideal}, $J_A$, of an $m\\\\times n$ Boolean matrix $A$ is the ideal of $k[A]$ defined by \\\\begin{equation}\\\\label{eq: J} J_A = I_{\\\\Delta_A} + \\\\left(x_{ij}^2: 1\\\\leq i\\\\leq m,1\\\\leq j\\\\leq n, a_{ij}=1 \\\\right). \\\\end{equation} \\\\end{definition}\",\"\\\\begin{lemma}[{\\\\cite[Theorem 18.4]{Peeva}}]\\\\label{lem: reg=top degree} If $S$ is an Artinian quotient of a polynomial ring (that is, $\\\\dim_k(S)$ is finite) then, $\\\\reg(S)=\\\\max\\\\{i\\\\mid S_i\\\\neq 0\\\\}$. \\\\end{lemma}\",\"\\\\begin{lemma}\\\\label{lem: top socle=top isolated} Let $A$ be a Boolean matrix with isolation ideal $J_A$. A square-free monomial $m=x_{i_1j_1}\\\\cdots x_{i_sj_s}$ is a nonzero element of $S=k[A]/J_A$ if and only if $\\\\{a_{i_1j_1},\\\\ldots, a_{i_sj_s}\\\\}$ is an isolated set in $A$. Moreover $m$ is of top degree in $S$ if and only if the corresponding isolated set has cardinality $s=\\\\iota(A)$. \\\\end{lemma}\"]"
},
{
"author": "Jordan Bounds",
"expected_output": "\\label{central} Let $f:N_r\\rightarrow N_r$ be a linear map such that $[f(x),x]\\in Z(N_r)$ for all $x\\in N_r$. Then there exist $\\lambda\\in F$ and additive $\\mu:N_r\\rightarrow\\Omega$ such that $f(x)=\\lambda x+\\mu(x)$ for all $x\\in N_r$.",
"actual_output": "\\begin{theorem}\nLet $F$ be a field of characteristic zero and let $N_n=N_n(F)$ denote the ring of $n\\times n$ strictly upper triangular matrices (with $n\\ge 4$) over $F$, whose center is $Z(N_n)$. Suppose that $f\\colon N_n\\to N_n$ is a linear map satisfying the commuting property\n\\[\n[f(A),A]=0\\quad\\text{for all }A\\in N_n.\n\\]\nAssume furthermore that there exists a set $S=S_1\\cup S_2$ spanning $N_n$, where\n\\[\nS_1=\\{D^{-1}JD:\\ D=\\sum_{i=1}^n d_i e_{ii}\\text{ with }\\prod_{i=1}^n d_i\\neq0\\},\n\\]\nand\n\\[\nS_2=\\{T_{i,j}^{-1}JT_{i,j}:\\ T_{i,j}=I_n-e_{ij}\\},\n\\]\nwith\n\\[\nJ=\\sum_{i=1}^{n-1} e_{i,i+1},\n\\]\nand $\\{e_{ij}\\}$ the standard matrix units. Then there exist a scalar $\\lambda\\in F$ and an additive map $\\mu\\colon N_n\\to\\Omega$, with\n\\[\n\\Omega=\\{a e_{1,n-1}+b e_{1,n}+c e_{2,n}:\\ a,b,c\\in F\\},\n\\]\nsuch that for all $A\\in N_n$ one has\n\\[\nf(A)=\\lambda A+\\mu(A).\n\\]\n\nIn particular, for every element $A$ of the spanning set $S$ (and hence, by linearity, for all $A\\in N_n$) the standard form $f(A)=\\lambda A+\\mu(A)$ holds, reducing the study of commuting linear maps on $N_n$ to an analysis of their action on the center and the nilpotent structure of $N_n$.\n\\end{theorem}\n",
"input": "Given the following results, definitions, and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"Let F be a field of characteristic zero and N_r=N_r(F) the ring of strictly upper triangular matrices with entries in F and center Z(N_r).\",\"Let R be a ring with center Z(R). We say that a map f:R\\\\rightarrow R is {\\\\em centralizing} if [f(x),x]\\\\in Z(R) for all x\\\\in R where [a,b]=ab-ba denotes the standard commutator on R. If [f(x),x]=0 for all x\\\\in R, then we say that f is {\\\\em commuting}.\",\"The first general result in the study of commuting maps is due to Bre{\\\\u s}ar \\\\cite{bresar93} when it was shown that an additive commuting map f over a simple unital ring R must be of the so-called {\\\\em standard form}: \\\\[f(x)=\\\\lambda x+\\\\mu(x)\\\\] for some \\\\lambda\\\\in Z(R) and additive \\\\mu:R\\\\rightarrow Z(R).\",\"In 2000, Beidar, Bre{\\\\u s}ar, and Chebotar \\\\cite{bbc} proved that a linear commuting map defined on T_r=T_r(F), the algebra of r\\\\times r upper triangular matrices with entries in a field F, must be of the standard form.\",\"where \\\\Omega=\\\\{ae_{1,r-1}+be_{1,r}+ce_{2,r}:a,b,c\\\\in F\\\\} and e_{i,j} denotes the standard matrix unit.\"] Results: [\"The first general result in the study of commuting maps is due to Bre{\\\\u s}ar \\\\cite{bresar93} when it was shown that an additive commuting map $f$ over a simple unital ring $R$ must be of the so-called {\\\\em standard form}: \\\\[f(x)=\\\\lambda x+\\\\mu(x)\\\\] for some $\\\\lambda\\\\in Z(R)$ and additive $\\\\mu:R\\\\rightarrow Z(R)$.\",\"\\\\begin{theorem}[Theorem 1 in \\\\cite{bounds16}]\\\\label{old} Let $N_r=N_r(F)$ be the ring of $r\\\\times r$ strictly upper triangular matrices, $r\\\\ge 4$, over a field $F$ of characteristic zero and suppose $f:N_r\\\\rightarrow N_r$ is a linear commuting map. Then there exist $\\\\lambda\\\\in F$ and an additive map $\\\\mu:N_r\\\\rightarrow\\\\Omega$ such that \\\\[f(A)=\\\\lambda A+\\\\mu(A)\\\\] for all $A\\\\in N_r$ where $\\\\Omega=\\\\{ae_{1,r-1}+be_{1,r}+ce_{2,r}:a,b,c\\\\in F\\\\}$ and $e_{i,j}$ denotes the standard matrix unit. \\\\end{theorem}\",\"As such, we will utilize the sets \\\\[S_1=\\\\{D^{-1}JD: D=\\\\sum\\\\limits_{i=1}^{r}d_ie_{i,i},\\\\ d_i\\\\in F,\\\\ \\\\text{with}\\\\ \\\\prod\\\\limits_{i=1}^{r}d_i\\\\ne 0\\\\}\\\\] and \\\\[S_2=\\\\{T_{i,j}^{-1}JT_{i,j}:T_{i,j}=I_r-e_{i,j}\\\\}\\\\] where $J=\\\\sum\\\\limits_{i=1}^{r-1}e_{i,i+1}$ and $I_r$ is the $r\\\\times r$ identity matrix. Note that the elements $A\\\\in S_1$ are all of the form $A=\\\\sum\\\\limits_{i=1}^{r-1}a_ie_{i,i+1}$ where $\\\\prod\\\\limits_{i=1}^{r-1}a_i\\\\ne0$. Setting $S=S_1\\\\cup S_2$ we have that $\\\\text{span}(S)=N_r$ by Lemma 5 in \\\\cite{bounds16}.\",\"\\\\begin{lemma}\\\\label{hj} Let $A=\\\\sum\\\\limits_{i=1}^{r-1}a_{i}e_{i,i+1}\\\\in N_r$ such that $\\\\prod\\\\limits_{i=1}^{r-1}a_{i,i+1}\\\\ne 0$. Then the centralizer of $A$ in $N_r$ is given by $C_A=\\\\{\\\\alpha_1A+\\\\alpha_2A^2+\\\\cdots+\\\\alpha_{r-1}A^{r-1}:\\\\alpha_i\\\\in F\\\\}$. \\\\end{lemma}\",\"\\\\begin{lemma}\\\\label{lem1} Let $A=\\\\sum\\\\limits_{i=1}^{r-1}a_ie_{i,i+1}\\\\in S_1$. Then there exist $\\\\alpha_1,\\\\dots,\\\\alpha_{r-3}\\\\in F$ and $\\\\mu(A)\\\\in\\\\Omega$ such that $f(A)=\\\\sum\\\\limits_{t=1}^{r-3}\\\\alpha_tA^t+\\\\mu(A)$. \\\\end{lemma}\",\"\\\\begin{lemma}\\\\label{lem2} Let $A\\\\in S$. Then there exist $\\\\lambda_A\\\\in F$ and $\\\\mu(A)\\\\in\\\\Omega$ such that $f(A)=\\\\lambda_A A+\\\\mu(A)$. \\\\end{lemma}\"] Notation: [\"Let F be a field of characteristic zero and $N_r=N_r(F)$ the ring of strictly upper triangular matrices with entries in $F$ and center $Z(N_r)$.\",\"Let $R$ be a ring with center $Z(R)$.\",\"We say that a map $f:R\\\\rightarrow R$ is {\\\\em centralizing} if $[f(x),x]\\\\in Z(R)$ for all $x\\\\in R$ where $[a,b]=ab-ba$ denotes the standard commutator on $R$.\",\"If $[f(x),x]=0$ for all $x\\\\in R$, then we say that $f$ is {\\\\em commuting}.\",\"\\\\[f(x)=\\\\lambda x+\\\\mu(x)\\\\] for some $\\\\lambda\\\\in Z(R)$ and additive $\\\\mu:R\\\\rightarrow Z(R)$.\",\"In 2000, Beidar, Bre{\\\\u s}ar, and Chebotar \\\\cite{bbc} proved that a linear commuting map defined on $T_r=T_r(F)$, the algebra of $r\\\\times r$ upper triangular matrices with entries in a field $F$, must be of the standard form.\",\"Let $N_r=N_r(F)$ be the ring of $r\\\\times r$ strictly upper triangular matrices, $r\\\\ge 4$, over a field $F$ of characteristic zero and suppose $f:N_r\\\\rightarrow N_r$ is a linear commuting map. Then there exist $\\\\lambda\\\\in F$ and an additive map $\\\\mu:N_r\\\\rightarrow\\\\Omega$ such that \\\\[f(A)=\\\\lambda A+\\\\mu(A)\\\\] for all $A\\\\in N_r$ where $\\\\Omega=\\\\{ae_{1,r-1}+be_{1,r}+ce_{2,r}:a,b,c\\\\in F\\\\}$ and $e_{i,j}$ denotes the standard matrix unit.\"]"
},
{
"author": "Elizabeth Gross",
"expected_output": "[The Maximum Likelihood Degree of $\\beta$-SBMs] \\label{thm:RecursionTheorem} Given positive integers $n,k,n_1,n_2,\\dots, n_k$ such that $n,k>1$, \\begin{enumerate} \\item $\\MLdeg(n)= \\begin{cases} 1 & n=2\\\\ 2^{n-1}-n & n>2 \\end{cases}$, \\item $\\MLdeg(n_1,1)=\\MLdeg(n_1+1)$, and \\item $\\MLdeg(n_1,n_2,\\dots,n_k)=\\displaystyle\\prod_{i \\in [k]}\\MLdeg(n_i,1)$. \\end{enumerate}",
"actual_output": "\\begin{theorem}[ML Degree Invariance and Quadratic Structure]\nLet $k$ be a positive integer and let $n_1,n_2,\\dots,n_k$ be positive integers. Consider the $\\beta$-Stochastic Block Model $M=\\mathcal{M}(n_1,\\dots,n_k)$ with design matrix $A$, and let $V(A)$ be the Zariski closure of its associated log-linear model with defining (toric) ideal $I_A$ generated by quadratic binomials. For a generic parameter vector $u\\in\\mathbb{C}^{|E|}$, define $L(M)$ to be the system of likelihood equations consisting of the linear equations\n\\[\nA(p-u)=0,\n\\]\ntogether with the quadratic equations corresponding to the generators of $I_A$.\n\nThen:\n\\begin{enumerate}[(i)]\n\\item The maximum likelihood degree $\\operatorname{MLdeg}(n_1,\\dots,n_k)$—that is, the number of complex solutions to $L(M)$—is well-defined and invariant under any permutation of the block indices (as in Lemma~1).\n\\item The fact that $I_A$ is generated by quadratics implies that the structure of $L(M)$ is governed by a complete interaction between the linear and quadratic constraints.\n\\end{enumerate}\n\nThis combinatorial and algebraic structure is crucial for a deeper understanding of the ML degree in these models and will be instrumental in further analysis of their statistical and geometric properties.\n\\end{theorem}",
"input": "Given the following previous results, write a theorem that will be useful in proving the paper. Previous results: [\"For a log-linear model given by a design matrix $A$, we denote by $V(A)$ the Zariski closure of the model $\\\\mathcal{M}_A$, and we denote by $I_A:= I(V(A))$ the defining ideal of $V(A)$. For log-linear models, the ideal $I_A$ is a toric ideal generated by binomials (see \\\\cite{aoki2012markov}, \\\\cite{DSS2009}, \\\\cite{sullivant2018}).\",\"In particular, the authors of \\\\cite{ADP2024} show that $I_A$ is generated by quadratics.\",\"Let $M$ be a $\\\\beta$-SBM $\\\\mathcal{M}(n_1,n_2,\\\\ldots,n_k)$ and let $\\\\textbf{u} = \\\\big( u_{(i,v)(j,w)} \\\\big) \\\\in\\\\mathbb{C}^{|E|}$ be a generic point. Then we will denote by $L(M)$ the system of likelihood equations consisting of the linear equations $A(\\\\textbf{p}-\\\\textbf{u})=\\\\textbf{0}$ and the quadratic equations described in \\\\cref{tab:binomials}. The number of solutions $\\\\textbf{p} = \\\\big( p_{(i,v)(j,w)} \\\\big) \\\\in\\\\mathbb{C}^{|E|}$ to the system $L(M)$ is known as the \\\\textit{maximum likelihood degree} of the model \\\\cite{HKS2005}, \\\\cite{DSS2009}, \\\\cite{sullivant2018} which we denote by $\\\\MLdeg(M)$.\",\"\\\\begin{lemma}\\\\label{lem:ReorderBlocks} Let $k$ be a positive integer and $\\\\tau:[k]\\\\rightarrow[k]$ be a permutation of $[k]$. If $M_1=\\\\mathcal{M}(n_1,n_2,\\\\ldots,n_k)$ and $M_2=\\\\mathcal{M}(n_{\\\\tau(1)},n_{\\\\tau(2)},\\\\ldots,n_{\\\\tau(k)})$ are $\\\\beta$-SBMs then $\\\\MLdeg(M_1)=\\\\MLdeg(M_2)$. \\\\end{lemma} \\\\begin{proof} The solutions of $L(M_1)$ and $L(M_2)$ differ only by a permutation of coordinates and so the two sets of solutions are equicardinal. \\\\end{proof}\",\"Throughout the remainder of this manuscript, will use the notation $\\\\MLdeg(n_1,n_2,\\\\ldots,n_k)$ to mean $\\\\MLdeg(M)$, where $M$ is a $\\\\beta$-SBM $\\\\mathcal{M}(n_1,n_2,\\\\ldots,n_k)$. By \\\\cref{lem:ReorderBlocks}, $\\\\MLdeg(n_1,n_2,\\\\ldots,n_k)$ is well-defined.\"]"
},
{
"author": "Christopher O’Neill",
"expected_output": "\\label{thm: computing aw in fixed directions} Let $P\\subset\\RR^d$ be a rational polytope and let $L$ be the input bit-size of $P$. In fixed dimension, given a nonzero integer vector $c\\in\\ZZ^d\\setminus\\{0\\}$, there is an algorithm to compute $\\aw_c(P)$ that is polynomial time in~$L$ and the input bit-size of $c$.",
"actual_output": "\\begin{theorem}[Structure and Efficient Enumeration of the Arithmetic Range]\nLet $K\\subset\\mathbb{R}^d$ be a convex body with $K\\cap\\mathbb{Z}^d\\neq\\emptyset$ and let $c\\in\\mathbb{Z}^d\\setminus\\{0\\}$. Define the arithmetic range of $K$ in direction $c$ by\n\\[\n\\mathrm{AR}_c(K)=\\{ n\\in\\mathbb{Z}:\\ \\exists x\\in K\\cap\\mathbb{Z}^d\\ \\text{with}\\ c^\\top x = n\\}.\n\\]\nThen the following hold:\n\\begin{enumerate}\n\\item (Almost arithmetic progression structure) The set $\\mathrm{AR}_c(K)$ is an almost arithmetic progression with step size $\\lambda$, where $\\lambda=\\gcd(c_1,\\dots,c_d)$ (equivalently the spacing induced by the lattice projection), and with gaps confined to its extreme ends. In particular, writing $m=\\min\\mathrm{AR}_c(K)$ and $M=\\max\\mathrm{AR}_c(K)$, there exist nonnegative integers $t,t'$ such that\n\\[\n\\lambda\\mathbb{Z}+m \\supseteq \\mathrm{AR}_c(K) \\supseteq [\\,m+t,\\,M-t'\\,]\\cap(\\lambda\\mathbb{Z}+m).\n\\]\n\\item (Width bound) The arithmetic width $\\operatorname{aw}_c(K)=|\\mathrm{AR}_c(K)|$ satisfies\n\\[\n\\operatorname{aw}_c(K)\\le w_c(K)+1,\n\\]\nwhere $w_c(K)=\\max_{x,y\\in K} c^\\top(x-y)$ is the (lattice) width of $K$ in direction $c$.\n\\item (Effective generation of the arithmetic range) In fixed dimension $d$ one can compute a short rational generating function for $\\mathrm{AR}_c(K)$. More precisely, there is a polynomial-time algorithm (via projection techniques inspired by Barvinok--Woods together with monomial substitution) which produces a representation of the generating function\n\\[\ng_{\\mathrm{AR}_c(K)}(z)=\\sum_{n\\in\\mathrm{AR}_c(K)} z^n\n\\]\nof the form\n\\[\ng(z)=\\sum_i E_i \\frac{z^{u_i}}{\\prod_j (1-z^{v_{ij}})},\n\\]\nwith $E_i\\in\\{1,-1\\}$ and suitable integers $u_i,v_{ij}$.\n\\end{enumerate}\nThese results provide both a structural understanding of the distribution of lattice points in $K$ when projected along $c$ and an efficient computational method for their enumeration.\n\\end{theorem}",
"input": "Given the following definitions and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"Fix a nonzero $c \\\\in \\\\ZZ^d$. The \\\\emph{hyperplane cover of $K\\\\cap\\\\ZZ^d$ in direction $c$} is\\n \\\\[h_c(K) = \\\\{H : H\\\\hspace{1mm}\\\\text{is a hyperplane with normal}\\\\hspace{1mm} c,\\\\hspace{1mm} H\\\\cap K\\\\cap\\\\ZZ^d\\\\neq\\\\emptyset\\\\}.\\n\\\\] The \\\\emph{arithmetic width of $K$ in direction $c$} is $\\\\aw_c(K)= |h_c(K)|$.\",\"Let $K\\\\subseteq \\\\mathbb{R}^d$ be a convex body and let $\\\\ell_c: \\\\mathbb{Z}^d\\\\to \\\\mathbb{Z}$ be a linear functional given by $\\\\ell_c(x)=c^Tx$. The \\\\emph{arithmetic range} of $K$ with respect to the direction $\\\\ell_c$ is \\\\[ \\\\AR_{c}(K)=\\\\{n\\\\in\\\\mathbb{Z}: n=\\\\ell_c(x) \\\\text{ for some } x\\\\in K\\\\cap\\\\mathbb{Z}^d\\\\}. \\\\]\",\"In what follows, we say $K\\\\subseteq\\\\RR^d$ is a convex body if it is a compact, convex set. We do not require that $K$ has a non-empty interior, allowing $\\\\dim(K) < d$. Additionally, let $B_r(c)\\\\subset\\\\RR^d$ be the Euclidean ball of radius $r>0$ centered at $c\\\\in\\\\RR^d$.\",\"We say a finite, nonempty set $S\\\\subset\\\\ZZ$ is an \\\\emph{almost arithmetic progression} with step size $\\\\lambda$, left bound $t$, and right bound $t'$ if \\\\[ S = \\\\{m, m+\\\\lambda, \\\\dots, M-\\\\lambda, M\\\\} \\\\setminus ( A \\\\cup A') \\\\] for some $A \\\\subseteq [m,m+t] \\\\cap (\\\\lambda \\\\ZZ + m)$ and $A' \\\\subseteq [M-t',M] \\\\cap (\\\\lambda \\\\ZZ + m)$, where $m=\\\\min(S)$ and $M=\\\\max(S)$. Said another way, \\\\[ (\\\\lambda \\\\ZZ + m) \\\\supseteq S \\\\supseteq [m+t, M-t'] \\\\cap (\\\\lambda \\\\ZZ + m). \\\\] We call \\\\[ \\\\gaps(S) = A \\\\cup A', \\\\qquad \\\\gaps_l(S) = A, \\\\qquad \\\\text{and} \\\\qquad \\\\gaps_r(S) = A' \\\\] the \\\\emph{gaps}, \\\\emph{left gaps}, and \\\\emph{right gaps} of $S$, respectively.\",\"In what follows, we say $P$ is a \\\\textit{rational polytope} if $P=\\\\convhull(v_1,\\\\dots,v_k)\\\\subset\\\\RR^d$ where $k$ is finite and each $v_i\\\\in\\\\QQ^d$ for $i\\\\in [k]$. If each $v_i\\\\in\\\\ZZ^d$, we say that $P$ is \\\\textit{integral}. The \\\\textit{denominator of $P$}, denoted $\\\\text{denom}(P)$, is the smallest positive dilation factor $n$ such that $nP$ is an integral polytope \\\\cite{ziegler}.\",\"Given a rational polyhedron $P$, the associated generating function of its lattice points is the Laurent series \\\\[ g_P(x) = \\\\!\\\\!\\\\! \\\\sum_{\\\\alpha\\\\in P\\\\cap\\\\ZZ^d} \\\\!\\\\!\\\\! x^{\\\\alpha}. \\\\]\"] Notation: [\"In all that follows, we denote $[n]=\\\\{1,\\\\dots, n\\\\}\\\\subseteq \\\\ZZ_{>0}$.\",\"The lattice width of a convex body $K\\\\subseteq\\\\RR^d$ is \\\\[ w(K)=\\\\displaystyle\\\\min_{c\\\\in \\\\ZZ^d\\\\setminus\\\\{0\\\\}} w_c(K), \\\\qquad \\\\text{where} \\\\qquad w_c(K) = \\\\max_{x,y\\\\in K}c^T(x-y). \\\\]\",\"Fix a nonzero $c \\\\in \\\\ZZ^d$. The \\\\emph{hyperplane cover of $K\\\\cap\\\\ZZ^d$ in direction $c$} is \\\\[h_c(K) = \\\\{H : H\\\\hspace{1mm}\\\\text{is a hyperplane with normal}\\\\hspace{1mm} c,\\\\hspace{1mm} H\\\\cap K\\\\cap\\\\ZZ^d\\\\neq\\\\emptyset\\\\}.\\\\] The \\\\emph{arithmetic width of $K$ in direction $c$} is $\\\\aw_c(K)= |h_c(K)|$.\",\"\\\\[\\\\aw_c(K)=|h_c(K)|\\\\leq w_c(K) + 1.\\\\]\",\"Let $K\\\\subseteq \\\\mathbb{R}^d$ be a convex body and let $\\\\ell_c: \\\\mathbb{Z}^d\\\\to \\\\mathbb{Z}$ be a linear functional given by $\\\\ell_c(x)=c^Tx$. The \\\\emph{arithmetic range} of $K$ with respect to the direction $\\\\ell_c$ is \\\\[ \\\\AR_{c}(K)=\\\\{n\\\\in\\\\mathbb{Z}: n=\\\\ell_c(x) \\\\text{ for some } x\\\\in K\\\\cap\\\\mathbb{Z}^d\\\\}. \\\\]\",\"We will soon prove (see Proposition~\\\\ref{prop: aw_properties}\\\\eqref{prop: aw_properties; equivalence}) that \\\\[\\\\aw_{c}(K):=|AR_c(K)|.\\\\]\",\"In what follows, we say $K\\\\subseteq\\\\RR^d$ is a convex body if it is a compact, convex set. We do not require that $K$ has a non-empty interior, allowing $\\\\dim(K) < d$. Additionally, let $B_r(c)\\\\subset\\\\RR^d$ be the Euclidean ball of radius $r>0$ centered at $c\\\\in\\\\RR^d$.\",\"We say $P$ is a \\\\textit{rational polytope} if $P=\\\\convhull(v_1,\\\\dots,v_k)\\\\subset\\\\RR^d$ where $k$ is finite and each $v_i\\\\in\\\\QQ^d$ for $i\\\\in [k]$. If each $v_i\\\\in\\\\ZZ^d$, we say that $P$ is \\\\textit{integral}. The \\\\textit{denominator of $P$}, denoted $\\\\text{denom}(P)$, is the smallest positive dilation factor $n$ such that $nP$ is an integral polytope \\\\cite{ziegler}.\",\"Definition: We say a finite, nonempty set $S\\\\subset\\\\ZZ$ is an \\\\emph{almost arithmetic progression} with step size $\\\\lambda$, left bound $t$, and right bound $t'$ if \\\\[ S = \\\\{m, m+\\\\lambda, \\\\dots, M-\\\\lambda, M\\\\} \\\\setminus ( A \\\\cup A') \\\\] for some $A \\\\subseteq [m,m+t] \\\\cap (\\\\lambda \\\\ZZ + m)$ and $A' \\\\subseteq [M-t',M] \\\\cap (\\\\lambda \\\\ZZ + m)$, where $m=\\\\min(S)$ and $M=\\\\max(S)$. Said another way, \\\\[ (\\\\lambda \\\\ZZ + m) \\\\supseteq S \\\\supseteq [m+t, M-t'] \\\\cap (\\\\lambda \\\\ZZ + m). \\\\] We call \\\\[ \\\\gaps(S) = A \\\\cup A', \\\\qquad \\\\gaps_l(S) = A, \\\\qquad \\\\text{and} \\\\qquad \\\\gaps_r(S) = A' \\\\] the \\\\emph{gaps}, \\\\emph{left gaps}, and \\\\emph{right gaps} of $S$, respectively.\",\"Given a rational polyhedron $P$, the associated generating function of its lattice points is the Laurent series \\\\[ g_P(x) = \\\\!\\\\!\\\\! \\\\sum_{\\\\alpha\\\\in P\\\\cap\\\\ZZ^d} \\\\!\\\\!\\\\! x^{\\\\alpha}. \\\\] Barvinok's theory shows that, in fixed dimension $d$, this (generally exponential) sum admits a polynomial-size representation as a sum of rational functions of the form \\\\begin{equation} \\\\label{eq:aa} g_P(x) = \\\\sum_{i\\\\in I} {E_i \\\\frac{x^{u_i}} {\\\\prod\\\\limits_{j=1}^d (1-x^{v_{ij}})}}, \\\\end{equation} where $I$ is a polynomial-size indexing set, $E_i\\\\in\\\\{1,-1\\\\}$ and $u_i, v_{ij} \\\\in\\\\ZZ^d$ for all $i$ and $j$.\",\"Lemma (monomial substitution): Let \\\\[ g(x)= \\\\sum_{i\\\\in I}\\\\alpha_i \\\\frac{x^{u_i}}{\\\\prod_{j=1}^k(1-x^{v_{ij}})}, \\\\] where $u_i,v_{ij}\\\\in\\\\ZZ^d$, $\\\\alpha_i \\\\in \\\\QQ$, and $k$ is fixed. Let $\\\\psi:\\\\CC^n\\\\to\\\\CC^d$ be the monomial map defined by $x_i\\\\mapsto z_1^{l_{i1}}z_2^{l_{i2}}\\\\dots z_n^{l_{in}},$ and assume $\\\\psi(\\\\CC^n)$ is not contained in the pole set of $g(x)$. Then, $g(\\\\psi(z))$ can be computed in polynomial time (in the input bit size) as a short rational generating function of the same form as $g(z)$.\",\"Projection lemma (Barvinok--Woods): Fix the dimension $d$. Let $P\\\\subset\\\\RR^d$ be a rational polytope and let $T:\\\\ZZ^d\\\\to\\\\ZZ^k$ be a linear map. Then, there is a polynomial-time algorithm that computes a short rational generating function for $f\\\\bigl(T(P\\\\cap\\\\ZZ^d);z\\\\bigr)$.\"]"
},
{
"author": "Christopher O’Neill",
"expected_output": "\\label{thm: eql in fixed directions} Let $P$ be a rational polytope in $\\mathbb{R}^d$. Then, for a fixed direction $c \\in \\mathbb{Z}^d$, the arithmetic width $\\aw_c(nP)$ is an eventually quasilinear function of $n \\in \\mathbb{Z}_{\\geq 0}$.",
"actual_output": "\\begin{theorem}\nLet \\(K\\subset\\mathbb{R}^d\\) be a convex body whose affine span contains a lattice point, and let \\(c\\in\\mathbb{Z}^d\\setminus\\{0\\}\\) be an integer vector so that the linear functional \\(\\ell_c:\\mathbb{Z}^d\\to\\mathbb{Z}\\) is defined by \\(\\ell_c(x)=c^T x\\). Assume further that \\(K\\) is a rational polytope with denominator \\(D\\). Then there exists an integer \\(N\\) such that for every integer \\(n\\ge N\\) for which the affine span of \\(nK\\) contains a lattice point, the following hold:\n\\begin{enumerate}\n\\item The arithmetic range \\(\\operatorname{AR}_c(nK)\\) is an almost arithmetic progression with some fixed step size \\(\\lambda\\) and with left and right bounds that depend only on \\(K\\).\n\\item In particular, the arithmetic width \\(\\operatorname{aw}_c(nK)=|\\operatorname{AR}_c(nK)|\\) equals the lattice height \\(h_c(nK)\\) and is invariant under integer translations and scaling (in the sense of Proposition \\ref{prop: aw_properties}).\n\\item Moreover, the structure of the gap set of \\(\\operatorname{AR}_c(nK)\\) is periodic in \\(n\\), meaning that\n\\[\n|\\operatorname{gaps}(\\operatorname{AR}_c(nK))|=|\\operatorname{gaps}(\\operatorname{AR}_c((n+D)K))|.\n\\]\n\\end{enumerate}\nConsequently, for all large dilates \\(nK\\) the arithmetic range not only exhibits almost arithmetic progression behavior but its gap structure repeats periodically every \\(D\\) steps.\n\\end{theorem}",
"input": "Given the following previous results, write a theorem that will be useful in proving the paper. Previous results: [\"\\\\begin{definition}\\n Let $K\\\\subseteq \\\\mathbb{R}^d$ be a convex body and let $\\\\ell_c: \\\\mathbb{Z}^d\\\\to \\\\mathbb{Z}$ be a linear functional given by $\\\\ell_c(x)=c^Tx$. The \\\\emph{arithmetic range} of $K$ with respect to the direction $\\\\ell_c$ is \\n \\\\[\\n \\\\AR_{c}(K)=\\\\{n\\\\in\\\\mathbb{Z}: n=\\\\ell_c(x) \\\\text{ for some } x\\\\in K\\\\cap\\\\mathbb{Z}^d\\\\}.\\n \\\\]\\n\\\\end{definition}\",\"\\\\begin{proposition} \\\\label{prop: aw_properties} Let $K\\\\subset\\\\RR^d$ be a convex body. \\n\\\\begin{enumerate}[(a)]\\n \\\\item \\\\label{prop: aw_properties; translation}\\n The arithmetic width $\\\\aw_c(K)$ for a nonzero integer vector $c$ is invariant under integer translations of $K$. Specifically, if $t\\\\in\\\\ZZ^d$, then $\\\\aw_c(K)= \\\\aw_c(t+K)$. \\n \\\\item \\\\label{prop: aw_properties; parallel}\\n Let $c_1$ and $c_2$ be nonzero parallel integer vectors. Then, $\\\\aw_{c_1}(K)=\\\\aw_{c_2}(K)$. \\n \\\\item \\\\label{prop: aw_properties; equivalence}\\n For a nonzero integer direction $c$, \\n \\\\[\\\\aw_c(K):= |\\\\AR_c(K)|= h_c(K).\\\\] \\n \\\\item \\\\label{prop: aw_properties; maxwidth}\\n The maximal arithmetic width of $K$ is $|K\\\\cap\\\\ZZ^d|$. %and is obtained in sufficiently generic directions. \\\\end{enumerate} \\\\end{proposition}\",\"\\\\begin{definition} \\\\label{def: almost arithmetic progression}\\n We say a finite, nonempty set $S\\\\subset\\\\ZZ$ is an \\\\emph{almost arithmetic progression} with step size $\\\\lambda$, left bound $t$, and right bound $t'$ if \\n \\\\[\\n S = \\\\{m, m+\\\\lambda, \\\\dots, M-\\\\lambda, M\\\\} \\\\setminus ( A \\\\cup A')\\n \\\\]\\n for some $A \\\\subseteq [m,m+t] \\\\cap (\\\\lambda \\\\ZZ + m)$ and $A' \\\\subseteq [M-t',M] \\\\cap (\\\\lambda \\\\ZZ + m)$, where $m=\\\\min(S)$ and $M=\\\\max(S)$. \\n Said another way, \\n \\\\[ (\\\\lambda \\\\ZZ + m) \\\\supseteq S \\\\supseteq [m+t, M-t'] \\\\cap (\\\\lambda \\\\ZZ + m). \\\\]\\n We call \\n \\\\[\\n \\\\gaps(S) = A \\\\cup A',\\n \\\\qquad\\n \\\\gaps_l(S) = A,\\n \\\\qquad \\\\text{and} \\\\qquad\\n \\\\gaps_r(S) = A'\\n \\\\]\\n the \\\\emph{gaps}, \\\\emph{left gaps}, and \\\\emph{right gaps} of $S$, respectively.\\n \\\\end{definition}\",\"\\\\begin{theorem} \\\\label{thm: AR structure}\\n Let $K$ be a convex body in $\\\\mathbb{R}^d$ whose affine span contains a lattice point, and let $\\\\ell_c:\\\\ZZ^d\\\\to\\\\ZZ$ be a linear functional. For $n\\\\gg 0$, the arithmetic range of $nK$ is an almost arithmetic progression whose step size, left bound, and right bound depend only on $K$.\\n\\\\end{theorem}\",\"\\\\begin{lemma} \\\\label{lemma: gap set equality} Let $P$ be a rational polytope in $\\\\mathbb{R}^d$ with denominator $D$, and fix a linear functional $\\\\ell_c:\\\\ZZ^d \\\\to \\\\ZZ$. Then, for any $n\\\\gg 0$ for which $\\\\aff(nP)$ contains a lattice point, \\\\[|\\\\gaps(AR_{c}(nP))| = |\\\\gaps(AR_{c}((n+D)P))|.\\\\] \\\\end{lemma}\"]"
},
{
"author": "Dwight Anderson Williams II",
"expected_output": "\\label{thm: tower} \t\tLet $x=(x_0,x_1,\\ldots,x_n)\\in\\{0,1,2,\\ldots,n\\}^{n+1}$. Then $x\\in \\ToH_{n+1}$ if and only if $x$ satisfies: \t\t\\begin{enumerate} \t\t\t\\setcounter{enumi}{-1} \t\t\t\\item $x_n=0$, \t\t\t\\item there exists $j\\in[n-1]$ and distinct $k,k' \\in [n-1]$ with $x_k = x_{k'} = j$, and \t\t\t\\item if $i \\neq k, k'$, then $x_i \\neq j$ and \t\t\t$ \t\t\t\\{x_i:0\\leq i\\leq n-1 \\mbox{ and }i\\neq k, k'\\} \t\t\t= \t\t\t[n-1]\\setminus\\{j\\}$. \t\t\\end{enumerate}",
"actual_output": "\\begin{theorem}\nLet $n\\in\\mathbb{N}$ and let $\\alpha=(a_1,a_2,\\dots,a_n)\\in\\mathrm{PF}(n)$ be a parking function with total displacement\n\\[\n d(\\alpha)=\\sum_{i=1}^n k_i,\n\\]\nwhere $k_i$ is the number of spots by which car $i$ is bumped from its preferred spot. For $d\\ge0$ denote by $\\mathrm{dPF}(n,d)$ the subset of $\\mathrm{PF}(n)$ consisting of parking functions with total displacement $d$. Moreover, let $\\mathrm{ToH}_{n+1}$ be the set of all \\emph{ideal states} in the $(n+1)\\times(n+1)$ Tower of Hanoi game; an ideal state $x=(x_0,x_1,\\dots,x_n)$ is required to satisfy:\n\\begin{enumerate}\n \\item the largest disk $n$ is alone on the source peg (peg $0$),\n \\item the destination peg (peg $n$) is empty, and\n \\item the remaining $n$ disks are distributed among the interior pegs so that each interior peg is nonempty and exactly one peg holds two disks.\n\\end{enumerate}\nAssume that to each parking function $\\alpha$ one may associate (in a manner to be explicitly constructed) a Tower of Hanoi state $x\\in\\mathrm{ToH}_{n+1}$ so that the parking process (with its bumps corresponding to displacements) mirrors the moves leading to the ideal state in an optimal strategy (i.e., one requiring $n+1$ moves to reach an ideal state and $2n+3$ moves to complete the game). Then the resulting map\n\\[\n \\mathrm{dPF}(n,d)\\longrightarrow\\mathrm{ToH}_{n+1}\n\\]\nis a bijection which preserves the displacement statistic. Equivalently, the total displacement $d(\\alpha)$ equals the cumulative number of bump--moves needed to reach the ideal state from the initial configuration under any optimal Tower of Hanoi strategy. Consequently, enumerative and structural properties of parking functions classified by displacement are equivalent to those of ideal states in the Tower of Hanoi game.\n\\end{theorem}\n",
"input": "Given the following definitions, write a theorem that will be useful in proving the paper. Definitions: [\"Fix $n\\\\in\\\\mathbb{N}=\\\\{1,2,3,\\\\ldots\\\\}$ and consider $n$ cars entering sequentially to park on a one-way street consisting of $n$ spots numbered consecutively from 1 to $n$. \\tThe cars enter the street one at a time and first drive to their preferred spot, where they park if unoccupied. If a car's preferred spot is occupied, then it continues down the street, parking in the first available spot it encounters. For each $i\\\\in[n]:=\\\\{1,2,\\\\ldots,n\\\\}$, we let $a_i\\\\in[n]$ be the preferred parking spot of car $i$; appropriately, $\\\\alpha=(a_1,a_2,\\\\ldots,a_n)\\\\in[n]^n$ is called a preference vector. If all cars can park given the preference vector $\\\\alpha$, then we say that $\\\\alpha$ is a \\\\textit{parking function} of length $n$. For example, $(3,1,1,3,2)$ is a parking function of length 5 since car 1 parks in spot 3, car 2 parks in spot 1, car 3 parks in spot 2, car 4 parks in spot 4, and car 5 parks in spot 5. On the other hand, $(3,4,2,3)$ is not a parking function, as no car prefers spot 1, and hence the cars cannot all park in the four available spots. We remark that parking functions do not require that all cars park where they prefer; indeed, all that matters is that every car can park within the $n$ parking spots on the one-way street. Throughout, we let $\\\\PF{n}$ denote the set of all parking functions of length $n$ and $|\\\\PF{n}|$ denote the number of parking functions of length $n$.\",\"An alternative to the counting of lucky cars, our work is motivated by a related but separate statistic measuring a type of holistic luckiness of a parking function: the \\\\textit{displacement of a parking function}. To begin, we note that the \\\\textit{displacement} of car $i$ under the parking function $\\\\alpha$ is defined as the difference between the number of the spot where a car actually parks and its preferred spot. If this value is $k_i$, then we say that car $i$ has been \\\\textit{bumped} $k_i$ spots down the road. So the displacement of a parking function $\\\\alpha$, which we denote by $d(\\\\alpha)$, is the total amount all cars are bumped under this parking function. Precisely, the displacement of a parking function $\\\\alpha$ is given by $d(\\\\alpha):=\\\\sum_{i=1}^nk_i$, where $k_i$ denotes the displacement of car $i$ when parking under $\\\\alpha$. In this way, the displacement of a parking function $\\\\alpha$ is an integral value that quantifies how ``unlucky'' $\\\\alpha$ is. If $\\\\alpha$ is a permutation of $[n]$, then $d(\\\\alpha)=0$. In all other cases, the displacement satisfies $d>0$. In particular, if $\\\\alpha$ is the preference vector consisting of all ones, then $d(\\\\alpha)=\\\\frac{n(n-1)}{2}$. We remark that displacement of a parking function does not determine the number of (un)lucky cars in a parking function. For example, a parking function $\\\\alpha$ may satisfy $d(\\\\alpha)=7$, but this does not provide any indication as to whether a single car has a displacement of seven or if seven cars have a displacement of one. Nonetheless, in comparing the parking functions $(1, 2, 2)$ and $(1, 2, 1)$, each with one unlucky car, we see the former has displacement one, whereas the latter has displacement two, illustrating the distinction between measuring ``luckiness'' of a parking function and counting unlucky cars. In what follows, we let $\\\\dPF{n}{d}$ denote the set of parking functions of length $n$ that have exactly $d$ bumps (displacement $d$) and $|\\\\dPF{n}{d}|$ denote the number of such parking functions.\",\"Our main contribution in this paper provides a connection between the displacement statistic on parking functions and the Tower of Hanoi --- a mathematical puzzle invented by the French mathematician \\\\'{E}douard Lucas in 1883 \\\\cite{hinzTowerHanoiMyths2018}. We focus on the $(n+1)\\\\times (n+1)$ Tower of Hanoi game, where there are $n+1$ disks labeled 0 to $n$ by increasing size and $n+1$ pegs labeled 0 to $n$ from left to right. In the game's starting position, the $n+1$ disks begin stacked on the first peg and are arranged in descending order, with disk $n$ on the bottom and disk 0 on the top. We refer to the first peg (labeled 0) as the \\\\textit{source} peg and the last peg (labeled $n$) as the \\\\textit{destination} peg. Moreover, all pegs in between the source and destination pegs are the \\\\textit{interior} pegs.\",\"The objective of this game is to move all $n+1$ disks from the source peg to the destination peg, ending with the disks in the same order as in the starting position. Thus $n \\\\geq 2$, as there must be at least three pegs/disks to consider when the number of pegs equals the number of disks. We illustrate the starting and ending positions for $n=3$ in Figure~\\\\ref{fig: positions}. Moving a disk from one peg to another must follow two rules. First, we can only move one disk at a time. Second, we can never place a larger disk on top of a smaller one. At the completion of each move, we refer to the arrangement of the disks on the pegs as a \\\\textit{state}. In this way, we also refer to the initial and ending positions as the initial and ending states of the game, respectively. We use the term \\\\textit{strategy} for the collection of moves made during a single game or, equivalently, the collection of states reached throughout a game. A particular intermediate state (between initial and ending states) is an \\\\textit{ideal state}, which is an arrangement of $n+1$ disks with the following properties: \\\\begin{itemize} \\\\item the largest disk (labeled $n$) is alone on the source peg (labeled 0), \\\\item the destination peg (labeled $n$) is the only empty peg, and \\\\item the remaining $n$ disks are on the $n-1$ interior pegs in such a way that each interior peg has at least one disk; hence, exactly one peg has two disks. \\\\end{itemize}\",\"We let $\\\\ToH_{n+1}$ denote the set of all distinct ideal states in the $(n+1)\\\\times(n+1)$ Tower of Hanoi game. The ideal states in a $(n+1)\\\\times(n+1)$ Tower of Hanoi game are significant in achieving an \\\\textit{optimal strategy}, which is a winning strategy with the minimum number of moves possible: If a strategy places a game in an ideal state after exactly $n+1$ moves, then such a strategy guarantees that the remainder of the game can be won after $n+2$ more moves, $2n+3$ moves being the minimum number of moves to win \\\\cite[see the proof of Proposition 2]{klavvzar2005hanoi}. Furthermore, any optimal strategy of an $(n+1)\\\\times(n+1)$ Tower of Hanoi game will necessarily result in an ideal state after $n+1$ moves. We remark that determining optimal strategies for Tower of Hanoi games is a very active area of research with a history of long-standing problems \\\\cite{bousch2014quatrieme,ottodunkelProblemsSolutions1941} and applications \\\\cite{simon1975functional}. For more, we refer the reader to \\\\cite{hinzTowerHanoiMyths2018}.\",\"Now turning to the Tower of Hanoi problem, we begin by setting the stage for describing ideal states. A state is denoted by \\\\[x=(x_0,x_1,\\\\ldots,x_{n})\\\\] where, for each $0\\\\leq i\\\\leq n$, disk $i$ is located on peg $x_i$. We make the assumption that at any point a vector $x$ with repeated entries satisfies the condition that the disks on the same peg are ordered with the smallest on the top and the largest disk on the bottom. For example, $x=(0,0,0,0)$ means all disks are on peg 0 (in order from smallest on top to largest at the bottom). Figure \\\\ref{fig: anidealstate} provides a visualization of the ideal state $(2,2,1,0)$ of the $4 \\\\times 4$ Tower of Hanoi game.\"]"
},
{
"author": "Dwight Anderson Williams II",
"expected_output": "{\\label{thm: pf}} \t\tLet $\\alpha=(a_1,\\ldots,a_n)\\in[n]^n$. Then $\\alpha\\in PF_n(1)$ if and only if \t\t$\\alpha$ \t\tsatisfies: \t\t\\begin{enumerate} \t\t\t\\item there exists $j\\in[ n-1]$ and distinct $k,k'\\in [n]$ such that $a_k=a_{k'}=j$ and $a_i\\neq j$ for any other index $i\\neq k, k'$ and \t\t\t\\item $ \t\t\t\\{a_i:i\\in[n] \\mbox{ and }i\\neq k, k'\\} \t\t\t= \t\t\t[n]\\setminus\\{j,j+1\\}$. \t\t\\end{enumerate}",
"actual_output": "\\begin{theorem}\nLet $n\\in\\mathbb{N}$ and consider any parking function $\\alpha\\in\\mathrm{PF}(n)$ with displacement\n\\[\nd(\\alpha):=\\sum_{i=1}^n k_i,\n\\]\nwhere $k_i$ is the number of spots car $i$ is bumped from its preferred spot. Then the following statements hold:\n\\begin{enumerate}\n\\item The displacement is bounded by $0\\le d(\\alpha)\\le \\dfrac{n(n-1)}{2}$. In particular, $d(\\alpha)=0$ if and only if $\\alpha$ is a permutation of $[n]$ (i.e. every car parks in its preferred spot), and $d(\\alpha)=\\dfrac{n(n-1)}{2}$ if and only if $\\alpha=(1,1,\\dots,1)$.\n\\item For any integer $d$ with $0\\le d\\le \\dfrac{n(n-1)}{2}$, let $\\mathrm{dPF}(n,d)$ denote the set of parking functions of length $n$ that have exactly displacement $d$. Then $\\mathrm{dPF}(n,d)$ is nonempty and the displacements refine the total count of parking functions, so that\n\\[\n\\sum_{d=0}^{\\tfrac{n(n-1)}{2}} |\\mathrm{dPF}(n,d)| = |\\mathrm{PF}(n)| = (n+1)^{\\,n-1}.\n\\]\n\\end{enumerate}\nThis theorem provides a structural criterion relating the usual counting of parking functions with their displacement statistic and is instrumental in studying further refinements of parking function behavior based on cumulative car bumping.\n\\end{theorem}\n",
"input": "Given the following results, definitions, and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"Fix $n\\\\in\\\\mathbb{N}=\\\\{1,2,3,\\\\ldots\\\\}$ and consider $n$ cars entering sequentially to park on a one-way street consisting of $n$ spots numbered consecutively from 1 to $n$. \\tThe cars enter the street one at a time \\tand first drive to their preferred spot, where they park if unoccupied. \\tIf a car's preferred spot is occupied, then it continues down the street, parking in the first available spot it encounters. \\tFor each $i\\\\in[n]:=\\\\{1,2,\\\\ldots,n\\\\}$, we let $a_i\\\\in[n]$ be the preferred parking spot of car $i$; appropriately, $\\\\alpha=(a_1,a_2,\\\\ldots,a_n)\\\\in[n]^n$ is called a preference vector. \\tIf all cars can park given the preference vector $\\\\alpha$, then we say that $\\\\alpha$ is a \\\\textit{parking function} of length $n$. \\tFor example, $(3,1,1,3,2)$ is a parking function of length 5 since car 1 parks in spot 3, car 2 parks in spot 1, car 3 parks in spot 2, car 4 parks in spot 4, and car 5 parks in spot 5. \\tOn the other hand, $(3,4,2,3)$ is not a parking function, as no car prefers spot 1, and hence the cars cannot all park in the four available spots. \\tWe remark that parking functions do not require that all cars park where they prefer; indeed, all that matters is that every car can park within the $n$ parking spots on the one-way street. \\tThroughout, we let $\\\\PF{n}$ denote the set of all parking functions of length $n$ and $|\\\\PF{n}|$ denote the number of parking functions of length $n$. Konheim and Weiss first introduced parking functions in 1966 in their study \\\\cite{konheimOccupancyDisciplineApplications1966} of hashing functions. They established that $|\\\\PF{n}|=(n+1)^{n-1}$ is the number of parking functions of length $n$ (in \\\\textit{loc. cit. denoted $T_{n}$}).\",\"An alternative to the counting of lucky cars, our work is motivated by a related but separate statistic measuring a type of holistic luckiness of a parking function: the \\\\textit{displacement of a parking function}. To begin, we note that the \\\\textit{displacement} of car $i$ under the parking function $\\\\alpha$ is defined as the difference between the number of the spot where a car actually parks and its preferred spot. If this value is $k_i$, then we say that car $i$ has been \\\\textit{bumped} $k_i$ spots down the road. \\tSo the displacement of a parking function $\\\\alpha$, which we denote by $d(\\\\alpha)$, is the total amount all cars are bumped under this parking function. Precisely, the displacement of a parking function $\\\\alpha$ is given by \\td(\\\\alpha):=\\\\sum_{i=1}^nk_i, \\twhere $k_i$ denotes the displacement of car $i$ when parking under $\\\\alpha$. \\tIn this way, \\tthe displacement of a parking function $\\\\alpha$ is an integral value that quantifies how ``unlucky'' $\\\\alpha$ is. \\tIf $\\\\alpha$ is a permutation of $[n]$, then $d(\\\\alpha)=0$. \\tIn all other cases, \\tthe displacement satisfies $d>0$. \\tIn particular, if $\\\\alpha$ is the preference vector consisting of all ones, then $d(\\\\alpha)=\\\\frac{n(n-1)}{2}$. \\tWe remark that displacement of a parking function does not determine the number of (un)lucky cars in a parking function. \\tFor example, a parking function $\\\\alpha$ may satisfy $d(\\\\alpha)=7$, but this does not provide any indication as to whether a single car has a displacement of seven or if seven cars have a displacement of one. Nonetheless, in comparing the parking functions $(1, 2, 2)$ and $(1, 2, 1)$, each with one unlucky car, we see the former has displacement one, whereas the latter has displacement two, illustrating the distinction between measuring ``luckiness'' of a parking function and counting unlucky cars. In what follows, we let $\\\\dPF{n}{d}$ denote the set of parking functions of length $n$ that have exactly $d$ bumps (displacement $d$) and $|\\\\dPF{n}{d}|$ denote the number of such parking functions.\"] Results: [\"Fix $n\\\\in\\\\mathbb{N}=\\\\{1,2,3,\\\\ldots\\\\}$ and consider $n$ cars entering sequentially to park on a one-way street consisting of $n$ spots numbered consecutively from 1 to $n$. The cars enter the street one at a time and first drive to their preferred spot, where they park if unoccupied. If a car's preferred spot is occupied, then it continues down the street, parking in the first available spot it encounters. For each $i\\\\in[n]:=\\\\{1,2,\\\\ldots,n\\\\}$, we let $a_i\\\\in[n]$ be the preferred parking spot of car $i$; appropriately, $\\\\alpha=(a_1,a_2,\\\\ldots,a_n)\\\\in[n]^n$ is called a preference vector. If all cars can park given the preference vector $\\\\alpha$, then we say that $\\\\alpha$ is a \\\\textit{parking function} of length $n$. For example, $(3,1,1,3,2)$ is a parking function of length 5 since car 1 parks in spot 3, car 2 parks in spot 1, car 3 parks in spot 2, car 4 parks in spot 4, and car 5 parks in spot 5. On the other hand, $(3,4,2,3)$ is not a parking function, as no car prefers spot 1, and hence the cars cannot all park in the four available spots. We remark that parking functions do not require that all cars park where they prefer; indeed, all that matters is that every car can park within the $n$ parking spots on the one-way street. Throughout, we let \\\\PF{n} denote the set of all parking functions of length $n$ and $|\\\\PF{n}|$ denote the number of parking functions of length $n$. Konheim and Weiss first introduced parking functions in 1966 in their study \\\\cite{konheimOccupancyDisciplineApplications1966} of hashing functions. They established that $|\\\\PF{n}|=(n+1)^{n-1}$ is the number of parking functions of length $n$ (in \\\\textit{loc. cit. denoted $T_{n}$}).\",\"Gessel and Seo \\\\cite{gesselRefinementCayleyFormula2006} classify parking functions based on the number of \\\\textit{lucky} cars --- those that park in their preferred spot. Note that parking functions that are permutations of $[n]$ are the luckiest of all, as every car parks in its preferred spot. In contrast, unless $n=1$, the parking function consisting of all ones is as unlucky as can be, since no car except the first can park in its preferred spot. For more on parking functions, we point the interested reader to \\\\cite{yan2015parking}.\",\"An alternative to the counting of lucky cars, our work is motivated by a related but separate statistic measuring a type of holistic luckiness of a parking function: the \\\\textit{displacement of a parking function}. To begin, we note that the \\\\textit{displacement} of car $i$ under the parking function $\\\\alpha$ is defined as the difference between the number of the spot where a car actually parks and its preferred spot. If this value is $k_i$, then we say that car $i$ has been \\\\textit{bumped} $k_i$ spots down the road. So the displacement of a parking function $\\\\alpha$, which we denote by $d(\\\\alpha)$, is the total amount all cars are bumped under this parking function. Precisely, the displacement of a parking function $\\\\alpha$ is given by $d(\\\\alpha):=\\\\sum_{i=1}^nk_i$, where $k_i$ denotes the displacement of car $i$ when parking under $\\\\alpha$. In this way, the displacement of a parking function $\\\\alpha$ is an integral value that quantifies how ``unlucky'' $\\\\alpha$ is. If $\\\\alpha$ is a permutation of $[n]$, then $d(\\\\alpha)=0$. In all other cases, the displacement satisfies $d>0$. In particular, if $\\\\alpha$ is the preference vector consisting of all ones, then $d(\\\\alpha)=\\\\frac{n(n-1)}{2}$.\",\"We remark that displacement of a parking function does not determine the number of (un)lucky cars in a parking function. For example, a parking function $\\\\alpha$ may satisfy $d(\\\\alpha)=7$, but this does not provide any indication as to whether a single car has a displacement of seven or if seven cars have a displacement of one. Nonetheless, in comparing the parking functions $(1, 2, 2)$ and $(1, 2, 1)$, each with one unlucky car, we see the former has displacement one, whereas the latter has displacement two, illustrating the distinction between measuring ``luckiness'' of a parking function and counting unlucky cars. In what follows, we let \\\\dPF{n}{d} denote the set of parking functions of length $n$ that have exactly $d$ bumps (displacement $d$) and $|\\\\dPF{n}{d}|$ denote the number of such parking functions.\"] Notation: [\"Fix $n\\\\in\\\\mathbb{N}=\\\\{1,2,3,\\\\ldots\\\\}$ and consider $n$ cars entering sequentially to park on a one-way street consisting of $n$ spots numbered consecutively from 1 to $n$.\",\"For each $i\\\\in[n]:=\\\\{1,2,\\\\ldots,n\\\\}$, we let $a_i\\\\in[n]$ be the preferred parking spot of car $i$; appropriately, $\\\\alpha=(a_1,a_2,\\\\ldots,a_n)\\\\in[n]^n$ is called a preference vector.\",\"If all cars can park given the preference vector $\\\\alpha$, then we say that $\\\\alpha$ is a \\\\textit{parking function} of length $n$.\",\"Throughout, we let $\\\\PF{n}$ denote the set of all parking functions of length $n$ and $|\\\\PF{n}|$ denote the number of parking functions of length $n$.\",\"So the displacement of a parking function $\\\\alpha$, which we denote by $d(\\\\alpha)$, is the total amount all cars are bumped under this parking function. Precisely, the displacement of a parking function $\\\\alpha$ is given by \\n$d(\\\\alpha):=\\\\sum_{i=1}^n k_i$, where $k_i$ denotes the displacement of car $i$ when parking under $\\\\alpha$.\",\"In what follows, we let $\\\\dPF{n}{d}$ denote the set of parking functions of length $n$ that have exactly $d$ bumps (displacement $d$) and $|\\\\dPF{n}{d}|$ denote the number of such parking functions.\"]"
},
{
"author": "Sara Jamshidi",
"expected_output": "[The Spark Randomizer] \\label{thm:main} \t Let $I=\\ideal{f_1,\\dots,f_s}\\subset K[x_1,\\dots,x_n]$ be an ideal and fix a monomial ordering $\\prec$. Let $\\mH\\subset I$ be any finite set guaranteed to contain a minimal Gr\\\"obner basis of $I$. %\t \\marginpar{\\sonja{SEE margin note at thm\\ref{thm:grobner violator basis is a GB}!! regarding $\\mH\\subset I$}} \t Let $k$ be the output of a (machine learning) algorithm which predicts the size $\\delta$ of a minimal $\\prec$-Gr\\\"obner basis of $I$, with $k\\geq \\delta$. Then there exists a sampling algorithm that outputs a Gr\\\"obner basis of $I$ in an expected number $O(k|\\mH|+k^{O(k)})$ calls to the violator primitive query that solves a small monomial ideal membership problem. In particular, if $k=\\delta$, the output is a minimal Gr\\\"obner basis.",
"actual_output": "\\begin{theorem}\nLet $K$ be a field and let $R=K[x_1,\\dots,x_n]$ be a polynomial ring equipped with a fixed monomial order $\\prec$. Let $f_1,\\dots,f_s\\in R$ and denote by $I=\\langle f_1,\\dots,f_s\\rangle$ the ideal they generate. Suppose that $H\\subseteq I$ is a finite set of polynomials (for example, $H$ may be taken to contain a generating set of $I$) and define the mapping $V_{\\prec}\\colon 2^H\\to 2^H$ by\n\\[\nV_{\\prec}(S)=\\{\\,h\\in H : \\operatorname{init}(S)\\subsetneq \\operatorname{init}(S\\cup\\{h\\})\\,\\}\n\\]\nfor any $S\\subseteq H$. Then the following hold:\n\\begin{enumerate}\n\\item[(1)] (Violator space structure) The pair $(H,V_{\\prec})$ is a violator space; that is, it satisfies both the Consistency axiom (for every $S\\subseteq H$, $S\\cap V_{\\prec}(S)=\\varnothing$) and the Locality axiom (for all $F\\subseteq G\\subseteq H$, if $G\\cap V_{\\prec}(F)=\\varnothing$ then $V_{\\prec}(F)=V_{\\prec}(G)$).\n\n\\item[(2)] (Equivalence with minimal Gr\\\"obner bases) A subset $B\\subseteq H$ is a basis of the violator space $(H,V_{\\prec})$ (i.e. $B\\cap V_{\\prec}(F)\\neq\\varnothing$ for every proper subset $F\\subset B$, or equivalently, $B$ is a minimal subset of $H$ such that $V_{\\prec}(B)=V_{\\prec}(H)$) if and only if $B$ is a minimal Gr\\\"obner basis for $I$ with respect to $\\prec$; namely, the set of initial terms $\\{\\operatorname{init}(b): b\\in B\\}$ minimally generates $\\operatorname{init}(I)$.\n\n\\item[(3)] (Bound on the basis size) Consequently, the size of any minimal Gr\\\"obner basis of $I$ (i.e. the cardinality of any basis of the violator space) is bounded above by the combinatorial dimension $\\delta(H,V_{\\prec})$ of $(H,V_{\\prec})$.\n\\end{enumerate}\n\\end{theorem}\n",
"input": "Given the following definitions and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"Denote by $K$ a field, for example the reader may keep $K=\\\\mathbb C$ in mind. Let $f_1=0,\\\\dots,f_s=0$ be a system of $s$ polynomial equations in $n$ variables with coefficients in $K$. We will denote by $\\\\ideal{f_1,\\\\dots,f_s}\\\\subset R=K[x_1,\\\\dots,x_n]$ the ideal generated by these polynomials. If $F=\\\\{f_1,\\\\dots,f_s\\\\}$ is a set of polynomials, the ideal $\\\\ideal{f_1,\\\\dots,f_s}$ will equivalently be denoted by $\\\\ideal{F}$. Fix a monomial order $\\\\prec$ on $R$ and an ideal $I$. Denote by $\\\\init(h)$ the initial term of $h\\\\in R$, which is the $\\\\prec$-largest monomial. The initial ideal of $I$ with respect to $\\\\prec$ is the monomial ideal $\\\\init(I):=\\\\ideal{\\\\init(h):h\\\\in I}$. For the Gr\\\"obner basis definitions, \\\\cite{clo} is a standard textbook reference.\",\"\\\\begin{defn} A finite subset $B\\\\subset I$ is a \\\\emph{Gr\\\"obner basis} of $I\\\\subset R$ with respect to $\\\\prec$ if the initial terms of $B$ generate the entire initial ideal: $$\\\\init(B):= \\\\ideal{\\\\init(b):b\\\\in B}=\\\\init(I):=\\\\ideal{\\\\init(f):f\\\\in I}.$$ A Gr\\\"obner basis is \\\\emph{minimal} if the monomial generators of the initial ideal are minimal generators. %no initial term is redundant. \\\\end{defn}\",\"\\\\begin{defn}[\\\\cite{ViolatorSpaces2008}] \\\\label{defn:ViolatorSpaces} Let $\\\\mH$ be a finite set and $\\\\vi$ a mapping $2^\\\\mH\\\\to2^\\\\mH$. A {\\\\it violator space} is a pair $(\\\\mH,\\\\vi)$ such that the following two axioms hold: \\\\\\\\\\\\begin{tabular}{ll} {\\\\it Consistency}: & $G\\\\cap \\\\vi(G)=\\\\emptyset$ holds for all $G\\\\subseteq \\\\mH$, and\\\\\\\\ {\\\\it Locality}: & $\\\\vi(G)=\\\\vi(F)$ holds for all $F\\\\subseteq G\\\\subseteq H$ such that $G\\\\cap \\\\vi(F)=\\\\emptyset$.\\\\\\\\ \\\\end{tabular} \\\\end{defn}\",\"\\\\begin{defn}[{\\\\cite[Definitions~7 and 19]{ViolatorSpaces2008}}] \\\\label{defn:delta} A set $B\\\\subseteq \\\\mH$ is a {\\\\it basis} if $B\\\\cap \\\\vi(F)\\\\neq\\\\emptyset$ holds for all proper subsets $F\\\\subset B$. %\\\\sonja{Every proper subset of the basis is violated by a basis element.} For $G\\\\subseteq \\\\mH$, a {basis of $G$} is a minimal subset $B$ of $G$ with $\\\\vi(B)=\\\\vi(G)$. %\\\\sonja{A minimal subset which captures all violations. If $G=\\\\mH$, these two definitions are equivalent.} %\\\\end{defn} %\\\\begin{defn}[{\\\\cite[Definition~19]{ViolatorSpaces2008}}] The size of a largest basis of a violator space $(\\\\mH, V)$ is called the {\\\\it combinatorial dimension} $\\\\delta=\\\\delta(\\\\mH, V)$ of $(\\\\mH, V)$. \\\\end{defn}\",\"\\\\begin{defn}\\\\label{defn:primitive} Given a violator space $(\\\\mH,\\\\vi)$, some set $G\\\\subsetneq \\\\mH$, and some element $h\\\\in\\\\mH\\\\setminus G$, the \\\\emph{primitive test} decides whether $h\\\\in\\\\vi(G)$. \\\\end{defn}\",\" \\\\begin{defn} \\\\label{defn:GbViolator} Fix a monomial ordering $\\\\prec$. % and an ideal $I\\\\subset R$. Let $\\\\mH\\\\subset I$ Let $\\\\mH\\\\subset R$ be a finite set of polynomials and $S\\\\subset\\\\mH$. Define the following mapping to capture the set of polynomials in the universe $\\\\mH$ whose initial terms lie outside the initial ideal of S: \\\\[ \\\\vi_{\\\\prec}(S):=\\\\{ h \\\\in\\\\mH : \\\\init(S)\\\\subsetneq\\\\init(S\\\\cup\\\\{h\\\\})\\\\}. \\\\] % {\\\\color{cyan} we could have written $\\\\init h\\\\not\\\\in\\\\init(S)$ but i guess we are spelling it out?} \\\\end{defn}\"] Notation: [\"\\\\DeclareMathOperator{\\\\supp}{Supp}\",\"\\\\newcommand{\\\\rowspan}[1]{\\\\textrm{rowspan} #1}\",\"\\\\newcommand{\\\\cost}{\\\\mathbf{c}}\",\"\\\\newcommand{\\\\x}{\\\\mathbf{x}}\",\"\\\\newcommand{\\\\bb}{\\\\mathbf{b}}\",\"\\\\newcommand{\\\\RR}{\\\\mathbf{R}}\",\"\\\\newcommand{\\\\M}{\\\\mathcal{M}}\",\"\\\\newcommand{\\\\mH}{\\\\mathcal H}\",\"\\\\newcommand{\\\\I}{\\\\mathcal I}\",\"\\\\newcommand{\\\\mB}{\\\\mathcal{B}}\",\"\\\\newcommand{\\\\mR}{\\\\mathcal{R}}\",\"\\\\newcommand{\\\\ideal}[1]{\\\\left< {#1}\\\\right>}\",\"\\\\newcommand{\\\\vecsp}[1]{\\\\langle {#1}\\\\rangle}\",\"\\\\newcommand{\\\\vi}{{\\\\sf V}}\",\"\\\\newcommand{\\\\ma}{\\\\mathfrak{a}}\",\"\\\\DeclareMathOperator{\\\\initial}{LT_{\\\\prec}}\",\"\\\\DeclareMathOperator{\\\\init}{LT_{\\\\prec}}\",\"\\\\newcommand{\\\\Basis}{\\\\mathrm{Basis}}\",\"\\\\newcommand{\\\\BruteForce}{\\\\textrm{BruteForce}}\",\"\\\\DeclareMathOperator{\\\\V}{\\\\mathcal V}\",\"\\\\DeclareMathOperator{\\\\coeff}{coeff}\",\"\\\\DeclareMathOperator{\\\\rank}{rank}\",\"\\\\newcommand{\\\\RealIntersect}{CP}\",\"Denote by $K$ a field, for example the reader may keep $K=\\\\mathbb C$ in mind.\",\"Let $f_1=0,\\\\dots,f_s=0$ be a system of $s$ polynomial equations in $n$ variables with coefficients in $K$.\",\"We will denote by $\\\\ideal{f_1,\\\\dots,f_s}\\\\subset R=K[x_1,\\\\dots,x_n]$ the ideal generated by these polynomials.\",\"If $F=\\\\{f_1,\\\\dots,f_s\\\\}$ is a set of polynomials, the ideal $\\\\ideal{f_1,\\\\dots,f_s}$ will equivalently be denoted by $\\\\ideal{F}$.\",\"Fix a monomial order $\\\\prec$ on $R$ and an ideal $I$.\",\"Denote by $\\\\init(h)$ the initial term of $h\\\\in R$, which is the $\\\\prec$-largest monomial.\",\"The initial ideal of $I$ with respect to $\\\\prec$ is the monomial ideal $\\\\init(I):=\\\\ideal{\\\\init(h):h\\\\in I}$.\",\"A finite subset $B\\\\subset I$ is a \\\\emph{Gr\\\\\\\"obner basis} of $I\\\\subset R$ with respect to $\\\\prec$ if the initial terms of $B$ generate the entire initial ideal: $$\\\\init(B):= \\\\ideal{\\\\init(b):b\\\\in B}=\\\\init(I):=\\\\ideal{\\\\init(f):f\\\\in I}.$$\",\"A Gr\\\\\\\"obner basis is \\\\emph{minimal} if the monomial generators of the initial ideal are minimal generators.\",\"The input and output to the problem are standard: the input consists of a set of polynomials $f_1,\\\\dots,f_s$ and a monomial order, and the output is a minimal Gr\\\\\\\"obner basis of the ideal they generate.\",\"The two machine learning algorithms (``ML 1\\\" and ``ML 2\\\" in the Figure) are used to predict the total degree ($m$) and the cardinality of the minimal Gr\\\\\\\"obner basis ($k$) of the ideal $\\\\ideal{f_1,\\\\dots,f_s}$; ML1 is optional.\"]"
},
{
"author": "Sara Jamshidi",
"expected_output": "\\label{thm:grobner violator basis is a GB} Fix a finite set of polynomials $\\mH\\subset R$ and a monomial order $\\prec$. Then a largest basis of the violator space $(\\mH,\\vi_\\prec)$ contains all the elements in the minimal Gr\\\"obner basis of $\\ideal{\\mH}$ which live in $\\mH$. %%$\\mH$-truncated (minimal) Gr\\\"obner basis of $\\ideal{\\mH}$. In particular, for a fixed ideal $I\\subset R$ and a finite subset $\\mH\\subset I$ that is guaranteed to contain a $\\prec$-Gr\\\"obner basis of $I$, a largest basis of $(\\mH,\\vi_\\prec)$ is a minimal Gr\\\"obner basis of $I$.",
"actual_output": "\\begin{theorem}[Gr\\\"obner Bases via Violator Spaces]\nLet $\\mathcal{H}$ be a finite set of polynomials in $R=K[x_1,\\dots,x_n]$ and fix a monomial order $\\prec$. Define the mapping $\\mathsf{V}_{\\prec}$ on subsets $S\\subseteq\\mathcal{H}$ by\n\\[\n\\mathsf{V}_{\\prec}(S):=\\{h\\in\\mathcal{H}:\\ \\init(S)\\subsetneq\\init(S\\cup\\{h\\})\\}.\n\\]\nThen the following hold:\n\\begin{enumerate}\n\\item (Violator space axioms) The pair $(\\mathcal{H},\\mathsf{V}_{\\prec})$ satisfies the axioms of a violator space, namely\n \\begin{itemize}\n \\item (Consistency) For any $G\\subseteq\\mathcal{H}$, $G\\cap\\mathsf{V}_{\\prec}(G)=\\emptyset$.\n \\item (Locality) For all $F\\subseteq G\\subseteq\\mathcal{H}$ with $G\\cap\\mathsf{V}_{\\prec}(F)=\\emptyset$ we have $\\mathsf{V}_{\\prec}(F)=\\mathsf{V}_{\\prec}(G)$.\n \\end{itemize}\n\\item (Gr\\\"obner basis equivalence) A subset $B\\subset\\mathcal{H}$ is a basis of the violator space $(\\mathcal{H},\\mathsf{V}_{\\prec})$ (i.e., for every proper subset $F\\subset B$, $B\\cap\\mathsf{V}_{\\prec}(F)\\neq\\emptyset$) if and only if $B$ is a minimal Gr\\\"obner basis for the ideal $\\langle\\mathcal{H}\\rangle$ with respect to $\\prec$, i.e., $\\langle\\init(B)\\rangle=\\init(\\langle\\mathcal{H}\\rangle)$ and the monomials $\\{\\init(b):b\\in B\\}$ are minimal generators of $\\init(\\langle\\mathcal{H}\\rangle)$.\n\\item (Efficient computation) If the combinatorial dimension $\\delta$ of $(\\mathcal{H},\\mathsf{V}_{\\prec})$ is the size of a largest basis, then by applying Clarkson's randomized algorithm (see Theorem~27 in \\cite{ViolatorSpaces2008}) a basis $B$ (and hence a minimal Gr\\\"obner basis of $\\langle\\mathcal{H}\\rangle$) can be computed by performing an expected\n \\[\n O\\Big(\\delta\\,|\\mathcal{H}|+\\delta^{O(\\delta)}\\Big)\n \\]\n primitive tests, where a primitive test decides for $h\\in\\mathcal{H}\\setminus G$ whether $h\\in\\mathsf{V}_{\\prec}(G)$.\n\\end{enumerate}\n\\end{theorem}\n",
"input": "Given the following results and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Results: [\"Fix a monomial order $\\\\prec$ on $R$ and an ideal $I$. Denote by $\\\\init(h)$ the initial term of $h\\\\in R$, which is the $\\\\prec$-largest monomial. The initial ideal of $I$ with respect to $\\\\prec$ is the monomial ideal $\\\\init(I):=\\\\ideal{\\\\init(h):h\\\\in I}$. For the Gr\\\\\\\"obner basis definitions, \\\\cite{clo} is a standard textbook reference.\",\"\\\\begin{defn} A finite subset $B\\\\subset I$ is a \\\\emph{Gr\\\\\\\"obner basis} of $I\\\\subset R$ with respect to $\\\\prec$ if the initial terms of $B$ generate the entire initial ideal: $$\\\\init(B):= \\\\ideal{\\\\init(b):b\\\\in B}=\\\\init(I):=\\\\ideal{\\\\init(f):f\\\\in I}.$$ A Gr\\\\\\\"obner basis is \\\\emph{minimal} if the monomial generators of the initial ideal are minimal generators. %no initial term is redundant. \\\\end{defn}\",\"\\\\begin{defn}[\\\\cite{ViolatorSpaces2008}] \\\\label{defn:ViolatorSpaces} Let \\\\mH be a finite set and \\\\vi a mapping $2^\\\\mH\\\\to2^\\\\mH$. A {\\\\it violator space} is a pair $(\\\\mH,\\\\vi)$ such that the following two axioms hold: \\\\\\\\begin{tabular}{ll} {\\\\it Consistency}: & $G\\\\cap \\\\vi(G)=\\\\emptyset$ holds for all $G\\\\subseteq \\\\mH$, and\\\\\\\\ {\\\\it Locality}: & $\\\\vi(G)=\\\\vi(F)$ holds for all $F\\\\subseteq G\\\\subseteq H$ such that $G\\\\cap \\\\vi(F)=\\\\emptyset$.\\\\\\\\ \\\\end{tabular} \\\\end{defn}\",\"\\\\begin{defn}[{\\\\cite[Definitions~7 and 19]{ViolatorSpaces2008}}] \\\\label{defn:delta} A set $B\\\\subseteq \\\\mH$ is a {\\\\it basis} if $B\\\\cap \\\\vi(F)\\\\neq\\\\emptyset$ holds for all proper subsets $F\\\\subset B$. %\\\\sonja{Every proper subset of the basis is violated by a basis element.} For $G\\\\subseteq \\\\mH$, a {basis of $G$} is a minimal subset $B$ of $G$ with $\\\\vi(B)=\\\\vi(G)$. %\\\\sonja{A minimal subset which captures all violations. If $G=\\\\mH$, these two definitions are equivalent.} %\\\\end{defn} %\\\\begin{defn}[{\\\\cite[Definition~19]{ViolatorSpaces2008}}] The size of a largest basis of a violator space $(\\\\mH, V)$ is called the {\\\\it combinatorial dimension} $\\\\delta=\\\\delta(\\\\mH, V)$ of $(\\\\mH, V)$. \\\\end{defn}\",\"\\\\begin{defn}\\\\label{defn:primitive} Given a violator space $(\\\\mH,\\\\vi)$, some set $G\\\\subsetneq \\\\mH$, and some element $h\\\\in\\\\mH\\\\setminus G$, the \\\\emph{primitive test} decides whether $h\\\\in\\\\vi(G)$. \\\\end{defn}\",\"\\\\begin{thm}\\\\cite[Theorem~27]{ViolatorSpaces2008} \\\\label{key tool violators} Using Clarkson's algorithms, a basis of $\\\\mH$ in a violator space $(\\\\mH,V)$ whose combinatorial dimension is $\\\\delta$ can be found by answering the primitive query an expected $O\\\\left(\\\\delta \\\\left|\\\\mH\\\\right| + \\\\delta^{O(\\\\delta)}\\\\right)$ times. \\\\end{thm}\",\"\\\\begin{defn} \\\\label{defn:GbViolator} Fix a monomial ordering $\\\\prec$. % and an ideal $I\\\\subset R$. Let $\\\\mH\\\\subset I$ Let $\\\\mH\\\\subset R$ be a finite set of polynomials and $S\\\\subset\\\\mH$. Define the following mapping to capture the set of polynomials in the universe $\\\\mH$ whose initial terms lie outside the initial ideal of S: \\\\[ \\\\vi_{\\\\prec}(S):=\\\\{ h \\\\in\\\\mH : \\\\init(S)\\\\subsetneq\\\\init(S\\\\cup\\\\{h\\\\})\\\\}. \\\\] % {\\\\color{cyan} we could have written $\\\\init h\\\\not\\\\in\\\\init(S)$ but i guess we are spelling it out?} \\\\end{defn}\",\"\\\\begin{prop}\\\\label{prop:violator axioms} The operator $\\\\vi_{\\\\prec}(S)$ satisfies violator space axioms. \\\\end{prop}\",\"\\\\begin{proof} \\\\emph{Consistency.} Let $g\\\\in G$. Then $\\\\init(G)=\\\\init(G\\\\cup\\\\{g\\\\})$, thus $g\\\\not\\\\in \\\\vi_\\\\prec(G)$. On the other hand, let $g\\\\in \\\\vi_\\\\prec(G)$. Then $\\\\init(G)\\\\subsetneq \\\\init(G\\\\cup\\\\{g\\\\})$. %but this implies $g\\\\not\\\\in G$, for how else would the initial ideal grow. In particular, $\\\\init(g)\\\\not\\\\in \\\\init(G)$ and therefore $\\\\init(g)\\\\not\\\\in \\\\{\\\\init(f):f\\\\in G\\\\}$, thus $g\\\\not\\\\in G$. %since $\\\\init(G)$ contains the initial terms of all elements of $G$ itself. \\\\emph{Locality.} Suppose $F\\\\subseteq G$ with $G\\\\cap \\\\vi_\\\\prec(F)=\\\\emptyset$. The aim is to prove that the violating sets $\\\\vi_\\\\prec(F)$ and $\\\\vi_\\\\prec(G)$ agree. Note that $F\\\\subset G$ immediately implies $\\\\vi_\\\\prec(G)\\\\subset\\\\vi_\\\\prec(F)$, so we need only prove the other inclusion. Given that no element of $G$ violates $F$, $\\\\init(F)=\\\\init(F\\\\cup\\\\{g\\\\})$ holds for all $g\\\\in G$, and in particular $\\\\init(g)\\\\in\\\\init(F)$ so $\\\\init(F)=\\\\init(G)$. Suppose $h$ violates $F$, %that is, $h\\\\in\\\\vi(F)$, so that that is, $\\\\init(F)\\\\subsetneq \\\\init(F\\\\cup\\\\{h\\\\})$. Then the following sequence of inclusions holds: \\\\[ % \\\\init(G)=\\\\cup_{g\\\\in G} \\\\init(F\\\\cup\\\\{g\\\\}) = \\\\init (F) \\\\subsetneq \\\\init(F\\\\cup\\\\{h\\\\}) \\\\subseteq \\\\init (G\\\\cup\\\\{h\\\\}), \\\\init(G)= \\\\init(\\\\cup_{g\\\\in G\\\\setminus F} F\\\\cup\\\\{g\\\\}) = \\\\init (F) \\\\subsetneq \\\\init(F\\\\cup\\\\{h\\\\}) \\\\subseteq \\\\init (G\\\\cup\\\\{h\\\\}), \\\\] and therefore $\\\\init(G)\\\\subsetneq \\\\init(G\\\\cup\\\\{h\\\\})$, in other words, $h$ also violates $G$. %\\\\in\\\\vi(G)$. Therefore $\\\\vi_\\\\prec(F)\\\\subset \\\\vi_\\\\prec(G)$, as required. \\\\end{proof}\"] Notation: [\"\\\\newcommand{\\\\mH}{\\\\mathcal H}\",\"\\\\newcommand{\\\\ideal}[1]{\\\\left< {#1}\\\\right>}\",\"\\\\newcommand{\\\\vi}{{\\\\sf V}}\",\"\\\\DeclareMathOperator{\\\\initial}{LT_{\\\\prec}}\",\"\\\\DeclareMathOperator{\\\\init}{LT_{\\\\prec}}\",\"Denote by $K$ a field, for example the reader may keep $K=\\\\mathbb C$ in mind.\",\"Let $f_1=0,\\\\dots,f_s=0$ be a system of $s$ polynomial equations in $n$ variables with coefficients in $K$.\",\"We will denote by $\\\\ideal{f_1,\\\\dots,f_s}\\\\subset R=K[x_1,\\\\dots,x_n]$ the ideal generated by these polynomials.\",\"If $F=\\\\{f_1,\\\\dots,f_s\\\\}$ is a set of polynomials, the ideal $\\\\ideal{f_1,\\\\dots,f_s}$ will equivalently be denoted by $\\\\ideal{F}$.\",\"Fix a monomial order $\\\\prec$ on $R$ and an ideal $I$.\",\"Denote by $\\\\init(h)$ the initial term of $h\\\\in R$, which is the $\\\\prec$-largest monomial.\",\"The initial ideal of $I$ with respect to $\\\\prec$ is the monomial ideal $\\\\init(I):=\\\\ideal{\\\\init(h):h\\\\in I}$.\",\"A finite subset $B\\\\subset I$ is a \\\\emph{Gr\\\\\\\"obner basis} of $I\\\\subset R$ with respect to $\\\\prec$ if the initial terms of $B$ generate the entire initial ideal: $$\\\\init(B):= \\\\ideal{\\\\init(b):b\\\\in B}=\\\\init(I):=\\\\ideal{\\\\init(f):f\\\\in I}.$$ A Gr\\\\\\\"obner basis is \\\\emph{minimal} if the monomial generators of the initial ideal are minimal generators.\",\"Let $\\\\mH$ be a finite set and $\\\\vi$ a mapping $2^\\\\mH\\\\to2^\\\\mH$. A {\\\\it violator space} is a pair $(\\\\mH,\\\\vi)$ such that the following two axioms hold: \\\\\\\\\\\\begin{tabular}{ll} {\\\\it Consistency}: & $G\\\\cap \\\\vi(G)=\\\\emptyset$ holds for all $G\\\\subseteq \\\\mH$, and\\\\\\\\ {\\\\it Locality}: & $\\\\vi(G)=\\\\vi(F)$ holds for all $F\\\\subseteq G\\\\subseteq H$ such that $G\\\\cap \\\\vi(F)=\\\\emptyset$.\\\\\\\\ \\\\end{tabular}\",\"A set $B\\\\subseteq \\\\mH$ is a {\\\\it basis} if $B\\\\cap \\\\vi(F)\\\\neq\\\\emptyset$ holds for all proper subsets $F\\\\subset B$. For $G\\\\subseteq \\\\mH$, a {basis of $G$} is a minimal subset $B$ of $G$ with $\\\\vi(B)=\\\\vi(G)$.\",\"The size of a largest basis of a violator space $(\\\\mH, V)$ is called the {\\\\it combinatorial dimension} $\\\\delta=\\\\delta(\\\\mH, V)$ of $(\\\\mH, V)$.\",\"Given a violator space $(\\\\mH,\\\\vi)$, some set $G\\\\subsetneq \\\\mH$, and some element $h\\\\in\\\\mH\\\\setminus G$, the \\\\emph{primitive test} decides whether $h\\\\in\\\\vi(G)$.\",\"Fix a monomial ordering $\\\\prec$. % and an ideal $I\\\\subset R$. Let $\\\\mH\\\\subset I$ Let $\\\\mH\\\\subset R$ be a finite set of polynomials and $S\\\\subset\\\\mH$. Define the following mapping to capture the set of polynomials in the universe $\\\\mH$ whose initial terms lie outside the initial ideal of S: \\\\[ \\\\t \\\\vi_{\\\\prec}(S):=\\\\{ h \\\\in\\\\mH : \\\\init(S)\\\\subsetneq\\\\init(S\\\\cup\\\\{h\\\\})\\\\}. \\\\]\"]"
},
{
"author": "Craig Larson",
"expected_output": "\\label{bracelets-Eger} Every bracelet with a perfect matching is Egerv\\'{a}ry.",
"actual_output": "\\begin{theorem}[Bracelet Egerv\\'ary]\nLet $G$ be a bracelet, that is, a graph consisting of three distinct nodes $u$, $v$, and $w$ together with three weak bananas joining $u$ to $v$, $v$ to $w$, and $w$ to $u$. If $G$ has a perfect matching, then $G$ is Egerv\\'ary.\n\\end{theorem}",
"input": "Given the following previous results, write a theorem that will be useful in proving the paper. Previous results: [\"The graph $K_4$ is the smallest instance of what we call a \\\\textit{weak wheel}, i.e., a cycle $C$ with three or more nodes, a node $w$ not in $C$, and a path (\\\\textit{spoke}) from each node of $C$ to $w$ such that these spokes are disjoint except for $w$.\",\"\\\\begin{thm} \\\\label{weak-wheels-Eger} Every weak wheel with a perfect matching is Egerv\\\\'ary. \\\\end{thm}\",\"\\\\begin{proof} A weak wheel cannot have a disjoint pair of odd cycles. \\\\end{proof}\",\"A graph is a \\\\textit{weak banana} when it consists of two nodes, $v$, $w$, together with three or more internally disjoint $vw$-paths. Notice that a weak banana fails to be bipartite exactly when at least two of its $vw$-paths are of opposite parity.\",\"\\\\begin{thm} \\\\label{weak-bananas-Eger} Every weak banana with a perfect matching is Egerv\\\\'ary. \\\\end{thm}\",\"\\\\begin{proof} A weak banana cannot have a disjoint pair of odd cycles. \\\\end{proof}\",\"A \\\\textit{bracelet} consists of three distinct nodes $u$, $v$, and $w$, together with three weak bananas, respectively joining $u$ to $v$, $v$ to $w$, and $w$ to $u$.\"]"
},
{
"author": "Craig Larson",
"expected_output": "\\label{weak-bananas-Eger} Every weak banana with a perfect matching is Egerv\\'{a}ry.",
"actual_output": "\\begin{theorem}[Unified Egerv\\'ary Criterion]\nLet $G$ be a matchable graph that admits a perfect matching. Then $G$ is Egerv\\'ary provided that at least one of the following conditions holds:\n\\begin{enumerate}\n \\item $G$ is a K\\H{o}nig--Egerv\\'ary (KE) graph, i.e. $\\alpha(G)+\\mu(G)=|V(G)|$;\n \\item $G$ contains a subgraph that is a \\emph{weak wheel}: a cycle of length at least $3$ together with a vertex not on the cycle that is joined to every vertex of the cycle by pairwise disjoint spokes;\n \\item $G$ contains a subgraph that is a \\emph{weak banana} which is nonbipartite: two vertices connected by at least three internally disjoint paths, among which at least two have opposite parity.\n\\end{enumerate}\n\\begin{proof}[Sketch]\nIn case (1) the conclusion follows from the well-known fact that every KE graph is Egerv\\'ary. In case (2), every weak wheel with a perfect matching is Egerv\\'ary because its structure precludes the existence of a spanning subgraph whose components are independent edges together with a positive even number of odd cycles. In case (3), the nonbipartite structure of the weak banana forces any spanning subgraph decomposing into independent edges and odd cycles to involve an even number of odd cycles, and hence satisfy the Egerv\\'ary condition. Therefore, in each case $G$ is Egerv\\'ary.\n\\end{proof}\n\\end{theorem}",
"input": "Given the following results and notation, write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Results: [\"Every KE graph is Egerv\\\\'{a}ry (Corollary~\\\\ref{cor:kayll-KE-implies-eger}). But there are also non-KE graphs which are Egerv\\\\'{a}ry. We give examples of some constructions. These examples are interesting not only because they provide infinite families of non-KE Egerv\\\\'{a}ry graphs---but also because they are not obviously derived from Deming subgraphs with the addition of extra edges.\",\"The graph $K_4$ is the smallest instance of what we call a \\\\textit{weak wheel}, i.e., a cycle $C$ with three or more nodes, a node $w$ not in $C$, and a path (\\\\textit{spoke}) from each node of $C$ to $w$ such that these spokes are disjoint except for $w$.\",\"\\\\begin{thm} \\\\label{weak-wheels-Eger} Every weak wheel with a perfect matching is Egerv\\\\'{a}ry. \\\\end{thm}\\n\\n\\\\begin{proof} A weak wheel cannot have a disjoint pair of odd cycles. \\\\end{proof}\",\"A graph is a \\\\textit{weak banana} when it consists of two nodes, $v$, $w$, together with three or more internally disjoint $vw$-paths. Notice that a weak banana fails to be bipartite exactly when at least two of its $vw$-paths are of opposite parity.\"] Notation: [\"An \\\\textit{independent set} is a set of vertices that is pairwise nonadjacent; the \\\\textit{independence number} $\\\\alpha$ of a graph is the cardinality of a largest independent set.\",\"A \\\\textit{matching} is a set of pairwise non-incident (or independent) edges; the \\\\textit{matching number} $\\\\nu$ is the cardinality of a largest matching.\",\"The \\\\textit{order} $n$ of a graph is the number of its vertices.\",\"A \\\\textit{K\\\\H{o}nig-Egerv\\\\'{a}ry} graph (henceforth, \\\\textit{KE} graph) is defined by the condition that $\\\\alpha+\\\\nu=n$.\",\"Egerv\\\\'{a}ry graphs generalize KE graphs. A graph is \\\\textit{Egerv\\\\'{a}ry} if it has a perfect matching but it doesn't contain a spanning subgraph whose components are independent edges together with at least one odd cycle (parity considerations show that ``at least one'' really means ``a positive even number of'').\",\"Following \\\\cite{LovaPlum86}, we call a subgraph $H$ of a matchable graph $G$ \\\\textit{nice} if $G-V(H)$ has a perfect matching.\",\"The graph $K_4$ is the smallest instance of what we call a \\\\textit{weak wheel}, i.e., a cycle $C$ with three or more nodes, a node $w$ not in $C$, and a path (\\\\textit{spoke}) from each node of $C$ to $w$ such that these spokes are disjoint except for $w$.\",\"A graph is a \\\\textit{weak banana} when it consists of two nodes, $v$, $w$, together with three or more internally disjoint $vw$-paths. Notice that a weak banana fails to be bipartite exactly when at least two of its $vw$-paths are of opposite parity.\"]"
},
{
"author": "Martin Malandro",
"expected_output": "\\label{ThmLegitPartition} Let $e_1, e_2, \\in E(S)$ with $e_1 \\D e_2$. Suppose $f\\in E(S)$ with $f\\leq e_1$. Then \\[ |h\\in E(S):h\\leq e_1 \\up{ and }h\\D f| = |h\\in E(S):h\\leq e_2 \\up{ and }h\\D f|. \\] %In particular, if $E$ is a finite meet-semilattice and $P$ is a set partition of $E$ for which there exists a finite inverse semigroup $S$ such that $E(S)=E$ and such that the restriction of $\\D$ from $S$ to $E(S)$ is $P$, then $P$ is a $\\D$-partition of $E$.",
"actual_output": "\\begin{theorem}[D-Partition via Inverse Semigroup Restriction]\nLet $E$ be a meet-semilattice and let $P$ be a partition of $E$ with induced equivalence relation $\\sim$. Suppose there exists an inverse semigroup $S$ with $E=E(S)$ such that for any $e,f\\in E$ the $\\mathcal{D}$-relation on $S$ restricts to $P$, i.e.\nfor $e,f\\in E$ we have $e\\sim f$ if and only if $e\\mathcal{D}f$ in $S$. Then for any $e_1,e_2,f\\in E$ with $e_1\\sim e_2$ and any $f\\le e_1$ the following equality holds:\n\\[\n\\bigl|\\{h\\in E:\\; h\\le e_1 \\text{ and } h\\sim f\\}\\bigr|\n=\n\\bigl|\\{h\\in E:\\; h\\le e_2 \\text{ and } h\\sim f\\}\\bigr|.\n\\]\nIn particular, under these conditions $P$ is a D-partition of $E$.\n\\end{theorem}",
"input": "Given the following results and definitions write a theorem that would be useful in proving the paper. You do not need to use all of these examples, but select the ones that you feel are the most relevant. Definitions: [\"Let $E$ be a meet-semilattice and $P$ a set partition of $E$. Write $\\\\sim$ for the equivalence relation on $E$ induced by $P$. That is, for $e,f\\\\in E$, $e\\\\sim f$ if and only if $e$ and $f$ are in the same part of $P$.\",\"\\\\begin{defn}We say $P$ is a {\\\\em $\\\\D$-partition} of $E$ if, whenever $e_1,e_2,f\\\\in E$ with $e_1\\\\sim e_2$ and $f\\\\leq e_1$, we have \\n\\\\[ |h\\\\in E: h\\\\leq e_1 \\\\up{ and }h \\\\sim f| = |h\\\\in E : h\\\\leq e_2 \\\\up{ and } h \\\\sim f|. \\\\]\\n\\\\end{defn}\"] Results: [\"Let $E$ be a meet-semilattice and $P$ a set partition of $E$. Write $\\\\sim$ for the equivalence relation on $E$ induced by $P$. That is, for $e,f\\\\in E$, $e\\\\sim f$ if and only if $e$ and $f$ are in the same part of $P$.\",\"\\\\begin{defn}We say $P$ is a {\\\\em $\\\\D$-partition} of $E$ if, whenever $e_1,e_2,f\\\\in E$ with $e_1\\\\sim e_2$ and $f\\\\leq e_1$, we have \\n\\\\[ |h\\\\in E: h\\\\leq e_1 \\\\up{ and }h \\\\sim f| = |h\\\\in E : h\\\\leq e_2 \\\\up{ and } h \\\\sim f|. \\\\]\\n\\\\end{defn}\",\"The main result of this section is Theorem \\\\ref{ThmLegitPartition}, which states that any set partition $P$ of $E$ for which there exists an inverse semigroup $S$ such that $E(S)=E$ and such that the restriction of $\\\\D$ from $S$ to $E(S)$ is $P$ is a $\\\\D$-partition of $E$. In fact we have the following more general result. Let $S$ be an inverse semigroup.\",\"\\\\begin{prop} \\\\label{PropLegitPartition} Let $s,t\\\\in S$, let $e\\\\in E(S)$, and let $s\\\\D e$. Let $f\\\\leq e$. %\\\\begin{enumerate} \\n\\tThen $$|\\\\{t\\\\in S:t\\\\leq s \\\\up{ and }t\\\\D f\\\\}| = |\\\\{g\\\\in S:g\\\\leq e \\\\up{ and }g\\\\D f\\\\}|.$$ %\\\\t\\\\label{bijective1} %\\\\t\\\\item If $t\\\\leq s$ and $t\\\\D h$ with $h\\\\in E(S)$, then $h\\\\D k$ for some $k\\\\leq e$. \\\\label{bijective2} (do we ever need this? I don't think so. We don't need it in this section or the next.) %\\\\end{enumerate} \\\\end{prop}\",\"\\\\begin{proof} Let $f\\\\leq e$, so $f$ is idempotent. Let $x\\\\in S$ such that $xx^{-1}=e$ and $x^{-1}x=ss^{-1}$. Define $$\\\\psi:\\\\{g\\\\in S:g\\\\leq e \\\\up{ and }g\\\\D f\\\\}\\\\rightarrow\\\\{t\\\\in S:t\\\\leq s \\\\up{ and } t\\\\D f\\\\}$$ by $\\\\psi(g)=x^{-1}gxs.$ We claim that $\\\\psi$ is a bijection. \\n\\nFirst, to show that the codomain of $\\\\psi$ really is $\\\\{t:t\\\\leq s \\\\up{ and } t\\\\D f\\\\}$, let $g\\\\leq e$ (so $g$ is idempotent and $g=eg=ge$) and $g\\\\D f$. Note that $x^{-1}gx$ is idempotent (by part \\\\eqref{simple7} of Theorem \\\\ref{ThmBasicProps}), so $\\\\psi(g)\\\\leq s$. We need to show that $\\\\psi(g)\\\\D f$. We have that \\\\begin{align*} \\\\ran(\\\\psi(g))&=\\\\psi(g)\\\\psi(g)^{-1}\\\\\\\\ &=x^{-1}gx(ss^{-1})x^{-1}gx\\\\\\\\ &=x^{-1}gx(x^{-1}x)x^{-1}gx\\\\\\\\ &=x^{-1}g(xx^{-1})(xx^{-1})gx\\\\\\\\ &=x^{-1}(xx^{-1})(xx^{-1})ggx\\\\\\\\ &=x^{-1}gx, \\\\end{align*} so we need to show that there exists $z\\\\in S$ such that $zz^{-1}=x^{-1}gx$ and $z^{-1}z=f$. Since $g\\\\D f$, let $y\\\\in S$ such that $yy^{-1}=g$ and $y^{-1}y=f$. Let $z=x^{-1}y$. \\n\\nThen $ zz^{-1}=x^{-1}yy^{-1}x=x^{-1}gx, $ as desired. Note that $y=yy^{-1}y=gy$, so we also have %\\\\begin{align*} %z^{-1}z&=y^{-1}xx^{-1}y\\\\\\\\ %&=y^{-1}ey\\\\\\\\ %&=y^{-1}egy\\\\\\\\ %&=y^{-1}gy\\\\\\\\ %&=y^{-1}y\\\\\\\\ %&=f, %\\\\end{align*} $$ z^{-1}z =y^{-1}xx^{-1}y =y^{-1}ey %=y^{-1}eyy^{-1}y =y^{-1}egy =y^{-1}gy =y^{-1}y =f, $$ so $z^{-1}z=f$, as desired. Thus $\\\\psi(g)\\\\D f$ and the codomain of $\\\\psi$ is as claimed. \\n\\nNext, to show $\\\\psi$ is injective, suppose $g_1,g_2\\\\leq e$ (so $eg_1=g_1$ and $eg_2=g_2$) and $\\\\psi(g_1)=\\\\psi(g_2)$. Then \\\\begin{align*} x^{-1}g_1xs&=x^{-1}g_2xs\\\\\\\\ \\\\implies x^{-1}g_1xss^{-1}&=x^{-1}g_2xss^{-1}\\\\\\\\ \\\\implies x^{-1}g_1xx^{-1}x&=x^{-1}g_2xx^{-1}x\\\\\\\\ \\\\implies x^{-1}g_1x&=x^{-1}g_2x\\\\\\\\ \\\\implies xx^{-1}g_1xx^{-1}&=xx^{-1}g_2xx^{-1}\\\\\\\\ \\\\implies eg_1e&=eg_2e\\\\\\\\ \\\\implies eeg_1&=eeg_2\\\\\\\\ \\\\implies eg_1&=eg_2\\\\\\\\ \\\\implies g_1&=g_2. \\\\end{align*} \\n\\nFinally, to show that $\\\\psi$ is surjective, let $t\\\\leq s$ and $t\\\\D f$. Then $t=gs$ for some $g\\\\in E(S)$, and there exists $y\\\\in S$ such that $yy^{-1}=tt^{-1}$ and $y^{-1}y=f$. We claim that $xgx^{-1}\\\\leq e$, $xgx^{-1}\\\\D f$, and $\\\\psi(xgx^{-1})=t$. To see why, first note that $xgx^{-1}$ is idempotent and $xgx^{-1} =xgx^{-1}xx^{-1} =xgx^{-1}e$, so $xgx^{-1}\\\\leq e$. Next, we show that $xgx^{-1}\\\\D f$ by showing that there exists $z\\\\in S$ such that $zz^{-1}=xgx^{-1}$ and $z^{-1}z=f$. If we take $z=xy$, then we have \\\\begin{align*} zz^{-1} &=xyy^{-1}x^{-1}\\\\\\\\ &=x tt^{-1} x^{-1}\\\\\\\\ &=x gss^{-1}g x^{-1}\\\\\\\\ &=x g x^{-1}x g x^{-1}\\\\\\\\ &=x g g x^{-1} xx^{-1}\\\\\\\\ &=x g x^{-1}. \\\\end{align*} Note that $tt^{-1}=gss^{-1}g=gx^{-1}xg=gx^{-1}x$, which implies that $$y=yy^{-1}y=tt^{-1}y=gx^{-1}xy.$$ Note also that $y^{-1}=y^{-1}yy^{-1}=fy^{-1}$. Therefore we have \\\\begin{align*} z^{-1}z&=y^{-1}x^{-1}xy\\\\\\\\ &=fy^{-1}x^{-1}xy\\\\\\\\ &=fy^{-1}x^{-1}xgx^{-1}xy\\\\\\\\ &=fy^{-1}gx^{-1}xx^{-1}xy\\\\\\\\ &=fy^{-1}gx^{-1}xy\\\\\\\\ &=fy^{-1}y\\\\\\\\ &=ff\\\\\\\\ &=f, \\\\end{align*} so $xgx^{-1} \\\\D f$. Finally we show that $\\\\psi(xgx^{-1})=t$. We have %\\\\begin{align*} $\\\\psi(xgx^{-1}) = x^{-1} xgx^{-1} xs =gx^{-1}xx^{-1}xs =gss^{-1}ss^{-1}s =gs =t.$ %\\\\end{align*} Thus $\\\\psi$ is surjective, completing the proof. \\\\end{proof}\"]"
},
{
"author": "Martin Malandro",
"expected_output": "%\\label{ThmPosetIsom1} %If $S$ and $T$ are isomorphic inverse semigroups and $\\phi: S \\rightarrow T$ is an isomorphism, then $\\phi$ is also an isomorphism of posets $\\phi: (S\\leq) \\rightarrow (T,\\leq)$. %",
"actual_output": "\\begin{theorem}[Fundamental Structure of Inverse Semigroups]\nLet $S$ be an inverse semigroup with idempotent set $E(S)$ and let the relation $\\le$ on $S$ be defined by any of the following equivalent conditions:\n\\begin{enumerate}\n \\item[(i)] $s\\le t$ if and only if $s=et$ for some $e\\in E(S)$,\n \\item[(ii)] $s=tf$ for some $f\\in E(S)$,\n \\item[(iii)] $s=ts^{-1}s$,\n \\item[(iv)] $s=ss^{-1}t$.\n\\end{enumerate}\nThen the following hold:\n\\begin{enumerate}\n \\item The restriction of $\\le$ to $E(S)$ endows $(E(S),\\le)$ with the structure of a meet‑semilattice; indeed, for any $e,f\\in E(S)$ we have $e\\le f$ if and only if $e=ef=fe$, and the meet is given by $e\\wedge f=ef=fe$.\n\n \\item For any $s,t\\in S$, the following are equivalent, defining Green's $\\mathcal{D}$‑relation for inverse semigroups:\n \\begin{enumerate}\n \\item[(a)] There exists $x\\in S$ with $\\operatorname{dom}(x)=\\operatorname{ran}(t)$ and $\\operatorname{ran}(x)=\\operatorname{ran}(s)$.\n \\item[(b)] There exists $y\\in S$ with $\\operatorname{dom}(y)=\\operatorname{dom}(t)$ and $\\operatorname{ran}(y)=\\operatorname{dom}(s)$.\n \\item[(c)] There exists $z\\in S$ with $\\operatorname{dom}(z)=\\operatorname{dom}(t)$ and $\\operatorname{ran}(z)=\\operatorname{ran}(s)$.\n \\end{enumerate}\n We denote $s\\mathrel{\\mathcal{D}}t$ when any (and hence all) of these conditions hold.\n\n \\item Every idempotent $e\\in E(S)$ acts as the identity of a unique maximal subgroup of $S$, namely\n \\[\n G_e=\\{\\,s\\in S:\\operatorname{dom}(s)=\\operatorname{ran}(s)=e\\,\\}.\n \\]\n Furthermore, if $e,f\\in E(S)$ satisfy $e\\mathrel{\\mathcal{D}}f$ then the corresponding maximal subgroups $G_e$ and $G_f$ are isomorphic. In particular, $S$ is a group (i.e. has a unique maximal subgroup) precisely when $|E(S)|=1$.\n\\end{enumerate}\n\\end{theorem}\n",
"input": "Given the following notation, write a theorem that will be useful in proving the paper. Notation: [\"An {\\\\\\\\em inverse semigroup} is a nonempty semigroup $S$ where, for each $x\\\\in S$, there exists a unique $y\\\\in S$ such that $xyx=x$ and $yxy=y$. We call $y$ the {\\\\\\\\em inverse} of $x$, and we write $x^{-1}=y$.\",\"There is a well-known alternate characterization of inverse semigroups. \\\\\\\\begin{thm}A nonempty semigroup $S$ is an inverse semigroup if and only if $S$ is regular (meaning for each $x\\\\in S$ there exists $y\\\\in S$ such that $xyx=x$ and $yxy=y$) and the idempotents of $S$ commute. \\\\\\\\end{thm}\",\"Let $S$ be an inverse semigroup. We denote by $E(S)$ the set of idempotents of $S$. If $x\\\\in S$, it is immediate that $xx^{-1},x^{-1}x\\\\in E(S)$, so $|E(S)|\\\\geq 1$, and furthermore that if $e\\\\in E(S)$, then $e=e^{-1}$. It is also clear from the alternate characterization that if $e,f\\\\in E(S)$, then $ef\\\\in E(S)$. It is also well known and easy to prove that $S$ is a group if and only if $|E(S)|=1$.\",\"\\\\\\\\begin{defn}Let $S,T$ be semigroups. A map $\\\\phi:S\\\\rightarrow T$ is called a {\\\\\\\\em homomorphism} if $\\\\phi(st)=\\\\phi(s)\\\\phi(t)$ for all $s,t\\\\in S$, and is called an {\\\\\\\\em anti-homomorphism} if $\\\\phi(st)=\\\\phi(t)\\\\phi(s)$ for all $s,t\\\\in S$. An {\\\\\\\\em isomorphism} is a bijective homomorphism and an {\\\\\\\\em anti-isomorphism} is a bijective anti-homomorphism. $S$ and $T$ are {\\\\\\\\em isomorphic} (resp., {\\\\\\\\em anti-isomorphic}) if there is an isomorphism (resp., anti-isomorphism) from $S$ to $T$. If $S$ and $T$ are isomorphic, we write $S\\\\cong T$. \\\\\\\\end{defn}\",\"For $s,t\\\\in S$, we define $s\\\\leq t$ if and only if any of the following four equivalent conditions hold. \\\\\\\\begin{itemize} \\\\\\\\titem $s=et$ for some $e\\\\in E(S)$. \\\\\\\\titem $s=tf$ for some $f\\\\in E(S)$. \\\\\\\\titem $s=ts^{-1}s$. \\\\\\\\titem $s=ss^{-1}t$. \\\\\\\\end{itemize}\",\"Thus, the restriction of $\\\\leq$ to $E(S)$ is given by the rule that, for $e,f\\\\in E(S)$, $e\\\\leq f$ if and only if $e=ef=fe$. Therefore $(E(S),\\\\leq)$ is a meet-semilattice, where the meet $e\\\\\\\\meet f$ of $e,f\\\\in E(S)$ is given by $e\\\\\\\\meet f=ef=fe$. Conversely, every meet-semilattice is an idempotent inverse semigroup under the meet operation.\",\"As is common in inverse semigroup theory, for $s\\\\in S$, let us write $$\\\\dom(s)=s^{-1}s$$ and $$\\\\ran(s)=ss^{-1}.$$\",\"\\\\\\\\begin{defn}For $s,t\\\\in S$, we say that $s$ is $\\\\\\\\D$-related to $t$ and we write $s \\\\\\\\D t$ if and only if any of the following equivalent conditions hold. \\\\\\\\begin{enumerate}[(i)] \\\\\\\\titem \\\\\\\\label{DEquiv1} There exists $x\\\\in S$ such that $\\\\dom(x)=\\\\ran(t)$ and $\\\\ran(x)=\\\\ran(s)$. \\\\\\\\titem \\\\\\\\label{DEquiv2} There exists $y\\\\in S$ such that $\\\\dom(y)=\\\\dom(t)$ and $\\\\ran(y)=\\\\dom(s)$. \\\\\\\\titem \\\\\\\\label{DEquiv3} There exists $z\\\\in S$ such that $\\\\dom(z)=\\\\dom(t)$ and $\\\\ran(z)=\\\\ran(s)$. \\\\\\\\end{enumerate} \\\\\\\\end{defn}\",\"A subset $G$ of $S$ is a {\\\\\\\\em subgroup} of $S$ if $G$ is a group with respect to the operation of $S$. A subgroup $G$ of $S$ is {\\\\\\\\em maximal} if $G$ is not properly contained in any other subgroup of $S$.\",\"Every idempotent $e$ of $S$ is the identity for a unique maximal subgroup of $S$, called the {\\\\\\\\em maximal subgroup of $S$ at $e$} and denoted $G_e$. For any subgroup $G$ of $S$ containing $e$, we have $G\\\\subseteq G_e$. In fact %\\\\\\\\cite{CliffPres} $$ G_e=\\\\{ s\\\\in S:\\\\dom(s)=\\\\ran(s)=e\\\\}, $$ %\\\\\\\\cite{Steinberg2}. and if $e,f\\\\in E(S)$ with $e \\\\\\\\D f$, then $G_e\\\\\\\\cong G_f$. Let $P$ denote the restriction of Green's $\\\\\\\\D$-relation on $S$ to $E(S)$. Every $\\\\\\\\D$-class of $S$ contains at least one idempotent, so $P$ is a partition of $E(S)$. Let $X\\\\in P$ and let $G$ be a group. If $G_e\\\\\\\\cong G$ for some $e\\\\in X$ (and hence for every $e\\\\in X$), then we shall write $G_X \\\\\\\\cong G$.\"]"
}
]