Affine monoid

From testwiki
Revision as of 09:50, 3 August 2024 by imported>VSankeerthSai1609 (Added short description)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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,d0.[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,,mnM such that
M=m1+++mn+.
x+y=x+z implies that y=z for all x,y,zM, 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,yM.
  • 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

Template:See also

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 xy, where xy=uv if and only if x+v+z=u+y+z, for zM, and

(xy)+(uv)=(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 φ:MG, 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={xNmxM,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 fR[M], then
f=i=1nfixi, where fiR,xiM, 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 CL 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 MC 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 PL is a finitely generated module over the affine monoid CL.[1] (Theorem 2.12)

See also

References