Professional Documents
Culture Documents
MODULE 2-Lesson 1-4 (REVIEWER)
MODULE 2-Lesson 1-4 (REVIEWER)
LESSON 1
v - logical “or”
∈ - an element
∉ - not an element
⇒ - if then
⇔ - if and only if
∃ - there exist
∴ - therefore
∑ - summation
∩ - intersection
∪ - union
Example 1.2
The table below summarizes the analogy between the English and Mathematics
Truth of Sentences
Sentences can be true or false. The notion of truth (i.e. the property of being true or false) is of fundamental importance in
the mathematical language.
Mathematical convention- is a fact, name, notation, or usage which is generally agreed upon by mathematicians.
For instance, the fact that one evaluates multiplication before addition in the expression 2+3x4 is merely conventional: It is
conventional to perform first multiplication before addition, this is following the order of operations.
Mathematicians abide by conventions in order to allow other mathematicians to understand what they write without constantly
having to redefine basic terms.
MODULE 2 - MATHEMATICAL LANGUAGE AND SYMBOL
LESSON 2
Sets- any group or collection of objects is called a set. The objects that belong in a set are the elements, or members, of the set.
2. List the elements of the set inside a pair of braces, { }. This method is called the roster method. Commas are used to separate
the elements.
Example 2
Word Description and the Roster Method
Equal Sets
Set A is equal to set B, denoted by 𝐴 = 𝐵, if and only if A and B have exactly the same elements.
Equivalent Sets
Set A is equivalent to set B, denoted by 𝐴~𝐵 if and only if A and B have the same number of elements.
Universal Set
The set of all elements being considered is called a universal set.
A Subset of a Set
Set A is a subset of set B, denoted by 𝐴 ⊆ 𝐵 if and only if every element of A is also an element of B.
Subset Relationships
1. 𝐴 ⊆ 𝐴, 𝑓𝑜𝑟 𝑎𝑛𝑦 𝑠𝑒𝑡 𝐴
Venn Diagram
The English logician John Venn (1834-1923) developed diagrams, which we now refer to as Venn diagrams, that can be used
to illustrate sets and relationships between sets. In a Venn diagram, the universal set is represented by a rectangular region and
subsets of the universal set are generally represented by oval or circular regions drawn inside the rectangle.
Intersection of Sets
The intersection of sets A and B, denoted by 𝐴 ∩ 𝐵, is the set of elements common to both A and B.
𝐴 ∩ 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∈ 𝐵}
Disjoint Sets
Intersection of Sets Two sets are disjoint if their intersection is the empty set
Union of Sets
The union of sets A and B, denoted by 𝐴 ∪ 𝐵, is the set that contains all the elements that belong to A or to B or to both
𝐴 ∪ 𝐵 = {𝑥|𝑥 ∈ 𝐴 𝑜𝑟 𝑥 ∈ 𝐵}
Union of Sets
De Morgan’s Laws
For all sets A and B,
Properties of Sets
Venn diagrams can be used to verify each of the following
properties.
LESSON 3
Relation
set of ordered pairs is called a binary relation or simply a relation. If 𝑆 is a relation, the set of all elements 𝑥 that occur as first
members of pairs (𝑥, 𝑦) in 𝑆 is called the domain of 𝑆, denoted by DS . The set of second members 𝑦 is called the range of 𝑆, denoted
by R S .
Example 1
Let 𝑆 = {(3, 5), (−2, 8), (−3, 8), (0, −6)}. Find the domain and range of set 𝑆.
Functions
function 𝒇 is a relation which is the set of ordered pairs (𝑥, 𝑦), no two of which have the same first member. That is, if
(𝑥, 𝑦) ∈ 𝑓 𝑎𝑛𝑑 (𝑥, 𝑧) ∈ 𝑓, 𝑡ℎ𝑒𝑛 𝑦 = 𝑧. The definition of function requires that for every 𝑥 in the domain of 𝑓 there is exactly one 𝑦
such that (𝑥, 𝑦) ∈ 𝑓. It is customary to call 𝑦 the 𝑣𝑎𝑙𝑢𝑒 of 𝑓 at 𝑥 and to write 𝑦 = 𝑓(𝑥) instead of (𝑥, 𝑦) ∈ 𝑓 to indicate that the pair
(𝑥, 𝑦) is in the set 𝑓.
(𝑓/𝑔)(𝑥) = 𝑓(𝑥)/𝑔(𝑥)
In each case the domain of the resulting function consists of those values of 𝑥 common to the domain of 𝑓 and 𝑔 , with the additional
requirement in case 4 that the values of 𝑥 for which 𝑔(𝑥) = 0 are excluded.
1. A function 𝑓 is said to be an even function if for every 𝑥 in the domain of 𝑓, 𝑓(−𝑥) = 𝑓(𝑥).
2. A function 𝑓 is said to be an odd function if for every 𝑥 in the domain of 𝑓(−𝑥) = − 𝑓(𝑥).
LESSON 4
Logic
Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meaning of
sentences.
We use logic informally in everyday life and certainly also in doing mathematics.
Definition 3. The truth value of a simple statement is either true (𝑇) or false (𝐹). On the other hand, the truth value of a compound
statement depends on the truth values of its simple statements and its connectives. Likewise, a truth table is a table that shows the
truth value of a compound statement for all possible truth values of its simple statements.
Note 1. George Boole (a founder of Boolean algebra which have an applications in the areas of computer programming and the
design of electronic circuits) has used lowercase 𝑝, 𝑞, 𝑟, and 𝑠 to represent simple statements and the symbols ∧, ∨, ∼, ⟶
, and ⟷ to represent connectives. See Table 1 below.
Definition 4. Given a statement 𝑝, we define the statement ~𝑝 (not 𝑝) to be false when 𝑝 is true, and true when 𝑝 is false.
Definition 5. Given two statements 𝑝 and 𝑞, we define the statement 𝑝 ∧ 𝑞 (𝑝 and 𝑞) to be true precisely when both 𝑝 and 𝑞 are
true.
Definition 6. Given two statements 𝑝 and 𝑞 we define the statement 𝑝 ∨ 𝑞 (𝑝 or 𝑞) to be true precisely when at least one of 𝑝 and 𝑞
is true.
Compound Statements and Grouping Symbols
If a compound statement is written in symbolic form, then parentheses are used to indicate which simple statements are
grouped together. Table 5 illustrates the use of parentheses to indicate groupings for some statements in symbolic form.