Proper subset
Proper Subset - Definition and Examples edit
A proper subset is a special kind of subset where all elements of one set are contained in another set, but the two sets are not equal. In other words, the proper subset must have fewer elements than the original set.
Definition of Proper Subset edit
A set is called a proper subset of a set if:
- Every element of is in , and
- is not equal to .
This is denoted by:
Mathematically:
where denotes "subset or equal".
Examples of Proper Subsets edit
Example 1: edit
and Since all elements of are in and , (A is a proper subset of B).
Example 2: edit
and Here, .
Example 3: edit
(the empty set) is a proper subset of every non-empty set. For example, .
Important Notes edit
- A proper subset cannot be equal to the original set.
- If , then is a subset but not a proper subset of .
- The empty set is a proper subset of any set except itself.
Difference Between Subset and Proper Subset edit
Property | Subset | Proper Subset |
---|---|---|
Definition | All elements of A are in B, A may be equal to B | All elements of A are in B, but A is not equal to B |
Symbol | ||
Example | (equal sets) | (proper subset) |
Conclusion edit
The concept of proper subsets is essential for understanding detailed relationships between sets. Proper subsets help distinguish when one set is strictly contained within another without being equal.