Raw

6. Control questions and tasks / Контрольні запитання і завдання

Relations and representations

  1. Define a binary relation on a set AA. How many different relations are there on a set with nn elements, and why?
  2. Describe the three representations of a relation — ordered pairs, Boolean matrix, directed graph — and how each pair (a,b)(a,b) appears in each. What is a self-loop in the digraph?
  3. Write the relation R={(1,1),(1,3),(2,2),(3,1)}R = \{(1,1),(1,3),(2,2),(3,1)\} on {1,2,3}\{1,2,3\} as a Boolean matrix and as a directed graph.

The four properties

  1. State the definitions of reflexive, symmetric, antisymmetric, and transitive. For each, say how it shows up in the matrix and in the digraph.
  2. Explain why antisymmetric is not the same as “not symmetric.” Give a relation that is both symmetric and antisymmetric, and one that is neither.
  3. To disprove that a relation is transitive, what exactly must you exhibit? Illustrate with the relation {(1,2),(2,3)}\{(1,2),(2,3)\} on {1,2,3}\{1,2,3\}.
  4. Is the empty relation on a non-empty set reflexive? Symmetric? Antisymmetric? Transitive? Justify each answer.

Operations and inverse

  1. Define RSR \cup S, RSR \cap S, RSR \setminus S, R\overline{R}, and R1R^{-1} for relations on AA. Relative to what universe is R\overline{R} taken?
  2. For the divides relation R={(a,b)ab}R = \{(a,b)\mid a\mid b\} on the positive integers, describe R1R^{-1} in words. What does reversing every arrow of the digraph do?
  3. Let A={0,1,2}A = \{0,1,2\}. Write the relations << and == as pairs, and compute <=<\cup\,{=}, <=<\cap\,{=}, and <\overline{<} (relative to A×AA\times A).

Types of relation

  1. Define an equivalence relation and a partial order in terms of the four properties. Give one everyday example of each.
  2. Why does an equivalence relation produce a partition of the set? What are the equivalence classes of the “same doubles team” relation from Task 5?
  3. Show that the divisibility relation on {1,2,3,4}\{1,2,3,4\} (Task 6) is a partial order but not an equivalence relation. Which single property separates the two types here?

Tasks by hand

  1. Classify {(1,1),(1,2),(2,1),(2,2),(3,3)}\{(1,1),(1,2),(2,1),(2,2),(3,3)\} on {1,2,3}\{1,2,3\} by all four properties, justifying every “no” with a witness pair.
  2. On Z\mathbb{Z}, let (x,y)R(x,y)\in R iff x+yx + y is even. Decide whether RR is reflexive, symmetric, antisymmetric, and transitive, and name its type.

Practical/Practical2/6questions.md · 2.5 KB · updated 2026-07-31 21:14