原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
5.1_Relations_and_their_Properties5.2n-ary_relations课件
5 RELATIONS Section 5.1 ;5 Relations;Section 5.1 Relations and Their Properties
Definition: Let A and B be sets.A binary二元 relation R from a set A to a set B is a subset R í A×B.
;;We have a common graphical representation of relations:
Definition: A Directed graph 有向图or a Digraph D from A to B is a collection of vertices顶点 V í AèB and a collection of edges边 R í A ×B. If there is an ordered pair e = x, y in R then there is an arc or edge from x to y in D. The elements x and y are called the initial and terminal vertices of the edge e.;;RELATIONS ON A SET
Definition: A binary relation R on a set A is a subset of A ×A or a relation from A to A.
Example: ? A = {1, 2, 3,4}
R={(1,1),(1,4),(2,1),(2,3),(2,4),(3,1),(4,1),(4,2)};Example 4 p248
Example 5;;n-ARY RELATIONS
Definition Let A1,A2,…,An be sets. An n-ary relation on these sets is a subset of A1×A2 × … × An . The sets A1,A2,…,An are called the domains of the relation, and n is called its degree(阶）.
Example Let R be relation consisting of triples三元组 (a,b,c) where a,b,c are integers with abc. Then (1,2,3)?R, but (2,4,3)?R. The degree of this relation is 3.Its domain are all equals to the set of integers.;;Consider the following relations on {1,2,3,4}:
R1={(1,1),(1,2),(2,1),(2,2),(3,4),(4,1),(4,4)}
R2={(1,1),(1,2),(2,1)}
R3={(1,1),(1,2),(1,4),(2,1),(2,2),(3,3),(4,1),(4,4)}
R4={(2,1),(3,1),(3,2),(4,1),(4,2),(4,3)}
R5={(1,1),(1,2),(1,3）,(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)}
R6={(3,4)}
Which of these relations are reflexive?
Solution: The relations R3 and R5 are reflexive.;Note: if U = ? then the implication x[x ?U ? x, x ?R] is true .
The void relation on a void Universe is reflexive!空关系在空集合上自反
The void relation on a nonempty Universe is not reflexive!空关系在非空集合上不自反
Note: If U is not void then all vertices in a reflexive relation must have loops! ;;Consider the following relations on {1,2,3,4}:
R1={(1,1),(1,2),(2,1),(2,2),(3,4),(4,1),(4,4)}
R2={(1,1),(1,2),(2,1)}
R3={(1,1),(1,2),(1,4),(2,1),(2,2),(3,3),(4,1),(4,4
文档评论（0）