Order of a matrix

Before you add two matrices, multiply them, or even ask whether an operation is legal, there is exactly one question you must answer first: how many rows and how many columns does each matrix have? That pair of numbers is the matrix's order, and it is the single most-checked fact in the entire Matrices chapter — every rule about addition, multiplication, and the shape of the result is written purely in terms of order. This section builds the idea from scratch: what order means, how it is written, the special shapes (row, column, square) it defines, and the counting question CBSE loves to ask — given a fixed number of entries, how many different orders are possible? By the end you should be able to read off the order of any matrix on sight, count its entries as a product, and use order to decide instantly whether two matrices can even be combined.

The core insight

A matrix with $m$ rows and $n$ columns has order $m \times n$ , giving $mn$ entries in total, and order alone decides which operations between two matrices are even defined.

The core idea

A matrix is a rectangular array of numbers arranged in rows (horizontal lines) and columns (vertical lines). If a matrix $A$ has $m$ rows and $n$ columns, its order (also called its size) is written $m \times n$ , read as " $m$ by $n$ " — rows always come first, columns always second. The total number of entries in the matrix is simply the product of the two dimensions.

A_{m \times n} \ \text{has}\ m\ \text{rows},\ n\ \text{columns}, \ \text{and}\ mn\ \text{entries in total.}

where: $A_{m\times n}$ denotes a matrix named $A$ of order $m \times n$ ; $m$ is the row count; $n$ is the column count; $mn$ is the total entry count, useful as a quick self-check after you count rows and columns separately. Three shapes recur constantly and are worth naming on sight: A matrix of order $m \times 1$ — only one column, many rows — is a column matrix. A matrix of order $1 \times n$ — only one row, many columns — is a row matrix. A matrix of order $n \times n$ , where the row count equals the column count, is a square matrix of order $n$ ; here the single number $n$ is often called "the order" loosely, but it is really shorthand for $n \times n$ . Order is not just a label — it is the gatekeeper for every matrix operation you will meet later in the chapter. Two matrices can be added (or subtracted) only if they have exactly the same order, entry by entry. Two matrices can be multiplied, $A_{m\times n} \times B_{p \times q}$ , only if the column count of the first equals the row count of the second, that is $n = p$ ; the product, when it exists, has order $m \times q$ . So before touching a single number inside a matrix, the very first move — always — is to read off its order and check compatibility. An operation that fails this order check is not "hard," it is simply undefined, and no amount of careful arithmetic afterward can rescue it. Order also drives a counting question CBSE returns to often: if a matrix has $mn$ entries and each entry can independently be chosen from a set of $k$ values, there are $k^{mn}$ distinct matrices of that order — because each of the $mn$ slots is filled independently. This links order directly to basic counting principles from earlier chapters.

Figure

A three by two grid of matrix entries labelled with row and column position, showing three rows and two columns giving order three by two

Determining the order of a matrix

Derivation AReading off the order and entry count of any given matrix

Goal: given any rectangular array of numbers written inside brackets, determine its order $m \times n$ by counting rows and columns directly, and confirm the entry count as a consistency check, since this is the procedure applied at the start of every single problem in the Matrices chapter before any operation is attempted.

Step 1. Identify the rows: scan the array from top to bottom and count each horizontal line of numbers separated by the array's row breaks. This count is $m$ .

Step 2. Identify the columns: scan a single row from left to right and count each entry separated by commas or spacing within that row. This count is $n$ , and it must be the same for every row (a matrix is rectangular, not jagged).

Step 3. Write the order as $m \times n$ , rows first, columns second — this ordering is a fixed convention, not a choice.

Step 4. Compute the total entries as the product $mn$ , and cross-check it against a direct count of every number in the array; a mismatch signals a miscount of rows or columns.

Step 5. Classify the shape if useful: $n = 1$ means a column matrix, $m = 1$ means a row matrix, and $m = n$ means a square matrix of order $n$ — each classification follows immediately from the order alone.

Worked example

State the order of each matrix below, give its entry count, and name its shape where applicable.

P = \begin{bmatrix} 4 & 1 & 0 \end{bmatrix}, \qquad Q = \begin{bmatrix} 2 \\ -1 \\ 6 \\ 3 \end{bmatrix}, \qquad R = \begin{bmatrix} 1 & 5 \\ 0 & 2 \end{bmatrix}

Step 1. $P$ has 1 row and 3 columns, so its order is $1 \times 3$ , with $1 \times 3 = 3$ entries; since $m = 1$ , it is a row matrix.

Step 2. $Q$ has 4 rows and 1 column, so its order is $4 \times 1$ , with $4 \times 1 = 4$ entries; since $n = 1$ , it is a column matrix.

Step 3. $R$ has 2 rows and 2 columns, so its order is $2 \times 2$ , with $2 \times 2 = 4$ entries; since $m = n$ , it is a square matrix of order 2.

Final answer. $P$ is $1 \times 3$ (row matrix, 3 entries), $Q$ is $4 \times 1$ (column matrix, 4 entries), and $R$ is $2 \times 2$ (square matrix of order 2, 4 entries).

Competitive stretch

If a matrix has exactly 12 entries, list every possible order it could have, assuming both dimensions are positive integers.

Step 1. The order $m \times n$ must satisfy $mn = 12$ , so list every factor pair of 12: $(1,12), (2,6), (3,4), (4,3), (6,2), (12,1)$ .

Step 2. Each pair gives one valid order, so there are six possible orders: $1\times12,\ 2\times6,\ 3\times4,\ 4\times3,\ 6\times2,\ 12\times1$ .

Final answer. A matrix with 12 entries could have any of six different orders — the entry count alone does not fix a unique shape unless an extra condition (such as "the matrix is square" or "it has 3 rows") is also given.

Common traps

Writing the order as "columns times rows" instead of "rows times columns" — the convention is always rows first, no exceptions.
Assuming a matrix with a given entry count has only one possible order; as the stretch example shows, several orders can share the same product $mn$ .
Blurring "order of a matrix" (the pair $m \times n$ describing shape) with the casual habit of calling a square matrix's single dimension $n$ its "order" — always be clear whether both dimensions or just one is being asked for.
Forgetting that a $1 \times 1$ matrix, a single number written in brackets, is still a matrix with a well-defined order.
Checking whether two matrices can be added or multiplied by looking at the entries first instead of comparing orders first — order compatibility must be verified before any arithmetic begins.

Ask the tutor: Want a quick drill on spotting orders at a glance or listing every possible order for a given entry count — ask the AI tutor to generate a few practice matrices.

Why does the order matter more than the actual numbers inside a matrix

Because order alone decides whether an operation is even legal, before any arithmetic is possible. Addition needs matching orders; multiplication needs the inner dimensions to agree. Two matrices can have wildly different entries but be perfectly compatible, or have very similar-looking entries but be impossible to add because their orders differ. Checking order first saves you from doing pointless calculation on an operation that was never defined.

Is a 1 x 1 matrix really a matrix, since it looks like just a number

Yes. A $1 \times 1$ matrix, such as $\begin{bmatrix} 7 \end{bmatrix}$ , has exactly 1 row and 1 column, so its order is $1 \times 1$ and it has 1 entry. It behaves like an ordinary number under addition and multiplication with other $1\times1$ matrices, but it is still formally a matrix and CBSE questions occasionally test this edge case directly.

If I know a matrix has 20 entries, can I always tell its order

Not on its own. As the worked stretch example shows for 12 entries, any factor pair of the entry count gives a valid order, so 20 entries could mean $1\times20$ , $2\times10$ , $4\times5$ , $5\times4$ , $10\times2$ , or $20\times1$ . You need an extra condition — such as the matrix being square, or a stated row or column count — to pin down a unique order.