100% found this document useful (1 vote)
1K views106 pages

Discrete Mathematics Course Overview

Here are the key points about functions: - A function f from a set A to a set B assigns to each element x in A exactly one element y in B. This is written as f(x) = y. - The domain of a function f is the set A of inputs. The range of f is the set B of outputs. - A function f is injective (one-to-one) if different inputs always map to different outputs. That is, if f(x1) = f(x2) then x1 = x2. - A function f is surjective (onto) if every possible output y in B is the output for at least one input x in

Uploaded by

Joshua Fajardo
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
100% found this document useful (1 vote)
1K views106 pages

Discrete Mathematics Course Overview

Here are the key points about functions: - A function f from a set A to a set B assigns to each element x in A exactly one element y in B. This is written as f(x) = y. - The domain of a function f is the set A of inputs. The range of f is the set B of outputs. - A function f is injective (one-to-one) if different inputs always map to different outputs. That is, if f(x1) = f(x2) then x1 = x2. - A function f is surjective (onto) if every possible output y in B is the output for at least one input x in

Uploaded by

Joshua Fajardo
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

No part of this publication may be reproduced or copied by recording or other electronic/

mechanical methods, without the prior written permission of the publisher/compiler via
jamanamtam@pup.edu.ph. Faculty members whose names are printed on the cover are only

compilers who collected materials from different authors. This is not for sale and the compilers
have no intention to profit from this.

2
INTRODUCTION
COURSE OVERVIEW
This Instructional Material deals with the study of symbolic logic and proofs, sets, ordered pairs,
relation and partial orders, equivalence relation and functions. The course also includes introduction to
graph theory, and trees.

The grading system will be as follows.

Class Standing 40%


Practice Exercises
Activities
Reflective Journal 30%
Major Exams 30%
FINAL GRADE 100%

REFLECTIVE JOURNAL DIRECTIONS

A reflective journal is a place to write down your daily or weekly reflection entries. You can write
about a positive or negative event that you experienced, what it means or meant to you, and what you
may have learned from that experience.
Directions: Following these steps will guide you in our reflective journal requirement.

1. Take a picture of yourself together with what you work on the day you read and work on the
exercises. Choose a clear photo or make the photo clear and visible.

2. Create a simple narration on what you feel, what you learn, the difficulties you encounter while
reading and answering the exercises, and what you did to overcome those difficulties.

3. Organize and Compile it (in a single file).

4. The number of photos should not be more that 20, assuming you will be working the lessons per
week.

5. Prepare a soft copy or hard copy of it depending on your situation, if you have internet
connection or none.

6. Submit it together with your answers in modules on the agreed date of submission.

7. Make sure your photo-essay meets the criteria on the rubric. The rubric is provided in the next
page.

3
REFLECTIVE JOURNAL RUBRIC
Criteria Above Average Average Below Average
Achievement of Learner has achieved Learner has achieved Learner has attempted
defined learning all learning outcomes, all of learning all of learning
outcomes demonstrated by valid outcomes. This outcomes. This
solutions. These are achievement is achievement is partially
explored to a deep demonstrated by valid demonstrated by
level, revealing answers with solutions. solutions.
advanced
understanding of
outcomes.
Evidence of Clear progression in Overall progression in Understanding of
progression from week understanding of understanding of learning outcomes is at
to week learning outcomes learning outcomes is the same level from
evident from week to evident but no clear week to week.
week, with advanced progression from week
level of understanding to week.
of the topics
encountered.
Presentation The writings are clear. The writings are clear. The writings are not
Solutions are well Solutions are provided clear. Solutions are
structured. for some answers and provided for some
well structured. answers and not well
structured.

4
TABLE OF CONTENTS

TITLE Pages

Lesson 1: Symbolic and Logic and Proofs 6 − 29

Lesson 2: Proofs 30 − 44

Lesson 3: Sets and Proofs 45 − 50

Lesson 4: Ordered Pairs, Relation and Partial Orders 51 − 58

Lesson 5: Equivalence Relation 59 − 64

Lesson 6: Functions 65 − 72

Lesson 7: Introduction to Graph Theory 73 − 93

Lesson 8: Trees 94 − 106

5
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 1: SYMBOLIC LOGIC AND PROOFS

LEARNING OBJECTIVES

• Discuss briefly the truth tables.


• Define arguments, premises and conclusion.
• Explain logical equivalence.
• Discuss deduction rule.

DISCUSSIONS

6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
LET’S PRACTICE!

25
26
27
28
REFERENCE:
DISCRETE MATHEMATICS 3rd Ed.(2019),by Oscar Levin, pages 197 − 212.

29
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 2: PROOFS

LEARNING OBJECTIVES

• Explain direct proofs and apply it.


• Apply proof by contrapositive.
• Practice proof by contradiction.
• Examine proof by counter example.

DISCUSSIONS

30
31
32
33
34
35
36
37
38
39
40
LET’S PRACTICE!

41
42
43
REFERENCE:
DISCRETE MATHEMATICS 3rd Ed.(2019),by Oscar Levin, pages 213 − 225.

44
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 3: SETS AND PROOFS

LEARNING OBJECTIVES

• Explain how to prove subsets relation.

• Discuss how to prove equal sets.

• Examine Russel’s Paradox.

DISCUSSIONS

45
46
47
48
LET’S PRACTICE!

49
50
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 4: ORDERED PAIRS, RELATION AND PARTIAL


ORDERS

LEARNING OBJECTIVES

• Discuss oredered pairs and relations.


• Define domain and image of a relation.
• Define symmetric relation.
• Explain partial orders.

DISCUSSIONS

51
52
53
54
55
56
LET’S PRACTICE!

1. Let A, B, and C be sets. Prove A × (B ∩ C) = (A × B) ∩ (A × C).

2. Let A, B, and C be sets. Prove A × (B\C) = (A × B)\(A × C).

3. a. Let X and Y be sets and R, S ⊆ X × Y relations. For a set A, let πX (A) be the projection of
A onto the X axis. Prove that πX (R ∪ S) = πX (R) ∪ πX (S).
b. Let R and S be as above. Is it true in general that πX (R ∩ S) = πX (R) ∩ πX (S)? Justify your
answer.

57
4. Prove that the relation ⊆ is a partial order on P(A).

5. Let A and B be two subsets of some universe U . Prove that there is a maximal element C (with
respect to the partial order on P(U ) given by ⊆ ) such that C ⊆ A and C ⊆ B, i.e any other set
D satisfying this is a subset of C. Prove that there is a minimal element E such that A ⊆ E and
B ⊆ E.

6. Suppose that A is a set and < is a strict partial order on A. Prove that
≤= {(a, b) : a < b ∨ a = b} is a partial order.

7. Prove that ≤1 ∩ ≤2 is indeed a relation on A ∩ B as defined above.

8. Suppose hA, ≤i is a partially ordered set. Prove ≤−1 is also a partial Order on A.

9. Prove that the lexicographic order is a partial order on the cartesian product of two partially
ordered sets. Prove that the lexicographic order on the cartesian product of two linear orders is a
linear order.

58
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 5: EQUIVALENCE RELATION

LEARNING OBJECTIVES

• Explain reflexive, symmetric and transitive property


of a relation.

• Define equivalence relation.

• State equivalence class and set partition.

DISCUSSIONS

59
60
61
62
LET’S PRACTICE!

63
64
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 6: FUNCTIONS

LEARNING OBJECTIVES

• Explain functions.
• Define domain and range of a function.
• Discuss surjective and injective functions.
• Discuss bijective functions.

DISCUSSIONS

65
66
67
68
69
70
LET’S PRACTICE!

71
72
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 7: INTRODUCTION TO GRAPH THEORY

LEARNING OBJECTIVES

• Discuss Graphs.
• Explain isomorphic graphs and subgraphs.
• Define handshake lemma.
• State different graph definitions.

DISCUSSIONS

73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
LET’S PRACTICE!

89
90
91
92
REFERENCE:
DISCRETE MATHEMATICS 3rd Ed.(2019),by Oscar Levin, pages 231 − 246.

93
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines

LESSON 8: TREES

LEARNING OBJECTIVES

• Define trees.
• Discuss trees properties.
• Define rooted trees.
• Explain spanning trees.

DISCUSSIONS

94
95
96
97
98
99
100
101
102
LET’S PRACTICE!

103
104
105
REFERENCE:
DISCRETE MATHEMATICS 3rd Ed.(2019),by Oscar Levin, pages 247 − 457.

106

No part of this publication may be reproduced or copied by recording or other electronic/
mechanical methods, without the pri
INTRODUCTION
COURSE OVERVIEW
This Instructional Material deals with the study of symbolic logic and proofs, sets, ordered pai
REFLECTIVE JOURNAL RUBRIC 
Criteria 
Above Average 
Average 
Below Average 
Achievement of 
defined learning 
outcomes 
Learn
TABLE OF CONTENTS
TITLE
Pages
Lesson 1:
Symbolic and Logic and Proofs
6 −29
Lesson 2:
Proofs
30 −44
Lesson 3:
Sets and Proofs
LEARNING MATERIALS IN
SEMA 40013: DISCRETE MATHEMATICS
Jay-R A. Manamtam
Polytechnic University of the Philippines
LESSON 1:
7
8
9
10

You might also like