Relations

(関係)

Discrete Mathematics I

9th lecture, Nov. 28, 2014

http://www.sw.it.aoyama.ac.jp/2014/Math1/lecture9.html

Martin J. Dürst

© 2005-14 Martin J. Dürst Aoyama Gakuin University

Today's Schedule

• Summary and homework for last lecture
• Pascal's triangle and combinations
• Factorial and neutral element
• Relations:
  
  • Tuples
  • Cross products
  • Relations
  • Representations of relations
• This week's homework

Summary of Last Lecture

• Sets are a central concept of Mathematics
• Representation of sets: Denotation, connotation, Venn diagram
• Member (b ∈ A), subset (B ⊂ A), powerset (P(A)), universal set (U)
• Set operations: Union, intersection, difference, complement
• Sets of numbers: Natural numbers (ℕ), integers (ℤ), rationals (ℚ), reals (ℝ), complex numbers (ℂ)
• Laws for sets (parallel to laws for Boolean operations)

Homework from Last Lecture (1, 2)

1. Create a set with four elements. If you use the same elements as other students, a deduction of points will be applied.

[都合により削除]

2. Create the powerset of the set you created in problem 1.

[都合により削除]

Homework from Last Lecture (3)

3. For sets A of size zero to six, create a table of the sizes of the powersets (|P(A)|).

[都合により削除]

Homework from Last Lecture (4, 5)

4. Express the relationship between the size of a set A and the size of its powerset P(A) as a formula.

[都合により削除]

5. Explain the reason behind the formula in problem 4.

[都合により削除]

Homework from Last Lecture (6)

6. Create a table that shows, for sets A of size zero to five, and for each n (size of sets in P(A)), the number of such sets.

[都合により削除] 

Pascal's Triangle

(Pascal's triangle)

Start with a single 1 in the first row, surrounded by zeroes
((0 ... 0) 1 (0 ... 0)). Create row by row by adding
the number above and to the left and the number above and to the right.

                  1
                1   1
              1   2   1
            1   3   3   1
          1   4   6   4   1
        1   5  10  10   5   1
      1   6  15  20  15   6   1
    1   7  21  35  35  21   7   1
  1   8  28  56  70  56  28   8   1

Subsets and Pascal's Triangle

• For a set A with |A| = n, we can write
  |{B|B⊂A∧|B|=m}| as _nC_m
• _nC_n = 1 (the only subset of size n is A itself)
• _nC₀ = 1 (the only subset of size 0 is {})
• _nC_m = _n-1C_m-1 + _n-1C_m (n>0, 0<m<n)

Subsets and Combinations

• Combinatorics is very important for Information Technology
• Combinatorics deals with counting the number of different things under various conditions or restrictions
• The word combinations refers to the number of choices of a given size from a set without repetitions and without considering order
• This is just the number of subsets of a given size
• Combinations are written _nC_m
• There are also permutations (considering order), repeated permutations, and repeated combinations

Direct Formula for Combinations

• _nC_m = n!/(m! (n-m)!)

(prove it as a homework)

Factorial

Notation: n!

Definition: n! = 1 · 2 · ... (n-1) · n = ∏ⁿ_i=1 i

(∏ is called product)

Question:

1! = 1

0! = 1

Neutral Element of an Operation

(also unit element, identity element)

• Neutral element of addition: 0
• Neutral element of multiplication: 1
• Neutral element of set union: {}
• Neutral element of set intersection: U
• Neutral element of conjunction: true
• Neutral element of disjunction: false
• Neutral element of substraction:

Relations

• Importance of relations in IT
• Definition of relation
• Representation of relations

Importance of Relations for IT

• Relational databases
• Relations and graphs
• Relations and logical operations

Tuples

• Sets are not ordered. Tuples are ordered.
• An ordered pair is a tuple with two elements.
• The ordered pair of a and b is written (a, b).
• {a, b} = {b, a}. (a, b) ≠ (b, a).
• An n-tuple is an ordered sequence of n elements.
• Tuples with a fixed number of elements are called
  triple (3), quadruple (4), quintuple (5), sextuple (6), septuple (7), octuple (8), nonuple (9),...
• Example: Quadruple of (lecture, teacher, room, student)
  (Mathematics for Computer Scientists I, Martin J. Dürst, E202, Hanako Aoyama)

Cartesian Product

• The Cartesian product (set) of two sets A and B is the set of all ordered pairs of elements from A and B.
• The Cartesian product of A and B is written A × B.
• A × B = {(x, y) | x ∈ A, y ∈ B}
  Example: A = {2, 3}, B = {5, 6}, A × B = {(2, 5), (2, 6), (3, 5), (3, 6)}
• Size of A × B: |A × B| = |A|·|B|
• Instead of A × A, one often writes A².
• The Cartesian product is also defined for more than two sets.
  Example 1: Cartesian product of A, B, C, D:
  A × B × C × D = {(x, y, z, v) | x ∈ A, y ∈ B, z ∈ C, v ∈ D}
  Example 2: Cartesian product of lectures, teachers, rooms, students
  (totally about 3000×1000×20000×200 ≅ 10¹³ quadruples)

Definition of Relation

• A relation R between two sets A and B is defined as a subset of A × B.
• Example: A = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, B = {3, 4}; R is the relation "is divisible by"
  R = {(3, 3), (6, 3), (9, 3), (4, 4), (8, 4)}
• (a, b) ∈ R can be written as aRb.
  Examples: a>b,...
• A relation between two sets is called a binary relation.
  There are also ternary relations, and so on.
• A binary relation between A and A is called a binary relation on A.
  

Representation of Relations

• A relation is a set. We can therefore use set representations:
  • Denotation
    Example: R = {(3, 3), (6, 3), (9, 3), (4, 4), (8, 4)}
  • Connotation
    Example: R = {(x, y)| x ∈ A, y ∈ B, x mod y = 0}
• Matrix representation
• Table representation
• Graph representation

Matrix Representation

A relation between sets A and B is represented as a matrix where:

• Each row of the matrix corresponds to an element of A
• Each column of the matrix corresponds to an element of B
• If the row and column elements are related,
  the entry is 1 (true), otherwise 0 (false)

Matrix representation is suited for binary relations.

A matrix with only 1 or 0 as entries is called a logical matrix (also binary matrix, relation matrix, or Boolean matrix)

Table Representation

A relation between several sets is represented in a table as follows:

• Use a column for each set of the relation
  (i.e. two columns for a binary relation, three columns for a ternary relation)
• Use a row for each element of the relation (each tuple)

Table representation is suited for relations of any arity.

Table representation is suited for sparse relations
(relations with very few entries).

Table representation is used in relational databases.

Graph Representation

A relation between sets A and B is represented as a graph as follows:

• The elements of A and B are represented as vertices.
• A relation from an element of A to an element of B is represented as a directed edge between the corresponding vertices.
• If the vertices of A and B are well separated (e.g. A on the left, B on the right), then there may be no need to indicate direction.
• For a binary relation on A, the vertices are often drawn only once.

Graph representation is suited for binary relations.

Inverse Relation

• The inverse relation of R is written R^-1.
• The inverse relation of a binary relation is the relation with the order of the pairs reversed.
• Example: R = {(3, 3), (6, 3), (9, 3), (4, 4), (8, 4)}
  R^-1 = {(3, 3), (3, 6), (3, 9), (4, 4), (4, 8)}
• xRy ⇔ yR^-1x
• (R^-1)^-1 = R

This Week's Homework

Deadline: December 6, 2014 (Thursday), 19:00.

Format: A4 single page (using both sides is okay; NO cover page), easily readable handwriting (NO printouts), name (kanji and kana) and student number at the top right

Where to submit: Box in front of room O-529 (building O, 5th floor)

1. Prove _nC_m = n!/(m! (n-m)!) for n>0, 0<m<n-0 using _nC_m = _n-1C_m-1 + _n-1C_m
2. Give three examples of relations from the real world that can be expressed as mathematical relations

Glossary

Pascal's triangle

パスカルの三角形

combinatorics

組合せ論

combination

組合せ

permutation

順列

repeated combination

重複組合せ

repeated permutation

重複順列

factorial

階乗

product (∏)

総乗、総積

neutral element

単位元

relational database

関係データベース

tuple

タプル

ordered pair

順序対

n-tuple

n 項組、n 字組

triple

三項組、三字組

quadruple

四項組、四字組

quintuple

五項組、五字組

sextuple

六項組、六字組

septuple

七項組、七字組

octuple

八項組、八字組

nonuple

九項組、九字組

Cartesian product (set)

直積 (集合)

definition

定義

divisible

割り切りが可能

binary relation

2項関係

ternary relation

3項関係

(binary) relation on A

A の中の関係、A の上の関係、A における関係

representation

表現

matrix

行列

row

行

column

列、欄

correspond to

と対応する

arity

アリティ

sparse

スパース、まばら (な)

vertex (plural: vertices)

頂点、節

edge

辺

directed

有向 (の)

reflexive relation

反射的関係

(main) diagonal

(主) 対角線

symmetric relation

対称的関係

(matrix) transposition

(行列) 転置

sibling

兄弟 (姉妹も含む)

antisymmetric relation

反対称的関係

opposite

反対

asymmetric relation

非対称的関係

transitive relation

推移的関係

descendant

子孫

anchestor

先祖

inverse relation

逆関係