In mathematics, the symmetric closure of a binary relation R {\displaystyle R} on a set X {\displaystyle X} is the smallest symmetric relation on X {\displaystyle X} that contains R . {\displaystyle R.}
For example, if X {\displaystyle X} is a set of airports and x R y {\displaystyle xRy} means "there is a direct flight from airport x {\displaystyle x} to airport y {\displaystyle y} ", then the symmetric closure of R {\displaystyle R} is the relation "there is a direct flight either from x {\displaystyle x} to y {\displaystyle y} or from y {\displaystyle y} to x {\displaystyle x} ". Or, if X {\displaystyle X} is the set of humans and R {\displaystyle R} is the relation 'parent of', then the symmetric closure of R {\displaystyle R} is the relation " x {\displaystyle x} is a parent or a child of y {\displaystyle y} ".
The symmetric closure S {\displaystyle S} of a relation R {\displaystyle R} on a set X {\displaystyle X} is given by S = R ∪ ∪ --> { ( y , x ) : ( x , y ) ∈ ∈ --> R } . {\displaystyle S=R\cup \{(y,x):(x,y)\in R\}.}
In other words, the symmetric closure of R {\displaystyle R} is the union of R {\displaystyle R} with its converse relation, R T . {\displaystyle R^{\operatorname {T} }.}
Lokasi Pengunjung: 3.147.195.163