Complement of a Relation

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/discrete-mathematics/relations/cartesian-product-relation-inverse-complement/asset-complement-of-a-relation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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 Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the mathematical concept of the complement of a relation within set theory. The instructor defines the complement of a relation R from set A to set B. He explains that the complement, denoted as R', R^c, or R_bar, consists of all ordered pairs present in the Cartesian product A×B that are not present in the original relation R. The lecture transitions into a practical example. By subtracting the elements of R from the total Cartesian product, the instructor demonstrates how to find the complement R'. Finally, the video concludes by establishing two fundamental properties: the union of a relation and its complement equals the universal set (A×B), and their intersection results in an empty set.

Chapters

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

    In this segment, the instructor introduces the definition of the complement of a relation. The slide displays the text "Complement of a relation: - Let R be a relation from A to B, then the complement of relation will be denoted by R', R^c or R_bar." He explains the set builder notation and the set difference formula. Visually, he underlines key terms like "Complement of a relation" in red. He also writes the alternative notations R', R^c, and R_bar in red ink on the right side. He emphasizes the condition (a, b) ∉ R by underlining it, clarifying that the complement contains pairs not in R. He further underlines (A×B) in the subtraction formula to highlight the universal set for the relation.

  2. 2:00 – 2:39 02:00-02:39

    The instructor moves to a worked example. The slide shows A×B = {(a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3)} and R = {(a, 1), (a, 3), (b, 2)}. He crosses out elements of R within A×B to identify the complement. He writes the result R' = {(a, 2), (b, 1), (b, 3)}. Following the example, he introduces two properties: R U R' = and R ∩ R' =. He writes the answers in red ink, stating that the union R U R' equals A×B and the intersection R ∩ R' equals the empty set symbol Φ.

The lesson systematically builds understanding from definition to application. It starts with the formal definition of the complement of a relation using set notation and set difference. The instructor clarifies that the complement is essentially the "rest" of the Cartesian product after removing the relation itself. This theoretical foundation is immediately reinforced with a numerical example where specific ordered pairs are listed, and the complement is derived by exclusion. The lecture concludes by solidifying the relationship through set operations. These final properties confirm that the relation and its complement are disjoint and their union covers the entire domain of possible pairs, ensuring a complete partition of the set.

Loading lesson…