Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Proposition 2.1, p. 3, with Definition 1.1 (p. 1), of Serkan Hoşten and Diane Maclagan, The vertex ideal of a lattice, arXiv:math/0012197v1 (2000), published in Adv. in Appl. Math. 29 (2002), 521--538, as identified on the source card. Page numbers are those of the arXiv print.

Setting

Let L\mathcal L be a lattice in Zn\mathbf Z^n with dim⁡(L)=m\dim(\mathcal L)=m (Definition 1.1, p. 1). For u∈Nnu\in\mathbf N^n the fiber of uu is

Pu=conv⁡{v∈Nn:u−v∈L},P_u=\operatorname{conv}\{v\in\mathbf N^n:u-v\in\mathcal L\},

and Pv=PuP_v=P_u whenever v∈Puv\in P_u. Each fiber is a rational polyhedron (Theorem 16.1 of Schrijver's Theory of Linear and Integer Programming, cited on p. 1), so it has finitely many vertices Vert⁡(Pu)\operatorname{Vert}(P_u). Let S=k[x1,…,xn]S=k[x_1,\ldots,x_n] and let eie_i be the ii-th unit vector.

Statement

Proposition 2.1 (p. 3). Let PuP_u be a fiber of L\mathcal L. If vv is a vertex of PuP_u and vi>0v_i>0, then v−eiv-e_i is a vertex of its own fiber (the print writes that fiber as Pu−eiP_{u-e_i}). Equivalently, there is a monomial ideal VL⊆SV_{\mathcal L}\subseteq S such that xv∉VLx^v\notin V_{\mathcal L} if and only if v∈Vert⁡(Pu)v\in\operatorname{Vert}(P_u) for a fiber PuP_u of L\mathcal L.

The paper calls VLV_{\mathcal L} the vertex ideal of L\mathcal L (p. 1): its standard monomials are exactly the monomials whose exponents are vertices of their fibers, and the union of all Vert⁡(Pu)\operatorname{Vert}(P_u), $u\in\mathbf N^n$, is an order ideal of Nn\mathbf N^n.

Read depth. Claims checked: the statement and Definition 1.1 were read clause by clause on pp. 1 and 3, with the short proof on p. 3.

Proof pointer

Page 3. If v−eiv-e_i were a convex combination of other points of its fiber, adding eie_i to each of them would write vv as a convex combination of other points of PuP_u.

Dependencies

Definition 1.1 of the same paper; finiteness of the vertex set of a rational polyhedron, cited from Schrijver.

Bears on

  • Problem 963: background only. The paper does not mention dissociated sets, subset sums or the problem. The source card's section on E963 uses this proposition to read xS∉VLXx_S\notin V_{\mathcal L_X}, for the lattice LX\mathcal L_X of integer relations among the elements of XX, as the statement that the incidence vector of SS is a vertex of its fiber, which with Definition 4.1 implies that SS is dissociated; it gives no bound on the size of such SS.