Intuition The ONE core idea
Interpolation is the art of drawing one smooth curve through a handful of dots — and that curve is a polynomial , a sum of powers of x . Everything else on the parent page (Lagrange switches, Newton's slope-of-slopes, the error formula) is just two different ways to write down that same curve plus a way to measure how far it strays between the dots.
This page assumes you know nothing beyond "x times x is x 2 " and "a graph has a horizontal axis and a vertical axis". Every letter, subscript, product sign and squiggle used by the parent note is built here, from the floor up, in the order you need them.
Before any symbol: we have a piece of graph paper. A few dots are marked. We want a rule — a function — whose graph is a single connected curve touching every dot.
Look at the amber dots. There are infinitely many wiggly curves through them, but only one polynomial of a chosen low degree. That uniqueness is the whole reason the topic works — hold that thought.
Definition Point and coordinates
A point on graph paper is a location. We name it by two numbers: how far right (x ) and how far up (y ). Written ( x , y ) .
The picture: pick a dot. Walk right along the horizontal axis until you're under it — that distance is x . Then walk up — that distance is y .
Why the topic needs it: our data is a list of dots, so every dot needs a name.
A subscript is a tiny label glued to the bottom of a letter to say which one . x 0 means "the x of dot number 0", x 1 means "the x of dot number 1", and so on. It is not a power; x 2 = x ⋅ x .
The picture: imagine numbered tags hanging off each dot: dot 0, dot 1, dot 2. We start counting at 0 (a computing habit) so that "n + 1 dots" are numbered 0 , 1 , … , n .
x 2 means x squared."
Why it feels right: both put a small number near x . The fix: a power sits at the top-right (x 2 ); a label sits at the bottom (x 2 ). Top = multiply, bottom = which one.
f and the letter y i
Often the dots come from some underlying function f — a machine that takes a number x and returns a number f ( x ) . Our data heights are just its outputs at the nodes:
y i = f ( x i ) .
So "y i " and "f ( x i ) " are two names for the same height of dot i . When we later write f [ … ] (square brackets), that f is this same function , sampled at the listed nodes.
The picture: think of f as the true hidden curve; our dots are just a few places where we peeked at its height. Interpolation tries to guess the rest of f from those peeks.
Why the topic needs it: the error formula and the divided differences f [ … ] all speak about this hidden f — so f must exist as a named object before those symbols appear.
A polynomial is a sum of terms, each a number times a whole-number power of x :
P ( x ) = a 0 + a 1 x + a 2 x 2 + ⋯ + a n x n .
The numbers a 0 , … , a n are the coefficients — the dials you can turn. P ( x ) is read "P of x": feed in a number x , get out a number.
The degree is the highest power that actually appears. 3 x − 1 has degree 1 (a straight line); − 2 x 2 + 11 x − 7 has degree 2 (a parabola). We write deg P ≤ n to mean "degree at most n ".
The picture below shows how degree controls how many bends a curve can make.
Intuition Coefficients are free dials
A degree-≤ n polynomial has n + 1 coefficients a 0 , … , a n — that's n + 1 dials. Matching n + 1 dots gives n + 1 demands. Same count of dials and demands ⇒ exactly one setting works. This "n + 1 = n + 1 " balance is why one polynomial exists .
Why the topic needs it: the whole subject is choosing these dials so the curve hits the dots.
n and ≤
n is just a placeholder for however many dots minus one . With n + 1 dots numbered 0 … n , the top index is n . The symbol ≤ means "less than or equal to".
Definition Distinct nodes
The x -values x 0 , … , x n are the nodes . Distinct means no two are equal: x i = x j whenever i = j . Two dots may share a height y , but never a position x .
The picture: two dots stacked in the same vertical line would demand the curve be at two heights above one x — impossible for a function. That's why nodes must be spread out horizontally.
Why the topic needs it: distinctness is exactly what makes the solution unique (next section) — the denominators x i − x j in Lagrange are never zero, and the Vandermonde determinant is nonzero.
The parent note leans hard on two symbols. They are just shorthand for "do this repeatedly".
Definition Sigma — the sum sign
∑
∑ i = 0 n t i = t 0 + t 1 + ⋯ + t n .
Read it: "start i at 0, run to n , add up every t i ." The letter under ∑ is the counter; the number on top is where to stop.
Definition Pi — the product sign
∏
∏ i = 0 n t i = t 0 ⋅ t 1 ⋯ t n .
Same loop, but multiply instead of add.
The condition j = 0 j = i ∏ just means "multiply over all j except j = i ". The picture: a row of factors with one gap punched out where j = i .
Worked example Reading a product concretely
With nodes x 0 = 1 , x 1 = 3 , x 2 = 4 , the product ∏ j = 1 ( x − x j ) = ( x − 1 ) ( x − 4 ) — we skipped the j = 1 factor ( x − 3 ) .
Why the topic needs it: Lagrange's basis is a product; Newton's polynomial is a sum of products. These two loops are the entire notation of the parent formulas.
Now that we have the product sign, we can meet the symbol L i that the parent page (and the map below) uses.
Definition Lagrange basis polynomial
L i ( x )
L i ( x ) is a special polynomial designed to be a switch : it equals 1 at its own node x i and 0 at every other node. The explicit formula uses the "skip j = i " product:
L i ( x ) = ∏ j = 0 j = i n x i − x j x − x j .
Why this formula does the job, in two moves:
The numerator ∏ j = i ( x − x j ) is zero whenever x lands on one of the other nodes — that gives the "0 elsewhere".
Dividing by ∏ j = i ( x i − x j ) (the numerator's value at x = x i ) scales it to exactly 1 at x i .
Worked example A switch with three nodes
Nodes x 0 = 1 , x 1 = 3 , x 2 = 4 . Then
L 1 ( x ) = ( 3 − 1 ) ( 3 − 4 ) ( x − 1 ) ( x − 4 ) = − 2 ( x − 1 ) ( x − 4 ) .
Check: at x = 3 the top is ( 2 ) ( − 1 ) = − 2 , so L 1 ( 3 ) = − 2/ − 2 = 1 ✔; at x = 1 and x = 4 the top is 0 ✔.
Why the topic needs it: stacking these switches, each scaled by its height, forces a curve through every dot — that is exactly the Lagrange interpolant on the parent page.
Intuition The system of demands
Demanding P ( x i ) = y i for each dot writes one equation per dot:
a 0 + a 1 x i + a 2 x i 2 + ⋯ + a n x i n = y i .
Stacking all n + 1 of these is a grid of the powers of the nodes.
Definition The Vandermonde matrix
A matrix is just a rectangular grid of numbers. Stacking the demands row by row gives the Vandermonde matrix : row i holds the powers of node x i .
1 1 ⋮ 1 x 0 x 1 x n x 0 2 x 1 2 x n 2 ⋯ ⋯ ⋯ x 0 n x 1 n ⋮ x n n a 0 a 1 ⋮ a n = y 0 y 1 ⋮ y n .
Definition Determinant — the "solvable?" number
The determinant of a square grid is a single number built from its entries. Its only job here: if the determinant is not zero , the system has exactly one solution (the dials a k are pinned down); if it is zero, the grid is defective and no unique answer exists.
For the Vandermonde grid this number works out to a product over all ordered pairs of nodes:
det = ∏ i < j ( x j − x i ) .
Definition The indexing condition
i < j
∏ i < j means "multiply one factor for every pair of nodes, taking the earlier-numbered node as i and the later one as j ". Writing i < j (instead of all i , j ) makes sure each pair is counted once and never pairs a node with itself.
Worked example The product
∏ i < j ( x j − x i ) for three nodes
Nodes x 0 = 1 , x 1 = 3 , x 2 = 4 . The pairs with i < j are ( 0 , 1 ) , ( 0 , 2 ) , ( 1 , 2 ) :
( x 1 − x 0 ) ( x 2 − x 0 ) ( x 2 − x 1 ) = ( 3 − 1 ) ( 4 − 1 ) ( 4 − 3 ) = 2 ⋅ 3 ⋅ 1 = 6 = 0.
Non-zero ⇒ a unique polynomial exists. If any two nodes were equal, one factor would be 0 and the whole product would collapse to 0 .
Why the topic needs it: this non-zero product is the exact statement of "distinct nodes ⇒ one and only one interpolating polynomial".
Newton's divided differences are built on the idea of slope , applied to the hidden function f from §2.
Definition Slope between two dots (secant slope)
x 1 − x 0 y 1 − y 0 = change in right-step change in height .
It answers: how steep is the straight line joining these two dots? Rise over run.
Definition Divided differences
f [ … ] (with formulas)
The bracket f [ ⋅ ] reads "the divided difference of f over the listed nodes". Built in layers:
Zeroth order (just a height): f [ x i ] = y i = f ( x i ) .
First order (a secant slope):
f [ x 0 , x 1 ] = x 1 − x 0 f [ x 1 ] − f [ x 0 ] = x 1 − x 0 y 1 − y 0 .
Second order (a slope of slopes):
f [ x 0 , x 1 , x 2 ] = x 2 − x 0 f [ x 1 , x 2 ] − f [ x 0 , x 1 ] .
In general, drop the leftmost node and the rightmost node to get two shorter brackets, subtract them, and divide by the gap between the outermost nodes:
f [ x 0 , … , x k ] = x k − x 0 f [ x 1 , … , x k ] − f [ x 0 , … , x k − 1 ] .
Intuition Why "slope of slopes"
A first divided difference f [ x 0 , x 1 ] is the secant slope above. The second, f [ x 0 , x 1 , x 2 ] , compares two neighbouring slopes and asks "how fast is the slope itself changing?" — that is curvature, exactly what an x 2 term supplies. So Newton's coefficients are these brackets.
Worked example A second divided difference by the formula
Data ( 1 , 2 ) , ( 3 , 8 ) , ( 4 , 5 ) :
f [ x 0 , x 1 ] = 3 − 1 8 − 2 = 3 , f [ x 1 , x 2 ] = 4 − 3 5 − 8 = − 3 ,
f [ x 0 , x 1 , x 2 ] = 4 − 1 − 3 − 3 = − 2.
Why the topic needs it: these numbers 2 , 3 , − 2 are precisely Newton's coefficients on the parent page.
Definition Kronecker delta
δ ik
δ ik = 1 when i = k , and δ ik = 0 when i = k . A compact way to say "on only when the labels agree" — exactly the switch behaviour of L i at the nodes: L i ( x k ) = δ ik .
The error formula uses two more symbols. You only need to recognise them here; Taylor series develops them fully.
( n + 1 )!
( n + 1 )! = 1 ⋅ 2 ⋅ 3 ⋯ ( n + 1 ) : multiply every whole number up to n + 1 . E.g. 3 ! = 6 . It appears because each round of "matching a derivative" divides by one more counting number.
Definition The superscript
f ( k ) — the k -th derivative
A derivative measures instantaneous slope. The notation f ( k ) (with the exponent in parentheses ) means "take the derivative of f a total of k times". The parentheses are a deliberate signal: f ( 2 ) is the second derivative , not f squared (f 2 would mean f ⋅ f ). So f ( 0 ) = f , f ( 1 ) = slope, f ( 2 ) = how the slope bends, and so on. See Numerical differentiation .
Definition The mystery point
ξ
ξ (Greek letter "xi", said "ksy") is just a name for some unknown point sitting somewhere between the nodes. In the error formula f ( n + 1 ) ( ξ ) means "the ( n + 1 ) -th derivative of f , evaluated at that unknown in-between point". We rarely know ξ exactly; we only need that it exists .
Why the topic needs it: together ( n + 1 )! f ( n + 1 ) ( ξ ) scales the product ∏ ( x − x i ) into the actual gap between the true function f and P ( x ) — the Runge phenomenon is this product growing near interval ends.
Points and coordinates (x_i, y_i)
Hidden function f with y_i = f(x_i)
n+1 coefficients = n+1 dials
Distinct nodes x_i not equal
Vandermonde determinant nonzero
Unique interpolating polynomial
Sum sign and product sign
Divided differences f brackets
Factorial and derivatives f^(k)
Interpolation error with xi
Read top-to-bottom: naming dots, the hidden function f , and powers gives dials; distinct nodes make the dial-setting unique via a non-zero determinant; the two loop-symbols dress that unique curve as Lagrange switches L i or Newton brackets f [ … ] ; slopes feed Newton; factorial and derivatives measure the leftover error at the mystery point ξ .
Cover the right side and test yourself.
What does the subscript in x 3 tell you? It labels which dot (dot number 3); it is not a power.
How are y i and f ( x i ) related? They are the same number — y i is the height of dot i , and f is the hidden function that produced it, so y i = f ( x i ) .
What is the degree of − 2 x 2 + 11 x − 7 ? 2 — the highest power that appears.
How many coefficients (free dials) does a degree-≤ n polynomial have? n + 1 , namely a 0 , … , a n .
What does "distinct nodes" mean and why is it required? No two x i are equal; otherwise a function would need two heights at one position, and the Vandermonde determinant would vanish.
Give the formula and the "switch" property of L i ( x ) . L i ( x ) = ∏ j = i x i − x j x − x j ; it is 1 at x i and 0 at every other node.
Expand ∑ i = 0 2 y i L i ( x ) . y 0 L 0 ( x ) + y 1 L 1 ( x ) + y 2 L 2 ( x ) .
Expand ∏ j = 0 j = 1 2 ( x − x j ) for that range. ( x − x 0 ) ( x − x 2 ) — skip the j = 1 factor.
What does the condition i < j under ∏ ensure? Each pair of nodes is used exactly once and no node is paired with itself.
What is a secant slope in words? Rise over run: change in height divided by change in horizontal position between two dots.
Write the second divided difference f [ x 0 , x 1 , x 2 ] as a formula. x 2 − x 0 f [ x 1 , x 2 ] − f [ x 0 , x 1 ] .
What does the Kronecker delta δ ik equal? 1 if i = k , otherwise 0.
Compute 3 ! . 1 ⋅ 2 ⋅ 3 = 6 .
What does f ( 2 ) mean, and how is it different from f 2 ? f ( 2 ) is the second derivative (differentiate twice); f 2 would mean f multiplied by itself.
What is ξ in the error formula? An unknown point somewhere between the nodes at which the ( n + 1 ) -th derivative is evaluated; we only need that it exists.
Why does a unique interpolating polynomial exist for n + 1 distinct nodes? n + 1 dials matched to n + 1 demands via a Vandermonde system whose determinant ∏ i < j ( x j − x i ) is non-zero gives exactly one solution.
Parent topic
Vandermonde matrix — the grid that guarantees uniqueness.
Runge phenomenon — what the error product does near the ends.
Chebyshev nodes — smarter node placement.
Cubic splines — piecewise low-degree alternative.
Numerical differentiation — where derivatives come from.
Newton-Cotes quadrature — integrating the interpolant.
Taylor series — factorials and derivatives, developed fully.