Adjoint of a Matrix

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/aptitude/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. 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
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  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
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Divisibility Rules, 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, Time and Work, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Speed Mathematics and Basic Mathematics, TCS NQT Advanced Quantitative Ability, Gamified / Game Based Aptitude, Linear Algebra, Trigonometry
  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, Crypt Arithmetic, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability
  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), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Sentence Construction, Active Passive Voice (Voice), Determiner, Facts, Inference and Judgements, Adverb, Interjection, Verb, English Writing Ability
  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.

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…