Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    dm1 - Problem Set - 4 - 2023 Autumn

    Uploaded by

    cooldana44
    Discrete math

    Copyright:

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

    dm1 - Problem Set - 4 - 2023 Autumn

    Uploaded by

    cooldana44
    9 views3 pages
    Discrete math

    Original Title

    dm1_Problem set_4_2023 Autumn

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Discrete math

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    9 views3 pages

    dm1 - Problem Set - 4 - 2023 Autumn

    Uploaded by

    cooldana44
    Discrete math

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    ELTE IK Discrete mathematics I Problem set 4

    Problem set 4: Partial orders, functions

    Summary of theory
    Partial orders
    partial order, partially ordered set: A binary relation ⊆ X ×X on set X is a partial oder if it is reflexive,
    transitive and anti-symmetric. Then (X, ) is a partially ordered set.
    Let (X, ) be a partially ordered set. An element x ∈ X is called:

    ˆ greatest element, if: ∀y ∈ X : y  x.

    ˆ maximal element, if: 6 ∃y ∈ X: y 6= x ∧ x  y.

    ˆ least element, if: ∀y ∈ X : x  y.

    ˆ minimal element, if: 6 ∃y ∈ X: y 6= x ∧ y  x.

    immediate predecessor: Let (X, ) be a partially ordered set. For any x, y ∈ X, x 6= y we say that x is
    an immediate predecessor of y if 6 ∃z ∈ X : (z 6= x ∧ z 6= y ∧ x  z  y).
    Hasse-diagram: A (finite) partially ordered set (X, ) can be represented on a Hasse-diagram as follows:
    each element of X is represented by a ’dot’on the diagram. Two dots representing x and y, respectively
    are connected by a line if and only if x is a predecessor of y or y is a predecessor of x. In this case we
    place the dot representing the element which is a predecessor of the other one lower on the diagram than
    the dot representing the other element.
    comparable and incomparable elements: Two elements x and y of a partially ordered set (X, ) are said
    to be comparable, if x  y or y  x holds; otherwise x and y are said to be incomparable.
    (total) order: A partial order ⊆ X × X is called a total order (or order for short), if every pair of
    elements x, y ∈ X is comparable, that is, if: ∀x, y ∈ X : x  y or y  x. In oder words: a (total) order
    is a dichotomous partial order. In this case the pair (X, ) is called a totally ordered set (or ordered set
    for short).

    Functions
    function: A relation f ⊆ X × Y is a function if: ∀x, y, y 0 : (x, y) ∈ f ∧ (x, y 0 ) ∈ f ⇒ y = y 0 .
    Notations:

    ˆ If f is a function then f (x) = y ⇔ (x, y) ∈ f .

    ˆ X → Y denotes the set of all functions f ⊆ X × Y .

    ˆ f ∈ X → Y ⇔ f ⊆ X × Y is a function.

    ˆ f : X → Y ⇔ (f ∈ X → Y ∧ dmn(f ) = X).

    A function f : X → Y is

    ˆ injective if: ∀x1 , x2 , y : f (x1 ) = f (x2 ) ⇒ x1 = x2 ;

    ˆ surjective, if rng(f ) = Y and

    ˆ bijective, if it is both injective and surjective.

    1
    ELTE IK Discrete mathematics I Problem set 4

    Questions
    Partial orders
    Question 1: Let A = {2, 3, 6, 8, 9, 12, 18} ⊆ N+ , R ⊆ A × A and aRb ⇐⇒ a | b.
    (a) Prove that R is a partial order on set A.
    (b) Draw the Hasse-diagram of the partial order R.

    Question 2:
    (a) Prove that the relation  is a partial order on N, where  is defined as follows:
    ∀n, m ∈ N : n  m ⇐⇒ ∃k ∈ N such that n + k = m.
    (b) Define the binary relation R on N×N as follows: ∀m1 , m2 , n1 , n2 ∈ N : (m1 , n1 )R(m2 , n2 ) ⇐⇒
    m1 ≤ m2 ∧ n1 ≤ n2 . Prove that R is a partial order on N × N.

    Question 3: In each of the following examples decide if relation R is a partial order on the
    underlying set.
    (a) P is the set of all polynomials with real coefficients and R ⊆ P × P , f Rg ⇐⇒ deg f ≤ deg g
    (b) R ⊆ Z × Z, aRb ⇐⇒ |a| ≤ |b|
    (c) V is the set of all those vectors in R2 which are 10 units in length and R ⊆ V × V, xRy ⇐⇒
    the angle from the positive real axis to vector x is less than or equal to the angle from the
    positive real axis to vector y (we assume both of these angles to be in the interval [0; 2π[)
    (d) R ⊆ R2 × R2 , xRy ⇐⇒ the length of vector x is less than or equal to the length of vector y.

    Question 4: Decide which of the following relations are total orders on the set A = {1, 2, 3, 4}.
    (a) f = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4), (3, 3), (3, 4), (4, 4)}
    (b) f = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 4), (3, 3), (4, 4)}
    (c) f = {(1, 1), (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4), (3, 4)}

    Functions
    Question 5: In each of the following examples decide if the relation f is a function. If f is a
    function then determine the domain and range of f and decide whether f is surjective, injective
    and/or bijective.
    (a) A = {1, 2, 3, 4, 5}, B = {10, 11, 12, 13, 14}, f ⊆ A × B, f = {(1, 11), (2, 11), (4, 12), (5, 10)}
    (b) A = {1, 2, 3, 4}, B = {a, b, c, d, e, f }, f ⊆ A × B, f = {(1, a), (2, c), (3, e), (3, f ), (4, a)}
    (c) A = {1, 2, 3, 4, 5}, B = {a, b, c, d, e, f }, f ⊆ A × B, f = {(1, a), (4, e), (5, d)}
    (d) A = {1, 2, 3}, B = {1, 3, 5}, f ⊆ A × B, f = {(1, 1), (2, 5), (3, 5)}

    Question 6: Let m ∈ R+ and A = {all isosceles triangles with height of m (from base)}, B =
    R+ . Define the binary relation R ⊆ A × B as follows: aRb, a ∈ A, b ∈ B, if the area of a equals b.
    Show that R is a function, and examine the properties of f (i.e. decide if f is surjective, injective
    and/or bijective).

    Question 7:
    (a) Let f : R → R, f (x) := 3x − 4. Prove that function f is bijective, and find the inverse of f .
    (b) Let g : R → R, g(x) := 3 − |x|. Prove that function g is neither injective, nor surjective.

    2
    ELTE IK Discrete mathematics I Problem set 4

    Question 8: In each of the following examples decide whether f is a function.


    (a) f ⊆ N × N, xf y ⇐⇒ x | y
    (b) f ⊆ {0, 3, 5} × {1, 2, 5}, xf y ⇐⇒ xy = 0
    (c) f ⊆ {1, 2, 5} × {0, 3, 5}, xf y ⇐⇒ xy = 0
    (d) f ⊆ N × N, xf y ⇐⇒ the set of digits contained by the base-10 form of x equals the set of
    digits in the base-10 form of y.
    (e) f ⊆ N × N, xf y ⇐⇒ 2x = y
    (f) f ⊆ Z × Z, xf y ⇐⇒ x2 = y 2
    (g) f ⊆ N × N, xf y ⇐⇒ x2 = y 2
    (h) f ⊆ R × R, xf y ⇐⇒ x2 + y 2 = 9

    Question 9: In each of the following examples decide if the given binary relation is a function.
    (a) f1 = {(x, y) ∈ R × R | 7x = y 2 } ⊆ R × R
    (b) f2 = {(x, y) ∈ R × R | x = y 2 + 6y} ⊆ R × R
    (c) f3 = {(x, y) ∈ R × R | 7x2 − 6 = y} ⊆ R × R
    (d) f4 = {(x, y) ∈ R × R+ 0 | y = |x|} ⊆ R × R0
    +

    (e) f5 = {(x, y) ∈ R × R | y = (x √ + 4)2 } ⊆ R × R


    (f) f6 = {(x, y) ∈ R × R+ 0 | 2y = x} ⊆ R × R+ 0
    (g) f7 = {(x, y) ∈ Z × Z | 7 | x − y} ⊆ Z × Z
    (h) f8 = {(x, y) ∈ (R \ {0}) × (R \ {0}) | xy = 1} ⊆ (R \ {0}) × (R \ {0})
    (i) f9 = {(x, y) ∈ R × R | xy = 1} ⊆ R × R
    (j) f10 = {(x, y) ∈ Z × Z | |x − y| ≤ 3} ⊆ Z × Z
    (k) f11 = {(x, y) ∈ R × R | y(1 − x2 ) = x − 1} ⊆ R × R
    (l) f12 = {(x, y) ∈ (R\{1, −1})×(R\{1, −1}) | y(1−x2 ) = x−1} ⊆ (R\{1, −1})×(R\{1, −1})
    About each relation that is a function decide if it is injective, surjective and/or bijective. About
    each relation that is not a function and is a homogeneous relation, decide if it is reflexive, symmetric
    and/or transitive.

    Further questions
    Question 10: Prove that the inverse of a partial order is also a partial order.

    Question 11: Prove the following statements:


    (a) The greatest (least) element in a partially ordered set (if it exists) is always a maximal
    (minimal) element. However, a maximal (minimal) element is not necessarily a greatest
    (least) element.
    (b) Every finite partially ordered set contains at least one maximal (minimal) element.
    (c) If a partially ordered set contains a greatest (or a least) element then it is unique.
    (d) In a totally ordered set an element is a maximal (minimal) element if and only if it is the
    greatest (least) element.

    Question 12: Give an example for a partially ordered set which


    (a) does not contain any maximal nor any minimal elements;
    (b) contains maximal (minimal) element(s), but no greatest (least) element.
    (c) contains more than one maximal (minimal) element.

    Question 13: Prove that the inverse of a function f is also a function if and only if f is injective.

    You might also like