Main Topics under Set Theory






1. Representation of Sets (āϏāĻŽāĻˇā§āϟāĻŋā§° āωāĻĒāĻ¸ā§āĻĨāĻžāĻĒāύ)


A. Roster Form (āϤāĻžāϞāĻŋāĻ•āĻžāϭ⧁āĻ•ā§āϤ āĻĒāĻĻā§āϧāϤāĻŋ) : In this method, all elements are listed inside curly braces { }. (āĻāχ āĻĒāĻĻā§āϧāϤāĻŋāϤ āϏāĻ•āϞ⧋ āωāĻĒāĻžāĻĻāĻžāύ { }-ā§° āĻ­āĻŋāϤ⧰āϤ āϞāĻŋāĻ–āĻž āĻšāϝāĻŧāĨ¤)


Example: A = {1, 2, 3, 4, 5} (Set of first five natural numbers) [A = {ā§§, ⧍, ā§Š, ā§Ē, ā§Ģ} (āĻĒā§ā§°āĻĨāĻŽ āĻĒāĻžāρāϚāϟāĻž āĻ¸ā§āĻŦāĻžāĻ­āĻžā§ąāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻžā§° āϏāĻŽāĻˇā§āϟāĻŋ)]


B. Set Builder Form (āĻŦ⧈āĻļāĻŋāĻˇā§āĻŸā§āϝ āĻĒāĻĻā§āϧāϤāĻŋ): In this method, a common property or rule is used. (āĻāχ āĻĒāĻĻā§āϧāϤāĻŋāϤ āĻāϟāĻž āϏāĻžāϧāĻžā§°āĻŖ āĻŦ⧈āĻļāĻŋāĻˇā§āĻŸā§āϝ āĻŦāĻž āύāĻŋāϝāĻŧāĻŽ āĻŦā§āĻ¯ā§ąāĻšāĻžā§° āϕ⧰āĻž āĻšāϝāĻŧāĨ¤)

Example: A = {x ∈ N : 1 ≤ x ≤ 5} (Set of natural numbers from 1 to 5)


āĻ…ā§°ā§āĻĨ: x āĻāϟāĻž āĻ¸ā§āĻŦāĻžāĻ­āĻžā§ąāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āφ⧰⧁ ā§§ā§° āĻĒā§°āĻž ā§Ģā§° āĻ­āĻŋāϤ⧰āϤāĨ¤


C. Descriptive Form (āĻŦā§°ā§āĻŖāύāĻžāĻŽā§‚āϞāĻ• āĻĒāĻĻā§āϧāϤāĻŋ): In this method, the set is described in words. (āĻāχ āĻĒāĻĻā§āϧāϤāĻŋāϤ āϏāĻŽāĻˇā§āϟāĻŋāĻ• āĻļāĻŦā§āĻĻ⧰⧇ āĻŦā§°ā§āĻŖāύāĻž āϕ⧰āĻž āĻšāϝāĻŧāĨ¤)

Example: A = The set of even natural numbers less than 10. (ā§§ā§ĻāϤāĻ•ā§ˆ āϏ⧰⧁ āϝ⧁āĻ—ā§āĻŽ āĻ¸ā§āĻŦāĻžāĻ­āĻžā§ąāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻžā§° āϏāĻŽāĻˇā§āϟāĻŋāĨ¤) Roster Form: {2, 4, 6, 8}


Types of Sets (āϏāĻŽāĻˇā§āϟāĻŋā§° āĻĒā§ā§°āĻ•āĻžā§°): i. Empty Set, ii. Finite Set,  iii. Infinite Set,  iv. Equal Set,  v. Singleton Set


Operations on Sets (āϏāĻŽāĻˇā§āϟāĻŋā§° āĻ“āĻĒā§°āϤ āĻ•ā§ā§°āĻŋāϝāĻŧāĻž): i. Union (āϏāĻ‚āϝ⧋āϜāύ) : ∪,  ii. Intersection (āϛ⧇āĻĻ) : ∩,  iii. Difference (āĻĒāĻžā§°ā§āĻĨāĻ•ā§āϝ) : −,  iv. Complement (āĻĒā§°āĻŋāĻĒā§‚ā§°āĻ•) : A′


Symbols: i. A B = Union of A and B (A āφ⧰⧁ B-ā§° āϏāĻ‚āϝ⧋āϜāύ),             ii. A ∩ B = Intersection of A and B (A āφ⧰⧁ B-ā§° āϛ⧇āĻĻ)


Example: Let, A = {1, 2, 3, 4}, B = {3, 4, 5, 6}



  • Union (A B) = {1, 2, 3, 4, 5, 6} āϏāĻ‚āϝ⧋āϜāύ = āĻĻ⧁āϝāĻŧā§‹āϟāĻž āϏāĻŽāĻˇā§āϟāĻŋā§° āϏāĻ•āϞ⧋ āωāĻĒāĻžāĻĻāĻžāύ

  • Intersection (A ∩ B) = {3, 4} āϛ⧇āĻĻ = āĻĻ⧁āϝāĻŧā§‹āϟāĻž āϏāĻŽāĻˇā§āϟāĻŋāϤ āϏāĻžāϧāĻžā§°āĻŖāĻ­āĻžā§ąā§‡ āĻĨāĻ•āĻž āωāĻĒāĻžāĻĻāĻžāύ






=============================================================================


2. Types of Sets (āϏāĻŽāĻˇā§āϟāĻŋā§° āĻĒā§ā§°āĻ•āĻžā§°)


A. Empty Set (āĻļā§‚āĻ¨ā§āϝ āϏāĻŽāĻˇā§āϟāĻŋ) : A set having no elements is called an Empty Set. (āϝāĻŋ āϏāĻŽāĻˇā§āϟāĻŋāϤ āϕ⧋āύ⧋ āωāĻĒāĻžāĻĻāĻžāύ āύāĻžāĻĨāĻžāϕ⧇ āϤāĻžāĻ• āĻļā§‚āĻ¨ā§āϝ āϏāĻŽāĻˇā§āϟāĻŋ āĻŦā§‹āϞāĻž āĻšāϝāĻŧāĨ¤)


Example: A = {x ∈ N : x < 0} There is no natural number less than 0. (ā§Ļ-āϤāĻ•ā§ˆ āϏ⧰⧁ āϕ⧋āύ⧋ āĻ¸ā§āĻŦāĻžāĻ­āĻžā§ąāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻž āύāĻžāχāĨ¤)


Therefore, A = ∅ or {}


B. Finite Set (āϏāϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ): A set having a limited number of elements is called a Finite Set. (āϝāĻŋ āϏāĻŽāĻˇā§āϟāĻŋā§° āωāĻĒāĻžāĻĻāĻžāύ⧰ āϏāĻ‚āĻ–ā§āϝāĻž āϏ⧀āĻŽāĻŋāϤ, āϤāĻžāĻ• āϏāϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ āĻŦā§‹āϞāĻž āĻšāϝāĻŧāĨ¤)


Example: A = {2, 4, 6, 8} Number of elements = 4 (āωāĻĒāĻžāĻĻāĻžāύ⧰ āϏāĻ‚āĻ–ā§āϝāĻž = ā§Ē)


C. Infinite Set (āĻ…āϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ): A set having unlimited elements is called an Infinite Set. (āϝāĻŋ āϏāĻŽāĻˇā§āϟāĻŋā§° āωāĻĒāĻžāĻĻāĻžāύ⧰ āϏāĻ‚āĻ–ā§āϝāĻž āĻ…āϏ⧀āĻŽ, āϤāĻžāĻ• āĻ…āϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ āĻŦā§‹āϞāĻž āĻšāϝāĻŧāĨ¤)


Example: N = {1, 2, 3, 4, 5, ...} (Set of natural numbers) āĻ¸ā§āĻŦāĻžāĻ­āĻžā§ąāĻŋāĻ• āϏāĻ‚āĻ–ā§āϝāĻžā§° āϏāĻŽāĻˇā§āϟāĻŋ


D. Equal Set (āϏāĻŽāĻžāύ āϏāĻŽāĻˇā§āϟāĻŋ): Two sets are equal if they contain exactly the same elements. (āĻĻ⧁āϟāĻž āϏāĻŽāĻˇā§āϟāĻŋā§° āϏāĻ•āϞ⧋ āωāĻĒāĻžāĻĻāĻžāύ āĻāϕ⧇ āĻšāϞ⧇ āϏāĻŋāĻšāρāϤ āϏāĻŽāĻžāύ āϏāĻŽāĻˇā§āϟāĻŋāĨ¤)


Example: A = {1, 2, 3}, B = {3, 2, 1} , A = B, āĻ•āĻžā§°āĻŖ āĻĻ⧁āϝāĻŧā§‹āϟāĻžāϤ⧇ āĻāϕ⧇ āωāĻĒāĻžāĻĻāĻžāύ āφāϛ⧇āĨ¤


E. Singleton Set (āĻāĻ•āĻ• āϏāĻŽāĻˇā§āϟāĻŋ): A set having only one element is called a Singleton Set. (āϝāĻŋ āϏāĻŽāĻˇā§āϟāĻŋāϤ āĻŽāĻžāĻ¤ā§ā§° āĻāϟāĻž āωāĻĒāĻžāĻĻāĻžāύ āĻĨāĻžāϕ⧇ āϤāĻžāĻ• āĻāĻ•āĻ• āϏāĻŽāĻˇā§āϟāĻŋ āĻŦā§‹āϞāĻž āĻšāϝāĻŧāĨ¤)


Example: A = {5}, Only one element exists. (āĻ•ā§‡ā§ąāϞ āĻāϟāĻž āωāĻĒāĻžāĻĻāĻžāύ āφāϛ⧇āĨ¤)


===================================================================


Short Note



  • Empty Set (āĻļā§‚āĻ¨ā§āϝ āϏāĻŽāĻˇā§āϟāĻŋ): Example: ∅ , { } āωāĻĻāĻžāĻšā§°āĻŖ: ∅ , { }

  • Finite Set (āϏāϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ)Example: {2, 4, 6, 8} āωāĻĻāĻžāĻšā§°āĻŖ: {2, 4, 6, 8}

  • Infinite Set (āĻ…āϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ)Example: {1, 2, 3, 4, ...} āωāĻĻāĻžāĻšā§°āĻŖ: {1, 2, 3, 4, ...}

  • Equal Set (āϏāĻŽāĻžāύ āϏāĻŽāĻˇā§āϟāĻŋ)Example: {1, 2, 3} = {3, 2, 1} āωāĻĻāĻžāĻšā§°āĻŖ: {1, 2, 3} = {3, 2, 1}

  • Singleton Set (āĻāĻ•āĻ• āϏāĻŽāĻˇā§āϟāĻŋ): Example: {5} āωāĻĻāĻžāĻšā§°āĻŖ: {5}


Trick (āĻ•ā§ŒāĻļāϞ)



  • No element → Empty Set (āĻļā§‚āĻ¨ā§āϝ āϏāĻŽāĻˇā§āϟāĻŋ)

  • Limited elements → Finite Set (āϏāϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ)

  • Unlimited elements → Infinite Set (āĻ…āϏ⧀āĻŽ āϏāĻŽāĻˇā§āϟāĻŋ)

  • Same elements → Equal Set (āϏāĻŽāĻžāύ āϏāĻŽāĻˇā§āϟāĻŋ)

  • One element only → Singleton Set (āĻāĻ•āĻ• āϏāĻŽāĻˇā§āϟāĻŋ)