Give a vector space a basis e₁, e₂; the dual basis e¹, e² lives in the space of linear functionals and is defined by one duality: ⟨eⁱ, eⱼ⟩ = δⁱⱼ — each dual vector returns 1 on its partner and 0 on the others. Then any vector's i-th coordinate is just ⟨eⁱ, v⟩. The dual basis is the reciprocal basis of crystallography, and it is the rows of the inverse matrix.
Choose a (non-orthogonal) basis; compute its dual as the rows of the inverse, then check the biorthogonality grid ⟨eⁱ, eⱼ⟩ is the identity — ones on the diagonal, zeros off it: live demo
“To get a vector's coordinates you solve a linear system.” — only until you have the dual basis; then the i-th coordinate is a single inner product ⟨eⁱ, v⟩. The dual basis is the machine that reads coordinates off, and it exists for every basis, orthogonal or not. cited
A basis names directions; its dual names the measurements that recover the amounts. Two bases, locked together by δⁱⱼ — you cannot move one without the other answering. reciprocal basis
On the canonical compiler, the dual of e₁=[2,1], e₂=[1,3] (rows of the inverse) satisfies biorthogonality to f64 precision — the off-diagonal ≈10⁻¹⁶ is the honest floating-point remainder: