Determinant of order 1 and 2
Every determinant you will ever expand in this chapter, no matter how large, eventually collapses down to a chain of (and trivially ) determinants. A determinant is expanded, via minors and cofactors, into three pieces; a breaks into 's, which break into 's. So the two smallest cases are not a warm-up exercise to be skimmed — they are the arithmetic engine of the entire topic. Order 1 is almost too simple to state: the determinant of a single number is that number. Order 2 introduces the cross-multiply-and-subtract rule, , that you will apply dozens of times per problem for the rest of the chapter, and that also quietly tells you when a matrix is singular.
The determinant of is , and the determinant of is — the diagonal-product-minus-cross-product rule that every larger determinant is eventually built from.
The core idea
Order 1: the trivial base case. A matrix has exactly one entry, and its determinant is simply that entry, sign included.
where: is the single entry of the matrix. For example, gives . This looks like nothing to compute, but it is the base case every recursive determinant expansion eventually bottoms out at.
Order 2: cross-multiply and subtract. For a array of numbers, the determinant is defined directly, not by any deeper procedure — it is simply given a name.
where: are the entries of the first row and the entries of the second row, read left to right, top to bottom. In words: multiply along the diagonal you keep (top-left times bottom-right), multiply along the diagonal you cross out (top-right times bottom-left), and subtract the second product from the first.
Why the rows matter, not just the numbers. The quantity is comparing the two diagonal products of the array, and this has a geometric consequence worth noticing early: if the second row is a scalar multiple of the first, , then always. Proportional rows force a zero determinant — the first hint that a determinant of zero signals a matrix that is singular (non-invertible), a theme that runs through the rest of the chapter.
Numbers versus algebraic entries. Nothing about the formula requires to be plain numbers — they can just as well be algebraic expressions in a variable, as long as you can still multiply and subtract them. This is exactly what makes determinants useful for solving equations: set up the array with entries involving , expand using , and the result is an ordinary algebraic expression in that you can then set equal to a target value and solve. The worked examples below show both flavours — a purely numeric determinant and an algebraic one used to find an unknown.
Why speed matters here specifically. Every determinant that appears later in this chapter is expanded, by minors and cofactors along a chosen row or column, into exactly three determinants of this type, each multiplied by a coefficient and a sign. A single arithmetic slip inside one of those pieces — a dropped minus sign, a swapped row — silently corrupts the entire answer even if every other step of the expansion is done correctly. So the payoff of mastering now is not really about order-2 problems themselves; it is about removing the single most common source of error from every larger determinant calculation still to come.
The core rule, derived
Confirming that "diagonal product minus cross product" really is the right rule, and not just a name attached to two random operations, is worth doing once because the whole chapter leans on this single computation being both fast and correct — every later expansion writes a minor exactly in this form and applies exactly this formula, so any hesitation or sign slip here propagates straight through the harder problems later.
The goal is to state precisely what means for and to see why the definition is built the way it is, so that the formula can be applied automatically and correctly to any array of numbers or algebraic expressions without re-deriving it each time.
Step 1. Label the entries by position. Read the matrix row by row: is row 1, column 1; is row 1, column 2; is row 2, column 1; is row 2, column 2. The determinant is defined using exactly these four entries and no others, since a matrix has no more information to use.
Step 2. Form the two diagonal products. The main diagonal (top-left to bottom-right) gives the product ; the anti-diagonal (top-right to bottom-left) gives the product .
Step 3. Subtract in the fixed order: main-diagonal product minus anti-diagonal product, , never the other way round. The order is not a matter of taste — swapping the two rows of swaps with and flips the sign of the determinant to , so getting the subtraction order wrong silently produces the wrong sign.
Step 4. Check the definition is consistent with order 1: if you shrink the matrix to a single row and column, only survives and , matching the order-1 rule exactly, so order 2 is a genuine extension of order 1 rather than an unrelated new idea.
Worked example
Evaluate , and then find if .
Step 1. For the first determinant, read off .
Step 2. Apply : and , so .
Step 3. For the second determinant, , so .
Step 4. The determinant simplifies to the constant for every value of — the unknowns cancel out entirely. So the equation becomes , which is never true: there is no value of that makes this determinant equal ; it is always .
Competitive stretch
Change the array slightly and the outcome changes completely: solve . Here , so gives , hence . Comparing this with the example above is the real lesson: you cannot tell in advance whether the unknown will cancel out or survive — always expand and simplify fully before deciding what the equation is actually asking.
Common traps
- Writing instead of — dropping the minus sign is the single most common slip in this topic.
- Misreading the array by columns instead of rows, so get assigned to the wrong positions.
- Treating as "nothing to compute" and forgetting to keep the sign of .
- Sign errors when entries are negative, such as computing as instead of .
- Trying to "solve for " before fully simplifying the algebraic expression, and missing that the unknown has already cancelled.
Ask the tutor: Want a few more mixed numeric-and-algebraic determinant problems to drill the sign rule before moving on to expansions?
Why is the order-1 determinant just the number itself — isn't there supposed to be some calculation?
There genuinely is no calculation to do, and that is fine. A matrix has only one entry, so there is nothing to multiply or subtract against; the determinant is defined to equal that entry, sign included. Students sometimes second-guess this and hunt for a hidden step, but is the complete rule. Its real purpose is structural: it is the smallest case that keeps the whole recursive family of determinant definitions (order 2 built from order 1 ideas, order 3 from order 2, and so on) consistent.
How do I remember whether it is ad minus bc or ad plus bc?
Picture the array and draw an X across it. The diagonal running top-left to bottom-right is the one you "keep" — multiply those two entries. The diagonal running top-right to bottom-left is the one you "cross out" — multiply those two, then subtract that product from the first. Saying it out loud as "keep minus cross" while sketching the X on scratch paper stops the sign error almost every time.
The algebra in the second worked example cancelled to a constant — is that a sign I made an error?
Not necessarily. Determinants of algebraic expressions sometimes simplify so that the variable disappears entirely, leaving a fixed number regardless of — that is exactly what happened with . It only becomes suspicious if you expected a genuine equation in and got a false numeric statement like ; in that case the correct conclusion is simply "no solution exists," not that you made a mistake. Always finish the algebraic simplification before judging whether the answer looks strange.