(G,∗) is a group iff∗ is a binary operation on set G satisfying:
Non-empty G=∅.
Closed ∀a,b∈G,a∗b∈G.
Associateive ∀a,b,c∈G,(a∗b)∗c=a∗(b∗c).
Identity exists ∃e∈G such that ∀a∈G,e∗a=a∗e=a.
Inverse exists ∀a∈G,∃a−1∈G such that a∗a−1=a−1∗a=e.
Can either be finite or infinite.
Properties:
Identity is unique.
Inverse is unique for each element.
∀a∈G,aˉˉ=a.
Examples:
(Z,+)
(R,+)
(R∖0,⋅)
Monster Group
A finite group with roughly 8×1053 elements.
Abelian Group
A group where the binary operation is commutative.
(G,∗) is abelian iff:
(G,∗) is a group and
∀a,b∈G,a∗b=b∗a.
Ring
(R,+,⋅) is a ring iff:
(R,+) is an abelian group
⋅ is associative and distributive over addition
⋅ has a multiplicative identity element
Not studied in this module.
Field
(F,+,∗) is a field iff 2 operations + and ⋅ on F satisfying:
(F,+) is an abelian group
(F∖0,⋅) is an abelian group (0 is additive identity)
∀a,b∈F,a⋅b∈F (1 is multiplicative identity)
multiplication is closed and distributive over addition ∀a,b,c∈F,a⋅(b+c)=a⋅b+a⋅c
Additive identity (0) is excluded for multiplication (∗) operatin because it doesn’t have an inverse.
Properties:
0 and 1 are unique.
F has atleast 2 elements: 0 and 1.
Examples:
(R,+,⋅)
({0,1,2},+mod3,⋅mod3)
Finite Fields
A field with a finite number of elements.
For a prime number p, Fp=({0,1,2,…,p−1},+modp,⋅modp) is a field.
Every finite field has size pk for some prime p and an some integer k. And, for any prime p and for any integer k, there exists a field with size pk. BUT not every set with pk number of elements are a field.