Math Summary
Math Summary
Math Summary
Variables
It is represented by a letter, like x or y.
A symbol for a value we don’t know yet.
Advantage of using variables
It allows you to give a temporary name to what you are seeking so that you can perform
concrete computations with it to help discover its possible values.
Example: Is there a number with the following property:
Doubling it and adding 3 gives the same results as squaring it?
- Example: There is a positive integer that is less than or equal to every positive integer.
Notation
If S is a set, the Notation
- XES means that x is an element of S
- X € S means that x is not an element of S)
A variation of notation is used to describe a very large set.
- (1, 2, 3., 100) refer to set of all integers from 1 to 100.
-. (1.2.3.) refer to set of all positive integers. The symbol… is called an ellipses with exactly
Set-Builder Notation
Let S denote and let P(x) be a property that elements of S may or may not satisfy. We define a
new set to be the set of all elements x in S such that P(x) is true. We denote this set as follows:
Equal sets are set with exactly the same elements and cardinality.
Example:
A = {c, a, r, e}
B = {r, a, c, e}
Equivalent sets are set with the same number of elements or Cardinality.
Example:
A = {a. e. I, o, u}
B = {1,2,3,4,5}
Universal Set
The set of all elements. We will use the letter U to denote universal set.
EXAMPLE:
If A {1, 2, 3} and B {3, 4,5, 5}, then the universal set U is,
U {1, 2, 3, 4, 5}
The empty set or null set is the set that contains no elements. The
Symbol Ó or {}is represent the empty set.
EXAMPLES:
A = {days start with letter L}
B= {triangles with 4 sides}
Subsets
If A and B are sets, then A is called a subsets of B, written A ≤ B, if, and only if, every element of
A is also an element of B.
A≥B means the For all elements x, if x E A then x E B.
Proper Subset
Let A and B be sets, A is a proper subset of B, if, and only if, every element of B is in B but there
is a least one element of B that is not in A.
Example
- Let A = Z+, B = { n E Z|0 ≤ n ≤ 100}, and
C = { 100, 200, 300, 400, 500}. Evaluate the Truth and falsity of each of the following
statements.
1. B ≤ A False. Zero is not a positive integer. Thus zero is in B but zero is not in A, and
so B ≥ A.
2. C is a proper subset of A.
3. C and B have at least one element in common.
Ordered Pair
Given elements a and b, the symbol (a, b) denotes the ordered pair consisting of a and b
together with the specification that a is the first element of the pair and b is the second
element. Two ordered pairs (a, b) and (c, d) are: equal if, and only if, a = c and b = d. Symbolically
(a, b)=(c, d) means that a = c and b = d
Example
- Is (1,2) = (2,1)?
No. By definition of equality of ordered pairs.
Given sets A and B, the Cartesian product of A and B, denoted A x B and read “A times B,” is the
set of all ordered pairs (a, b) where a is in A and b is in B. Symbolically:
Example
Let A (1, 2, 3) and B = (u, v)
Find AxB. AxB = {(1, u), (2, u), (3, u),(1,v),(2,v),(3,v)
Find BX A. BxA = {(u, 1), (u, 2), (u, 3), (v, 1), (v, 2) (v, 3)}
Find BxB. BxB= {(u, u), (u, v), (v, u), (vv)}
How many elements are in Ax B, BxA, and Bx B? AxB has six elements, BxA has six elements and BxB has
four elements.
Relation
A relation is a rule that relates values from a set of values (called the domain) to a second set of
values (called the range.)
The elements of the domain can be imagined as input to a machine that applies a rule to these
inputs to generate one or more outputs.
A relation is also a set of ordered pair (x, y).
EXAMPLE:
R = {(1,2), (2, 4), (3, 61, 14. 8), 15, 10)}
A Relation as a Subset
Let A = (1, 2) and B = {1, 2, 3) and define a relation from A to B as follows: Given any (x, y) e Ax B,
(x, y) e R means that x – y/2 is an integer.
Function
A function is a relation where each element in the domain is related to only one value in the
range by some rule.
The elements of the domain can be imagined as input to a machine that applies a rule so that
each input corresponds to only one output.
A function is a set of ordered pairs (x,y) such that no two ordered pairs have the same x-value
but different y-values.