−Table of Contents
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→(y→z)=(x⋅y)→z
x→x=1
(x→y)⋅x=(y→x)⋅y
Remark: This definition shows that hoops form a variety.
Hoops are partially ordered by the relation x≤y⟺x→y=1.
The operation x∧y=(x→y)⋅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
x⋅y=y⋅x
x⋅1=x
x→(y→z)=(x⋅y)→z
x→x=1
(x→y)⋅x=(y→x)⋅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 x≤y is defined by x→y=1 then
≤ is a partial order,
→ is the residual of ⋅, i.e., x⋅y≤z⟺y≤x→z, and
(x→y)⋅x=(y→x)⋅y.
Morphisms
Let A and B be hoops. A morphism from A to B is a function h:A→B that is a homomorphism:
h(x⋅y)=h(x)⋅h(y), h(x→y)=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