Coordinate Notation and Vector Equality

Reading a Vector by Its Coordinates

A vector in \(\mathbb{R}^n\) is specified by \(n\) real coordinates in a fixed order. The order matters: the first coordinate, second coordinate, and later coordinates occupy distinct positions. Coordinate notation lets us describe those positions precisely and decide whether two vectors represent the same vector. The key test is direct: compare entries at matching positions, not merely the collections of numbers that appear.

Throughout this tutorial, scalars are real numbers. We write vectors as columns, with bold lowercase letters, and use subscripts to identify their coordinates. For example, the vector \(\mathbf{x}\) in \(\mathbb{R}^3\) may be written as \(\mathbf{x}=(x_1,x_2,x_3)^{\top}\), or as the column below. The subscript \(i\) indicates the position of a coordinate, and \(x_i\) names the real number in that position.

The notation \((x_1,x_2,x_3)^{\top}\) means that the listed coordinates are written as a column. It does not mean that the coordinates are rearranged. For a general positive integer \(n\), the same convention is

The number of coordinates is part of the notation: a vector in \(\mathbb{R}^n\) has exactly \(n\) entries. The index \(i\) ranges from \(1\) through \(n\), so there is no coordinate numbered \(0\) and no coordinate numbered \(n+1\). Coordinate notation describes an ordered list, not an unordered set. For instance, \((2,5)^{\top}\) and \((5,2)^{\top}\) have the same two numbers but put them in different positions.

The Coordinate Criterion for Equality

To compare two vectors in \(\mathbb{R}^n\), write both using the same number of coordinates and compare position by position. The first coordinate of one must match the first coordinate of the other, the second must match the second, and so on through coordinate \(n\). Equality in one or several positions is not enough: every position must match.

Proof. Suppose first that \(\mathbf{x}=\mathbf{y}\). Both vectors are ordered \(n\)-tuples of real numbers. Equality of ordered tuples means that their entries in each corresponding position agree. Therefore \(x_i=y_i\) for each \(i=1,\dots,n\). Conversely, suppose \(x_i=y_i\) for every \(i\) from \(1\) through \(n\). Then the two ordered lists have equal first entries, equal second entries, and equal entries in every remaining position up to \(n\). They are the same ordered \(n\)-tuple, so \(\mathbf{x}=\mathbf{y}\). Both implications hold, proving the equivalence. \(\square\)

The phrase “if and only if” matters here. Matching all coordinates guarantees equality, and equality guarantees that all corresponding coordinates match. A useful way to apply the result is to treat a proposed vector equality as a list of scalar equalities. Each coordinate supplies one condition; the original vector equality holds exactly when all of those conditions hold.

Equality with Unknown Coordinates

Sometimes a vector equality is given with one or more unknown coordinates. The same criterion turns the equality into scalar conditions. Match each coordinate separately, solve the resulting conditions, and then check that the resulting vector has all the required coordinates. A single mismatch disproves equality; every position must be accounted for.

Coordinate matching also applies when a condition involves a parameter. It is important not to stop after checking one coordinate: every coordinate contributes a condition, and the values must satisfy all of them at once.

The Ambient Space and Vector Equality

Before comparing coordinates, check that the vectors are being treated as elements of the same space. A vector in \(\mathbb{R}^2\) has two real coordinates, whereas a vector in \(\mathbb{R}^3\) has three. Under the ordered-tuple convention, the vectors have different lengths and are not equal. In particular, one cannot establish vector equality by matching only the entries that happen to be present in both.

Proof. An element of \(\mathbb{R}^m\) is an ordered tuple with exactly \(m\) real entries, while an element of \(\mathbb{R}^n\) is an ordered tuple with exactly \(n\) real entries. Equal ordered tuples must have the same number of entries, as well as equal entries in every position. Since \(m\ne n\), these tuples have different numbers of entries and therefore cannot be equal. \(\square\)

Equality Behaves Like Equality of Real Numbers

Once two vectors are understood coordinate by coordinate, the familiar properties of equality follow from the corresponding properties of real-number equality. These properties are useful when reading equations involving vectors: a vector is equal to itself, equality can be reversed, and equalities can be linked in a chain.

Proof. Write \(\mathbf{x}=(x_1,\dots,x_n)^{\top}\), \(\mathbf{y}=(y_1,\dots,y_n)^{\top}\), and \(\mathbf{z}=(z_1,\dots,z_n)^{\top}\) in \(\mathbb{R}^n\). For reflexivity, each real coordinate satisfies \(x_i=x_i\); the coordinate criterion therefore gives \(\mathbf{x}=\mathbf{x}\). For symmetry, if \(\mathbf{x}=\mathbf{y}\), then \(x_i=y_i\) for every \(i\). Symmetry of real-number equality gives \(y_i=x_i\) for every \(i\), so the coordinate criterion gives \(\mathbf{y}=\mathbf{x}\). For transitivity, suppose \(\mathbf{x}=\mathbf{y}\) and \(\mathbf{y}=\mathbf{z}\). Then for every \(i\), \(x_i=y_i\) and \(y_i=z_i\). Transitivity of real-number equality gives \(x_i=z_i\) for every \(i\), and the coordinate criterion gives \(\mathbf{x}=\mathbf{z}\). \(\square\)

Common Mistakes and a Reliable Check

Comparing entries without respecting their positions is a common error. For example, consider the false claim that \(\begin{bmatrix}3\\8\end{bmatrix}=\begin{bmatrix}8\\3\end{bmatrix}\) because both vectors contain the numbers \(3\) and \(8\). The first coordinates are \(3\) and \(8\), so they are unequal. The second coordinates are \(8\) and \(3\), so they are also unequal. The correction is to compare corresponding positions, not to ask whether the same numbers appear somewhere in each vector.

Another mistake is to check only the first coordinate of two vectors and assume the rest must follow. For instance, the first coordinates of \(\begin{bmatrix}1\\0\\4\end{bmatrix}\) and \(\begin{bmatrix}1\\0\\5\end{bmatrix}\) agree, as do their second coordinates, but the third coordinates \(4\) and \(5\) do not. The vectors are therefore not equal. A valid equality check must reach the final coordinate.

Use this short procedure when deciding whether two coordinate expressions are equal:

1. Check that both expressions represent vectors with the same number of coordinates.
2. Write or read each coordinate in its position, from first through last.
3. Compare the first coordinates, then the second, continuing through coordinate \(n\).
4. Conclude equality only if every coordinate pair agrees; one unequal pair is enough to conclude the vectors are not equal.

This procedure is deliberately limited to equality. It depends on interpreting coordinates accurately and keeping their order fixed; it does not require any vector calculation. When a coordinate contains an unknown, the same position-by-position comparison produces the scalar conditions that the unknowns must satisfy.