Translating a System of Equations into Ax=b

From Equations to a Matrix Equation

A system of linear equations can be written compactly as one matrix equation. The compression is useful only if the coefficients, unknowns, and constants stay aligned: each equation becomes one row, and each unknown keeps the same position throughout the matrix and vector. In particular, an unknown that does not appear in an equation still has a place in that equation’s row, with coefficient zero.

Work over the real numbers. Suppose a system has \(m\) equations and the ordered unknowns \(x_1,\dots,x_n\). Put each equation in standard form: all terms involving unknowns on the left and the constant on the right. Write the \(i\)th equation as \(a_{i1}x_1+\cdots+a_{in}x_n=b_i\). Here \(a_{ij}\) is the coefficient of the \(j\)th unknown in the \(i\)th equation, and \(b_i\) is the right-hand-side constant.

The dimensions are part of the translation, not an optional check: an \(m\times n\) coefficient matrix multiplies an \(n\)-entry unknown vector and gives an \(m\)-entry vector. The order of the unknowns determines the order of the columns. If the unknown vector is \((x,y,z)^{\top}\), then every row lists the coefficients of \(x\), then \(y\), then \(z\), even when one or more coefficients are zero.

Build Each Row in the Same Order

A reliable procedure is to decide the variable order first, put each equation in standard form, and then record its coefficients in that order. Keep the constants on the right-hand side. An absent variable contributes a zero entry; it does not cause the other coefficients in that row to shift columns.

The row formula makes the check precise. If \(\mathbf{x}=(x_1,\dots,x_n)^{\top}\), then the \(i\)th entry of \(\mathbf{A}\mathbf{x}\) is \(a_{i1}x_1+\cdots+a_{in}x_n\). Thus the \(i\)th equation is represented by the \(i\)th row of \(\mathbf{A}\) together with the \(i\)th entry of \(\mathbf{b}\).

Zero Coefficients Keep the Columns Aligned

Zero entries have a structural role. They show which unknown is absent while keeping every equation’s coefficient list the same length and in the same order. An equation involving only some of the chosen unknowns still contributes a complete row with \(n\) entries. Equations that contain no variable terms can also be represented: their coefficient row consists entirely of zeros.

The right-hand side must be read after the equation is put in standard form. Moving a term across the equality changes its sign. If a constant begins on the left, it must be moved too. Simplifying first prevents a frequent source of incorrect entries: recording a coefficient before combining all the terms involving that unknown.

Why the Encoding Represents the Same System

Proof. Assume the \(i\)th equation is \(a_{i1}x_1+\cdots+a_{in}x_n=b_i\), for each \(i=1,\dots,m\), and let \(\mathbf{x}\) be the column of values in the fixed order. By the definition of matrix-vector multiplication, the \(i\)th entry of \(\mathbf{A}\mathbf{x}\) is \(a_{i1}x_1+\cdots+a_{in}x_n\). Therefore the \(i\)th equation holds exactly when the \(i\)th entry of \(\mathbf{A}\mathbf{x}\) equals \(b_i\). This statement holds for every \(i\) exactly when all \(m\) equations hold, which is exactly the vector equality \(\mathbf{A}\mathbf{x}=\mathbf{b}\). Hence the system and matrix equation have the same satisfying assignments. \(\square\)

The result explains why preserving order is essential: the coefficient in column \(j\) multiplies the \(j\)th entry of \(\mathbf{x}\). The zero coefficient case is included in the proof, since a missing variable contributes \(0x_j=0\) to the row product.

Proof. Fix an equation number \(i\) and an unknown position \(j\). In standard form, the coefficient of \(x_j\) in equation \(i\), after like terms have been collected, determines the entry in row \(i\), column \(j\). Thus every entry \(a_{ij}\) is fixed by the system. The constant on the right side of equation \(i\) determines \(b_i\), so every entry of \(\mathbf{b}\) is fixed as well. Since this applies to every row and column, no different coefficient matrix or right-hand-side vector can represent that same fixed, standard-form system with the same orders. \(\square\)

Common Mistake: Dropping a Zero Entry

Consider the equation \(x+z=4\) with the unknown order \(x,y,z\). A tempting but incorrect row is \((1,1)\), obtained by listing only the coefficients that visibly occur. That row has too few entries and does not preserve the stated variable order. If one instead treats it as coefficients of \(x,y\), it represents \(x+y=4\), not \(x+z=4\).

The correction is to insert the coefficient of the absent unknown \(y\): the row must be \((1,0,1)\). The corresponding equation is \(1x+0y+1z=4\), which is exactly \(x+z=4\). Check dimensions as well: with three ordered unknowns, each row of the coefficient matrix must have three entries, so \(\mathbf{A}\) has three columns and \(\mathbf{x}\) has three entries.

A second sign-related error is to place a term’s coefficient in the matrix before putting the equation in standard form. For instance, \(x+2=y+5\) becomes \(x-y=3\), not \(x-y=5\): subtracting \(y\) and \(2\) from both sides gives \(x-y=5-2=3\). With unknown order \(x,y\), the row is \((1,-1)\), and the corresponding right-hand-side entry is \(3\).