Revision Notes — Matrices 1. The Fundamentals: Definition and Structure In NCERT Mathematics, a matrix is far more than a simple list of numbers; it is a strategic ordered rectangular array used to organize complex data and simplify the solution of linear systems. By transforming information into this structure, we enable powerful algebraic manipulations that are essential in science, economics, and cryptography. NCERT Definition 1: A matrix is an ordered rectangular array of numbers or functions. These are called the elements or entries of the matrix. Data Representation (The Radha Example): Data can be arranged in multiple ways. Suppose Radha has 15 notebooks and 6 pens, Fauzia has 10 notebooks and 2 pens, and Simran has 13 notebooks and 5 pens. We can represent this as: Arrangement 1 (3 x 2 Matrix): People as rows, items as columns. [15 6] [10 2] [13 5] Arrangement 2 (2 x 3 Matrix): Items as rows, people as columns. [15 10 13] [6 2 5] Order of a Matrix: A matrix with m rows and n columns is of order m x n. We denote a general matrix as A = [aᵢⱼ]ₘₓₙ. A 3 x 2 matrix is structured as: [a₁₁ a₁₂] [a₂₁ a₂₂] [a₃₁ a₃₂] The (i, j) Index: This coordinate system is the bedrock of matrix algebra. The index i represents the row position, and j represents the column position. This "addressing system" allows for precise element-wise operations. -------------------------------------------------------------------------------- 2. Classification: Types of Matrices Identifying the "species" of a matrix is your first diagnostic step. In the hierarchy of matrices, the Square Matrix acts as the "parent" species for several others; if a matrix is not square, it cannot be a Diagonal, Scalar, or Identity matrix. The primary types defined by NCERT are: • Column Matrix: Has exactly one column. Notation: A = [aᵢⱼ]ₘₓ₁. • Row Matrix: Has exactly one row. Notation: B = [bᵢⱼ]₁ₓₙ. • Square Matrix: Prerequisite for diagonal properties. Number of rows equals number of columns (m = n). Elements a₁₁, a₂₂, ..., aₙₙ form the Diagonal. • Diagonal Matrix: A square matrix where all elements outside the diagonal are zero (bᵢⱼ = 0 when i ≠ j). • Scalar Matrix: A diagonal matrix where all diagonal elements are equal to a constant k (bᵢⱼ = k when i = j). • Identity Matrix (Iₙ): A square matrix where diagonal elements are 1 and all others are 0. Piecewise notation: aᵢⱼ = { 1 if i = j; 0 if i ≠ j } • Zero Matrix (O): A matrix of any order where all elements are 0. The "So What?" Layer: While all Identity matrices are Scalar matrices (where k = 1), the reverse is not true. This classification determines which matrices can be added or multiplied. -------------------------------------------------------------------------------- 3. Conditions of Equality Matrix Equality is a strategic tool used to solve for unknown variables (x, y, z) by converting a single matrix statement into multiple algebraic equations. Two matrices A = [aᵢⱼ] and B = [bᵢⱼ] are equal (A = B) if and only if: 1. They have the same order. 2. Each element aᵢⱼ equals the corresponding element bᵢⱼ. Method Blueprint for Equality: • [Setup]: Compare the orders of A and B. If they differ, stop; equality is impossible. • [Apply]: Create individual linear equations by equating the values at each (i, j) position. • [Transform]: Solve the resulting system of equations for the required variables. • [Conclude]: State the final values clearly (e.g., x = 2, y = -3). -------------------------------------------------------------------------------- 4. Matrix Operations I: Addition and Scalar Multiplication Arithmetic operations allow us to scale or combine datasets, such as finding the total production of multiple factories. Addition of Matrices Check Condition: Addition is defined ONLY if both matrices have the same order. • Properties: o Commutative: A + B = B + A o Associative: (A + B) + C = A + (B + C) o Additive Identity: A + O = A o Additive Inverse: A + (-A) = O Scalar Multiplication (k) Multiplying a matrix A by a scalar k results in every single element being multiplied by k (kA = [k aᵢⱼ]). Common Pitfall: Many students mistakenly multiply only the first row or column by the scalar. Exam Tip: Scalar multiplication is "all-inclusive." You must transform every single entry in the matrix. -------------------------------------------------------------------------------- 5. Matrix Operations II: Matrix Multiplication Multiplication is not element-wise; it is a complex "Across the row, Down the column" interaction. CRITICAL CONDITION CHECK: The product AB exists ONLY if the number of columns in A equals the number of rows in B. (m x n) x (n x p) → (m x p) Method Blueprint for Multiplication: • [Setup]: Write the orders of A and B side-by-side. Circle the "inner" numbers. If they match (n = n), proceed. • [Apply]: To find element cᵢₖ, multiply the i-th row of A by the k-th column of B element- wise. • [Transform]: Sum these products using the summation notation: cᵢₖ = Σⱼ₌₁ⁿ aᵢⱼbⱼₖ. • [Conclude]: Fill the resulting matrix of order m x p. Departure from Real Algebra: 1. Non-commutativity: In general, AB ≠ BA. The order of factors is vital. 2. Zero Product Nuance: In real numbers, ab = 0 means a or b must be zero. In matrices, the product AB can be a zero matrix even if neither A nor B is a zero matrix. Properties: (AB)C = A(BC); A(B + C) = AB + AC; IA = AI = A. -------------------------------------------------------------------------------- 6. Transpose, Symmetric, and Skew Symmetric Matrices Reflecting a matrix across its diagonal reveals its internal symmetry. Transpose (Aᵀ): Obtained by interchanging rows and columns. If A = [aᵢⱼ]ₘₓₙ, then Aᵀ = [aⱼᵢ]ₙₓₘ. Symmetric Matrix: A square matrix where Aᵀ = A (i.e., aᵢⱼ = aⱼᵢ). Skew Symmetric Matrix: A square matrix where Aᵀ = -A (i.e., aᵢⱼ = -aⱼᵢ). • Crucial Property: In a skew symmetric matrix, all diagonal elements must be zero (aᵢᵢ = 0). Relationship Theorem: Any square matrix A can be expressed as the sum of a symmetric and a skew symmetric matrix: A = 1/2(A + Aᵀ) + 1/2(A - Aᵀ) -------------------------------------------------------------------------------- 7. Invertible Matrices In matrix algebra, "division" is performed via the inverse. Definition: If A and B are square matrices of order n such that AB = BA = I, then B is the inverse of A (A⁻¹). Uniqueness Theorem: The inverse of a square matrix, if it exists, is unique. The "Socks-and-Shoes" Property: Just as you put on socks then shoes, but take off shoes then socks, the inverse of a product reverses the order: (AB)⁻¹ = B⁻¹A⁻¹ Final Exam Tip: To ensure "Full Marks" accuracy, always begin by checking the matrix order and the specific existence conditions before performing any calculation. Precision in the setup prevents errors in the result! UNIT 3: MATRICES — NCERT KEY SHEET 1. Topic 1: Introduction Matrices serve as a sophisticated mathematical framework designed to streamline the management of complex linear systems. This tool simplifies mathematical work significantly when compared to straightforward algebraic methods. Originally developed as a compact way to solve systems of linear equations, the utility of matrices has expanded into modern fields such as business budgeting, scientific data analysis, and cryptography. By organizing data into structured arrays, professionals can perform large-scale operations—such as cost estimation or sales projections—with far greater efficiency than traditional methods allow. 1.2. Standard Results & Key Facts • Historical Evolution: The concept of matrices emerged from the necessity to obtain compact and simple methods for solving systems of linear equations (NCERT Page 34). • Modern Utility: Matrices are the backbone of electronic spreadsheet programs, utilized in diverse areas including genetics, economics, sociology, and industrial management (NCERT Page 34). • Physical Representations: In physics and geometry, matrices represent operations such as magnification, rotation, and reflection through a plane (NCERT Page 34). As we transition from these broad applications to formal study, we begin by defining the structural boundaries and internal organization of the matrix. -------------------------------------------------------------------------------- 2. Topic 2: Matrix (Definition, Order, and Representation) To facilitate mathematical manipulation, information is organized into a specific rectangular structure. This organization allows us to identify and access individual data points through a standardized coordinate-like system of rows and columns. 2.2. Definitions • Matrix: An ordered rectangular array of numbers or functions (NCERT Page 36). • Elements/Entries: The individual numbers or functions that constitute the matrix (NCERT Page 36). 2.3. Formulas & Identities • General Representation: A matrix A is represented as A = [aᵢⱼ]ₘₓₙ. • Element Location: The notation aᵢⱼ refers to the element lying in the iᵗʰ row and jᵗʰ column (the (i, j)ᵗʰ element). • Total Elements: For a matrix of order m × n, the total number of elements is the product mn (NCERT Page 36). • Array Structure: [ a₁₁ a₁₂ ... a₁ₙ ] [ a₂₁ a₂₂ ... a₂ₙ ] [ ... ... ... ... ] [ aₘ₁ aₘ₂ ... aₘₙ ] 2.4. Notation Conventions Matrices are denoted by capital letters (A, B, C). The indices i and j follow the constraints: 1 ≤ i ≤ m and 1 ≤ j ≤ n, where i, j ∈ N (where N is the set of natural numbers) (NCERT Page 36). 2.5. Quick Reference: Geometric Representation Matrices represent coordinates and shapes in a 2D plane (NCERT Page 37). Using coordinates A(1, 0), B(3, 2), C(1, 3), D(–1, 2): Matrix Representation (Column Geometric Entity Matrix Representation (Row Form) Form) Point (x, y) [ x ]
[ y ] [ x, y ] Vertex P(0, 1) [ 0 ]
[ 1 ] [ 0, 1 ] [ 1 0 ]
[ 3 2 ]
[ 1 3 ]
[-1 2 Quadrilateral ABCD [ 1 3 1 -1 ]
[ 0 2 3 2 ] ] 2.6. Structural Capacity The order of a matrix (m × n) defines its dimensions and capacity. It determines exactly how many rows (m) and columns (n) the structure contains, which is fundamental to determining if algebraic operations are valid. -------------------------------------------------------------------------------- 3. Topic 3: Types of Matrices Classifying matrices is essential because certain mathematical properties and theorems apply only to specific structural arrangements. 3.2. Definitions • Column Matrix: Has only one column; order m × 1 (NCERT Page 39). • Row Matrix: Has only one row; order 1 × n (NCERT Page 39). • Square Matrix: Number of rows equals number of columns (m = n) (NCERT Page 39). • Diagonal Matrix: A square matrix where all non-diagonal elements are zero (bᵢⱼ = 0 when i ≠ j) (NCERT Page 40). • Scalar Matrix: A diagonal matrix where all diagonal elements are equal (bᵢⱼ = k when i = j) (NCERT Page 40). • Identity Matrix: A square matrix where diagonal elements are 1 and all others are 0 (NCERT Page 40). • Zero Matrix: All elements are zero. Denoted by O (NCERT Page 41). 3.3. Theorems & Properties • Diagonal Elements: In a square matrix A = [aᵢⱼ], the elements a₁₁, a₂₂, ..., aₙₙ constitute the principal diagonal (NCERT Page 39). • Equality of Matrices: Two matrices A and B are equal (A = B) if they are of the same order and every corresponding element is identical (aᵢⱼ = bᵢⱼ for all i, j) (NCERT Page 41). 3.4. Matrix Classification Table Type Structural Condition Example (Order 2x2) Square m = n [ 3 1 ]
[ 4 2 ] Diagonal aᵢⱼ = 0 for i ≠ j [ 2 0 ]
[ 0 5 ] Scalar Diagonal elements equal [ 3 0 ]
[ 0 3 ] Identity Diagonal elements are 1 [ 1 0 ]
[ 0 1 ] 3.5. Structural Differentiation Diagonal, Scalar, and Identity matrices are nested constraints. A Diagonal matrix requires non-diagonal elements to be zero. A Scalar matrix adds the constraint that all diagonal elements must be equal. An Identity matrix is the most specific, requiring those equal diagonal elements to be exactly 1. -------------------------------------------------------------------------------- 4. Topic 4: Operations on Matrices Matrix algebra allows us to combine and scale data sets. These operations require specific compatibility checks. 4.2. Formulas & Identities • Addition (A + B): cᵢⱼ = aᵢⱼ + bᵢⱼ. Requirement: Same order (NCERT Page 44). • Scalar Multiplication (kA): [k(aᵢⱼ)]. Every element is multiplied by constant k (NCERT Page 45). • Negative of a Matrix (–A): Defined as (–1)A (NCERT Page 45). • Difference (A – B): Defined as A + (–B) (NCERT Page 46). • Multiplication (AB): For Aₘₓₙ and Bₙₓₚ, product Cₘₓₚ has elements: cᵢₖ = Σⱼ₌₁ⁿ (aᵢⱼ × bⱼₖ) (NCERT Page 51). 4.3. Theorems & Properties • Addition: Commutative (A+B = B+A); Associative ((A+B)+C = A+(B+C)); Identity (A+O = A); Inverse (A+(-A) = O) (NCERT Page 46). • Scalar Multiplication: k(A + B) = kA + kB; (k + l)A = kA + lA (NCERT Page 47). • Multiplication: Associative (AB)C = A(BC); Distributive A(B+C) = AB + AC; Identity IA = AI = A (NCERT Page 54). 4.4. Compatibility Table Operation Condition for Validity Resulting Order Addition/Subtraction A and B must have the same order Same as A and B Scalar Multiplication Always valid for any matrix Same as original Columns of A = Rows of B (Inner dimensions (Rows of A) × (Columns Multiplication (AB) match: n = n) of B) 4.5. The Non-Commutative Nature of Multiplication Unlike real numbers, matrix multiplication is generally not commutative (AB ≠ BA). Even if AB and BA are both defined, they may have different orders; even if they share the same order, their corresponding elements usually differ (NCERT Page 53). -------------------------------------------------------------------------------- 5. Topic 5: Transpose of a Matrix The transpose converts rows into columns, reorienting the matrix structure. 5.2. Definition Transpose of a Matrix: If A = [aᵢⱼ]ₘₓₙ, then the transpose A′ (or Aᵀ) is defined as A′ = [aⱼᵢ]ₙₓₘ. 5.3. Theorems & Properties 1. (A′)′ = A 2. (kA)′ = kA′ 3. (A + B)′ = A′ + B′ 4. (AB)′ = B′A′ (The Reversal Law) 5.5. Reversal Law Evaluation The property (AB)′ = B′A′ is critical. To maintain row-column compatibility during transformation, the product of transposes must be taken in reverse order. -------------------------------------------------------------------------------- 6. Topic 6: Symmetric and Skew Symmetric Matrices 6.2. Definitions • Symmetric Matrix: A square matrix where A′ = A. • Skew Symmetric Matrix: A square matrix where A′ = –A. 6.3. Theorems & Properties • Theorem 1: For any square matrix A with real entries, (A + A′) is symmetric and (A – A′) is skew symmetric. • Theorem 2: Any square matrix can be uniquely expressed as the sum of a symmetric and a skew symmetric matrix. 6.4. Standard Results In a skew-symmetric matrix, diagonal elements are always zero. Because aᵢⱼ = –aⱼᵢ, for diagonal elements (where i = j), aᵢᵢ = –aᵢᵢ, which necessitates aᵢᵢ = 0. 6.5. Matrix Decomposition The formula for unique decomposition is: A = ½(A + A′) + ½(A – A′). -------------------------------------------------------------------------------- 7. Topic 7: Invertible Matrices 7.2. Definitions • Invertible Matrix: A square matrix A of order n is invertible if there exists a square matrix B of the same order such that AB = BA = I. • Inverse: Matrix B is the inverse of A, denoted by A⁻¹. 7.3. Theorems & Properties • Uniqueness of Inverse: The inverse of a square matrix, if it exists, is unique. • Inverse of a Product: (AB)⁻¹ = B⁻¹A⁻¹ (follows the Reversal Law). 7.5. Comparison: Inverse vs. Transpose Properties Property Transpose (A′) Inverse (A⁻¹) Reversal Law (AB)′ = B′A′ (AB)⁻¹ = B⁻¹A⁻¹ Double Operation (A′)′ = A (A⁻¹)⁻¹ = A Requirement Any order m × n Must be Square (n × n) 7.6. The Square Matrix Constraint A matrix must be square to be invertible. For non-square matrices, the products AB and BA would have different orders; thus, the condition AB = BA = I becomes impossible. 7.7. Conclusion Unit 3 establishes a cohesive language from basic array structures to complex inversion. Mastering structural properties (order), operational rules (non-commutative multiplication), and transformational laws (transpose and symmetry) is essential for NCERT curriculum excellence.

Matrices – CBSE Class 12

Topics in this Unit