Scribd Logo
Upload

Welcome to Scribd!

  • 36 views

    Relation and Function Between Sets

    Uploaded by

    Riza Mae Bayo
    The document defines and provides examples of different types of relations and functions between sets. It begins by defining a relation as a subset of the Cartesian product between two sets. It then discusses functions as a special type of relation where each input has a single output. The document goes on to define and give examples of empty relations, universal relations, identity relations, inverse relations, reflexive relations, symmetric relations, transitive relations, equivalence relations, one-to-one functions, many-to-one functions, image and inverse image, domain and range, order relations, strict order relations, and partitions. The goal is to help the reader understand and be able to identify different types of relations and functions between sets.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Relation and Function Between Sets

    Uploaded by

    Riza Mae Bayo
    36 views36 pages
    The document defines and provides examples of different types of relations and functions between sets. It begins by defining a relation as a subset of the Cartesian product between two sets. It then discusses functions as a special type of relation where each input has a single output. The document goes on to define and give examples of empty relations, universal relations, identity relations, inverse relations, reflexive relations, symmetric relations, transitive relations, equivalence relations, one-to-one functions, many-to-one functions, image and inverse image, domain and range, order relations, strict order relations, and partitions. The goal is to help the reader understand and be able to identify different types of relations and functions between sets.

    Original Description:

    Relations and Functions

    Original Title

    REPORTING-GROUP1 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines and provides examples of different types of relations and functions between sets. It begins by defining a relation as a subset of the Cartesian product between two sets. It then discusses functions as a special type of relation where each input has a single output. The document goes on to define and give examples of empty relations, universal relations, identity relations, inverse relations, reflexive relations, symmetric relations, transitive relations, equivalence relations, one-to-one functions, many-to-one functions, image and inverse image, domain and range, order relations, strict order relations, and partitions. The goal is to help the reader understand and be able to identify different types of relations and functions between sets.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    36 views36 pages

    Relation and Function Between Sets

    Uploaded by

    Riza Mae Bayo
    The document defines and provides examples of different types of relations and functions between sets. It begins by defining a relation as a subset of the Cartesian product between two sets. It then discusses functions as a special type of relation where each input has a single output. The document goes on to define and give examples of empty relations, universal relations, identity relations, inverse relations, reflexive relations, symmetric relations, transitive relations, equivalence relations, one-to-one functions, many-to-one functions, image and inverse image, domain and range, order relations, strict order relations, and partitions. The goal is to help the reader understand and be able to identify different types of relations and functions between sets.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 36

    RELATION AND FUNCTION

    BETWEEN SETS
    Objectives
    • you will be able to define;relation and function between
    sets,image and inverse image,domain and range of a
    relation/function,and equivalence relations,order
    relations, strict order relations,and partitions
    • you can answer the examples and site examples;and
    • you can gain knowledge and realizations from the given
    topics.
    Relation
    It is a subset of the Cartesian product. Or simply, a bunch
    of points (ordered pairs). In other words, the relation
    between the two sets is defined as the collection of the
    ordered pair, in which the ordered pair is formed by the
    object from each set.

    Example: {(-2, 1), (4, 3), (7, -3)}, usually written in set
    notation form with curly brackets.
    Relation Representation
    There are other ways too to write the relation, apart from set
    notation such as through tables, plotting it on XY- axis or through
    mapping diagram.
    Function
    special kind of relation (a set of ordered pairs),
    Is a relation which describes that there should be
    only one output for each input (or) we can say
    that a which follows a rule i.e., every X-value
    should be associated with only one y-value is
    called a function.
    TYPES OF
    RELATION
    DIFFERENT TYPES OF RELATION AS
    FOLLOWS:
    Empty relation
    When there’s no element of set X is related or mapped to
    any element of X, then the relation R in A is an empty
    relation, and also called the void relation, i.e R= ∅.

    For example, if there are 100 mangoes in the fruit basket.


    There’s no possibility of finding a relation R of getting any
    apple in the basket. So, R is Void as it has 100 mangoes
    and no apples.
    Universal relation
    R is a relation in a set, let’s say A is a universal
    relation because, in this full relation, every
    element of A is related to every element of A. i.e
    R = A × A.

    It’s a full relation as every element of Set A is in


    Set B.
    Identity relation
    If every element of set A is related to itself only, it is called
    Identity relation.
    I={(A, A), ∈ a}.
    For Example,
    When we throw a dice, the total number of possible
    outcomes is 36. I.e (1, 1) (1, 2), (1, 3)…..(6, 6). From
    these, if we consider the relation (1, 1), (2, 2), (3, 3) (4, 4)
    (5, 5) (6, 6), it is an identity relation.
    Inverse Relation
    If R is a relation from set A to set B i.e R ∈ A X B.
    The relation R 1= {(b,a):(a,b) ∈ R}.

    For Example,
    If you throw two dice if R = {(1, 2) (2, 3)}, R1= {(2,
    1) (3, 2)}. Here the domain is the range R1
    and vice versa.
    Reflexive Relation

    • A relation is a reflexive relation iIf


    every element of set A maps to itself,
    i.e for every a ∈ A, (a, a) ∈ R.
    Symmetric Relation
    • A symmetric relation is a relation
    R on a set A if (a, b) ∈ R then (b,
    a) ∈ R, for all a & b ∈ A.
    Transitive Relation
    • If (a, b) ∈ R, (b, c) ∈ R, then (a,
    c) ∈ R, for all a,b,c ∈ A and this
    relation in set A is transitive.
    Equivalence Relation
    • If a relation is reflexive,
    symmetric and transitive, then the
    relation is called an equivalence
    relation.
    TYPES OF
    FUNCTION
    In terms of relations, we can define the types of
    functions as:
    One to one function or Injective
    function:
    • A function (f): P → Q is said to
    be one to one if for each element
    of P there is a distinct element of
    Q.
    Many to one
    function:
    A function which maps two or
    more elements of P to the
    same element of set Q.

    The relation shows the


    relationship between INPUT
    and OUTPUT. Whereas, a
    function is a relation which
    derives one OUTPUT for each
    given INPUT.
    Note: All functions are
    relations, but not all
    relations are functions.
    Example:
    • In Maths, the relation is the • Example: For ordered
    relationship between two or pairs={(1,2),(-3,4),
    more set of values.
    • Suppose, x and y are two sets (5,6),(-7,8),(9,2)}
    of ordered pairs. And set x • The domain is = {-7,-
    has relation with set y, then 3,1,5,9}
    the values of set x are called • And range is =
    domain whereas the values of
    set y are called range. {2,4,6,8}
    IMAGE AND
    INVERSE IMAGE
    Image and inverse image

    Image and inverse image may also be


    defined for general binary relations, not
    just functions. The word "image" is used in
    three related ways. In these definitions, f :
    X → Y is a function from the set X to the
    set Y .
    Example:
    • f:{1,2.3}→{a,b,c,d} define by f(x)={a, if x=1, a, if
    .
    x=2, c,if x=3}
    • The image of the set {2,3}under f is
    f({2,3})={a,c}.The image of function f is {a,c}.The
    preimage of a is f-1 ({a})={1,2}.The preimage of
    {a,b} is also f ({1,2})={1,2}.The preimage {b,d},is
    -1

    the empty set {}=Ø.


    DOMAIN AND RANGE OF
    A RELTION/FUNCTION
    The Domain

    Is the set of all the first numbers of the


    ordered pairs.

    In other words, the domain is all of the x-


    values.
    The Range

    Is the set of the second numbers


    in each pair, or the y-values.
    Example:
    Relation: {(5,10),(1,20),(3,22)}

    Domain: 5 1 3

    Range: 10 20 22

    In the relation above the domain is { 5, 1 , 3 } .


    And the range is {10, 20, 22}
    EQUIVALENCE
    RELATIONS,ORDER
    RELATIONS,STRICT ORDER
    RELATIONS,AND PARTITIONS
    Equivalence relation
    a relation between elements of a set that is
    reflexive, symmetric, and transitive. It thus
    defines exclusive classes whose members bear
    the relation to each other and not to those in
    other classes (e.g., “having the same value of a
    measured property”).
    Example:
    Question 1:
    Let us assume that F is a relation on the set R real numbers defined by xFy if and
    only if x-y is an integer. Prove that F is an equivalence relation on R.
    Solution:
    Reflexive: Consider x belongs to R,then x – x = 0 which is an integer. Therefore
    xFx.
    Symmetric: Consider x and y belongs to R and xFy. Then x – y is an integer. Thus,
    y – x = – ( x – y), y – x is also an integer. Therefore yFx.
    Transitive: Consider x and y belongs to R, xFy and yFz. Therefore x-y and y-z are
    integers. According to the transitive property, ( x – y ) + ( y – z ) = x – z is also an
    integer. So that xFz.
    Thus, R is an equivalence relation on R.
    Order Relation
    An order relation is a relation that
    ranks elements against one another. Do
    notuse this definition in proofs! It's
    just an intuition! Properties of Order
    Relations
    Example:
    Let Α be the set of natural numbers so divisors of 60 are represented by
    which are divisors of 60. Find a the following set:
    chain of length 4 in the poset(A,|) A={1,2,3,4,5,6,10,12,15,20,30,60}
    where | represents the divisibility The poset(A.|) contains several
    relation.y chains of length 4 some of them
    Solution. are listed below:
    C1={1,2,4,12,60},
    The prime factorization of the C2={1,5,10,20,60},
    number 60 has the form:
    C3={1,3,6,12,60}
    60=22x3x5,
    Strict order relations
    A Total Strict Order Relation is a Binary Relation
    that is a Transitive, a Antisymmetric and a
    Semiconnex Relation. AKA: Total Strict Partial
    Order Relation, Strict Total Order Relation, Strict
    Semiconnex Order, Strict Semiconnex Order, Linear
    Order, Total Order, Full Order, Simple Order,
    Connex Order.
    Example:
    As an example of a strict
    partial order we can take the
    subset relation A ⊆ B and
    transform it into a strict subset
    relation A ⊂ B which is only
    true if B contains the same
    elements at A but is not equal
    to A. And again, a strict partial
    order doesn’t need to be total.
    Partition
    In mathematics, a partition of a set is a grouping
    of its elements into non-empty subsets, in such a
    way that every element is included in exactly
    one subset. Every equivalence relation on a set
    defines a partition of this set, and every partition
    defines an equivalence relation.
    Example
    Addition portioning
    32 + 22
    25+26
    40+11
    50 1 30+2 20+1
    its hard to study and so hard to
    understand but the achievement you
    can gain after is worth it to fight
    Chrisbelle Bentoy Kayeshia Manit Batoon
    Kimverly Cañas Riza Mae Bayo
    Donna Abella Jojie Ann Aringay

    You might also like