Group 1 Posets and Boolean Algebra

Members
Asis, Welmar ( Supremo)

Asna, Elezar (Bayani)
Aquino, Kenneth ( Kawal)
Anistoso, Christine Grace ( Katipunan)
Amba, Mayen Grace ( Katipunan)

Functions, Relations, sets
and Posets
f(x)= ax^3+bx^2+cx+d
What is a function?
A function is defined as a relation between a set of inputs having one output each. In
simple words, a function is a relationship between inputs where each input is related
to exactly one output.
The vertical line test is a graphical method of determining whether a curve in
the plane represents the graph of a function by visually examining the number
of intersections of the curve with vertical lines. and, as a result, any vertical line
in the plane can intersect the graph of a function at most once.
An injective function (injection) or one-to-one function
is a function that maps distinct elements of its domain to
distinct elements of its codomain.
A surjective function (also known as surjection, or onto function is
a function f such that every element y can be mapped from some element x such
that f(x) = y. In other words, every element of the function's codomain is
the image of at least one element of its domain. It is not required
that x be unique; the function f may map one or more elements of X to the same
element of Y.
A function is said to be bijective or bijection, if a function f: A → B satisfies
both the injective (one-to-one function) and surjective function (onto function)
properties. It means that every element “b” in the codomain B, there is exactly
one element “a” in the domain A.
• A relation in mathematics defines the relationship between two
different sets of information
• A relation is any set of ordered-pair numbers.
• An empty relation (or void relation) is one in which there is no relation

between any elements of a set. For example, if set A = {1, 2, 3} then, one
of the void relations can be R = {x, y} where, |x – y| = 8.
• A universal (or full relation) is a type of relation in which every
element of a set is related to each other.
• In a reflexive relation, every element maps to itself. For example,
consider a set A = {1, 2,}. Now an example of reflexive relation will be
R = {(1, 1), (2, 2), (1, 2), (2, 1)}. The reflexive relation is given by-
• In a symmetric relation, if a=b is true then b=a is also true. In other words,
a relation R is symmetric only if (b, a) ∈ R is true when (a,b) ∈ R. An
example of symmetric relation will be R = {(1, 2), (2, 1)} for a set A = {1,
2}. So, for a symmetric relation,
• For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R.
For a transitive relation,
• A relation R on a set A is known as asymmetric relation if no (b,a) ∈ R
when (a,b) ∈ R or we can even say that relation R on set A is symmetric
if only if (a,b) ∈ R⟹(b, a) ∉R.
Partially ordered sets?
Especially in order theory, a partial order on a set is an arrangement

such that, for certain pairs of elements, one precedes the other. The
word partial is used to indicate that not every pair of elements needs to
be comparable
In simple words, in order to become a partially ordered sets the

Relation R must be reflexive, asymmetric, and transitive
Hasse Diagram
• A Hasse diagram is a graphical representation of the relation of

elements of a partially ordered set (poset) with an implied upward
orientation.
• Hasse diagrams were originally devised as a technique for making

drawings of partially ordered sets by hand,
Let's see what a Hasse diagram is. For this, we will

consider a set B, as {3,4,5,6}
Draw the Hasse Diagram for the following partial ordering
• {(a,b)la/b} on the set {1,2,3,4,5,6,10,12,20,30,60

• A = {1, 2, 3, 4} R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 4), (3, 2),
(3, 1), (3, 4)}
• A = {a, b, c} R = {(a, b), (a, a), (b, b), (c, c), (a, c), (b, c), (c, a),
(c, b)}
• A = {1, 2, 3, 6} : Factors of 6 following the partial order {(a,
b) | a∕b }.
• B = {1, 2, 5, 10} : Factors of 10 following the partial order
{(a, b) | a∕b }
Lattice
lattice is a partially ordered set or POSET

in which every pair of elements
has both:
-a least upper bound (LUB) and
-a greatest lower bound (GLB)
Boolean Algebra
Boolean algebra is a division of mathematics that deals with
operations on logical values and incorporates binary variables.
The Boolean variables are represented as binary numbers to

represent truths: 1 = true and 0 = false.
1+1=1
1+0=1
0+0=1
1*0=0
0*0=0
1*1=1
Draw a diagram representing the circuit
1. f=ab+c
2. xy+x’y+y’z
3. (a+b)(a+b+c)
(b’+c’)
The END

Group 1 Posets and Boolean Algebra

Uploaded by

Copyright:

Available Formats

Group 1 Posets and Boolean Algebra

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Group 1 Posets and Boolean Algebra

Uploaded by

Copyright:

Available Formats

Members

Asis, Welmar ( Supremo)

Aquino, Kenneth ( Kawal)

Anistoso, Christine Grace ( Katipunan)

Amba, Mayen Grace ( Katipunan)

• An empty relation (or void relation) is one in which there is no relation

Especially in order theory, a partial order on a set is an arrangement

In simple words, in order to become a partially ordered sets the

• A Hasse diagram is a graphical representation of the relation of

• Hasse diagrams were originally devised as a technique for making

Let's see what a Hasse diagram is. For this, we will

• {(a,b)la/b} on the set {1,2,3,4,5,6,10,12,20,30,60

lattice is a partially ordered set or POSET

The Boolean variables are represented as binary numbers to

You might also like