Math 2.0

Convex and discrete geometry Convex sets: basic notions Lemma

Gordan's lemma

Builds on Convex coneMonoidLattice (group)

Statement

Let n≥1n \ge 1 and let v1,…,vk∈ℤnv_1, \dots, v_k \in \Z^n. Let C={λ1v1+⋯+λkvk:λ1,…,λk≥0}C = \set{\lambda_1 v_1 + \cdots + \lambda_k v_k : \lambda_1, \dots, \lambda_k \ge 0} be the rational polyhedral convex cone they generate in ℝn\R^n. Then the monoid C∩ℤnC \cap \Z^n, with the addition of ℤn\Z^n, is finitely generated.

Remarks

Let P={t1v1+⋯+tkvk:0≤ti<1}P = \set{t_1 v_1 + \cdots + t_k v_k : 0 \le t_i < 1}. It is a bounded set, so P∩ℤnP \cap \Z^n is finite. Every x∈C∩ℤnx \in C \cap \Z^n can be written x=∑itivix = \sum_i t_i v_i with ti≥0t_i \ge 0, and then x=∑i⌊ti⌋vi+px = \sum_i \floor{t_i} v_i + p with p=∑i(ti−⌊ti⌋)vi∈P∩ℤnp = \sum_i (t_i - \floor{t_i}) v_i \in P \cap \Z^n. So the finite set {v1,…,vk}∪(P∩ℤn)\set{v_1, \dots, v_k} \cup (P \cap \Z^n) generates C∩ℤnC \cap \Z^n.

Example: v1=(1,0)v_1 = (1, 0) and v2=(1,2)v_2 = (1, 2) in ℤ2\Z^2. Here P∩ℤ2={(0,0),(1,1)}P \cap \Z^2 = \set{(0,0), (1,1)}, so C∩ℤ2C \cap \Z^2 is generated by (1,0)(1,0), (1,1)(1,1), (1,2)(1,2). The point (1,1)(1,1) is needed: it lies in CC but is not a combination of (1,0)(1,0) and (1,2)(1,2) with nonnegative integer coefficients.

Rationality is needed. For the cone C={(x,y):x≥0, 0≤y≤2 x}C = \set{(x, y) : x \ge 0, \ 0 \le y \le \sqrt{2}\, x} the monoid C∩ℤ2C \cap \Z^2 is not finitely generated. Finitely many generators in C∩ℤ2C \cap \Z^2 only produce points of slope at most qq, the largest slope of a generator, and q<2q < \sqrt{2} since qq is rational. But CC contains lattice points (b,a)(b, a) with q<a/b<2q < a/b < \sqrt{2}.

Going deeper

For a student

The lemma is the combinatorial input of the theory of affine toric varieties. For a rational cone σ\sigma, the semigroup algebra of σ∨∩M\sigma^\vee \cap M is then finitely generated, and its spectrum is the toric variety of σ\sigma. The minimal generating set of C∩ℤnC \cap \Z^n for a pointed cone is its Hilbert basis. In invariant theory the same statement is used to show that rings of invariants of tori are finitely generated.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex cone concept
  2. Lattice (group) concept
  3. Monoid concept
  4. Gordan's lemma statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Gordan's_lemma
About this page
TagHEKDP2TDNZ
URIm2://HEKDP2TDNZ
Kindstatement, lemma
WritingW0 stub
MSC52B20, 14M25
StatusThis copy of the site has no build data. Run m2 status HEKDP2TDNZ.
AboutConvex cone, Monoid
UsesConvex cone, Monoid, Lattice (group)
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.