Relations defined on sets-英文文献.pdf

JOURNAL OF FORMALIZED MATHEMATICS Volume 1, Released 1989, Published 2003 Inst. of Computer Science, Univ. of Białystok Relations Defined on Sets Edmund Woronowicz Warsaw University Białystok Summary. The article includes theorems concerning properties of relations defined as a subset of the Cartesian product of two sets (mode Relation of X ,Y where X ,Y are sets). Some notions, introduced in [4] such as domain, codomain, field of a relation, composition of relations, image and inverse image of a set under a relation are redefined. MML Identifier: RELSET_1. WWW: /JFM/Vol1/relset_1.html The articles [2], [1], [3], and [4] provide the notation and terminology for this paper. We adopt the following convention: A , B, X , X , Y , Y , Y , Z denote sets and a, x , y denote sets. 1 1 2 Let us consider X , Y . Relation between X and Y is defined by: (Def. 1) It ⊆ [:X , Y :]. Let us consider X , Y . We see that the relation between X and Y is a subset of [:X , Y :]. Let us consider X , Y . Note that every subset of [:X , Y :] is relation-like. In the sequel P, R denote relations between X and Y . One can prove the following propositions: (4)1 If A ⊆ R , then A is a relation between X and Y . 2 (6) If a ∈ R , then there exist x , y such that a = x ,y and x ∈X and y ∈ Y. 3 (8) If x ∈X and y ∈ Y, then {x ,y } is a relation between X and Y . (9) For every binary relation R such that domR ⊆X holds R is a relation between X and rngR . (10) For every binar