Processing math: 100%

Table of Contents

Boolean groups

Abbreviation: BGrp

Definition

A \emph{Boolean group} is a monoid M=M,,e such that

every element has order 2: xx=e.

Morphisms

Let M and N be Boolean groups. A morphism from M to N is a function h:MN that is a homomorphism:

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

Examples

Example 1: {0,1},+,0, the two-element group with addition-mod-2. This algebra generates the variety of Boolean groups.

Basic results

Properties

Finite members

f(1)=1f(2)=1f(3)=0f(4)=1f(5)=0f(6)=0f(7)=0f(8)=1

Subclasses

Trivial algebras

Superclasses

Abelian groups

References