Adjoint of a Matrix

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/general-aptitude-reasoning/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. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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 Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. 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, Database Recovery, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. 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…