Processing math: 100%

Hoops

Definition

A \emph{hoop} is a structure A=A,,,1 of type 2,2,0 such that

A,,1 is a commutative monoid

x(yz)=(xy)z

xx=1

(xy)x=(yx)y

Remark: This definition shows that hoops form a variety.

Hoops are partially ordered by the relation xyxy=1.

The operation xy=(xy)x is a meet with respect to this order.

Definition

A \emph{hoop} is a structure A=A,,,1 of type 2,2,0 such that

xy=yx

x1=x

x(yz)=(xy)z

xx=1

(xy)x=(yx)y

Definition

A \emph{hoop} is a structure A=A,,,1 of type 2,2,0 such that

A,,1 is a commutative monoid

and if xy is defined by xy=1 then

is a partial order,

is the residual of , i.e.,  xyzyxz, and

(xy)x=(yx)y.

Morphisms

Let A and B be hoops. A morphism from A to B is a function h:AB that is a homomorphism:

h(xy)=h(x)h(y), h(xy)=h(x)h(y), h(1)=1

Examples

Example 1:

Basic results

Finite hoops are the same as generalized BL-algebras (= divisible residuated lattices) since the join always exists in a finite meet-semilattice with top, and since all finite GBL-algebras are commutative and integral.

Properties

Finite members

f(1)=1f(2)=1f(3)=2f(4)=5f(5)=10f(6)=23f(7)=49

Subclasses

Superclasses

References


QR Code
QR Code hoops (generated for current page)