Listing the members versus stating the property they share

What to assume they know

• Why "well-defined" is the whole difference between a set and a heap — a set as a collection with a decidable membership test
• The belongs-to symbol and its negation
• Divisors and prime factorisation of a two- or three-digit number
• Solving a quadratic by factorising, including one with a negative root
• Squares of the first ten natural numbers
• Reading an inequality chain such as 1 ≤ n ≤ 6

What they should be able to do

• Write a given set in roster form, using braces and commas, with no member repeated
• State why reordering a roster and deleting a repeat both leave the set unchanged
• Use the three-dot convention correctly, and say what has to be true of a set before the convention is allowed
• Read a set-builder expression aloud, naming the job of the brace, the variable and the colon
• Convert a roster to a set-builder description, and check the description in both directions before accepting it
• Convert a set-builder description to a roster, deriving the members rather than guessing them
• Give two different correct set-builder descriptions of the same set, and explain why that is not a contradiction
• Match given rosters against given descriptions and justify each pairing

Where it usually goes wrong

• "Writing an element twice makes the set bigger." Membership is a yes/no answer with no count attached, so a second mention adds nothing. This is why SCHOOL, LOYAL and BETTER all shrink.
• "Reordering makes a different set." Same reason: nothing in the membership question mentions position.
• "Any endless set can be written with dots." The chapter says plainly that the real numbers cannot, because the members follow no pattern a reader could continue. The dots are a promise that the next member is predictable.
• **"The dots mean and so on, roughly."** They stand for definite members. If a reader cannot name the next one, the roster is not a description.
• "A set-builder description must use the letter x." Any letter serves; the chapter itself switches to y and z when it renames three sets.
• "If my description produces the right first few members, it is right." Example 5 has to be checked in both directions: every member satisfies the property, and nothing outside does. A description that admits an extra element describes a different set.
• "There is one correct set-builder form." Example 3 prints two. What is fixed is the set, not the sentence naming it.
• "1 ≤ n ≤ 6 is a detail." Delete it from Example 4 and the six fractions become an infinite family. The bound is part of the set.

Questions to check understanding

• Write a described set in roster form, including cases whose roster is a single member or is empty
• Write a listed set in set-builder form, with marks for the bound as well as the pattern
• Match rosters to descriptions and justify each pairing
• Insert the belongs-to symbol or its negation for elements of a set given in set-builder form
• State two different correct set-builder descriptions of one given set

Examples worth working on the board

Values marked verified are worked out here from the chapter's own data; the chapter prints no answers to its exercises.

• Three rosters the chapter builds (§1.2, pp. 2–3): the even positive integers below 7, printed as {2, 4, 6}; the natural numbers that divide 42; and the odd natural numbers, written with three dots after the first three. Verified: 42 = 2 × 3 × 7, so its divisors are 1, 2, 3, 6, 7, 14, 21, 42 — eight of them, which is what the page prints.
• Order and repetition (§1.2, p. 3, two Notes). The divisor list above is reprinted in a scrambled order and is the same set. Taking the letters of the word SCHOOL gives five distinct letters, S, C, H, O and L, because the repeated O is one member however many times it is written.
• Set-builder, first pass (§1.2, p. 3). V is set up as the vowels of the English alphabet, and the chapter checks both halves: every member is a vowel, and no letter outside V is. Then A is given as the natural numbers strictly between 3 and 10. Verified: A = {4, 5, 6, 7, 8, 9}, six members, which is what the page states.
• Example 1 (p. 3). Solve x² + x – 2 = 0 and give the solution set as a roster. Verified: the left side factorises as (x – 1)(x + 2), so the set is {1, –2}.
• Example 2 (pp. 3–4). A condition names the positive integers whose square stays under 40, and asks for the roster. Verified: 6² = 36 is under 40 and 7² = 49 is over, so the set is {1, 2, 3, 4, 5, 6}.
• Example 3 (p. 4). Turn {1, 4, 9, 16, 25..} into a property. The chapter gives two acceptable answers — the squares of natural numbers, and the same thing written with an explicit x = n² and n drawn from N. Use both; the point of section 9 is that a set has many correct descriptions.
• Example 4 (p. 4). Turn the six fractions 1/2, 2/3, 3/4, 4/5, 5/6, 6/7 into a property. Verified: each numerator is one below its denominator, and the numerators run 1 to 6, so the members are n/(n + 1) for natural n with 1 ≤ n ≤ 6. Both halves of that description are load-bearing: drop the bound and the set becomes infinite.
• Example 5 (p. 4) — four rosters to be matched with four descriptions. Rosters: the seven letters P, R, I, N, then C, A and L; {0}; {1, 2, 3, 6, 9, 18}; {3, –3}. Descriptions: a positive integer dividing 18; an integer with x² – 9 = 0; an integer with x + 1 = 1; a letter appearing in PRINCIPAL. Verified: PRINCIPAL has nine letters with P and I each appearing twice, leaving the seven distinct letters shown; x + 1 = 1 forces x = 0; the divisors of 18 are 1, 2, 3, 6, 9, 18; and x² = 9 gives 3 and –3.
• Exercise 1.1 Q3 (p. 5) — six sets to put in roster form: the integers with –3 ≤ x < 7; the natural numbers below 6; the two-digit natural numbers whose digits add to 8; the prime numbers dividing 60; the letters of TRIGONOMETRY; the letters of BETTER. Verified: the two-digit case gives 17, 26, 35, 44, 53, 62, 71, 80 — note 08 is not two-digit and 89 sums to 17, so students must work the tens digit from 1 to 8; 60 = 2² × 3 × 5, so its prime divisors are 2, 3, 5; TRIGONOMETRY has nine distinct letters, T, R, I, G, O, N, M, E, Y; BETTER has four, B, E, T, R.
• Exercise 1.1 Q4 (p. 5) — five rosters to be described by a property: {3, 6, 9, 12}; {2, 4, 8, 16, 32}; {5, 25, 125, 625}; the even naturals written with dots; the squares from 1 to 100. Verified: these are respectively the multiples of 3 up to 12, the powers of 2 from the first to the fifth, the powers of 5 from the first to the fourth, and — for the last — the squares n² with n running 1 to 10.
• Exercise 1.1 Q5 (p. 5) — six descriptions to be listed out. Verified: the odd naturals are endless and take dots; the integers strictly between –1/2 and 9/2 are 0, 1, 2, 3, 4; the integers with x² ≤ 4 are –2, –1, 0, 1, 2; LOYAL contributes L, O, Y, A; the months without 31 days are February, April, June, September, November; the consonants of the English alphabet before k are b, c, d, f, g, h, j.
• Exercise 1.1 Q6 (p. 5) — a second matching question. Verified: {1, 2, 3, 6} are the natural divisors of 6; {2, 3} are the prime divisors of 6; MATHEMATICS reduces to eight distinct letters — M, A, T, H, then E, I, C and S; and {1, 3, 5, 7, 9} are the odd naturals below 10.

Figures to have open

• An annotated set-builder expression with callouts on the brace, the variable, the colon and the property. Standard schematic; the chapter explains this in prose and draws nothing.
• A two-column matching board for section 10, with a tick that only appears once both directions have been checked. Standard schematic.
• No textbook figure is needed. This topic is entirely notation and worked conversions; pp. 2 to 5 carry no artwork at all beyond the two boxed Notes on p. 3 and the watermark, and the chapter's first numbered figure is Fig 1.1 on p. 11.

Where this sits in the book

• NCERT Class 11 Mathematics, Chapter 1 "Sets", §1.2 Sets and their Representations, pp. 2–4, including the two boxed Notes on p. 3
• Worked Examples 1 to 5, pp. 3–4
• Exercise 1.1, questions 3 to 6, p. 5