Adjoint of a Matrix

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/engineering-mathematics/linear-algebra/adjoint-and-inverse-of-a-matrix/asset-adjoint-of-a-matrix after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. 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
  3. 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
  4. 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
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. 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
  8. 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
  9. 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
  10. 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
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. 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
  13. 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
  14. 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
  15. 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
  16. 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
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This linear algebra lecture focuses on the Adjoint and Inverse of a matrix, specifically deriving the formula for the inverse using the adjoint. The instructor defines the adjoint as the transpose of the cofactor matrix ($Adj(A) = C^T$) and establishes the fundamental property $A \cdot adj(A) = |A| \cdot I$. Through algebraic manipulation, he derives the inverse formula $A^{-1} = rac{adj(A)}{|A|}$. The lecture concludes by explaining that if the determinant $|A|$ is zero, the matrix is singular and the inverse is undefined, marking a critical condition for matrix invertibility.

Chapters

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

    The video opens with a title card and a visual of a 2x2 determinant formula ($ab - cd$). The instructor introduces the topic "ADJOINT/ADJUGATE/ADJUNCT" and writes the definition $Adj(A) = C^T$, clarifying that the adjoint is the transpose of the cofactor matrix. He then writes the first major property on the board: $A \cdot adj(A) = |A| \cdot I$. The text "Adjoint is the transpose of cofactor matrix" appears in brackets next to the formula.

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

    The instructor derives the inverse formula by manipulating the property $A \cdot adj(A) = |A| \cdot I$. He divides the equation by the scalar determinant $|A|$ to get $A \cdot rac{adj(A)}{|A|} = I$. By comparing this to the definition $A \cdot A^{-1} = I$, he boxes the final formula $A^{-1} = rac{adj(A)}{|A|}$. The board also displays "also $A \cdot A^{-1} = I$" to show the comparison. He emphasizes that if $|A| = 0$, the inverse is not defined, writing "If $|A| = 0$, then $A^{-1}$ is not defined" on the board.

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

    The instructor re-derives the steps on the right side of the board to reinforce the logic, writing $A \cdot rac{1}{|A|} adj(A) = I$. He discusses scalar multiplication properties like $x(M_1 M_2)$ to justify the algebraic steps involving the scalar $1/|A|$. The text "Singular" is written next to the condition $|A| = 0$ and the inverse symbol is crossed out to indicate non-existence. He also writes "If $|A| = 0$, then $A$ is not invertible" to reinforce the concept. Finally, he summarizes the dimensional relationship: $A_{n imes n} o adj(A) o C^T$, showing how the matrix transforms into its adjoint.

The lecture provides a complete derivation of the matrix inverse using the adjoint method. It connects the definition of the adjoint to the fundamental identity involving the determinant, leading to the standard inverse formula. The key distinction made is between invertible matrices (where $|A| eq 0$) and singular matrices (where $|A| = 0$), ensuring students understand the limitations of the inverse operation and the conditions required for a matrix to be invertible. The instructor uses clear board work to show the step-by-step algebraic division.

Loading lesson…