UNIT 2 PART 4 Flashcards
What is a function?
two sets A and B
f:A->B IF FOR EVERY ELEMENT IN A -> image in B
one cannot branch out into two
domain and codomain
f:A->B
A=DOMAIN
B=CODOMAIN
Types of functions
identity: f(a) = a
constant: f(a) = c
onto,surjective: every image in B, pre-image in A
one-one,injective:diff ele in A,diff ele in B, two cannot branch out to one
bijection:one-one + onto
many to one:many ele map to one
composition of function
f:x->y f:y->z
x belongs to X, z belongs to Z, exists y in Y f(x) = y and g(y) = z
same as relation except gof = f -> g not in order
Equivalence classes
R -> equivalence relation
x blong X
y blng X and xRy
.
Inverse functions
~
reverse each ordered pair
not always a function, only if f was one-one
identity mapping
.
f:x->y g:y->x
g is finverse if gof =Ix anf fog = Iy
(gof)inverse = finverse o g inverse
properties of function
f,g in Fx -> fog and gof also in Fx (Closure property of op of comp)
f,g,h in Fx (fog)oh associative
fof-1 = Ix
foIx = f
recursive functions
func specify f(x) for particular val, rest with val
algebraic structure
sys = nonempty set + one or more n-ary operations
{S,f1,f2..}
CADCIII
Homomorphism
same type, o and * binary op
image g:x->y homomorph g(x1ox2) = g(x1)*g(x2) onto ->epi 1-1 ->mono both ->endo
ISomorphism
homomorphism
y sub or equal to x
automorphism
y=x isomorphism
semigroup
associative
AIDIC -> SMGA
monoid
associative,identity
moniod -> subgroup