Exercise 3.2 · Q11: Find and from a column-matrix equation
If
find the values of and .
Equating corresponding entries,
Adding (1) and (2): , so .
From (2): .
, .
Want the reason behind every step, the basics and the checks?
Equating the two entries of the column matrices turns the single matrix equation into a pair of simultaneous linear equations, one from each row. Unlike Questions 9 and 10, each equation now contains both unknowns, so we solve the pair together, by elimination.
- Given
- Three column matrices, each of order , and the equation above with unknown scalars and .
- To find
- The numbers and .
- Plan
- (1) Check the orders. (2) Form the scalar multiples and add them. (3) Equate the two entries to get two equations. (4) Eliminate by adding the equations, then find . (5) Check in both equations.
Basics you need
A matrix with one column; here each has 2 rows, so the order is . Basics: rows, columns and the address a_ij
times a column multiplies both its entries by ; columns of the same order are added entry by entry. Basics: adding only like with like
Same order and equal corresponding entries. Lesson: equality of matrices
If one unknown has opposite coefficients in two equations (like and ), adding the equations removes it, leaving one equation in one unknown. Basics: solving equations, one unknown at a time
Solution
Check the orders
All three matrices are column matrices of order . Multiplying by the numbers and keeps the order , so the sum on the left is defined, is , and can be compared with the right side.
Here and are scalars (numbers) multiplying whole matrices, not entries. Recognising that tells us which operation is happening: scalar multiplication.Form the scalar multiples and add
Adding entry by entry,
The scalar multiplies every entry of its column. Then entries in the same row are added: row 1 collects and ; row 2 collects and .Equate corresponding entries
The equation is now
so, row by row,
Two matrices are equal exactly when their first entries agree and their second entries agree. Each equation involves both unknowns, so neither can be solved alone.Eliminate and find
The coefficients of in (1) and (2) are and . Adding the left sides and adding the right sides:
If two equations are true, the equation obtained by adding them is true too. Because , the sum contains only , which we can solve directly.Elimination: add (or subtract) equations so that one unknown cancels. Basics: solving equationsFind
Put into (2):
Once one unknown is known, either original equation gives the other. We used (2) and keep (1) for the check, so the check is independent.Check, and why the answer is the only one
In (1): ✓. In (2): ✓.
The solution is unique: any pair satisfying (1) and (2) also satisfies their sum , which forces , and then (2) forces .
Elimination gives a necessary condition (any solution must have , ); the check shows it is also sufficient (that pair really works). Together: exactly one solution.
and . (Textbook answer: .)
Substitute into the original matrix equation: for the top entry ✓, and for the bottom entry ✓.
- Sign of in row 1. times is , so row 1 is , not .
- Dropping the minus in the answer. gives ; it is not 4.
- Checking only in the equation used to find . That equation is satisfied automatically; check in the other one too.
- A column-matrix equation is a compact way of writing simultaneous equations: one equation per row.
- When each entry equation has several unknowns, solve them together (elimination or substitution).
- Geometrically, the question asks how many copies of each column are needed to reach the right side.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Column matrix of order | Step 1 | Section 3.3 (i) |
| Step 2 | Section 3.4.2 | |
| Sum of matrices of the same order, entry by entry | Step 2 | Section 3.4.1 |
| Equal matrices: equal corresponding entries | Step 3 | Definition 2, Section 3.3.1 (Lesson: equality) |
| Adding two true equations gives a true equation | Step 4 | Algebra of equations |
| Matrix addition is commutative (figure: both paths meet) | Figure | Section 3.4.3 (i) |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →