Systems and Matrices

A precise translation between linear systems, augmented matrices, vector equations, and solution geometry.

Vector-space ideas connect sets, operations, spanning, independence, basis, and dimension. A vector space sits at the centre of a dependency map. Subspace conditions lead to span and independence, which meet at basis and determine dimension; kernel and range connect through a transformation.

Precise definition

A linear system $a_{i1}x_1+\cdots+a_{in}x_n=b_i$ is written $A\mathbf x=\mathbf b$, where rows encode equations and columns encode coefficients of variables. The augmented matrix $[A\mid\mathbf b]$ stores both sides for row reduction.

Notation and mathematical language

The vector equation is $x_1a_1+\cdots+x_na_n=\mathbf b$, so consistency is equivalent to $\mathbf b\in\operatorname{Col}A$. Rank criteria say a solution exists iff $\operatorname{rank}A=\operatorname{rank}[A\mid b]$, and it is unique iff that common rank equals the number of variables.

Conceptual picture

Each equation defines a hyperplane; solutions are intersections. Algebraically, one solution plus every null-space vector gives the full consistent solution set $x_p+\ker A$.

Fully worked example

Interpretation and application

Matrix form scales to networks, balances, fitting, and discretized models. A consistent algebraic system can still be a poor real-world model; residuals and parameter uncertainty address different questions from exact solvability.