Noam Zeilberger dmonoid (Rev #1, changes)

Showing changes from revision #0 to #1: Added | Removed | Changed

Contents

Idea

A dmonoid is a “directed” monoid.

Definition

A (left) dmonoid is a preorder (X,≤)(X,\le) equipped with:

  1. a binary operation ⋅\cdot (called multiplication) which is monotonic in both arguments:
    (1)a 1≤a 2b 1≤b 2 a 1⋅b 1≤a 2⋅b 2 \array{ \arrayopts{\rowlines{solid}} a_1 \le a_2 \quad b_1 \le b_2 \\ a_1\cdot b_1 \le a_2\cdot b_2 }

    and which satisfies the semi-associative law:

    (2)(a⋅b)⋅c≤a⋅(b⋅c) (a \cdot b)\cdot c \le a \cdot (b\cdot c)

    for all a,b,c∈Xa,b,c \in X; and

  2. an element I∈XI \in X (called unit) satisfying left and right unit laws:
    (3)I⋅a≤a I \cdot a \le a
    (4)a≤a⋅I a \le a \cdot I

    for all a∈Xa \in X.

References

  • Ross Street. Skew-closed categories. Journal of Pure and Applied Algebra 217(6) (June 2013), arXiv:1205.6522

  • Kornel Szlachanyi. Skew-monoidal categories and bialgebroids. arXiv:1201.4981

  • Dov Tamari. Monoïdes préordonnés et chaînes de Malcev. Thèse, Université de Paris, 1951.

  • Dov Tamari. Sur quelques problèmes d’associativité. Ann. sci. de Univ. de Clermont-Ferrand 2, Sér. Math., vol. 24, pp. 91-107, 1964. url

Revision on May 1, 2017 at 14:20:59 by Noam Zeilberger?. See the history of this page for a list of all contributions to it.