Subsets of the set of real numbers
Every number system you have met since primary school nests inside the next: naturals sit inside integers, integers inside rationals, rationals inside the full set of real numbers . That chain of inclusions is the first subset story in this chapter, but the far more useful one for the rest of Class 11 is the interval — a compact bracket notation for "all real numbers between here and there." Domains of functions, solution sets of inequalities, and the ranges you will compute in later chapters are almost always written as intervals, not as long-winded inequality sentences. This section builds both stories together: the inclusion chain , the four bounded interval types, the unbounded ones that reach out to , and a general rule for deciding when one interval sits inside another — the exact skill needed the moment inequalities and functions arrive.
Real numbers are built from nested subsets , and intervals — open, closed, or half-open stretches of written with round and square brackets — are the compact notation used to describe and compare such subsets.
The core idea
The nested number systems. Every real number belongs to one of several progressively larger families:
where is the natural numbers, adds zero and the negatives, is every number expressible as with and , and additionally contains the irrationals — numbers like and that cannot be written as such a fraction. Each inclusion is proper (the symbol , not just ): is in but not , is in but not , and is in but not . A common slip is assuming rationals already "fill up" the number line — they do not, since between any two rationals sits an irrational, and vice versa.
Intervals as subsets of . An interval collects every real number lying between two fixed endpoints and , with . There are four bounded types, distinguished only by whether each endpoint is included:
- Open: , both endpoints excluded.
- Closed: , both endpoints included.
- Half-open, left-excluded: .
- Half-open, right-excluded: .
A round bracket always means "strictly beyond, endpoint not counted"; a square bracket always means "up to and including." Even though looks like a short segment on paper, it is an infinite set — between any two of its points sit infinitely many more real numbers.
Unbounded intervals. Some intervals extend forever in one direction, using and as boundary markers. Since infinity is not an actual number that a set can "contain," it always sits beside a round bracket: , , , , and the whole real line is . The length of a bounded interval with endpoints and is simply , regardless of whether the brackets are round or square.
Deciding whether every element of a smaller interval also lies in a larger one is a skill needed constantly once inequalities and function domains arrive, so it pays to have a general rule rather than checking numbers one at a time; the goal here is to derive, from the definitions alone, the exact condition under which the closed interval is a subset of the closed interval , assuming and throughout.
Step 1. Write down what subset means. means: for every real with , it must also be true that . So we must show the inequality chain forces for every such , not just some.
Step 2. Test the two endpoints of , since they are the extreme cases. If satisfies , and satisfies , then every strictly between and automatically satisfies too, because and sandwich the whole range inside .
Step 3. Simplify the two endpoint conditions. Since already gives , the condition reduces to just ; likewise already gives , so reduces to just . The two conditions that matter are therefore and — the smaller interval's left endpoint must not fall below , and its right endpoint must not rise above .
Step 4. State the result and check it both ways. if and only if and . Conversely, if either or , the endpoint or itself lies outside , so the subset relation fails. The same reasoning, with strict inequalities at the relevant ends, extends directly to open and half-open intervals.
Worked example
Let and . Using the rule just derived, determine whether , and separately determine whether is a proper subset.
Step 1. Write in set-builder form to identify its endpoints: , so its left endpoint is (included) and its effective right boundary is (excluded). Compare against .
Step 2. Apply the endpoint test. The left-endpoint condition needs , which holds. The right-boundary condition needs every to also satisfy ; since , this holds too. Both conditions are satisfied, so .
Step 3. Check for a proper subset by finding an element of that is not in . Take : it satisfies , so , but means . Since has at least one element lacks, is a proper subset of : .
Step 4 (competitive stretch). Now find the interval (their common elements) and (everything in either). Since , every element of is already in , so and . This is a general fact: whenever , and — a shortcut worth remembering instead of recomputing from scratch.
Common traps
- Swapping round and square brackets: a round bracket always excludes its endpoint, a square bracket always includes it — mixing them up flips the whole answer.
- Writing or -style errors with a square bracket touching an infinity symbol — infinity is never an included endpoint, so it must always sit next to a round bracket.
- Checking only one endpoint when testing — both and must hold; satisfying only one is not enough.
- Reversing the inclusion chain, e.g. writing — the correct order is smallest to largest: .
Ask the tutor: Want to practice converting a compound inequality into interval notation, or test whether one interval sits inside another using the endpoint rule? Ask the AI tutor to walk through a few with you.
Why do we even need interval notation when set-builder notation already describes the same thing?
Both describe the same set, but interval notation is far shorter to write and read once you are doing this repeatedly — writing takes a moment, while writing every time slows you down and invites inequality-sign slips. Later chapters on function domains and inequality solutions lean on interval notation constantly, so learning it now as a fast, reliable shorthand pays off immediately.
Is an interval like (a, b) really infinite, even if a and b are close together, like (1, 1.001)?
Yes, always, no matter how close and are. Between any two distinct real numbers there are infinitely many more real numbers — you can always average two numbers in the interval to find another one strictly between them, and repeat that forever. So is just as infinite as itself, even though it looks "small" on a number line. Length and infinitude are different properties.
How is deciding subset for intervals different from deciding subset for sets like {1, 2, 3}?
The idea is identical — every element of the smaller set must be in the larger one — but with finite sets like you can check each element individually, while an interval has infinitely many elements, so checking one at a time is impossible. That is exactly why the endpoint-comparison rule derived above matters: instead of testing infinitely many -values, you only ever need to compare the two endpoints of each interval.