SubGroup

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/engineering-maths/group-theory/subgroup-definition-examples-and-verification-techniques/asset-subgroup 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 lecture begins with a theoretical overview of subgroups in abstract algebra, presented on a slide titled 'Sub Group'. The instructor outlines six key properties, defining a subgroup as a subset that is also a group, emphasizing that the identity element remains the same. He distinguishes between unions and intersections of subgroups and introduces Lagrange's theorem, which states that the order of a subgroup must exactly divide the order of the parent group. The second half of the video transitions to a practical application, solving a multiple-choice problem involving the group G = {1, 3, 5, 7} under multiplication modulo 8. The instructor systematically evaluates potential subsets to determine which one fails to form a subgroup, utilizing Cayley tables to check for closure and applying Lagrange's theorem as a verification method.

Chapters

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

    The video opens with a static slide listing six fundamental points about subgroups. The instructor reads through them, underlining key terms like 'subset', 'sub group', and 'always same' to emphasize that the identity element is invariant. He specifically highlights point 6, 'Lagrange's theorem', noting that the order of a group is always exactly divisible by the order of a subgroup. He also clarifies that while the intersection of two subgroups is always a subgroup, the union may not be. This section establishes the theoretical framework necessary for the subsequent problem-solving session.

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

    The instructor presents a question asking to identify which subset of G = {1, 3, 5, 7} under operation *8 is not a subgroup. He analyzes five options: {0, 1}, {1, 3}, {1, 5}, {1, 7}, and {1, 3, 7}. He draws Cayley tables for each subset to check closure. For {1, 3}, he shows 3*3=1, confirming it is a subgroup. Similarly, {1, 5} and {1, 7} are verified as subgroups. However, for {1, 3, 7}, he calculates 3*7=21, which is 5 modulo 8. Since 5 is not in the subset, closure fails. He also applies Lagrange's theorem, noting that the order of G is 4, and the order of {1, 3, 7} is 3, which does not divide 4. He marks {0, 1} as invalid because 0 is not in G. He writes O(G)/O(S) = 4/2 = 2 for valid subgroups and 4/3 for the invalid one to show non-integer division.

The lesson effectively bridges abstract definitions with concrete calculation. By first establishing the rules of subgroups and Lagrange's theorem, the instructor provides the tools needed to solve the problem. The use of Cayley tables offers a visual proof of closure, while the order check provides a quicker theoretical validation. This dual approach reinforces the concept that a subset must satisfy all group axioms, including closure and the divisibility condition of Lagrange's theorem, to be considered a valid subgroup.

Loading lesson…