Talk:Math 360, Fall 2021, Assignment 1
From cartan.math.umb.edu
Revision as of 17:34, 13 September 2021 by Michael.reilly002 (talk | contribs) (Created page with "== Revisions (Michael Reilly): # Revised definition of “containment”: containment only refers to relationships between sets, “membership” is the term discussed in cla...")
== Revisions (Michael Reilly):
- Revised definition of “containment”: containment only refers to relationships between sets, “membership” is the term discussed in class that applied to individual elements in a set.
- Revised definition of “equality”: equality does not care about cardinality, because sets can be equal and have different cardinalities, if an element is repeated. Set equality is only concerned with whether the sets are subsets of each other (ie., all elements of each set are elements of the other set).
- revised definition of “property”: it is important to be specific that a “property” must be a true or false statement, the original definition was ambiguous.
- revised book problem (4): the instructions said specifically to list the elements of the set, the set was already described using a rule. Also, the rule that was given as an answer to this question said that all integers between -10.2 and 11.2 are included, and while that answer logically makes sense, there are integers between those values, typically integers are listed with integer bounds, so it would be $-10 \leq x \leq 11$.
- revised proof of largest set: The proof was hard to follow, and I don’t think even proved what the question asked. The proof was a proof by contradiction, but I think it followed faulty logic. The basic structure was: “Proof of Proposition P. Assume P is false. P=false creates a contradiction, therefore P is false.” Luckily, there is a much simpler proof that is based on the definition of the Power Set that is definitional and doesn’t require proof by contradiction, which I have put there instead.