原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
of R, observe that if a ∈ Ai, then x ∈ [a] implies x ∈ Ai, and x ∈ Ai implies x ∈ [a]. ▪
A binary relation R on a set A is antisymmetric if a R b and b R a imply a = b. For example, the “≤” relation on the natural numbers is antisymmetric, since a ≤ b and b ≤ a imply a = b. A
relation that is reflexive, antisymmetric, and transitive is a partial order, and we call
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea