Inverse of a Relation

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/relations/cartesian-product-relation-inverse-complement/asset-inverse-of-a-relation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video segment focuses on the mathematical concept of the inverse of a relation within set theory. The instructor, Sanchit Jain Sir, defines the inverse of a relation R from set A to set B. The text states the inverse relation, denoted as R^-1, is a relation from B to A. The definition is R^-1 = {(b, a) | (a, b) ∈ R}, indicating swapped element order. The lecture transitions to a concrete example. The Cartesian product A×B is listed with six elements involving 'a', 'b' and numbers 1, 2, 3. A specific relation R is defined as a subset: R = {(a, 1), (a, 3), (b, 2)}. The instructor derives the inverse relation R^-1 by reversing the ordered pairs from R. He writes out the resulting set R^-1 = {(1, a), (3, a), (2, b)}. Finally, he establishes a property regarding cardinality, writing |R| = |R^-1|, demonstrating that the number of elements remains constant.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the definition of the inverse of a relation, R^-1, mapping from set B back to set A. He displays the formula R^-1 = {(b, a) | (a, b) ∈ R} and underlines key phrases like "from A to B" and "from B to A" to emphasize direction change. He sets up an example using the Cartesian product A×B = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)} and a specific relation R = {(a, 1), (a, 3), (b, 2)}. He calculates the inverse by swapping elements in the ordered pairs of R, writing R^-1 = {(1, a), (3, a), (2, b)} on the screen. He underlines the elements of R to show which ones are being transformed.

  2. 2:00 – 2:09 02:00-02:09

    The instructor concludes the derivation of the inverse relation. He writes the cardinality comparison |R| = |R^-1| to show that the number of elements in the original relation equals the number of elements in the inverse relation. The final screen displays the completed set R^-1 = {(1, a), (3, a), (2, b)} alongside the instructor's branding, reinforcing the lesson's conclusion. He gestures to emphasize the equality of the sets' sizes.

The video provides a clear, step-by-step introduction to finding the inverse of a relation. It starts with the theoretical definition, emphasizing the reversal of domain and codomain. It then solidifies understanding through a worked example where specific ordered pairs are swapped. The lesson concludes by highlighting a fundamental property: the cardinality of a relation and its inverse are identical. This progression from definition to application to property verification offers a complete micro-lesson on the topic.

Loading lesson…