Affine monoid

From HandWiki

In abstract algebra, a branch of mathematics, an affine monoid is a commutative monoid that is finitely generated, and is isomorphic to a submonoid of a free abelian group ℤd,d≥0.[1] Affine monoids are closely connected to convex polyhedra, and their associated algebras are of much use in the algebraic study of these geometric objects.

Characterization

  • Affine monoids are finitely generated. This means for a monoid M, there exists m1,…,mn∈M such that
M=m1Z++…+mnZ+.
x+y=x+z implies that y=z for all x,y,z∈M, where + denotes the binary operation on the affine monoid M.
  • Affine monoids are also torsion free. For an affine monoid M, nx=ny implies that x=y for n∈ℕ, and x,y∈M.
  • A subset N of a monoid M that is itself a monoid with respect to the operation on M is a submonoid of M.

Properties and examples

  • Every submonoid of ℤ is finitely generated. Hence, every submonoid of ℤ is affine.
  • The submonoid {(x,y)∈ℤ×ℤ∣y>0}∪{(0,0)} of ℤ×ℤ is not finitely generated, and therefore not affine.
  • The intersection of two affine monoids is an affine monoid.

Affine monoids

Group of differences

If M is an affine monoid, it can be embedded into a group. More specifically, there is a unique group gp(M), called the group of differences, in which M can be embedded.

Definition

  • gp(M) can be viewed as the set of equivalences classes x−y, where x−y=u−v if and only if x+v+z=u+y+z, for z∈M, and

(x−y)+(u−v)=(x+u)−(y+v) defines the addition.[1]

  • The rank of an affine monoid M is the rank of a group of gp(M).[1]
  • If an affine monoid M is given as a submonoid of ℤr, then gp(M)≅ℤM, where ℤM is the subgroup of ℤr.[1]

Universal property

for any monoid homomorphism φ:M→G, where G is a group, there is a unique group homomorphism ψ:gp(M)→G, such that φ=ψ∘ι, and since affine monoids are cancellative, it follows that ι is an embedding. In other words, every affine monoid can be embedded into a group.

Normal affine monoids

Definition

  • If M is a submonoid of an affine monoid N, then the submonoid
M^N={x∈N∣mx∈M,m∈ℕ}

is the integral closure of M in N. If M=MN^, then M is integrally closed.

  • The normalization of an affine monoid M is the integral closure of M in gp(M). If the normalization of M, is M itself, then M is a normal affine monoid.[1]
  • A monoid M is a normal affine monoid if and only if ℝ+M is finitely generated and M=ℤr∩ℝ+M .

Affine monoid rings

see also: Group ring

Definition

  • Let M be an affine monoid, and R a commutative ring. Then one can form the affine monoid ring R[M]. This is an R-module with a free basis M, so if f∈R[M], then
f=∑i=1nfixi, where fi∈R,xi∈M, and n∈ℕ.
In other words, R[M] is the set of finite sums of elements of M with coefficients in R.

Connection to convex geometry

Affine monoids arise naturally from convex polyhedra, convex cones, and their associated discrete structures.
  • Let C be a rational convex cone in ℝn, and let L be a lattice in ℚn. Then C∩L is an affine monoid.[1] (Lemma 2.9, Gordan's lemma)
  • If M is a submonoid of ℝn, then ℝ+M is a cone if and only if M is an affine monoid.
  • If M is a submonoid of ℝn, and C is a cone generated by the elements of gp(M), then M∩C is an affine monoid.
  • Let P in ℝn be a rational polyhedron, C the recession cone of P, and L a lattice in ℚn. Then P∩L is a finitely generated module over the affine monoid C∩L.[1] (Theorem 2.12)

See also

References

  1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 1.6 Bruns, Winfried; Gubeladze, Joseph (2009). Polytopes, Rings, and K-Theory. Monographs in Mathematics. Springer. ISBN 0-387-76356-2. https://books.google.com/books?id=pbgg1pFxW8YC.