Concept stop · What is it?

Properties of Sets

In the Chinese book: 集合的性质

A rule and a few elements force much into a set; an invariant shows the limit.

Before this stop, visit:Families of Subsets (Concept)

Hands first, words secondS contains 12 and 18, and the difference of any two elements is again in S. Tap two elements to subtract them. Can you force the smallest positive number in S?

Loading figure…

Try this

  1. Tap , then : you get . Now subtract using and the other elements. Which numbers can you get?
  2. Tap “one round” a few times. What does end up looking like in ? Compare it with the blue ticks.
  3. Is there a way to force ? Try it, then think about why it fails.
  4. 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?

Choose an answer first; then you can see the result.

Why

A set closed under subtraction that contains 12 and 18

Step 1 / 5
Loading figure…
  1. 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?

Loading figure…
Tap a few times. When does the chain come back to where it started?

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?

Loading figure…

Remove one condition

Break it

Counterexample lab: remove one condition

Conclusion: The smallest positive element of divides every element of

With closure under subtraction, the smallest positive element you end up with, , divides everything:

Loading figure…

Practice

Exercise 1Basic

A set of integers is closed under subtraction, and , . What is the smallest positive integer that must contain?

Exercise 2Basic

A set of real numbers satisfies and . Given that , what is the product of the three elements that must contain?

Exercise 3Advanced

A set of real numbers satisfies and . Given that , at least how many elements does have?

Exercise 4Challenge

A set of real numbers is non-empty and finite, , and . If , what can be?

Mistake Museum · Exhibits from this stop

Before you leave, look at the traps other people fell into here.See every exhibit in the museum →

Exhibit

Saying “equals” when you have only shown “must contain”

The wrong step: is closed under subtraction, and , so .
What went wrong? Think first, then open

Diagnosis What follows is , , and from there every integer is in , that is, . But the problem never said contains only integers: is also closed under subtraction and also contains and .

The right step: The conclusion should be . To claim equality you would also have to prove the other direction: contains nothing else.

“What you derive is a lower bound, not the whole set”

Exhibit

Thinking S could have just one element

The wrong step: satisfies . Take ; all we need is .
What went wrong? Think first, then open

Diagnosis becomes , whose discriminant is : no real solution. So in a set of real numbers, and are always two different elements.

The right step: First check whether the fixed-point equation has a solution. Here it has none, so has at least two elements; pushing further, it actually has at least three.

“Before you make the rule “stand still”, solve the equation”