1) Introduction to Rings Flashcards
What is the division theorem for ℤ
If you have two integers a and b with b > 0.
Then there exist unique integers q and r such that a = bq + r and 0 ≤ r < b
What does it mean for a to divide b
a divides b if and only if there exists an integer k such that b = ka
What is the greatest common divisor of two integers
gcd(a, b) = max{g ∈ Z | g divides a and g divides b}
When are two integers coprime
If gcd(a, b) = 1
What is the Euclidean Algorithm
Use the Division Theorem repeatedly to calculate
What does it mean for a to be congruent to b modulo n
a is congruent to b modulo n if and only if n divides
a − b (n ∈ Z with n ≥ 2)
What is the congruent class of of a modulo n
What is the set of all congruence classes mod n
What does the Division Theorem imply about the congruence of every integer modulo n
By the Division Theorem every integer is congruent to a unique element of {0, 1, 2, …, n − 1} modulo n
Therefore Zn = {[0]n, [1]n, …, [n − 1]n}
What is the critera for two integers
a and b to be congruent modulo n
b ≡ a mod n if and only if b - a = kn for some k ∈ Z
What is another way we can represent [a]n
[a]n = {a + nk | k ∈ Z}
[a]n = [a + kn]n for all k ∈ Z
Let a, b, n ∈ Z with n ≥ 2. Prove that a ≡ b mod n if and only if
[a]n = [b]n
What are the properties of congruence modulo n concerning addition and multiplication
Let a, b, c, d, n ∈ Z with n ≥ 2 and a ≡ b mod n and c ≡ d mod n,
Addition: a + c ≡ b + d mod n
Multiplication: ac ≡ bd mod n
Describe the proof of the properties of congruence modulo n concerning addition and multiplication
- Assume a ≡ b mod n and c ≡ d mod n.
- Then we can write a = b + rn and c = d + sn for some r, s ∈ Z.
- Then a + c = b + d + (r + s)n and so a + c ≡ b + d mod n.
- We have ac = (b + rn)(d + sn) = bd + n(rd + sb + rsn) and so ac ≡ bd mod n
What is a composite number
A number that is not prime
What is Euclid’s property of primes
Let p be a prime and a, b ∈ Z. If p divides ab, then p divides a or p divides b
Describe the proof of Euclid’s property of primes
Let p be a prime. Assume that p | ab
If p | a, then we are done.
Suppose that p ∤ a. Then p and a are coprime because the only positive factors of p are 1 and p
Using the Euclidean algorithm we can write 1 = am + pn for some m, n ∈ Z.
Therefore b = abm + pbn and since p | ab we have that p | (abm + pbn).
Hence p | b
What is the Fundamental Theorm of Arithmetic
Every integer n greater than 1 can be written as a product of primes that is unique up to ordering
Describe the proof of the uniqueness of prime factorisation
Prove that in Zp, [(p − 1)!]p = [−1]p
- Since p is a prime, every non-zero element of Zp has an inverse
- The only elements of Zp that are self-inverse are [1]p and [−1]p
- Therefore the other non-zero elements pair up as inverses mod p in the product (p − 1)!. Hence [(p − 1)!]p = [1]p[2]p…[p − 1]p = [1]p[p − 1]p = [p − 1]p = [−1]p
What is a ring
A ring is a set R with two binary operations, + and ×, on R which satisfies the following conditions:
* (R1) (R, +) is an abelian group with identity 0.
* (R2) × is associative
* (R3) × is distributive over +
* (R4) there exists an element 1 ∈ R, different from 0, that is the identity for ×
Is + or x commutative in a ring
- (+ is always commutative in a ring but × may not be commutative
- If × is commutative we call R a commutative ring
Describe the multiplication properties of rings
Let R be a ring. Then, for all a, b ∈ R
(i) 0a = a0 = 0
(ii) a(−b) = (−a)b = −(ab)
(iii) (−a)(−b) = ab.
Describe the proof of the multiplication properties of rings
(i) We have 0a + 0a = (0 + 0)a = 0a
and so be adding −0a to both sides we get 0a = 0. Likewise a0 = 0
(ii) By definition −(ab) is the unique element in R with the property that ab + (−(ab)) = 0. Now
ab + (−a)b = (a + (−a))b = 0b = 0
Hence (−a)b = −(ab) by uniqueness. Similarly a(−b) = −(ab)
(iii) By using (ii) twice and −(−a) = a we get
(−a)(−b) = −(−(ab)) = ab
