Try this
- Tap , then : you get . Now subtract using and the other elements. Which numbers can you get?
- Tap “one round” a few times. What does end up looking like in ? Compare it with the blue ticks.
- Is there a way to force ? Try it, then think about why it fails.
- Where does the “Smallest positive element” meter finally stop? How is it related to and ?
Given that a set has some property, which elements must it contain, and what other properties must it have? This is the most common type of set problem. The approach is always two steps: first push outward with the rule and see what the set is forced to become; then find a quantity the rule cannot change (here, “divisible by ”) to show that nothing more can be forced.
Predict first
is closed under subtraction (), and , . What is the smallest positive integer that must contain?
and , so : this is the Euclidean algorithm. On the other hand, is itself closed under subtraction and contains and , so no positive integer smaller than has to be in . The answer is .
Why
A set closed under subtraction that contains 12 and 18
Step 1 / 5- Given
contains and , and is closed under subtraction.
Another kind of rule: each element produces the next
A rule can also act on a single element: . Start from and keep applying it. What happens?
It goes round in three steps: . So as soon as , the set contains at least the three elements . With a different starting point and the rule , how long is the cycle?
Remove one condition
Break it
Counterexample lab: remove one condition
Conclusion: The smallest positive element of divides every element of ← still true?
With closure under subtraction, the smallest positive element you end up with, , divides everything:
Now take closure under addition only. Start from and and run a few rounds:
The smallest positive element is , but does not divide . Addition only makes things bigger: it cannot produce differences, so it can never produce . Closure under subtraction is powerful because it can “go down” and carry the Euclidean algorithm all the way through.
Practice
A set of integers is closed under subtraction, and , . What is the smallest positive integer that must contain?
A set of real numbers satisfies and . Given that , what is the product of the three elements that must contain?
A set of real numbers satisfies and . Given that , at least how many elements does have?
A set of real numbers is non-empty and finite, , and . If , what can be?