Mathematics – BCA 1st Year – Unit 1: Sets, Relations, and Functions

 Of course! Here’s a simpler and more detailed explanation of Unit 1 concepts in Mathematics for BCA. I’ll break each topic down with examples to make it easier to follow.

---

### **Unit 1: Sets, Relations, and Functions**

---

### **1. Sets**

**What is a Set?**

   - A **set** is a group of distinct (unique) objects. You can think of it as a collection of items. Each item in a set is called an **element** or **member**.

   - Sets are usually written with curly braces `{ }`, and each element is separated by a comma.

   **Example:** 

   - If we have a set of numbers, we could write it as:  

     \( A = \{1, 2, 3, 4\} \)  

     Here, 1, 2, 3, and 4 are elements of set \( A \).

#### Types of Sets

1. **Finite Set:** A set with a limited number of elements.

   - *Example:* \( B = \{apple, banana, mango\} \). This set has only three fruits, so it’s finite.

2. **Infinite Set:** A set with an unlimited number of elements.

   - *Example:* \( C = \{1, 2, 3, 4, ...\} \). This set has all positive numbers, and it goes on forever, so it’s infinite.

3. **Empty Set (Null Set):** A set with no elements, represented by `{}` or the symbol `∅`.

   - *Example:* \( D = \{\text{multiples of 5 between 1 and 2}\} \) is empty, because there are no multiples of 5 between 1 and 2.

4. **Subset:** A set \( A \) is a subset of set \( B \) if all elements of \( A \) are also in \( B \).

   - *Example:* If \( A = \{1, 2\} \) and \( B = \{1, 2, 3, 4\} \), then \( A \subseteq B \).

5. **Universal Set:** The set that contains all possible elements for a particular discussion, usually denoted by \( U \).

   - *Example:* If we’re talking about all numbers from 1 to 10, then \( U = \{1, 2, 3, ..., 10\} \) could be the universal set.

#### Set Operations

1. **Union ( \( A \cup B \) ):** Combines all elements in \( A \) and \( B \), without repeating any element.

   - *Example:* If \( A = \{1, 2, 3\} \) and \( B = \{3, 4, 5\} \), then \( A \cup B = \{1, 2, 3, 4, 5\} \).

2. **Intersection ( \( A \cap B \) ):** Finds the elements that are in both \( A \) and \( B \).

   - *Example:* If \( A = \{1, 2, 3\} \) and \( B = \{3, 4, 5\} \), then \( A \cap B = \{3\} \) (only 3 is in both sets).

3. **Difference ( \( A - B \) ):** Finds elements that are in \( A \) but not in \( B \).

   - *Example:* If \( A = \{1, 2, 3\} \) and \( B = \{3, 4, 5\} \), then \( A - B = \{1, 2\} \).

4. **Complement ( \( A' \) ):** Finds all elements that are not in \( A \) but are in the universal set \( U \).

   - *Example:* If \( U = \{1, 2, 3, 4, 5\} \) and \( A = \{1, 2\} \), then \( A' = \{3, 4, 5\} \).

---

### **2. Relations**

**What is a Relation?**

   - A **relation** describes a connection between elements of two sets. We often show a relation using pairs of elements. If an element from set \( A \) is related to an element in set \( B \), we can write it as \( (a, b) \).

   **Example:** 

   - Suppose \( A = \{1, 2\} \) and \( B = \{3, 4\} \).

   - A relation \( R \) from \( A \) to \( B \) could be: \( R = \{(1, 3), (2, 4)\} \).

#### Types of Relations

1. **Reflexive Relation:** Every element is related to itself.

   - *Example:* In a set \( A = \{1, 2, 3\} \), a relation \( R \) is reflexive if \( (1, 1), (2, 2), (3, 3) \in R \).

2. **Symmetric Relation:** If \( (a, b) \in R \), then \( (b, a) \in R \) as well.

   - *Example:* If \( R = \{(1, 2), (2, 1)\} \), then \( R \) is symmetric because if 1 is related to 2, then 2 is related to 1.

3. **Transitive Relation:** If \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \in R \) must also be in \( R \).

   - *Example:* If \( R = \{(1, 2), (2, 3), (1, 3)\} \), then \( R \) is transitive.

4. **Equivalence Relation:** A relation that is reflexive, symmetric, and transitive.

   - *Example:* \( R = \{(1, 1), (2, 2), (3, 3)\} \) on set \( A = \{1, 2, 3\} \) is an equivalence relation.

---

### **3. Functions**

**What is a Function?**

   - A **function** is a rule that assigns each element in one set (the **domain**) to exactly one element in another set (the **codomain**). In simpler terms, a function links inputs to exactly one output.

   **Example:**  

   - If we have a function \( f(x) = x + 2 \), it takes an input \( x \), adds 2 to it, and gives an output. So:

     - \( f(2) = 4 \), \( f(3) = 5 \), etc.

#### Types of Functions

1. **One-to-One (Injective) Function:** Each input has a unique output.

   - *Example:* \( f(x) = 2x \) is one-to-one, because each input gives a different output.

2. **Onto (Surjective) Function:** Every element in the codomain has at least one input mapping to it.

   - *Example:* If \( g(x) = x - 1 \) and the codomain includes all real numbers, then every possible output has a corresponding input, so it’s onto.

3. **Bijective Function:** A function that is both one-to-one and onto.

   - *Example:* \( h(x) = x + 1 \) on the real numbers is a bijective function, since every input has a unique output, and every output can be reached by some input.

4. **Constant Function:** Every input maps to the same output.

   - *Example:* \( f(x) = 5 \) for all \( x \) means every input goes to 5.

#### Important Terms in Functions

1. **Domain:** All possible input values of a function.

2. **Codomain:** The set where all possible outputs live (not necessarily all are reached).

3. **Range:** The actual outputs the function can produce.

---

### **Summary of Key Concepts:**

   - **Sets** are collections of distinct items with operations like union, intersection, and difference.

   - **Relations** describe how elements from one set relate to elements in another, with types such as reflexive, symmetric, and transitive.

   - **Functions** link each input to exactly one output, and can be one-to-one, onto, bijective, or constant. 

---

By breaking down these basic concepts and using examples, these notes should give you a solid understanding of sets, relations, and functions!