Fitting polynomials on points in the plane
The aim of this blogpost is to prove that given $n$ points with distinct $x$ coordinates there is a unique polynomial function passing through all of them. Basically this polynomial is the (unique) polynomial of lowest degree that ‘fits’ given data. This theroem is known as the ‘Lagrange interpolation theorem’ in numerical analysis. From hence forth by a set of $n$-coordinate pairs we refer to a set indexed by $0,1,\cdots,n-1$, such that the $x$-coordinates of all tuples in the set are distinct. It is well know that given a set of $2$-coordinate pairs one can find a unique linear function(a...