Scribd
Upload
47 views5 pages

Logic and Set Theory Reviewer

The document defines key mathematical concepts such as theorems, proofs, definitions, axioms, propositions, and sets, providing clear explanations and examples for each. It also discusses methods for proving theorems, including direct proofs, and describes ways to represent sets, such as roster method and set builder notation. Additionally, it covers intervals and the concept of empty and singleton sets.

Uploaded by

ItsMe Riamarielle TafsMaligaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views5 pages

Logic and Set Theory Reviewer

The document defines key mathematical concepts such as theorems, proofs, definitions, axioms, propositions, and sets, providing clear explanations and examples for each. It also discusses methods for proving theorems, including direct proofs, and describes ways to represent sets, such as roster method and set builder notation. Additionally, it covers intervals and the concept of empty and singleton sets.

Uploaded by

ItsMe Riamarielle TafsMaligaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

THEOREM

-​ mathematical statement that is true and can be (and has been) verified as true.
-​ statement that can be shown to be true.

PROOF
-​ a written verification that shows that the theorem is definitely and unequivocally
true.
-​ valid argument that establishes the truth of a theorem.

DEFINITION
-​ an exact, unambiguous explanation of the meaning of a mathematical word or
phrase.

AXIOM
-​ statement used in a proof. Statements we assume to be true (for example, the
axioms for the real numbers)

PROPOSITION
-​ A statement that is true but not as significant

4.2 Definitions
●​ A proof of a theorem should be absolutely convincing.
●​ meanings of the sets;
-​ N = natural numbers
-​ Z = integers
-​ R = real numbers
-​ Q = rational numbers
-​ ø = empty set
●​ symbols
-​ ∈
-​ ⊆ = subset

Definition 4.1
●​ An integer n is even if n = 2a for some integer a ∈ Z.
-​ ex.
10 is even because 10 = 2·5.

Definition 4.2
●​ An integer n is odd if n = 2a+1 for some integer a ∈ Z.
-​ ex.
7 is odd because 7 = 2·3+1

Definition 4.3
●​ Two integers have the same parity if they are both even or they are both odd.
Otherwise they have opposite parity.
-​ ex.
5 and -17, 8 and 0 (same parity)
3 and 4 (opposite parity)

Definition 4.4
●​ Suppose a and b are integers. We say that a divides b;
●​ written a | b, if b = ac for some c ∈ Z. In this case we also say that a is a divisor
of b, and that b is a multiple of a.
-​ ex.
5 divides 15 because 15 = 5·3.
We write this as 5 | 15.

Definition 4.5
●​ A natural number n is prime if it has exactly two positive divisors, 1 and n.
-​ ex.
2 is prime, as are 5 and 17.

DIRECT PROOF
●​ a simple way to prove theorems or propositions that have the form of conditional
statements.
●​ A direct proof shows that a conditional statement p → q is true by showing that if
p is true, then q must also be true, so that the combination p true and q false
never occurs.
●​
●​ involve proving statements that are almost obviously true. *propositions

NOTE: a proposition is a statement that, although true, is not as significant as a


theorem.

NOTE: The methods of proof discussed in this chapter are important not only because they are
used to prove mathematical theorems, but also for their many applications to computer science.
example:

1.​ Proposition If x is odd, then x2 is odd.

2.​ Proposition Let a,b and c be integers. If a | b and b | c, then a | c.

3.​ Proposition If x and y are positive real numbers, then 2 p xy ≤ x+ y.


SET
●​ an unordered collection of objects
●​ elements or members of the set.
●​ said to contain its elements.
●​ We write a ∈ A to denote that a is an element of the set A. The notation a ∈ A denotes
that a is not an element of the set A.

NOTE: Lowercase letters are usually used to denote elements of sets.

WAYS OF DESCRIBING A SET

1.​ ROSTER METHOD


-​ way of describing a set
●​ One way is to list all the members of a set, when this is possible. We use a notation
where all members of the set are listed between braces.
-​ ex.
the notation {a, b, c, d} represents the set with the four elements a, b, c, and d.
-​ example 1.
▪︎ vowels. V ={a, e, i, o, u}.
▪︎ odd positive integers less than 10. O ={1, 3, 5, 7, 9}.

ELLIPSES
●​ (...) are used when the general pattern of the elements is obvious.
-​ ex.
set of positive integers less than 100. {1, 2, 3,..., 99}.

2.​ SET BUILDER


●​ characterize all those elements in the set by stating the property or properties
they must have to be members.
-​ ex.
set O of all odd positive integers less than 10. O ={x | x is an odd
positive integer less than 10},

N ={0, 1, 2, 3,...}, the set of natural numbers


Z ={...,−2,−1, 0, 1, 2,...}, the set of integers
Z+ ={1, 2, 3,...}, the set of positive integers
Q ={p/q | p ∈ Z,q ∈ Z, and q = 0}, the set of rational numbers R, the set of real numbers
R+, the set of positive real numbers
C, the set of complex numbers.

INTERVALS
-​ When a and b are real numbers with a< b, we write

●​ [a, b]={x | a ≤ x ≤ b}

●​ [a, b) ={x | a ≤ x< b}

●​ (a, b]={x | a< x ≤ b}

●​ (a, b) ={x | a< x < b}

NOTE:
-​ [a, b] is called the closed interval from a to b
-​ (a, b) is called the open interval from a to b.

EMPTY SET {}
-​ null set
-​ a special set that has no elements.
-​ denoted by Ø
-​ The empty set can also be denoted by {}

NOTE: the set of all positive integers that are greater than their squares is the null set.

SINGLETON SET {∅}


-​ a set with one element

You might also like