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 A is called a proper subset of a set B if:

  • Every element of A is in B, and
  • A is not equal to B.

This is denoted by:

AB

Mathematically:

AB(AB)(AB)

where denotes "subset or equal".

Examples of Proper Subsets edit

Example 1: edit

A={1,2} and B={1,2,3} Since all elements of A are in B and AB, AB (A is a proper subset of B).

Example 2: edit

C={apple,banana} and D={apple,banana,cherry} Here, CD.

Example 3: edit

(the empty set) is a proper subset of every non-empty set. For example, {1}.

Important Notes edit

  • A proper subset cannot be equal to the original set.
  • If A=B, then A is a subset but not a proper subset of B.
  • 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 AB AB
Example {1,2,3}{1,2,3} (equal sets) {1,2}{1,2,3} (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.