Ch 1 · Relations and Functions Start
Maths · Ch 1 · Topic 4 of 11 · 8 slides

Exercise 1.1 · Types of Relations

Relations and Functions

Swipe left or right to change slide

Exercise 1.1 · Types of Relations

Relation, empty and universal

✎ Note: A relation R on A is a set of ordered pairs (a, b) with a, b ∈ A. Write (a, b) ∈ R or aRb. Empty relation = no pair; universal relation = all pairs A × A. Both are called trivial relations.

Hinglish mein samjho: Relation = A × A ka subset. Khali (φ) aur poora (A × A) – dono ko trivial relation kehte hain.
हिंदी में समझो: संबंध = A × A का उपसमुच्चय। खाली (φ) और पूरा (A × A) – दोनों तुच्छ संबंध कहलाते हैं।
Exercise 1.1 · Types of Relations

Reflexive, symmetric, transitive

✎ Note: Check the three properties one by one. To prove a property, take general elements (a, b, c). To disprove it, one counter-example is enough – give actual numbers.

Hinglish mein samjho: Teen test alag-alag karo. Prove karne ke liye general a, b, c lo; galat dikhane ke liye ek number wala example kaafi hai.
हिंदी में समझो: तीनों परीक्षण अलग-अलग करो। सिद्ध करने के लिए सामान्य a, b, c लो; गलत दिखाने के लिए संख्याओं वाला एक उदाहरण काफ़ी है।
Exercise 1.1 · Types of Relations

Equivalence relation and classes

✎ Note: A relation that is reflexive, symmetric AND transitive is an equivalence relation. It splits A into disjoint equivalence classes: every element is in exactly one class.

Hinglish mein samjho: Teeno test pass = equivalence. Ye set ko alag-alag groups (classes) mein baant deta hai – har element ek hi group mein.
हिंदी में समझो: तीनों परीक्षण पास = तुल्यता संबंध। यह समुच्चय को अलग-अलग समूहों (वर्गों) में बाँट देता है – हर अवयव एक ही समूह में।
Hinglish mein samjho: Equivalence prove karna = 3 steps: reflexive (a ~ a), symmetric (ulta), transitive (chain). Har step mein general letters use karo.
हिंदी में समझो: तुल्यता सिद्ध करना = 3 चरण: स्वतुल्य (a ~ a), सममित (उल्टा), संक्रामक (श्रृंखला)। हर चरण में सामान्य अक्षर लो।
Exercise 1.1 · Types of Relations

SOLVED EXAMPLE – Prove an equivalence relation (Ex 1.1 type)

Step 1: R on Z: (a, b) ∈ R if a − b is divisible by 3. Reflexive: a − a = 0, and 0 is divisible by 3.

Step 2: Symmetric: if 3 divides a − b, then 3 divides −(a − b) = b − a.

Why: −k is also an integer.

Step 3: Transitive: add the two differences.

Step 4: All three hold:

Exercise 1.1 · Types of Relations

SOLVED EXAMPLE – Counter-example (Ex 1.1 type)

Step 1: R on R: (a, b) ∈ R if a ≤ b². Reflexive? Try a = ½:

Step 2: So (½, ½) ∉ R:

Why: one counter-example is enough.

Exercise 1.1 · Types of Relations

Exam tip: To show a relation is NOT reflexive/symmetric/transitive, write one actual counter-example with numbers. Writing only “not symmetric” gets no marks.

Exercise 1.1 · Types of Relations

Quick check

A relation R on A is reflexive if:

Practice only – this does not count as a test.

Exercise 1.1 · Types of Relations

Quick check

An equivalence relation is:

Practice only – this does not count as a test.

✓

Topic 4 done!

Log in to save your progress.