Reflexive Relation
Duration: 7 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a detailed mathematical exploration of relations, specifically focusing on the properties of reflexive relations. It begins by establishing the foundational counting principle: for a set A with n elements, the Cartesian product AxA has n^2 elements, leading to a total of 2^(n*n) possible relations. The instructor then defines a reflexive relation, requiring that every element x in A must be related to itself, denoted as (x, x) being in R. Through a series of examples and a structured table of questions, the lecture demonstrates how to identify reflexive relations on a set like {1, 2, 3}. The session concludes by deriving the formula for the total number of reflexive relations, which is 2^(n^2 - n), and discussing key properties such as the behavior of unions, intersections, and inverses of reflexive relations.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by reviewing the total number of relations possible on a set. He explains that if a set A has n elements, the Cartesian product AxA will contain n^2 elements or pairs. Based on this, he states that the total number of possible relations is 2 raised to the power of n times n. He writes "A x A" and "n^2" on the board to illustrate the set of pairs. He briefly writes "A x B" but crosses it out to emphasize that the discussion is about relations on a single set A. This sets the stage for understanding the vast number of potential relations before narrowing down to specific types.
2:00 – 5:00 02:00-05:00
The focus shifts to the definition of a "Reflexive relation". The instructor writes that a relation R on a set A is reflexive if for all x in A, the pair (x, x) is in R. To visualize this, he uses a 3x3 table for the set A={1, 2, 3}, highlighting the diagonal cells (1,1), (2,2), and (3,3) as the required elements. A table of questions appears, asking students to identify which of the listed relations are reflexive or irreflexive. The instructor marks the first row (AxA) as reflexive with a checkmark and the second row (empty set) as not reflexive with an X. He continues to evaluate the third relation {(1,1), (2,2), (3,3)} as reflexive.
5:00 – 6:59 05:00-06:59
The instructor delves into the properties and counting of reflexive relations. He identifies the smallest reflexive relation as the diagonal set Delta A, containing only {(1,1), (2,2), (3,3)}, and the largest as the full Cartesian product AxA. He derives the formula for the total number of reflexive relations as 2^(n^2 - n), explaining that n elements are fixed on the diagonal, leaving n^2 - n elements to be chosen freely. He addresses true/false questions, confirming that the union and intersection of reflexive relations are reflexive, as are supersets and inverses. A binary table for A={a,b} is shown to visually demonstrate the 16 possible relations and highlight the 4 that are reflexive.
This lecture systematically builds the concept of reflexive relations from basic counting principles to specific properties. It starts by establishing the total space of relations (2^(n^2)) and then narrows the focus to the subset of reflexive relations. The instructor uses visual aids like tables and diagonal markings to make the abstract definition concrete. The derivation of the formula 2^(n^2 - n) is a key takeaway, showing how the fixed diagonal elements reduce the degrees of freedom. Finally, the discussion on properties like union, intersection, and inverses provides a complete algebraic understanding of how reflexive relations behave, preparing students for more complex relation problems.

