Properties of Adjoint, Inverse & Determinants
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- 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
- 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
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- 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
- 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
- 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
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This video lecture focuses on the properties of adjoint and inverse matrices within the context of linear algebra. The instructor begins by listing fundamental properties on a whiteboard, including the relationship between the determinant of a matrix and its inverse. He then provides a step-by-step derivation for the determinant of the adjoint matrix, utilizing scalar multiplication rules. The lesson concludes by cataloging additional properties involving matrix products, powers, scalar multiplication, and transposes, supported by a 2x2 matrix example.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with a title card 'LINEAR ALGEBRA' and a 2x2 determinant formula. The scene shifts to a whiteboard titled 'PROPERTIES OF ADJOINT & INVERSE'. The instructor introduces the first property: $|A^{-1}| = rac{1}{|A|} = |A|^{-1}$, illustrating it with the example $1/2 = 2^{-1}$. He then states that for a singular matrix where $|A|=0$, the inverse $A^{-1}$ does not exist, marking this with a check. He introduces the third property: $|adj(A)| = |A|^{n-1}$ for an $n imes n$ matrix. He extends this to iterated adjoints, writing $|adj(adj(A))| = |A|^{(n-1)^2}$ and $|adj(adj(adj(A)))| = |A|^{(n-1)^3}$. He points to the first property formula while explaining. He also circles the term $|A|$ in the denominator.
2:00 – 5:00 02:00-05:00
The instructor moves to a derivation on the left side of the board to prove $|adj(A)| = |A|^{n-1}$. He starts with the definition $A^{-1} = rac{adj(A)}{|A|}$ and rearranges it to $|A|A^{-1} = adj(A)$. Taking the determinant of both sides gives $||A|A^{-1}| = |adj(A)|$. He applies the scalar multiplication property $|kA| = k^n|A|$, where $k=|A|$, resulting in $|A|^n |A^{-1}| = |adj(A)|$. Substituting $|A^{-1}| = 1/|A|$, he simplifies the left side to $|A|^n \cdot rac{1}{|A|} = |A|^{n-1}$, confirming the property. On the right side, he derives the formula for the determinant of the adjoint of the adjoint. Letting $adj(A) = B$, he uses the property $|adj(B)| = |B|^{n-1}$. Substituting back, he gets $|adj(adj(A))| = |adj(A)|^{n-1}$. Finally, substituting the previous result, he arrives at $|adj(adj(A))| = (|A|^{n-1})^{n-1} = |A|^{(n-1)^2}$. He notes that similarly, the triple adjoint yields $|A|^{(n-1)^3}$. He writes 'Similarly' to indicate the pattern continues.
5:00 – 8:15 05:00-08:15
The final section lists additional properties of determinants and adjoints. Property 4 states $|AB| = |A||B|$, and Property 5 states $|A^k| = |A|^k$. He lists Property 6 as $adj(0) = 0$ (zero matrix) and Property 7 as $adj(I) = I$. Property 8 is $adj(kA) = k^{n-1} adj(A)$, and Property 9 is $adj(A^T) = (adj(A))^T$. On the right side, he displays a 2x2 matrix example $A = egin{bmatrix} a & b \ c & d \end{bmatrix}$, showing its adjoint $adj(A) = egin{bmatrix} d & -b \ -c & a \end{bmatrix}$ and inverse $A^{-1} = rac{1}{ad-bc} egin{bmatrix} d & -b \ -c & a \end{bmatrix}$. He points to the formula $|AB| = |A||B|$ and the scalar multiplication property $adj(kA) = k^{n-1} adj(A)$ while explaining. The video concludes with these fundamental properties written on the board. He also circles 'mxn matrix' in the previous section.
The lecture systematically builds understanding of matrix properties, starting with the relationship between a matrix and its inverse determinant. It then rigorously derives the determinant of the adjoint matrix using scalar multiplication rules. The lesson concludes by cataloging essential properties for products, powers, and transposes, providing a comprehensive reference for solving linear algebra problems involving determinants and adjoints.