BSE Abstract Binary Relations 1
BSE Abstract Binary Relations 1
BSE Abstract Binary Relations 1
Binary Relations
Exercise Review:
R = {(1,1), (2,2), (2,4), (2,3), (4,2), (4,4), (4,3), (3,2), (3,4), (3,3)}
Functions vs. Relations
Lesson Focus 1
-How functions maybe
represented
table of values
The Grade 11 (General
Mathematics) content
revolves around the
Ordered pairs
concept of functions and
its applications.
Graphs
Equations
y = 3x - 4
Lesson Focus 2: Differentiating functions from relations
Based on definition, no two ordered pairs have the same 1st coordinate
{(1,2),(2,2), (3,5), (4,5)}
{(1,3),(1,4), (2,3), (4,5)}
Vertical line intersects the graph at most once (vertical line test)
Equation produces only one value for each x in the input (domain)
Why keep functions apart from relation?
Because…
Functions have rules
• Many widely used formulas in
1. that is true to every element in
the domain (input) mathematics classes are
expressions of known functions
such as the formula for
2. that produce unique output for the circumference of the circle
every input C = 2πr
If a variable y is so related to a
Functions are essential for variable x that whenever a numerical
formulating physical relationships in value is assigned to x, there is a rule
the sciences. according to which a unique value
of y is determined, then y is said to be a
function of the independent variable x.
The modern definition of function
was first given in 1837 by the
German mathematician Peter
Dirichlet as follows:
Binary Operation
NOTE:
There are other operations defined on sets that have the same properties as
the usual operation we know.
Definition Remark:
A binary operation on a • The term binary refers to the fact
non-empty set S is a rule that that the rule is used for combining
assigns to each ordered pair of two elements (at a time).
elements x, y in S exactly one
element x y S. • To show that is a binary operation
on S, we need to determine
This means that a binary • a b is well-defined in S that is,
operation * on a non-empty set S is a b exists uniquely
function from S x S to S, that is • a b S, that is
: SxSS S is closed under .
( a, b) a b
Other Examples:
Show whether the operation defined on the given set is a binary operation or NOT.
3. On Z+, define a * b = c where is c the smallest integer greater than both a and b
Show whether the operation defined on the given set is a binary operation or NOT.
3. On Z+, define a * b = c where is c the smallest integer greater than both a and b
BINARY
Examples:
a * b = 3ab +1 and
b * a = 3ba + 1 = 3ab + 1 since multiplication is commutative
Practice:
2. Define the binary operation * on Z+ such that x*y = x + 3y. Determine if * is associative and/or
commutative
aij = si * sj
The aij’s are in the shaded region of the table where a * a = b; a * b = c and so on. Notice that
the si * sj is unique and clearly an element of S.
If a binary operation on set S is commutative, its multiplication table has entries that are
symmetric about the main diagonal that is aij = aji. The operation defined on the given table
above is in fact commutative.