System identification of $Ax = b$

Question

Given a system of the form $Ax = b$, I have a method to extract infinitely many combinations of $A$ and $b$ that satisfies a given $x$. Can I argue that any combination of $A$ and $b$ (such that $A^{-1}b = x$) satisfies the governing equations that the original system $Ax = b$ represents?