Maths 2F Flashcards
The power set of X denoted P(X) or 2<strong>x</strong> is the set whose?
Members are the subsets of X.
The union of A and B, denoted A ∪ B, is the set of?
All objects belonging to at least one of the sets.
A ∪ B = { x : x ∈ A or x ∈ B }
The intersection of A and B, denoted A ∩ B, is the set of objects belonging to?
Both of the sets
A ∩ B = { x : x ∈ A and x ∈ B }
The complement or relative complement of B in A, denoted A\B or A−B, is the?
Set of members of A which do not belong to B
A \ B = { x ∈ A : x ∈/ B }
Let X, Y and Z be sets, and let f: X → Y and g: Y → Z be functions. Then the composite
g ◦ f = gf : X → Z
…
Is the function given by
g ◦ f(x) = g f(x)
For any set X there is an identity function…
Id = IdX : X → X given by IdX (x) = x
A function f : X → Y is injective or an injection or one-to- one if?

f(x1) = f(x2) ⇒ x1 = x2
A function f : X → Y is surjective or a surjection or onto if for every…

y ∈ Y there exists x ∈ X such that f(x) = y
A function f : X → Y is bijective or a bijection or a one-to-one correspondence if?

It is both injective and surjective
Let f : X → Y be a function. If A is a subset of X then the image of A is the?
Subset f(A) of Y given by
f(A) = {f(a) : a ∈ A}
If B is a subset of Y then the inverse image or preimage of B is?
The subset f−1(B) of X given by
f−1(B) = { x ∈ X : f(x) ∈ B }
Let X be a set. If there is a bijection n → X for some nonnegative integer n then?
X is finite
Otherwise X is infinite
A set E is countably infinite if?
There is a bijection from ℕ to E
A set E is uncountable if there is?
No injective function from E to ℕ.
If f : X → Y is injective and Y is countable then X is?
Countable
If f : X → Y is surjective and X is countable then?
Y is countable
Let X be any set. Is P(X) to X countable or uncountable?
Then there is no injective function from P(X) to X.
In particular P(ℕ) is uncountable.
Is the set of real numbers countable or uncountable?
Uncountable
Let ∼ be a relation on a set X
x ∼ x for all x ∈ X is?
One says then that ∼ is relexive
Let ∼ be a relation on a set X
If x ∼ y then y ∼ x is?
One says then that ∼ is symmmetric
Let ∼ be a relation on a set X
If x ∼ y and y ∼ z then x ∼ z is?
One says then that ∼ is transitive
Let ∼ be an equivalence relation on a set X, and let x be a member of X. Then the equivalence class of x is the set?
[x] = { y ∈ X : x ∼ y }
Let d, a, b, m, n be integers such that d | a and d | b. Then?
d | (ma + nb)
Let a and b be integers not both zero. Then there are integers m and n such that?
gcd(a, b) = ma + nb
Two integers are coprime or relatively prime if?
Their greatest common divisor is 1
Integers m,n such that ma + nb = 1
A prime number is an integer p > 1 with?
No positive integer divisors other than 1 and p
The least common multiple of two integers a and b is the?
Smallest natural number m such that m divides a and m divides b
One says that a and b are congruent modulo m
a ≡ b mod m if?
if a − b is divisible by m
If a ̸≡ b mod m then?
a − b is not divisible by m
a ≡ b mod m ⇒?
a = b + km
for some integer k
f a ≡ b mod m and c ≡ d mod m, then?
a + c ≡ b + d mod m
a − c ≡ b − d mod m
ac ≡ bd mod m
Let m,a ∈ Z, m > 0. Then gcd(a,m) = 1 if and only if there is?
An integer r such that
ra ≡ 1 mod m
Let a ∈ Z, m ∈ N. An integer r such that ar ≡ 1 mod m is called?
An inverse for a modulo m
Let X be a set. A permutation of X is a?
Bijective function from X to X
The set of permutations of X is denoted?
Perm(X)
An equivlence relation is thus if and only if?
It is reflexive, symmetric and transative
State a formula relating the cardinalities of A,B, A ∪ B and A ∩ B
|A ∪ B| = |A| + |B| - | A ∩ B |
|A x B| = |A| x |B|
The Pigeonhole principle states that there can only be an injection…
A x B → A ∪ B if
|A x B| ≤ |A ∪ B|