When the textbook says A \subseteq A is always true, a small part of your brain rebels. How can A be a subset of itself? A sub-anything should be smaller than the thing it is a part of — a sub-committee has fewer members than the committee, a sub-plot is smaller than the plot. So calling A a subset of A sounds like calling a person their own ancestor. Something is off.
It turns out nothing is off. The rule A \subseteq A falls out of the definition of "subset" the moment you read it carefully, and accepting it is the difference between counting subsets correctly and losing two marks on a JEE question about power sets.
The definition, slowly
Here is the definition of subset, written the way your textbook states it:
That is a universal statement: for every object x, if x \in A, then x \in B.
Now plug B = A into that statement. The question becomes: for every x, if x \in A, then x \in A? Yes — trivially. Every element of A is an element of A. There is nothing to check, because you're not comparing two things; you're comparing A with itself.
So A \subseteq A is not a surprising axiom someone imposed on the theory. It is what the definition forces you to say.
Why: the definition of subset quantifies over every element, and says "whatever is in A must be in B." When B is A, the requirement becomes "whatever is in A must be in A," which is trivially true. No new content was added — we just set B=A and read the definition.
The misleading English word
The reason this feels circular is that English "sub-" usually implies strictly smaller. That is a convention of English, not a property of the mathematical definition.
Mathematics has two symbols for this reason:
- A \subseteq B — "A is a subset of B," which allows A = B. Some books call this "improper or proper subset."
- A \subsetneq B (or A \subset B in older texts) — "A is a proper subset of B," which requires A \neq B.
If you want "strictly smaller," you have to ask for it explicitly with the proper-subset symbol. The default \subseteq includes equality because that is the more useful default for theorem-proving.
You can think of it like \leq versus < for numbers. Saying "x \leq x" is not a trick question — it is clearly true because \leq allows equality. If you want to say x is strictly less than itself, that is x < x, which is never true. Same story for sets: A \subseteq A is always true; A \subsetneq A is never true.
A picture
The third picture is just the first one with A's inner circle pushed outward until it coincides with B's boundary. Nothing suspicious happens at the moment they coincide — the element-check definition is unchanged.
Why the convention is useful, not lazy
Once you accept A \subseteq A, two very common mathematical moves become clean.
Move 1: proving A = B by proving mutual containment. The standard way to show two sets are equal is:
This works because "\subseteq" allows equality. If the symbol forbade equality, then "A \subseteq B and B \subseteq A" would never both be true at once, and this technique would be dead. The tool is in your proof toolbox precisely because \subseteq is reflexive.
Move 2: counting subsets. A set with n elements has 2^n subsets. For n = 3, |A| = 3 gives 2^3 = 8 subsets, including \varnothing and A itself. If A were not counted as a subset of A, the formula would become 2^n - 1, and every power set problem in JEE would read slightly differently.
Work the case A = \{1, 2, 3\} explicitly. The eight subsets are:
Count them: 1 + 3 + 3 + 1 = 8. The full set \{1, 2, 3\} is listed last, and dropping it would give 7, mismatching 2^3. The counting formula needs A \subseteq A to hold.
The empty set gets in on the action too
A companion fact: \varnothing \subseteq A for every set A. This is usually proven by a tiny piece of logic called vacuous truth. "Every element of \varnothing is an element of A" is true because \varnothing has no elements, so the condition "if x \in \varnothing then x \in A" has no chance to fail. No counterexample exists.
Together, the two facts give you the structure:
- Every set has at least two subsets: \varnothing and itself.
- If |A| = n, then |A| has exactly 2^n subsets in total, two of which are these special ones.
A common slip
In JEE-style subset-counting problems, students sometimes subtract one because they "don't want to count A itself." That is a mistake introduced by importing the English meaning of "sub-" into the mathematical one. The answer to "how many subsets does \{a, b, c, d\} have?" is 2^4 = 16, including \{a, b, c, d\} itself. If the question asks for proper subsets specifically, that's 2^n - 1 = 15 (excluding the set itself), and if it wants proper non-empty subsets, that's 2^n - 2 = 14 (excluding both \varnothing and the full set).
Always re-read the question: is it asking for subsets, proper subsets, or proper non-empty subsets? The default word "subset" (the \subseteq relation) always includes A itself.
Putting it in your bones
Three reflexes will cement this for you:
- Whenever you see \subseteq, mentally translate to "is a part of, possibly the whole thing."
- Whenever you see \subsetneq, mentally translate to "is a strictly smaller part."
- When counting subsets, always include \varnothing and A itself unless the question explicitly excludes them.
With those, the "circular" feeling goes away, replaced by something more useful: a clean default rule that makes proofs and counting formulas work smoothly.
Related: Sets — Introduction · How Many Subsets Does a Set with n Elements Have? · Element vs Subset · When Do I Use ∈ and When Do I Use ⊆?