Conversion of POSET to Hasse Diagram
Duration: 9 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.
This educational video lecture introduces the concept of Hasse Diagrams as a graphical tool for representing Partial Order Sets (POSETs). The instructor explains that converting partial order relations into this notation simplifies their study. He defines a Hasse diagram as a drawing of the transitive reduction of a finite partially ordered set, named after mathematician Helmut Hasse. The core of the lecture focuses on a four-step algorithm to convert a relation into a Hasse diagram: drawing vertices for set elements, drawing edges for the relation, removing reflexive and transitive edges, and arranging vertices by height without direction. Two detailed examples are worked through to demonstrate the removal of redundant edges and the final vertical arrangement of the diagram.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with the title slide "Conversion of POSET into a Hasse Diagram". The instructor explains that to study Partial order relations further, it is better to convert them into a more convenient notation for easier study. He introduces the "Hasse Diagram" as this graphical representation. The slide text provides a formal definition: "In order theory, a Hasse diagram is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction." He also notes that the diagrams are named after Helmut Hasse (1898-1979), showing a black and white photo of him on the screen. This section sets the theoretical foundation for the practical examples that follow.
2:00 – 5:00 02:00-05:00
The instructor presents a specific problem: "Consider a Partial order relation and convert it into hasse diagram?" The relation is given as $R = \{(1,1), (1,2), (1,4), (1,8), (2,2), (2,4), (2,8), (4,4), (4,8), (8,8)\}$. He lists four specific steps on the left side of the screen: 1. Draw a vertex for each element in the Set. 2. If $(a, b) \in R$ then draw an edge from $a$ to $b$. 3. Remove all Reflexive and Transitive edges. 4. Remove the direction of edges and arrange them in the increasing order of heights. He starts drawing the graph, placing vertices 1, 2, 4, and 8. He draws edges corresponding to the relation, including reflexive loops on each vertex and transitive edges like 1->4 and 1->8, creating a complex web of connections.
5:00 – 8:39 05:00-08:39
The instructor demonstrates the simplification process. He crosses out the reflexive loops (e.g., 1->1) and the transitive edges (e.g., 1->4 is removed because 1->2 and 2->4 exist). He arranges the remaining direct edges vertically: 1 at the bottom, 2 above it, 4 above that, and 8 at the top. He then introduces a second, more complex relation: $R = \{(1,1), (1,2), (1,3), (1,6), (2,2), (2,6), (3,3), (3,6), (6,6)\}$. He draws vertices 1, 2, 3, 6. He draws edges 1->2, 1->3, 1->6, 2->6, 3->6. He removes the reflexive loops and the transitive edge 1->6. The final Hasse diagram is arranged with 1 at the bottom, 2 and 3 in the middle layer, and 6 at the top, forming a diamond shape. He removes the arrowheads to complete the diagram.
The lecture effectively bridges the gap between abstract set theory and visual representation. By defining the Hasse diagram as a transitive reduction, the instructor clarifies why certain edges are removed. The step-by-step algorithm provided (draw vertices, draw edges, remove reflexive/transitive, arrange by height) serves as a reliable method for students. The two examples illustrate different structures: a simple chain (1-2-4-8) and a diamond lattice (1-2/3-6), showing how the method adapts to different partial orders. The final diagrams clearly show the hierarchy of the sets without the clutter of redundant information.

