All Unit 1 Definitions
Evens and Odds
Let a ∈ Z.
• We say that a is even if there exists m ∈ Z
with a = 2m.
• We say that a is odd if there exists m ∈ Z
with a = 2m + 1.
Sets
Given two sets A and B, we say that A = B if A
and B have exactly the same elements.
Given two sets A and B, we write A ⊆ B to
mean that for all x, if x ∈ A, then x ∈ B.
Set Operations
Given two sets A and B, we define A ∪ B to be
the set consisting of those elements that are
in A or B (or both).
Given two sets A and B, we define A ∩ B to be
the set consisting of those elements that are
in both of A and B.
We say that two sets A and B are disjoint if
A ∩ B = ∅.
Given two sets A and B, we define A\B to be
the set consisting of those elements that are
in A but not in B.
Given two sets A and B, we let A × B be the set
of all ordered pairs (a, b) such that
a ∈ A and b ∈ B, and we call this set the
Cartesian product of A and B.
Functions
Let A and B be sets. A function from A to B is a
subset f of A × B with the property that for all a ∈
A, there exists a unique b ∈ B with (a, b) ∈ f.
Let f : A → B be a function.
• We call A the domain of f.
• We call B the codomain of f.
• We define range(f) = {b ∈ B : There exists a ∈ A
with f(a) = b}
Suppose that f : A → B and g : B → C are
functions. The composition of g and f, denoted g ◦
f, is the function g ◦ f : A → C defined by letting (g
◦ f)(a) = g(f(a)) for all a ∈ A.
Let A be a set. The function idA : A → A defined by
idA(a) = a for all a ∈ A is called the identity
function on A.
Let f : A → B be a function.
• We say that f is injective (or one-to-one) if
whenever a1, a2 ∈ A satisfy f(a1) = f(a2), we have
a 1 = a 2.
• We say that f is surjective (or onto) if for all b ∈
B, there exists a ∈ A such that f(a) = b.
• We say that f is bijective if f is both injective and
surjective.
Suppose that we have two functions f : A → B and
g : A → B. We define the solution set of the
equation f(x) = g(x) to be {a ∈ A : f(a) = g(a)}.
 Spans
Let 𝑢
⃑ ∈ R2. We define a subset of R2 as follows: Span(𝑢
⃑ ) = {c · 𝑢
⃑ : c ∈ R}.

Linear Combinations
Let u
⃑ 1, u ⃑ ∈ 𝑅2.
⃑ 2, v
We say that u
⃑ is a linear combination of
⃑ 1 and u
u ⃑ 2 if there exists c1 , c2 ∈ 𝑅 with
⃑ = c1 u
v ⃑ 1 + c2 u
⃑ 2.