Properties of crisp set helps us to simplify many mathematical set operations. Crisp set are collection of unordered, district elements. We can perform various crisp set operations on the crisp set. It is recommended to reader to first navigate through the crisp set operations for better understanding of properties of crisp set.

Crisp set possesses following properties. We will demonstrate each of them with suitable example.

We will be using following sets for the further discussion:

X = {1, 2, 3, 4, 5, 6}

A = {1, 2, 3},

B = {2, 3, 4},

C = {5, 6}

### Involution:

Involution states that the complement of complement of set A would be set A it self.

For given data,

A’ = X – A = {4, 5, 6}

(A’)’ = X – A’ = {1, 2, 3} = A

### Commutativity:

Commutativity property states that the operation can be performed irrespective of order of the operand. For example, addition is commutative operator, so 2 + 3 or 3 + 2 yields the same result. But, subtraction is not commutative, so 3 – 2 â‰ 2 – 3.

**Proving union is commutative:**

A âˆª B = {1, 2, 3, 4} â†’ LHS

B âˆª A = {1, 2, 3, 4} â†’ RHS

**Proving intersection is commutative:**

A âˆ© B = {2, 3} â†’ LHS

B âˆ© A = {2, 3} â†’ RHS

### Associativity:

Associativity property allows us to perform the operations by grouping the operands and keeping them in similar order.

**(A âˆª B) âˆª C= A âˆª ( B âˆª C )**

For given data:

A âˆª B = {1, 2, 3, 4}

(A âˆª B) âˆª C={1, 2, 3, 4, 5, 6} â†’ LHS

B âˆª C = {2, 3, 4, 5, 6}

A âˆª (B âˆª C) = {1, 2, 3, 4, 5, 6} â†’ RHS

**(A âˆ© B) âˆ© C= A âˆ© ( B âˆ© C)**

For given data:

A âˆ© B = {2, 3}

(A âˆ© B) âˆ© C = Ï• â†’ LHS

B âˆ© C = Ï•

A âˆ© (B âˆ© C) = Ï• â†’ RHS

### Distributivity:

Mathematically it is defined as,

**A âˆª (B âˆ© C) = (A âˆª B) âˆ© (A âˆª C)**

B âˆ© C = Ï•

A âˆª (B âˆ© C) = {1, 2, 3}â†’LHS

A âˆª B = {1, 2, 3, 4}

A âˆª C = {1, 2, 3, 5, 6}

(A âˆª B) âˆ© (A âˆª C) = {1, 2, 3} â†’ RHS

**A âˆ© (B âˆª C) = (A âˆ© B) âˆª (A âˆ© C)**

B âˆª C = {2, 3, 4, 5, 6}

A âˆ© (B âˆª C) = {2, 3} â†’ LHS

A âˆ© B = {2, 3}

A âˆ© C = Ï•

(A âˆ© B) âˆª (A âˆ© C) = {2, 3} â†’ RHS

### Absorption:

Mathematically absorption is defined as,

**A âˆª (A âˆ© B) = A**

For the given data:

A âˆ© B = {2, 3}

A âˆª (A âˆ© B) = {1, 2, 3} = A

**A âˆ© (A âˆª B) = A**

For the given data:

A âˆª B = {1, 2, 3, 4}

A âˆ© (A âˆª B) = {1, 2, 3} = A

### Idempotency/Tautology:

Idempotency is defined as,

A âˆª A = A

A âˆ© A = A

For the given data,

A âˆª A = {1, 2, 3} = A

A âˆ© A = {1, 2, 3} = A

### Identity:

Mathematically, we can define this property as,

A âˆª X = X

A âˆ© X = A

A âˆª Ï• = A

A âˆ© Ï• = Ï•

For the given data,

A âˆª X = {1, 2, 3, 4, 5, 6} = X

A âˆ© X = {1, 2, 3} = A

A âˆª Ï• = {1, 2, 3} = A

A âˆ© Ï• = { } = Ï•

### De Morgan’s Laws:

Mathematically, De Morgan’s laws are defined as,

**Law 1: (A âˆª B)’ = A’ âˆ© B’ **

For the given data:

A âˆª B = {1, 2, 3, 4}

(A âˆª B)’ = {5, 6} â†’ LHS

A’ = {4, 5, 6}

B’ = {1, 5, 6}

A’ âˆ© B’ = {5, 6} = (A âˆª B)’ â†’ RHS

**Law 2: (A âˆ© B)’ = A’ âˆª B’**

For the given data:

A âˆ© B = {2, 3}

(A âˆ© B)’ = {1, 4, 5, 6} â†’ LHS

A’ = {4, 5, 6}

B’ = {1, 5, 6}

A’ âˆª B’ = {1, 4, 5, 6} = (A âˆ© B)’ â†’ RHS

### Law of Contradiction:

Mathematically it is defined as,

A âˆ© A’ = Ï•

For the given data:

A’ = {4, 5, 6}

A âˆ© A’ = { } = Ï•

### Law of Excluded Middle:

Mathematically it is defined as,

A âˆª A’ = X

For the given data:

A’ = {4, 5, 6}

A âˆª A’ = {1, 2, 3, 4, 5, 6} = X

## Watch on YouTube: Properties of crisp set

## Test Your Knowledge:

Let X = {1, 2, 3, 4, 5, 6, 7, 8}, A = {1, 2, 3, 5}, B = {1, 3, 4, 6, 7}, C = {2, 4, 6, 8}. Prove following properties for given sets.

- Involution
- Commutativity
- Associativity
- Distributivity
- Absorption
- Idempotency
- Identity
- De Morgan’s Laws
- Law of Contradiction
- Law of Excluded Middle

**Please post your answer / query / feedback in comment section below !**

lucidly explained.

Thanks a lot Mohmmad for interaction !