Symmetric Relation

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/discrete-mathematics/relations/symmetric-anti-symmetric-asymmetric-relation-and-properties/asset-symmetric-relation after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive lecture on symmetric relations within the context of discrete mathematics. The instructor begins by formally defining a symmetric relation: a relation R on a set A is symmetric if for every pair (a, b) in R, the pair (b, a) is also in R. He uses a visual 3x3 matrix to demonstrate this concept, showing how elements must be mirrored across the main diagonal. The lecture then transitions to a practical application where the instructor evaluates a series of specific relations on the set A = {1, 2, 3} to determine their symmetry properties. He systematically fills out a table, marking relations as symmetric or not based on the definition. Finally, the instructor derives the formula for the total number of symmetric relations on a set of size n, which is $2^{n(n+1)/2}$, and discusses related properties involving inverses, unions, intersections, and complements.

Chapters

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

    The instructor introduces the definition of a symmetric relation, stating that if (a, b) is in R, then (b, a) must also be in R. He draws a 3x3 grid representing a set A = {1, 2, 3} to visualize the concept. He explains that for a relation to be symmetric, the matrix representation must be symmetric across the main diagonal. He circles pairs like (1, 2) and (2, 1) to illustrate that if one exists, the other must exist. He also highlights diagonal elements like (1, 1), (2, 2), and (3, 3), noting that they are their own reverses and do not require a pair. This visual aid helps clarify the condition for symmetry. He emphasizes that the condition applies to all elements in the set A. He uses red ink to draw the matrix and circle the elements, making the visual distinction clear for the students.

  2. 2:00 – 5:00 02:00-05:00

    The lecture moves to a problem-solving session using a table with the set A = {1, 2, 3}. The instructor evaluates seven different relations to check for symmetry. He marks the Cartesian product AxA as symmetric because it contains all possible pairs. The empty set is also marked symmetric. He evaluates specific sets like {(1,1), (2,2), (3,3)} as symmetric. Conversely, he marks {(1,2), (2,3), (1,3)} as not symmetric because the reverse pairs are missing. He derives the formula for the total number of symmetric relations, explaining that diagonal elements can be chosen in $2^n$ ways and off-diagonal pairs in $2^{(n^2-n)/2}$ ways, leading to the total $2^{n(n+1)/2}$. He writes this formula on the board and explains the logic behind the exponent. He also discusses the specific case of n=2 to verify the formula.

  3. 5:00 – 8:30 05:00-08:30

    The instructor completes the analysis of the relations in the table, marking the remaining entries. He summarizes key facts: the smallest symmetric relation is the empty set, and the largest is the Cartesian product AxA. He then addresses theoretical properties. He confirms that if a relation R is symmetric, then $R = R^{-1}$. He validates that the union and intersection of two symmetric relations are always symmetric. However, he refutes the idea that supersets or subsets of a symmetric relation are always symmetric, marking it as false. Finally, he confirms that the complement of a symmetric relation is always symmetric, using a 2x2 example to reinforce the counting logic. He writes True and False next to the statements to clarify the properties. He ensures students understand that while operations like union preserve symmetry, inclusion does not.

The video effectively bridges the gap between the abstract definition of symmetric relations and their practical identification and counting. By starting with a clear definition and a visual matrix representation, the instructor establishes a strong conceptual foundation. The progression to a tabular analysis of specific examples allows students to apply the definition directly, distinguishing between symmetric and non-symmetric cases. The derivation of the counting formula $2^{n(n+1)/2}$ is a crucial takeaway, providing a method to calculate the total number of such relations for any set size. The final section on properties, such as the behavior of unions, intersections, and complements, rounds out the topic by connecting symmetric relations to broader set theory concepts. This structured approach ensures students understand not just what a symmetric relation is, but how to identify it, count it, and manipulate it within mathematical proofs. The use of specific examples like A={1,2,3} and A={a,b} makes the abstract concepts concrete and easier to grasp for exam preparation.

Loading lesson…