Sets Relations Functions Questions for AGNIVEER VAYU

Sets and Set Operations

A set is a well-defined collection of distinct objects. In Agniveer Vayu, you'll work with union, intersection, complement, and difference. The key is understanding Venn diagrams and De Morgan's Laws, which flip operations when negating. Think of sets like military units: union combines all soldiers, intersection finds those in both units, and complement finds those NOT in a unit.

• Union (A ∪ B): all elements in A or B or both
• Intersection (A ∩ B): only elements in both A and B
• Complement (A'): all elements NOT in A (within universal set U)
• Difference (A - B): elements in A but not in B
• De Morgan's Laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'
• Cardinality |A|: count of elements; for finite sets, |A ∪ B| = |A| + |B| - |A ∩ B|

Relations and Their Properties

A relation is a connection between elements of two sets (or a set with itself). Relations have properties: reflexive (every element relates to itself), symmetric (if a relates to b, then b relates to a), and transitive (if a relates to b and b relates to c, then a relates to c). An equivalence relation has all three properties—it partitions a set into equivalence classes. This is heavily tested in Agniveer Vayu because it combines logical thinking with pattern recognition.

• Reflexive: (a, a) in R for all a in the set. Example: 'equal to' relation
• Symmetric: if (a, b) in R, then (b, a) in R. Example: 'is sibling of'
• Transitive: if (a, b) and (b, c) in R, then (a, c) in R. Example: 'less than or equal to'
• Equivalence Relation: reflexive AND symmetric AND transitive. Creates partitions
• Partial Order: reflexive AND antisymmetric AND transitive. Example: subset relation
• Check each property independently—don't assume one implies another

Functions and Function Types

A function f: A → B assigns each element of A (domain) to exactly one element of B (codomain). Key types: injective (one-one: different inputs give different outputs), surjective (onto: every element of B is mapped to), and bijective (both injective and surjective—one-to-one correspondence). Agniveer Vayu tests whether you can identify function types from equations or mappings, and compute composite functions.

• Injective (One-one): if f(a) = f(b) then a = b. No two inputs map to same output
• Surjective (Onto): for every b in B, there exists a in A such that f(a) = b. Every codomain element is used
• Bijective: both injective and surjective. Allows inverse function to exist
• Domain: set of all valid inputs. Range: set of all actual outputs (subset of codomain)
• Composite function (f ∘ g)(x) = f(g(x)): apply g first, then f
• Inverse function f^(-1) exists only if f is bijective

Equivalence Classes and Partitions

When a relation is equivalence, it divides the set into non-overlapping groups called equivalence classes. Each class contains all elements related to each other. For example, 'congruence modulo 3' on integers creates three classes: {0, 3, 6, ...}, {1, 4, 7, ...}, {2, 5, 8, ...}. Agniveer Vayu often asks to identify or count equivalence classes. The key insight: equivalence classes partition the set completely—every element belongs to exactly one class.

• Equivalence class [a] = {x in set : x is related to a}
• Two equivalence classes are either identical or disjoint (no overlap)
• Union of all equivalence classes equals the entire set
• Number of equivalence classes depends on the relation definition
• Partition: a collection of non-empty, disjoint subsets whose union is the whole set

• Confusing 'onto' (surjective) with 'one-one' (injective). Remember: onto means every output is used; one-one means no two inputs share an output.
• Forgetting that a relation can be reflexive but not symmetric, or symmetric but not transitive. Check each property independently—they don't imply each other.
• Miscounting in set operations. Always use |A ∪ B| = |A| + |B| - |A ∩ B|, not just |A| + |B|. The intersection is subtracted to avoid double-counting.
• Assuming domain and codomain are the same. Domain is the input set; codomain is the target set. Range (actual outputs) is a subset of codomain.
• Making errors in composite functions. (f ∘ g)(x) means apply g first, then f. Writing it backwards is a frequent trap.

• RST for Equivalence: Reflexive, Symmetric, Transitive—if a relation has all three, it's equivalence.
• IOB for Function Types: Injective (one-one), Onto (surjective), Bijective (both). Bijective = has inverse.
• DUCO for Set Operations: De Morgan's Union = Complement Opposite (A ∪ B)' = A' ∩ B'.
• Inner-Outer for Composition: (f ∘ g)(x)—g is inner (apply first), f is outer (apply second).

• Agniveer Vayu typically includes 1-2 questions on identifying relation properties from a given set and relation definition. Practice recognizing reflexive/symmetric/transitive quickly by checking small examples.
• Function type identification (injective/surjective/bijective) appears in 1-2 questions. Often given as f(x) = expression; you must determine type. Sketch or test with examples if unsure.
• Composite functions and domain/range are tested together. A recent pattern: 'If f(x) = sqrt(x) and g(x) = x-1, find domain of (f ∘ g)(x).' Requires careful order of operations.
• Set operations with cardinality (inclusion-exclusion) appear in 1 question. Usually involves 2-3 sets and Venn diagram logic. Draw the diagram to avoid errors.
• Equivalence classes and partitions are less frequent but high-value. If asked, count carefully and verify that classes partition the set completely.