Division Algorithm to Infinite Groups Flashcards
Division Algorithm for Z
Let m,n ϵ Z with n>0. Then ∃! integers q,r such that m=nq+r where 0≤r
Divisibility: If n|m
then m=nk for some integer k
We say that a is congruent to b modulo n, written a≡b(modn) iff___
iff a and b have the same remainder when divided by n or n divides the b - a
Proving an Equivalence Relation
- Non empty
- reflexive a∼a
- symmetric if a∼b then b∼a
- transitive if a∼b and b∼c then a∼c
Equivalence Class of a in S under ∼
The equivalence class determined by a is [a]={x ∈ S | x∼a }
T/F. [a]=∅
F because it is of relflexive property
An element of an equivalence class is called a _____ of the class
representative
A ____ of a set S is a collection of non-empty disjoint subsets of S whose union is S
Partition
The equivalence relation “congruence modulo n” partitions Z into n classes ([0],[1],[2],[3],…,[n-1]). The classes are referred to as _____
residue classes modulo n
A _____ on a non-empty set S is a rule that assigns to each ordered pair (a,b) of elements of S some elements of S given by (a*b).
binary operation *
- is a function from ____ to ____
S x S into S
A binary operation on S is said to be ____ on S
closed
_____ describes the structure of a FINITE group by arranging ALL the POSSIBLE products of all the group’s elements in a square table
Cayley Table
Axioms to be satisfied for Groups
- G is non-empty
- binary operation * is associative
- identity element
- inverse element
T/F. Composition of Functions is not associative.
F