9/21 Closure of Relations & Equivalence Relation

如果对你有什么帮助的话 ，点个赞吧 谢谢（鞠躬
但是为什么这个访问量这么高=(´･ω･`)？

Closure of relation

Introduction

Let $R$ be a relation on set $A$. $R^{\prime }$ is called the reflexive(symmetric, transitive ) closure of $R$

We write $r(R)(s(R),t(R)or{R}^{+})$, if there exists a relation $R^{\prime }$ with reflexivity (symmetric, transitivity) containing $R$.
Such that $R^{\prime }$ is a subset of every relation with reflexivity(symmetry, transitivity) containing $R$.

^ in other words closure must be the smallest relation with particular property

Condition

a closure must satisfy

1. $R^{\prime }$ is reflexivity(symmetry, transitivity)
2. $R\subseteq R^{\prime }$
3. For any reflexive (symmetric, transitive) relation $R^{\prime \prime }$, if $R\subseteq R^{\prime \prime }$, then $R^{\prime }\subseteq R^{\prime \prime }$

Theorem

Let $R_1$ and $R_2$ be relations on $A$, and $R_1\subseteq R_2$. Then

1. $r(R_1)\subseteq r(R_2)$
2. $s(R_1)\subseteq s(R_2)$
3. $t(R_1)\subseteq t(R_2)$

Computing closures

Let $R$ be a relation on a set $A$, and $I_A$ be identity(diagonal) relation. Then

1. $r(R)$
   r ( R ) = R ∪ I A ( I A = { ( a , a ) ∣ a ∈ A } ) r(R) = R\cup I_A\\ (I_A = \{(a,a)|a\in A\}) r(R)=R∪IA​(IA​={(a,a)∣a∈A})
   reflexive closure of empty relation on $A$ is the identity relation on $A$
2. $s(R)$
   $$s(R)=R\cup R^{-1}$$
   The symmetric closure of empty relation on $A$, is an empty relation
3. $t(R)$
   Let $R$ be a relation on $A$, Then
   
   ^infinity set
   
   ^finite set($A$ be set with $|A|=n$)

Equivalence Relation

A relation $R$ on a set $A$ is called an equivalence relation if it is reflexive, symmetric, transitive

partition (quotient)

A partition or a quotient set of a nonempty set $A$ is a collection $\Pi$ of nonempty subsets of $A$ such that

1. Each element of $A$ belongs to one of the sets in $\Pi$
2. If $A_i$ and $A_j$ are distinct elements of $\Pi$, then $A_i\cap A_j=\varnothing$

For example
A = { a , b , c } A = \{a,b,c\} A={a,b,c}
Then, U = { { a , b } , { c } } U=\{\{a,b\},\{c\}\} U={{a,b},{c}}, S = { { a } , { b } , { c } } S=\{\{a\},\{b\},\{c\}\} S={{a},{b},{c}} are both elements of $\Pi$

equivalence class

Let $R$ be an equivalence relation on a set $A$. The set of all element that are related to an element $a$ of $A$ is called the equivalence class of $a$.
The equivalence class of $a$ with respect to $R$ is denoted by $[a{]}_R$.

When only one relation is under consideration, we will delete the subscript $R$ and write $[a]$ for this equivalence class.

Theorem

Let $R$ be an equivalence relation on $A$. Then

1. For any $a\in A$, $a\in [a]$
2. If $aRb$, then $[a]=[b]$
3. For $a,b\in A$, If $(a,b)\notin R$, then $[a]\cap [b]=\varnothing$

form equivalence relation with partition on a set

Let $\Pi$ be a partition of a nonempty set $A$. Let $R$ be a relation on $A$, and $aRb$ if only if there exists $A_i\in \Pi s.t.a,b\in A_i$
$$R=(A_1\times A_1)\cup (A_2\times A_2)\cup \cdots \cup (A_n\times A_n)$$

$R$ is an equivalence relation on $A$

Theorem

Given a partition { A i ∣ i ∈ Z } \{ A_i | i\in Z \} {Ai​∣i∈Z} of the set $A$, there is an equivalence relation $R$ that has the set $A_i,i\in Z$, as its equivalence classes