nLab
hypermonoid

Contents

Definition

By removing structure and properties from the notion of hypergroup, a hypermonoid is a set equipped with an associative multivalued multiplication. There are several equivalent ways of making this more precise:

  • A hypermonoid is a monoid MM in the monoidal Pos-enriched category of sets and total (entire) relations, where the tensor product of sets is cartesian product and the tensor product of relations R:ABR: A \to B, S:CDS: C \to D is defined by the truth-value assignment

    (R×S)((a,c),(b,d))=R(a,b)S(c,d)(R \times S)((a, c), (b, d)) = R(a, b) \wedge S(c, d)

    The unit u:1Mu: 1 \to M is assumed to be a well-defined relation (therefore a function).

  • A hypermonoid is a 2\mathbf{2}-enriched promonoidal category structure on a discrete poset SS, whose prounit is a singleton and whose promultiplication S×SPSS \times S \to P S takes values in P +(S)P_+(S) (nonempty subsets);

  • A hypermonoid is a structure of quantale on a power set P(S)P(S), whose unit is a singleton and where the quantale multiplication \cdot satisfies TUT \cdot U \neq \bot whenever T,UT, U \neq \bot.

(In the opinion of one of the article authors (Todd Trimble), one may legitimately ask what is the mathematical gain in restricting to total relations and in the condition that the unit is functional. Lifting these restrictions, one obtains the simpler notion of quantale.)

Examples

Special types

Analogous to how ordinary monoids refine to groups and to rings, hypermonoids refine to

See there for more examples.

Specific examples

Boolean Hecke algebra of a Coxeter group

Let WW be a finite Coxeter group. A Coxeter group is by definition a group presentation, generated by elements s 1,,s ns_1, \ldots, s_n and subject to relations of the form

(s is j) m ij=1(s_i s_j)^{m_{i j}} = 1

where m ijm_{i j} is a collection of integers specified by a Coxeter diagram or Coxeter matrix, assumed symmetric and with m ii=1m_{i i} = 1. We may rewrite the presentation as

s i 2=1,s is j=s js is_{i}^{2} = 1, \qquad s_i s_j \ldots = s_j s_i \ldots

where the words on either side of the second equation alternate between s is_i and s js_j and have length m ijm_{i j}.

The Boolean Hecke algebra of a Coxeter group WW is a quantale whose underlying sup-lattice is PWP W, and whose quantalic multiplication is uniquely determined by a hypermonoid structure which satisfies

{s i}{s i}={s i,1},s is j=s js i\{s_i\} \cdot \{s_i\} = \{s_i, 1\}, \qquad s_i s_j \ldots = s_j s_i \ldots

and described as follows:

  • If ww is a reduced word s i 1s i 2s i ks_{i_1} s_{i_2} \ldots s_{i_k}, then the hypermonoid product js i j\prod_j s_{i_j} is {[w]}\{[w]\} where [w][w] is the value of ww in WW;

  • Given a generator ss and a reduced word w=wsw = w' s in the Coxeter group presentation, define {[w]}{s}={[ws],[w]}\{[w]\} \cdot \{s\} = \{[w' s], [w']\}.

It may be shown that this recipe gives a well-defined map W×WP(W)W \times W \to P(W) that gives a hypermonoid structure.

This description appears to depend on combinatorial technicalities of Coxeter groups, but it can be made more conceptual if the Coxeter group WW is seen as arising from a BN-pair. A BN-pair? (see also references below) is given by a simple algebraic group GG, a Borel subgroup BB, and a normalizer NN of a maximal torus TT for which T=BNT = B \cap N and G=BNG = B N, satisfying some conditions. The corresponding Boolean Hecke algebra may be defined to be the quantale whose elements are GG-equivariant sup-preserving maps

P(G/B)P(G/B)P(G/B) \to P(G/B)

where the quantale multiplication is composition. As a sup-lattice, this quantale is isomorphic to P(B\G/B)P(B\backslash G/B), the power set of the set of double cosets BgBB g B. According to the general theory of BN-pairs, the double cosets are in bijection with the elements of a Coxeter group WW given by N/TN/T; the bijection is given by the well-defined map

WB\G/B:wBwBW \to B \backslash G/B: w \mapsto B w B

Hence P(W)P(B\G/B)P(W) \cong P(B\backslash G/B) as sup-lattices, but the algebra structure on P(B\G/B)P(B \backslash G/B) can be regarded as a deformation of the group algebra structure. The unit is the singleton {BeB}\{B e B\}.

Other examples

Hecke algebras are a deformation of the Coxeter group algebra. Under certain conditions, other deformations of group or monoid algebras of monoids MM can be exploited to yield hypermonoids.

For example, if the multiplication table of such a deformation is given by equations

g ig j= ka ij kg kg_i g_j = \sum_k a_{i j}^{k} g_k

where all the a ij ka_{i j}^k are nonnegative rational numbers of which at least one is nonzero for each pair i,ji, j, then we may obtain a hypermonoid by replacing each positive a ij ka_{i j}^{k} by 11 and interpreting the sum as a join in the Boolean algebra P(M)P(M). This procedure may be termed “Booleanization”. For example, in the case of Hecke algebras, we have

s i 2=q1qs i+1qs_{i}^{2} = \frac{q-1}{q} s_i + \frac1{q}

and if the parameter qq is specialized to positive integer values (e.g., powers of primes), one may apply Booleanization to obtain the Boolean Hecke algebra.

In general the principle is this: if the structure coefficients a ij ka_{i j}^{k} belong to a rig AA, so that we have a deformation A[M] dA[M]_d of a monoid rig, and if one is provided with a rig homomorphism p:A2=({0,1},+=,=)p: A \to\mathbf{2} = (\{0, 1\}, + = \vee, \cdot = \wedge) then there is a Booleanized hypermonoid structure defined by the composite

M×MmultA[M] dA AA[M] dp A12 AA[M] d2[M] dP(M)M \times M \stackrel{mult}{\to} A[M]_d \cong A \otimes_A A[M]_d \stackrel{p \otimes_A 1}{\to} \mathbf{2} \otimes_A A[M]_d \cong \mathbf{2}[M]_d \hookrightarrow P(M)

For instance, there is a unique rig homomorphism p: +2p: \mathbb{Q}_+ \to \mathbf{2} from the rig of nonnegative rational numbers.

References

Revised on August 8, 2012 18:17:06 by Andrew Stacey (192.76.7.219)