8920
|
Equivalence relations are reflexive, symmetric and transitive, and classify similar objects [Lipschutz]
|
|
Full Idea:
A relation R on a non-empty set S is an equivalence relation if it is reflexive (for each member a, aRa), symmetric (if aRb, then bRa), and transitive (aRb and bRc, so aRc). It tries to classify objects that are in some way 'alike'.
|
|
From:
Seymour Lipschutz (Set Theory and related topics (2nd ed) [1998], 3.9)
|
|
A reaction:
So this is an attempt to formalise the common sense notion of seeing that two things have something in common. Presumably a 'way' of being alike is going to be a property or a part
|
15896
|
Cantor needed Power Set for the reals, but then couldn't count the new collections [Cantor, by Lavine]
|
|
Full Idea:
Cantor grafted the Power Set axiom onto his theory when he needed it to incorporate the real numbers, ...but his theory was supposed to be theory of collections that can be counted, but he didn't know how to count the new collections.
|
|
From:
report of George Cantor (The Theory of Transfinite Numbers [1897]) by Shaughan Lavine - Understanding the Infinite I
|
|
A reaction:
I take this to refer to the countability of the sets, rather than the members of the sets. Lavine notes that counting was Cantor's key principle, but he now had to abandon it. Zermelo came to the rescue.
|