Binary Operations
How to show that binary structures are not isomorphic?
9.1
How do we demonstrate that two binary structures
Let S be a nonempty set. A binary operation * on a set ⟨S, ∗⟩ and ⟨S′, ∗′⟩ are not isomorphic, if this is the
S is a function mapping S × S into S. For each (a, b) ∈ case?
o This would mean that there is no one-to-one
S × S, we will denote the element ∗(a, b) of S by a ∗ b.
function 𝜙 from S onto S′with the property that
o A binary operation ∗ on S is a rule for combining 𝜙(x ∗ y) = 𝜙(x) ∗′𝜙(y) for all x, y ∈ S.
two elements of S to produce another element o In general, it is clearly not feasible to try every possible
of S. Thus, we can say that S is closed with one-to-one function mapping S onto S′ and test
respect to ∗. whether it has this property, except in the case where
there are no such functions. This is precisely the case
o The important things to note are: when S and S′ do not have the same cardinality.
→ a ∗ b must be defined for all a, b ∈ S
Structural property
→ a ∗ b must itself be an element of S
A structural property of a binary structure is one that
for all a, b ∈ S
must be shared by any isomorphic structure. It is not
concerned with names or some nonstructural
Definition 9.2
characteristics of the elements.
Let ∗ be a binary operation on S and let H be a subset
of S. The subset H is closed under * if for all a, b ∈ H, In the event that there are no one-to-one mappings of
we also have a ∗ b ∈ H. In this case, the binary S onto S′, we usually show that ⟨S, ∗⟩ is not isomorphic
operation on H given by restricting ∗ to H is the induced to ⟨S, ∗′⟩ by showing that one has some structural
operation of ∗ on H. property that the other does not possess.
Definition 9.3 Possible Structural/Nonstructural Properties
A binary operation ∗ on a set S is commutative if (and Possible Structural Properties:
only if) a ∗ b = b ∗ a for all a, b ∈ S. o The set has 4 elements.
o The operation is commutative.
Definition 9.4 o x ∗ x = x for all x ∈ S.
A binary operation on a set S is associative if o The equation a ∗ x = b has a solution x in S for
(a ∗ b) ∗ c = a ∗ (b ∗ c) for all a, b, c ∈ S. all a, b ∈ S.
o The equation x ∗ x = s has a solution in S for all
s ∈ S.
Isomorphic Binary Structures o There is an element e in S such that e ∗ s = s for
all s ∈ S.
Definition 10.1
A binary algebraic structure ⟨S, ∗⟩ is a set S together Possible Nonstructural Properties:
with a binary operation ∗ on S. o The number 4 is an element.
o The operation is called addition.
Definition 10.2
o The elements of S are matrices.
Let ⟨S, ∗⟩ and ⟨S′, ∗′⟩ be binary algebraic structures. o S is a subset of C.
An isomorphism of S with S′is a one-to-one function
𝜙 mapping S onto S′such that Definition 10.3
𝜙(x ∗ y) = 𝜙(x) ∗′𝜙(y) for all x, y ∈ S. Let ⟨S, ∗⟩ be a binary structure. An element e of S is
an identity element for * if
o The condition 𝜙(x ∗ y) = 𝜙(x) ∗′𝜙(y) in the
e ∗ s = s ∗ e = s for all s ∈ S.
above definition is called the homomorphism
property. Theorem 10.1 (Uniqueness of Identity Element)
o If such a map 𝜙 exists, then S and S′are A binary structure ⟨S, ∗⟩ has at most one identity
isomorphic binary structures, which we element. That is, if there is an identity element, it is
denoted by S ≅ S′ unique.
Theorem 10.2
How to show that binary structures are isomorphic?
o Define the function 𝜙 that gives the Suppose ⟨S, ∗⟩ has an identity element e for ∗. If
isomorphism of S with S′ 𝜙 : S → S′ is an isomorphism of ⟨S, ∗⟩ with ⟨S′, ∗′⟩,
o Show that 𝜙 is a one-to-one function. then 𝜙(e) is an identity for the binary operation ∗′ on
o Show that 𝜙 is onto S′. S′.
o Show that 𝜙(x ∗ y) = 𝜙(x) ∗′𝜙(y) for all x, y ∈ S.