Equality as two demands, and why the orders have to agree before the entries are looked at

What to assume they know

• The order of a matrix, and the fact that it is a pair read rows first
• The double subscript, and what it means for two entries to correspond
• Solving a pair of simultaneous linear equations in two unknowns
• Recognising a pair of equations that no value can satisfy
• Rearranging a linear equation with the unknown on both sides
• Surds and decimals as legitimate entries, from the previous two topics

What they should be able to do

• State Definition 2 as two tests applied in a fixed order
• Explain why the order test must be settled before any entry is compared
• Decide equality for a pair of printed matrices, giving the reason for the verdict
• Produce a pair sharing one order and one list of values that are still not equal
• Read a matrix equation as a system of equations between corresponding entries, and say how many equations it holds
• Recover unknown values from an equality whose entries are numbers
• Recover unknown values from an equality whose entries are expressions, solving the resulting system
• Recognise an equality that no assignment satisfies, and justify the verdict rather than guessing
• Use the symbolic statement that two matrices are equal, and say what it abbreviates

Where it usually goes wrong

• "Two matrices with the same entries are equal." Not unless the entries sit in the same positions. The chapter's own second illustration on Part I p. 41 is a pair holding the same four values in different arrangements, and it is printed there to be rejected.
• "If the orders differ you compare the entries that do line up." There is nothing to compare. Clause (i) is a gate: fail it and the question of equality is closed, not partially answered.
• "A matrix equation is one equation." It is as many equations as there are positions. Example 4 holds nine and Example 5 holds four, and treating either as a single statement is what makes them look unsolvable.
• "Every position in a matrix equation tells you something." Three of the nine positions in Example 4 compare a value with itself. Recognising a position that carries no information is part of the work.
• "If several equations mention the same unknown, one of them is redundant." In Exercise 3.1 Q9 two positions constrain the same unknown and disagree, which is the whole point of the item. Disagreement is a verdict, not a mistake in the question.
• "Checking one unknown is enough to pick an option." Exercise 3.1 Q9 is built so that the value of one unknown is consistent and the other is not. Check every position before choosing.
• "Equality only matters for tidy answers." Every unknown matrix recovered later in the chapter — in the two simultaneous-matrix examples, in the equation solved for an unknown matrix, and in the miscellaneous item that builds a matrix from four scalar equations — is recovered by applying this definition. Section 10 should name each of them.

Questions to check understanding

• Decide whether two printed matrices are equal, and name the clause that decides it
• Produce two unequal matrices of the same order holding the same values
• Say how many scalar equations a stated matrix equality contains, and how many of them carry information
• Recover a list of unknowns from an equality whose entries are plain values
• Recover unknowns from an equality whose entries are linear expressions — the form of Examples 4 and 5 and of Exercise 3.1 Q7
• Handle an equality that yields a product as well as a sum, and report every solution — the form of Exercise 3.1 Q6(ii)
• Choose the correct option for an equality no assignment satisfies, and justify the choice by exhibiting the conflicting positions — the form of Exercise 3.1 Q9

Examples worth working on the board

Values marked verified are worked out here from the chapter's own printed data; neither answers file was opened, and this chapter prints no answers to its exercises.

• Definition 2 (§3.3.1, Part I p. 41). Two numbered clauses: the orders must agree, and each entry must equal the entry in the same position of the other matrix. The chapter closes the paragraph with the symbolic abbreviation. The whole of sections 2 and 3 is the observation that clause (i) is a precondition — if it fails, clause (ii) has nothing to quantify over, because there are positions in one matrix with no counterpart in the other.
• The chapter's three-way illustration (Part I p. 41). Two identical two by two matrices, called equal; then a pair that differ only in that the top row reads three then two on one side and two then three on the other, called not equal. Read this off the page image. Verified: the second pair share an order and share the multiset of their entries, and they still fail clause (ii), because clause (ii) compares positions. This is the single sharpest thing on the page.
• The read-off instance (Part I p. 41). A three by two matrix of six letters set equal to a three by two matrix of six values — minus one point five and zero, two and root six, three and two — and the six letters read off directly. Verified: each letter takes the value sitting in its own position, and the chapter's list matches position for position. Use it as the trivial case before the entries become expressions.
• Example 4 (Part I p. 41). Two three by three matrices whose entries are expressions in six unknowns. The left holds x plus three, z plus four and two y minus seven; minus six, a minus one and zero; b minus three, minus twenty-one and zero. The right holds zero, six and three y minus two; minus six, minus three and two c plus two; two b plus four, minus twenty-one and zero. Verified: comparing positions gives x equal to minus three, z equal to two, y equal to minus five, a equal to minus two, c equal to minus one and b equal to minus seven; three of the nine positions are identities that carry no information. Say that aloud — nine positions, six of which do work and three of which do not, and the student has to notice which is which.
• Example 5 (Part I pp. 41–42). A two by two equality whose four entries are two a plus b, a minus two b, five c minus d and four c plus three d, set against four, minus three, eleven and twenty-four. Verified: the four positions split into two independent pairs — the top row gives a equal to one and b equal to two, the bottom row gives c equal to three and d equal to four — and each pair is a two-unknown system solved on its own. That the four equations split into two independent pairs is a fact about which unknowns appear where, not about matrices.
• Exercise 3.1 Q6 (Part I p. 42). Three equalities. (i) A two by two of numbers and letters, giving y equal to four, z equal to three, x equal to one. (ii) A two by two whose entries include a sum and a product: comparing positions gives x plus y equal to six, five plus z equal to five and the product of x and y equal to eight. Verified: z is zero, and x and y are two and four in one order or the other, so this item has two solutions and the question does not say so. Handle it in the explanation by saying which pair, not which single value. (iii) Three sums of pairs from three unknowns, equal to nine, five and seven. Verified: adding the three equations gives twice the total as twenty-one, so the total is ten and a half — but subtracting instead is cleaner: x is two, y is four, z is three.
• Exercise 3.1 Q7 (Part I p. 42). A two by two equality in four unknowns giving a minus b equal to minus one, two a plus c equal to five, two a minus b equal to zero and three c plus d equal to thirteen. Verified: the third equation gives b as twice a, the first then forces a equal to one and b equal to two, the second gives c equal to three and the fourth gives d equal to four. Note the ordering: the equations are not solvable left to right, and the student has to choose which pair to attack first.
• Exercise 3.1 Q9 (Part I p. 43). Two two by two matrices, one holding three x plus seven and five above y plus one and two minus three x, the other holding zero and y minus two above eight and four. Four options, one of which says the values cannot be found. Verified: the top left position forces x to be minus seven thirds and the bottom right position forces x to be minus two thirds. Both are demands on the same unknown and they disagree, so no assignment satisfies the equality and the fourth option is right. The two consistent demands on y are the trap — position one two and position two one both give y equal to seven, so a student who checks only y concludes wrongly. Build section 9 on exactly that.
• The Summary bullet (Part I p. 73). Equality restated in one line with the two clauses kept in the same order. Worth showing at the close as confirmation that the ordering of the clauses is the book's own and not the explanation's.

Figures to have open

• A three by three equality grid whose nine positions can be lit one at a time, each lighting producing its own scalar equation in the margin. Build it with the repo's DataTable component. It carries sections 5 and 7 and should be the same grid both times.
• A side-by-side of the two matrices from Part I p. 41 that hold the same four values in different positions, with the two swapped positions joined by crossed arrows. The matrices are the chapter's; the arrows are added here.
• Two number-line-free equation panels for section 9, one carrying each of the conflicting demands on the same unknown, so the disagreement is visible without arithmetic.
• No redraw of a textbook figure is possible or needed: this chapter prints no figure at all. Confirmed on the page image of every one of the forty-two pages.

Where this sits in the book

• NCERT Class 12 Mathematics, Chapter 3 "Matrices", §3.3.1, Definition 2 and the three-way illustration, Part I p. 41
• The read-off instance in six letters, Part I p. 41
• Examples 4 and 5, Part I pp. 41–42
• Exercise 3.1, questions 6, 7 and 9, Part I pp. 42–43
• Summary, the equality bullet, Part I p. 73