TEST 1 Flashcards
Relation from set A to set B
a subset R of AxB
Properties of a relation R on a set A
R is reflexive if aRa for all a in A
R is symmetric if aRb then bRa for all a,b in A
R is transitive if aRb and bRc then aRc for all a,b,c in A
Equivalence Relation on a set A
a relation on A that is reflexive, symmetric, and transitive
Equivalence Class of s in set S under equivalence relation ~
[s] = {x in S | x ~ s} where S is a set and ~ is an equivalence relation on S.
Binary Operation on set S
a function *: SxS -> S
Commutative Binary Operation * on set S
s * t = t * s for all s,t in set S
Associative Binary Operation * on set S
(a * b) * c = a * (b * c) for all a,b,c in set S
Closed Under Binary Operation *
Let T be a subset of set S and * a binary operation on S. Then t1 * t2 is in T for all t1,t2 in T.
Group
an ordered pair (G, *) such that
- is a binary operation on the set G
- is associative on G
- There exists an element e (identity) in G such that e * x = x and x * e = x for every x in G.
- For every x in G there exists y (inverse of x) in G such that x * y = e and y * x = e.
Abelian group
a group with a commutative binary operation
Binary Algebraic Structure
(S, *) where * is a binary operation on a set S
Isomorphism from (S1, *) to (S2, *’)
a function f: S1->S2 satisfying:
- f is bijective (injective/1-1 and surjective/onto)
- f(a) *’ f(b) = f(a * b) for all a,b in S1
Structural Properties
- operation is commutative
- operation is associative
- cardinality of the set (ex. set has 11 elements)
Supgroup
a subset H of G where (G, * ) is a group such that H is also a group with the “same” binary operation
Criterion to be a Subgorup
Suppose (G, * ) is a group and H is a subset of G.
- H is closed under * (h1,h2 in H implies h1 * h2 in H)
- e is in H
- If h is in H, then h^(-1) is in H (H is closed under inverses)