Ejercicios Resueltos Matrices

Matrix Problems: What Actually Happens When You Sit Down to Solve Them

The first time I tried working through matrix exercises for a linear algebra course, I spent forty-five minutes on a single 3x3 determinant because I didn't understand that you could just reduce it first instead of brute-forcing cofactor expansion. I still cringe thinking about it. Matrix work doesn't have to be like that. Once you know what to look for, these problems follow patterns that repeat across every textbook, exam, and real-world application. The trick is recognizing the pattern before you start calculating.

Ejercicios Resueltos Matrices

When people search for solved matrix exercises, they are usually looking for one of three things: a worked example that shows the steps so they can compare their own work, a reference guide they can use when stuck mid-problem, or practice material to build speed before an exam. All of those goals are valid. I am going to walk through the actual solving process here so you can apply it directly. The core operations you will encounter are matrix addition, subtraction, scalar multiplication, matrix multiplication, finding the transpose, computing determinants, finding inverses, row reduction (Gauss-Jordan), and solving systems using matrices. That is the standard set. Everything else is a variation on one of these.

The Order in Which You Should Learn These Operations

Most people try to learn row reduction before they are comfortable with basic matrix multiplication. That is backward. If you cannot multiply matrices quickly and correctly, row reduction becomes a mess of arithmetic errors that mask whether you actually understand the method. Start with addition and subtraction. Those are element-wise operations. A 2x2 matrix added to another 2x2 matrix means you add the top-left elements together, then top-right, bottom-left, and bottom-right. Nothing complicated. The constraint is that both matrices must have the same dimensions. This seems obvious but I have seen students try to add a 2x3 to a 3x2 and wonder why their answer was wrong. Scalar multiplication is the next step. Multiply every element by the scalar. A 3x4 matrix multiplied by 2 just doubles every entry. Again, trivial. This builds the habit of tracking dimensions carefully, which matters later.

Matrix multiplication is where things get real. The number of columns in the first matrix must equal the number of rows in the second. The resulting matrix has the dimensions of the outer pair. So a 2x3 times a 3x4 gives you a 2x4. Students frequently forget this dimensional rule and waste twenty minutes checking their arithmetic before realizing the operation was never valid to begin with. Here is a practical example. Multiply: A = [[1, 2], [3, 4]] by B = [[5, 6], [7, 8]]

The result C has entries calculated as follows: C11 = (1)(5) + (2)(7) = 5 + 14 = 19 C12 = (1)(6) + (2)(8) = 6 + 16 = 22

C21 = (3)(5) + (4)(7) = 15 + 28 = 43 C22 = (3)(6) + (4)(8) = 18 + 32 = 50 So C = [[19, 22], [43, 50]]. Check your work by confirming the result is 2x2, which it is, matching the outer dimensions of the original matrices.

Determinants and Why They Matter More Than You Think

Determinants are often taught as a standalone calculation with no context. In practice, the determinant tells you whether a matrix is invertible. If det(A) = 0, the matrix has no inverse. If det(A) 0, it does. That is the single most important property, and everything else about determinants follows from that. For a 2x2 matrix [[a, b], [c, d]], the determinant is ad - bc. Straightforward. For a 3x3 matrix, you have several options. The cofactor expansion method works but gets tedious. The rule of Sarrus applies only to 3x3 matrices and is quick if you remember the diagonal pattern. Row reduction to upper triangular form and then multiplying the diagonal entries is often the fastest approach for larger matrices because it avoids the combinatorial explosion of cofactors.

Here is a 3x3 example. Find the determinant of: A = [[2, 1, 3], [4, 0, 1], [1, 2, 5]] Using cofactor expansion along the second row (which has a zero, making it slightly easier):

det(A) = -4 * det([[1, 3], [2, 5]]) + 0 * (...) - 1 * det([[2, 1], [1, 2]]) det(A) = -4 * (5 - 6) - 1 * (4 - 1) det(A) = -4 * (-1) - 1 * (3)

det(A) = 4 - 3 = 1 The determinant is 1, which means this matrix is invertible. That conclusion alone determines what methods you can use going forward.

Row Reduction: The Tool That Solves Everything

Gauss-Jordan elimination is the workhorse of matrix problems. Once you are comfortable with it, nearly every exercise type becomes a routine procedure. The goal is to transform the augmented matrix into reduced row echelon form using three operations: swapping rows, multiplying a row by a non-zero scalar, and adding a multiple of one row to another. Let me walk through a system solution. Consider: 2x + y - z = 8

-3x - y + 2z = -11 -2x + y + 2z = -3 The augmented matrix is:

[[2, 1, -1, 8], [-3, -1, 2, -11], [-2, 1, 2, -3]]

Step 1: Get a 1 in the top-left. Divide row 1 by 2: [[1, 0.5, -0.5, 4], [-3, -1, 2, -11],

[-2, 1, 2, -3]] Step 2: Eliminate below the pivot. R2 = R2 + 3*R1, R3 = R3 + 2*R1: [[1, 0.5, -0.5, 4],

[0, 0.5, 0.5, 1], [0, 2, 1, 5]] Step 3: Get a 1 in position (2,2). Multiply row 2 by 2:

[[1, 0.5, -0.5, 4], [0, 1, 1, 2], [0, 2, 1, 5]]

Step 4: Eliminate above and below the pivot in column 2. R1 = R1 - 0.5*R2, R3 = R3 - 2*R2: [[1, 0, -1, 3], [0, 1, 1, 2],

[0, 0, -1, 1]] Step 5: Get a 1 in position (3,3). Multiply row 3 by -1: [[1, 0, -1, 3],

[0, 1, 1, 2], [0, 0, 1, -1]] Step 6: Eliminate above the pivot in column 3. R1 = R1 + R3, R2 = R2 - R3:

[[1, 0, 0, 2], [0, 1, 0, 3], [0, 0, 1, -1]]

The solution is x = 2, y = 3, z = -1. Verify by substituting back into the original equations. It checks out.

Finding the Inverse: Two Methods, One Result

There are two main approaches. The first uses the formula A^(-1) = (1/det(A)) * adj(A), where adj(A) is the adjugate matrix (the transpose of the cofactor matrix). This is elegant for 2x2 and small 3x3 matrices but becomes impractical beyond that size because computing the adjugate requires calculating n^2 cofactors. The second method uses row reduction on the augmented matrix [A | I]. Reduce A to I, and the right side becomes A^(-1). This is the method I use almost exclusively. It is less prone to arithmetic errors because you are doing the same operations you already know from Gauss-Jordan, and you can check your work at each step by verifying that the left side is approaching the identity matrix. One thing beginners consistently miss: you must check that the determinant is non-zero before attempting either method. I once spent thirty minutes computing an inverse for a singular matrix using the adjugate method, only to get a result that, when multiplied back with the original, did not produce the identity. The problem was never in my arithmetic. The matrix simply had no inverse.

Common Pitfalls That Waste Time

Forgetting that matrix multiplication is not commutative. AB BA in general. I have seen students assume they are equal and then wonder why their answers diverge. The dimensions alone often make it clear: if A is 2x3 and B is 3x2, then AB is 2x2 but BA is 3x3. They cannot possibly be the same. Confusing the transpose with the inverse. A^T and A^(-1) are completely different operations. Transposing swaps rows and columns. Inverting finds a matrix that produces the identity when multiplied. For orthogonal matrices, these happen to coincide, but that is the exception, not the rule. Arithmetic errors during row reduction. These are unavoidable at first. The mitigation is to work slowly, keep your fractions clean by not converting to decimals prematurely, and re-verify each row operation before proceeding. A single sign error early in the process cascades into a completely wrong final answer that is extremely difficult to trace back to its origin.

What Textbooks Don't Always Emphasize

The relationship between rank and solutions is more useful than most students realize. If you row-reduce an augmented matrix and end up with a row like [0 0 0 | k] where k is non-zero, the system is inconsistent. There is no solution. This happens more often on exams than anyone expects. Professors include these cases to catch students who blindly proceed through the algorithm without checking for this condition. Another thing: the null space. When solving homogeneous systems (Ax = 0), the solution set always includes the trivial solution x = 0. But if the matrix has free variables—which you identify by counting pivot columns versus total columns—there are infinitely many solutions forming a subspace. Understanding this structure matters more for later courses than the mechanics of finding a single solution vector.

Where to Find Quality Solved Exercises

OpenStax Linear Algebra has a free chapter on matrix operations with worked examples. Khan Academy covers the operational mechanics step by step. Paul's Online Math Notes has a solid set of practice problems with full solutions for Gauss-Jordan elimination and matrix inverses. For Spanish-language resources, the searches for Ejercicios Resueltos Matrices tend to surface sites like matefisicas.com, universidadonline.es, and various university department pages that post problem sets with solutions. The quality varies significantly across these sources. Some show complete step-by-step work. Others skip intermediate calculations and expect you to fill in the gaps, which is frustrating when you are still building intuition. My rule of thumb is to work through a problem yourself first, then compare with the provided solution. If the solution skips steps you needed, that is a sign the source is not suited for your current level.

A Practical Strategy for Building Speed

Do ten easy problems, then ten medium problems, then mix in three hard ones. The easy ones build confidence and fluency with the mechanics. The medium ones are where learning happens. The hard ones expose gaps in your understanding that you did not know you had. This progression takes roughly two weeks if you practice for thirty to forty-five minutes daily. After that, timed practice sessions of twenty minutes each, working through exam-style problems, will bring your completion time down to a reasonable level. I used to spend about twenty minutes on a standard 3x3 row reduction problem. After structured practice following the progression above, I was consistently finishing in under six minutes with high accuracy. The difference was not intelligence. It was pattern recognition. Your brain starts seeing the structural moves before your hand even picks up the pencil. The exercises themselves do not get easier. You just stop fighting the basics and can focus on what the problem is actually asking you to find.