Irreflexive Relation

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/relations/reflexive-irreflexive-relation-count-and-properties/asset-irreflexive-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.

The video lecture focuses on irreflexive relations in set theory. The instructor defines an irreflexive relation formally, stating that a relation R on a set A is irreflexive if for every element x in A, the pair (x, x) is not in R. He emphasizes this by underlining key components. The lecture transitions to practical application, analyzing a specific set A = {1, 2, 3} and evaluating seven different relations to determine if they are reflexive or irreflexive. The instructor systematically fills out a table, marking 'Y' or 'N' for each property. Finally, the session covers theoretical properties, including identifying the smallest and largest such relations, calculating the total number using the formula $2^{n(n-1)}$, and verifying true/false statements regarding unions, complements, subsets, and inverses.

Chapters

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

    The instructor introduces the definition of an irreflexive relation. The slide displays the text: "Irreflexive relation: - A relation R on a set A is said to be Irreflexive, 1. If $\forall x \in A$, 2. $(x, x) \notin R$". He verbally explains that for a relation to be irreflexive, no element can be related to itself. He uses a red pen to underline specific terms on the slide, including "Irreflexive relation", "relation R", "set A", and the condition "$(x, x) \notin R$". This section establishes the foundational definition required for the subsequent examples. He emphasizes that the condition must hold for *all* x in A.

  2. 2:00 – 4:38 02:00-04:38

    The lecture moves to a problem-solving session. A table appears with the question: "Q consider a set A = {1,2,3}, find which of the following relations are reflexive and Irreflexive?". The instructor evaluates seven relations listed in the table, such as $A \times A$, $\phi$, and specific sets of ordered pairs. He marks 'Y' or 'N' in the Reflexive and Irreflexive columns. For instance, he marks the empty set $\phi$ as Irreflexive (Y) but not Reflexive (N). He then lists properties like "Smallest irreflexive relation is $\phi$" and "Largest irreflexive relation is $(A \times A) - \Delta_A$". He derives the total number of irreflexive relations as $2^{n(n-1)}$ using a table for $A = \{a, b\}$ to show that diagonal elements must be 0. He concludes by marking True/False for statements about unions, complements, and inverses. He specifically underlines "irreflexive relation" in question 6 regarding subsets.

The video provides a comprehensive overview of irreflexive relations, starting from the formal definition where no element relates to itself. It progresses to concrete examples using a set of three elements, demonstrating how to classify relations based on the presence or absence of diagonal pairs. The instructor then generalizes these concepts by discussing the bounds of irreflexive relations (smallest being the empty set, largest being the set minus the diagonal) and deriving the formula for the total count of such relations. The session concludes with a review of algebraic properties, testing the student's understanding of how irreflexivity behaves under operations like union, intersection, and complementation. This structured approach ensures students grasp both the theoretical definition and practical application of irreflexive relations in discrete mathematics.

Loading lesson…