BASIC ALGEBRA

ABHINAV NEGI

Abstract. This document contains my solutions to the exercises and proofs of theorems given
in the book.

0. Concepts from Set Theory. The Integers.

0.1. The Power Set of a Set.
Definition 0.1 (Power Set). For any set S, define the power set P(S) to be the set of all the
subsets of S.
Theorem 0.2 (Distributive Law). Let A, B, C ⊂ S be sets, then;
(1) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)

(2) and A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).

Proof. Lets first show (1). We will show that for any e;
e ∈ A ∩ (B ∪ C) ⇐⇒ e ∈ (A ∩ B) ∪ (A ∩ C).
Let e ∈ A ∩ (B ∪ C);
e ∈ A and e ∈ B ∪ C.
Since e ∈ B ∪ C, either e ∈ B or e ∈ C, also e ∈ A in either case. So, either e ∈ A ∩ B or
e ∈ A ∩ C. We get S ∈ (A ∩ B) ∪ (A ∩ C). Now, suppose S ∈ (A ∩ B) ∪ (A ∩ C). We have;
e ∈ A ∩ B or e ∈ A ∩ C.
In either case, e ∈ A, and e ∈ B or C. So, e ∈ A and e ∈ B ∪ C, so e ∈ A ∩ (B ∪ C).
Lets now show (2). We will show that for any e;
e ∈ A ∪ (B ∩ C) ⇐⇒ e ∈ (A ∪ B) ∩ (A ∪ C).
Let e ∈ A ∪ (B ∩ C);
e ∈ A or e ∈ B ∩ C.
If e ∈ A, then e ∈ A ∪ B and A ∪ C, so e ∈ (A ∪ B) ∩ (A ∪ C). If e ∈ B ∩ C, then e ∈ B and e ∈ C.
So, e ∈ A ∪ B and e ∈ A ∪ C. So, e ∈ (A ∪ B) ∩ (A ∪ C). Now, suppose e ∈ (A ∪ B) ∩ (A ∪ C).
We have;
e ∈ A ∪ B and e ∈ A ∪ C.
If e ∈ A then e ∈ A ∪ (B ∩ C) holds. But if e ∈
/ A, then we must have e ∈ B and e ∈ C. So
e ∈ B ∩ C, and e ∈ A ∪ (B ∩ C). □

It is also possible to show (2) using (1);

1
2 ABHINAV NEGI

Proof. Let A′ = S − A, B ′ = S − B, and C = S − C. We have by (1);

A′ ∩ (B ′ ∪ C ′ ) = (A′ ∩ B ′ ) ∪ (A′ ∩ C ′ ).
So, we get;
e ∈ A′ ∩ (B ′ ∪ C ′ ) ⇐⇒ e ∈ (A′ ∩ B ′ ) ∪ (A′ ∩ C ′ ).
But e ∈ A′ ∩ (B ′ ∪ C ′ ) is equivalent to e ∈ A′ and e ∈ B ′ ∪ C ′ . This is further equivalent to
saying e ∈
/ A and either e ∈ / B or e ∈/ C. This is further equivalent to, e ∈ / A and e ∈ / B ∩ C, i.e.,
e∈/ A ∪ (B ∩ C).
Similarly, e ∈ (A′ ∩ B ′ ) ∪ (A′ ∩ C ′ ) is equivalent to e ∈ A′ ∩ B ′ or e ∈ A′ ∩ C ′ . This is just
e∈/ A and e ∈/ B or e ∈/ A and e ∈ / C, i.e. e ∈/ A ∪ B or e ∈/ A ∪ C, or e ∈/ (A ∪ B) ∩ (A ∪ C).
So, we have e ∈/ A ∪ (B ∩ C) ⇐⇒ e ∈ / (A ∪ B) ∩ (A ∪ C). So;
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
□
Theorem 0.3 (General Distributive Law). Let Γ ⊂ P(S) be a set of subsets of S, and B ⊂ S,
then; \ \
B∪ A= (A ∪ B)
A∈Γ A∈Γ
[ [
B∩ A= (A ∩ B)
A∈Γ A∈Γ

0.2. The Cartesian Product Set. Maps.

Definition 0.4 (Cartesian Product). Given any two sets S and T , the cartesian product set
S × T is {(s, t) : s ∈ S, t ∈ T }.
Definition 0.5 (Map). A map of a set S into a set T is some α ⊂ S × T such that;
(1) For any s ∈ S there exists a t ∈ T such that (s, t) ∈ α.
(2) If (s, t) and (s′ , t′ ) ∈ α then t = t′ . S is the domain and T is the co-domain of the map α.
Definition 0.6 (Image). Given sets S, T and a map α : S → T , the image of s ∈ S under α is
the unique t ∈ T such that (s, t) ∈ α.
For A ⊂ S, the image of A under α is α(A) = {α(A) : a ∈ A}.
Definition 0.7 (Transformation). A map with domain and co-domain both S is called a trans-
formation of the set S.
Definition 0.8 (Bijective Maps). Let α : S → T be a map.
(1) We say that α is injective if for each s1 , s2 ∈ S, s ̸= t =⇒ α(s) ̸= α(t).
(2) We say that α is surjective if for each t ∈ S, there exists s ∈ S such that α(s) = t.
(3) We say that α is bijective if it is both injective and bijective. In this case α can be said to
be a one-to-one correspondence between S and T .
Definition 0.9 (Composite of maps). Let α : S → T and β : T → U be maps. Then we define
the composite map of α and β as βα : S → U such that;
βα = {(s, β(α(s)) : s ∈ S)}.
In simpler terms; (βα)(s) = β(α(s)).