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

About Course: About the Course
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
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
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
AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
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
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
Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
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
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
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
Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
Live Classes: ISRO Live classes
Full Mock Test:

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.