Difficult: Hold on here, so remind me, can you have the same element twice in a set? I'm assuming not, so {3,2,1+1} is bad and should be written as {3,2}? Otherwise , Theorem 8.3 would not make sense since there would be multiple, equivalent sets in the set P (the partition). Or maybe we just don't count them twice, maybe could you remind us about that?
Again, like a lot of things in this class, there are a big handful of concepts to master that will take practice. So examples rock.
Interesting: It is way cool that we can call things equivalence relations if they are reflexive, symmetric, AND transitive. I went back through the examples we did in class and realized that mod's are reflexive, symmetric, and transitive, so it's an equivalence relation! Which means... we're probably going have to start proving more of those soon.
No comments:
Post a Comment