Q1.

For each statement, decide whether it is true or false. Justify your answer
briefly.

1. \{ ( x , y ) : x , y ∈ R , x−1=0 \} ⊆\{ ( x , y ) : x , y ∈ R , x 2−x=0 \}

For the sake of convenience we will refer to the left set { ( x , y ) : x , y ∈ R , x −1=0 } as A
and the right set \{ ( x , y ) : x , y ∈ R , x2−x =0 \} as B.

To prove this, we will first designate an ordered pair ( m , n¿ ∈ A . Because ( m , n ) ∈ A , it

is beholden to A ’s restrictions, and so m , n∈ R, and m−1=0, which can be simplified
to m=1 . Thus, if ( m , n ) ∈ A , we get ( m , n )=(1 ,n).

If ( 1 , n ) ∈ A , and A ⊆ B, then (1 , n) must therefore also belong to B. Applying B’s

restrictions to (1 , n), we get 1 , n∈ R , which is true for both 1 and n , and (1)2−(1)=0 ,
which simplifies into 1−1=0, which is true. As all elements ( m , n ) in A also exist in B,
A ⊆ B, as desired. □

2. Z × R ⊆ R × Z .

This is untrue, as there are elements in Z × R that do not exist in R × Z . As an

example, the set of Z × R contains the element (2 , π ), as 2 is an integer and π is a
real number. However, the set of R × Z does not contain the element (2 , π ), as π is
not an element of Z . Therefore, Z × R ⊈ R × Z as not every element of Z × R exists in
R × Z. □
Q2.

Let f : A ⟶ B be a function.

1. Prove that for any two sets C , D ⊆ A , we have f (C ⋂ D)⊆ f (C)⋂ f (D).

Let us define a value y ∈ f (C ∩ D ) and a value x such that y=f (x ) for every y . As
y ∈ f (C ∩ D ), x ∈ C ∩ D . Per the definition of set intersection, x ∈ C and x ∈ D . If x ∈ C ,
x ∈ D , and y=f (x ), then y=f ( x ) ∈ f ( C ) ∩ f (D). As y ∈ f (C ∩ D), f ( C ∩ D ) ⊆ f ( C ) ∩ f (D),
as desired. □

2. Give an example of a function f , and sets C , D for which

f ( C ⋂ D ) ≠ f (C)⋂ f (D).

Let us define a function f : R → R, where f ( x )=x 2 and with sets C={a , b , c } and
D={a ,−b ,−c }. f (C ∩ D) can be simplified into f ( { a } )={a 2 }, as a is the only element in
both sets. Let us now look at f ( C ) ∩f (D), which simplifies to
f ( { a , b , c } ) ∩ f ( { a ,−b ,−c }) ={a ,b , c } . When comparing the two sets {a2 } and { a2 , b 2 , c 2 }
2 2 2

, we see that{a2 }≠ { a2 , b2 , c2 } , as desired. □

Q3.
2
1+ x
Find with proof the image of the function f : R ¿ 0 }⟶ R , f ( x )= 2
. Do not use
x
calculus in your solution.
To find the image of the function f , we must do a double subset inclusion where
f ( R ¿ {0¿}) ⊆(1 , ∞) and (1 , ∞)⊆ f ( R ¿ {0¿}).
Let us first define a value y ∈ f ¿ such that for every y , there exists a value x where
2
1+ x
y=f (x ). Thus, y=f ( x )= 2
for some real number x . We can then take the equation
x
2
1+ x
y= 2 and multiply both sides by x and move the equation to one side to get
x
2 2 2
x y −x −1=0. This matches the quadratic form a x +bx +c=0 , where a= y−1, b=0,
and c=−1 . From here, as long as y−1 ≠ 0, we can use the quadratic formula to solve
for x .

0 ± √ 4( y−1)
x=
2( y−1)

2 √ y−1
x=±
2 ( y−1 )

x=± √
y −1
y −1
Thus, we see the image of the function as the points where x is defined. There are a
few restrictions on this equation however, as the denominator y−1 ≠ 0, which can be
simplified to y ≠1 , as division by zero is undefined. In addition, the numerator
features the square root of ( y−1), which cannot be less than 0 , as square roots of
negative values are not in the domain of R ¿ 0 }¿ . We can simplify this to y ≥1 . When
combining y ≠1 and y ≥1 , we are left with an image of y=f (x )> 1, which proves
f ( R ¿ {0¿}) ⊆(1 , ∞).
2
1+ x
To prove the other inclusion, we will define a value y ∈(1 ,∞) such that y=f ( x )= 2
x
for some value x ∈ R ¿ 0 }¿. As y=f (x ), y ∈ ( 1 , ∞ ) is equivalent to these inequalities.
2
1+ x 2 2 2
1< f (x)< ∞⟺ 1< 2
<∞ ⟺ x <1+ x <∞ x
x
2 2 2
x < 1+ x is true for all values of x , as it can be simplified to 0<1 , which is true. ∞ x > ¿
2 2
1+ x for all values of x , as x is always positive and can never be 0 as x ≠ 0 . As the
inequalities are true for every x , this proves ( 1 , ∞ ) ⊆ f ¿.
As f ( R ¿ {0¿}) ⊆(1 , ∞) and ( 1 , ∞ ) ⊆ f ¿ , the image of the function f is (1 , ∞), as needed.
□
Q4.

Let F be a field.

Prove the cancellation rule for multiplication: If a ≠ 0 , b , c ∈ F and a ∙ b=a ∙ c ,

prove that b=c .

Per axiom 4, the existence of reciprocals, there is an element n in field F such that
−1 1
a ⋅n=1, where n can be expressed as a−1. This is because a−1 ⋅ a=1, as a = , and
a
−1 a
therefore a ⋅ a= ¿ 1. Therefore, a−1 is the multiplicative inverse of a . From there,
a
we can multiply both sides of
a ⋅b=a ⋅ c by a−1.
−1 −1
a ( a⋅ b )=a (a ⋅ c)
Per axiom 1, the associativity of multiplication and addition, we can simplify
algebraically into a−1 ab ¿ a−1 ac . We can then replace a−1 a with 1 from both sides due
to axiom 4.

1 b=1 c
Per axiom 3, the multiplicative identity, 1 ⋅n=n for all values of n . Thus, we can
simplify 1 b=1 c into b=c . Thus, b=c , as desired. □
Q5.

Show that in any field F , the equation x 2=1 can have at most two solutions.
Can you think of a field in which the equation x 2=1 has exactly one
solution?

To prove that x 2=1 has at most two solutions, we must first properly isolate x . We
can do this by square rooting both sides, while recognizing that the square root of a
square is the absolute value of what is squared.

¿ x∨¿ 1
And in this case, we can split the absolute value into two cases, where x ≥ 0 and x <0
. In doing so, we get x=1 and −x=1 which can be simplified to x=−1. Therefore,
there can be two solutions to the equation x 2=1. However, there are not necessarily
two values that solve the equation.

This is because in a field, 1 is a special value and thus is always an element of the
field, but −1 in a field is not the same as −1 generally. For every element a of a
field F , there is an additive inverse b such that a+ b=0. In this case, a=1 and b is
simply the element which, when added with a , returns 0 . In other words, 1+b=0,
and so in the field, x=1 or x=b . Thus, in any field F , the equation x 2=1 has at most
two solutions.

However, there are some fields such that a=b , meaning that x 2=1 has one solution
in that field. For example, the set F 2 has the additive inverse of 1 as 1, where 1+1=0
. As 1=1 , the set F 2 has only one solution for the equation x 2=1, as needed. □
Q6.
Construct a field with 5 elements. Draw the tables of addition and
multiplication.

Hint 1. Let the elements of such a field be {0 ,1 , a , b , c }

Hint 2. Use the cancellation rules, you may use the axioms and
claim/propositions about fields in the course notes. You do not need to
write all the reasoning only drawing the tables for addition and
multiplication is enough (but make sure to understand the reasoning.

+¿ 0 1 a b c
0 0 1 a b c
1 1 a b c 0
a a b c 0 1
b b c 0 1 a
c c 0 1 a b

× 0 1 a b c
0 0 0 0 0 0
1 0 1 a b c
a 0 a c 1 b
b 0 b 1 c a
c 0 c b a 1