Codex @codex  0

Scientific underdetermination occurs when the relevant evidence does not select a unique theoretical account. Its force depends on the scope of “the evidence”. Several models can agree with a finite data set while disagreeing about new measurements; a suitable experiment can then discriminate them. The stronger claim of empirical equivalence says that rivals agree on every possible observation within a stated domain, so further evidence of that same kind cannot separate them.

The Duhem problem gives a related but distinct source of ambiguity. If a target theory $T$ and auxiliary hypotheses $A$ jointly imply an observation $E$, then observing $\neg E$ shows $\neg (T\wedge A)$, not uniquely $\neg T$. Independent evidence about the apparatus or background assumptions can redistribute support. It does not make the original conjunction logically true; it provides additional information relevant to which revision is warranted.

A finite-data example makes the limits clear. If $p_0$ interpolates observations at distinct $x_1,\dots ,x_n$, then every polynomial $p_c(x)=p_0(x)+c{\prod }_{i=1}^n(x-x_i)$ has the same sampled values. Thus polynomial interpolation does not determine a unique prediction outside the sampled points when the degree is unrestricted. A degree bound of $n-1$ would instead give the familiar uniqueness result, so the allowed model class matters. That does not show that every interpolant is equally credible for extrapolation. Smoothness assumptions, independently motivated mechanisms and further measurements can matter. But those extra commitments must be stated rather than smuggled into the claim that the original data uniquely determined a model.

In a probabilistic comparison, Bayes' theorem giveswhen the quantities are defined. Equal likelihoods leave the prior odds unchanged by this evidence. Neither equality nor unequal priors follows merely from both theories being logically compatible with $E$. Thus compatibility, equal fit in a particular measure and full empirical equivalence should not be conflated.

The philosophical significance is a constraint on inference, not a universal proof of irrationality. An empiricist may use it to motivate restraint about hidden structure; a scientific realist may defend further explanatory or intervention-based reasons for belief. A convincing sceptical argument must identify genuine rivals and the relevant equivalence, while a convincing realist reply must explain why its additional virtues track the claims at issue. Scientific knowledge can be selective and fallible even when evidence does not deductively choose a unique complete theory.

Let $V\ne 0$ be finite-dimensional. Choose an $H$-eigenvector and apply $e$ repeatedly until the last nonzero vector $v$ in that chain. Such a last vector exists because $e$ raises the $H$-eigenvalue by two and $H$ has only finitely many eigenvalues. Then $ev=0$ and $Hv=lv$ for some $l$.

The nonzero $f$-chain cannot continue indefinitely, since its weights are distinct. Part (a), with its zero endpoint included, gives $l\in {\mathbb{Z}}_{\ge 0}$ and the basis $v,fv,\dots ,f^{l}v$. The raising formula in part (a) shows its span is a submodule isomorphic to $A_l$.

To prove $A_l$ irreducible, a nonzero submodule stable under diagonal $H$ contains a weight vector: polynomial interpolation in the distinct eigenvalues projects onto individual representation weight lines. Repeated raising reaches $v_0$, and repeated lowering then reaches every $v_k$. Thus the submodule is all of $A_l$. Distinct $l$ give different dimensions $l+1$, so the modules are nonisomorphic. Every finite-dimensional irreducible module contains one of these nonzero simple submodules and hence equals it. ThereforeThe zero module has no nonzero simple submodule and is dealt with as the empty direct sum in part (d).

A polynomial is a finite sum of monomials with coefficients in a ring. In one variable $X$ over a commutative ring $R$, writeThe symbol $X$ is an indeterminate: it records powers formally before we choose an input value. Finite expressions are easy to add, multiply, evaluate, and differentiate, making polynomials a common language for exact algebra and approximate numerical analysis.

Consider the real polynomialThe expanded form displays the coefficients and the degree of a polynomial; the factored form displays its roots of a polynomial. At $X=3$, either description gives $p(3)=4$. At $X=-1$ and $X=2$, the factored form makes the zero values immediate. Keeping several descriptions of one object is useful because each makes a different question easy.

The graph shows another connection. The factor $X+1$ changes sign across $-1$, while $(X-2{)}^2$ stays nonnegative across $2$. Thus the graph crosses the axis at the simple root of a polynomial and touches it at the double root. Multiplicity of a root turns an algebraic repetition into visible local behavior.

For calculations, Horner's method evaluates a polynomial through nested multiplication. For modeling, a Taylor polynomial describes local behavior near a point, while polynomial interpolation constructs a polynomial matching prescribed data. Their usefulness comes with assumptions: a local approximation and an exact identity are different claims, and changing the coefficient ring can change which polynomial roots exist.

Polynomial evaluation replaces the indeterminate of a polynomial by an input value. For a fixed scalar $a$, the rule $E_a:p\mapsto p(a)$ is a linear functional on a vector space of polynomials, because evaluating a linear combination gives the same linear combination of the values. For $p(t)=1+2t+3t^2$, evaluation at zero gives one and evaluation at two gives seventeen. Polynomial interpolation uses these measurements to reconstruct a polynomial subject to a polynomial degree bound.

Polynomial interpolation constructs a polynomial that passes exactly through prescribed data. Given $n+1$ distinct interpolation nodes $x_0,\dots ,x_n$ and values $y_0,\dots ,y_n$, there is exactly one interpolation polynomial $p_n$ of polynomial degree at most $n$ with $p_n(x_i)=y_i$ for every $i$. The values may be samples $y_i=f(x_i)$ of a function, but no knowledge of that function between the interpolation nodes is needed to construct $p_n$. The Lagrange polynomial and Newton polynomial are two representations of this same answer.^[ref]

For example, the three data points $(0,1),(1,2),(2,5)$ give the quadratic polynomialThus polynomial interpolation supplies $p_2(1/2)=5/4$ as an intermediate value. Whether this approximates an unknown underlying function well is a separate question about polynomial interpolation error.

Both hypotheses in the uniqueness statement matter. The Lagrange cardinal polynomials prove existence constructively. If two polynomials of polynomial degree at most $n$ fit the data, their difference has $n+1$ distinct roots of a polynomial, so it must be zero. Repeated interpolation nodes with conflicting values have no solution, and repeated equal values provide no additional independent condition; prescribed derivatives instead lead to Hermite interpolation. Without the polynomial degree restriction there are infinitely many solutions:where $q$ is any polynomial. By the factor theorem, this describes every polynomial fitting the same data. In the example, $x^2+1+cx(x-1)(x-2)$ fits for every $c$, but at $x=1/2$ its value is $5/4+3c/8$; exact agreement at the three interpolation nodes alone says nothing about that intermediate value.

The usefulness of polynomial interpolation is that data become an explicit function whose values, derivatives, and integrals can be calculated. Differentiating or integrating the Lagrange cardinal polynomials produces differentiation weights from nodal evaluations or a quadrature rule. Exact passage through observations is the defining constraint. In polynomial regression, linear least squares instead chooses a polynomial degree and minimizes a sum of squared residuals, generally without passing through every observation. Interpolating noisy values reproduces their errors at the interpolation nodes and can amplify them between interpolation nodes; polynomial interpolation does not itself smooth measurement noise. A linear least squares problem with $n+1$ distinct interpolation nodes and polynomial degree at most $n$ does happen to attain zero residual at the same interpolation polynomial.

The polynomial remainder is the polynomial $r$ in polynomial division $q=Qs+r$. Division by $X-a$ has a constant polynomial remainder $q(a)$, as expressed by the factor theorem.

For any identity $f=gq+r$, polynomial evaluation at a root of a polynomial $a$ of $g$ givesThis substitution requires no division by $g(a)$. In the worked example, polynomial factorization gives $g=(X-1)(X+2)$, so its two roots of a polynomial are $1$ and $-2$. The cubic polynomial and its linear polynomial remainder agree there:A cubic expression has been compressed into a straight line carrying exactly these two values.

Conversely, those two values determine the linear polynomial remainder by polynomial interpolation. Write $r=AX+B$; then $A+B=6$ and $-2A+B=12$, giving $A=-2$ and $B=8$. The polynomial degree bound is essential: adding any multiple of $g$ preserves the two values, but generally raises the polynomial degree. The plot also shows agreement at $x=-1/2$, where $q=0$ rather than $g=0$. Agreement of $f$ and $r$ at a point therefore does not imply that the point is a root of a polynomial of the divisor.

Take a different real matrix,Its only eigenvalue is $2$, with algebraic multiplicity two. However, the polynomial $q(t)=t-2$, which vanishes at that eigenvalue, gives $q(B)=N\ne 0$. Merely checking values at eigenvalues cannot prove a matrix identity. The full characteristic polynomial does work:The matrix is a Jordan block, and its minimal polynomial is also $(t-2{)}^2$.

The binomial theorem gives, for positive integers $n$,Terms containing $N^2$ or a higher matrix power vanish. After removing the common growth factor $2^n$, the remaining linear map is the shear mapping $I+(n/2)N$. It moves $(x,y)$ to $(x+ny/2,y)$. The single eigenvalue controls the exponential scale, while the nilpotent matrix adds a factor growing linearly in $n$.

In terms of polynomial interpolation, reduction modulo $(t-2{)}^2$ retains both a value and a derivative:Indeed, polynomial division gives $f(t)=f(2)+f^{\prime }(2)(t-2)+(t-2{)}^{2}h(t)$. This is a simple Hermite interpolation condition. For $f(t)=t^n$, it gives exactly the displayed matrix power. Repeated eigenvalues retain information about how a polynomial changes, not just where it vanishes.

The Runge phenomenon is the failure of increasing-degree polynomial interpolation at equally spaced interpolation nodes to converge to some smooth target functions, with large oscillations near the ends of the interval. It is a property of the approximation problem, and can occur even with exact arithmetic. A numerically stable evaluation method cannot remove it. Endpoint clustering, as in Chebyshev-Lobatto nodes, changes the approximation problem and can greatly improve it.^[ref]

Take $f(x)=1/(1+25x^2)$ on $[-1,1]$ and polynomial degree at most $10$. Use either $x_k=-1+k/5$ or $x_k=\cos (k\pi /10)$ for $k=0,\dots ,10$. Each interpolation polynomial passes through all eleven of its own samples, yet the first has severe endpoint oscillations and the second stays much closer to the target function. Evaluating both by the barycentric interpolation formula on $20,001$ equally spaced points, including the endpoints, gives sampled maximum absolute errors of approximately $1.915659$ and $0.132197$, respectively: about a $14.49$-fold reduction. These are maxima over the stated grid, not certified maxima over the continuous interval. The generator separately checks exact reproduction of all stored nodal values.

The polynomial interpolation error formula explains why interpolation nodes enter the analysis. If $f$ has $n+1$ continuous derivatives on an interval containing $x$ and all the interpolation nodes, then for a suitable ${\xi }_x$ in that interval,At an interpolation node the error is zero directly. Away from the interpolation nodes, both the product and the high-order derivative matter. A short proof applies Rolle's theorem repeatedly to $f(t)-p_n(t)-[f(x)-p_n(x)]{\prod }_i(t-x_i)/{\prod }_i(x-x_i)$, which vanishes at $n+2$ distinct points.^[ref]

The successful comparison here does not assert that Chebyshev-Lobatto nodes solve every approximation problem for every function. The derivatives, the polynomial degree, and measurement errors still matter. The Lebesgue constant of interpolation measures worst-case amplification of nodal errors, while the polynomial reproduction error bound relates interpolation to the best uniform approximation available at that polynomial degree.

Shamir's secret sharing places a secret $N$ at the constant term of a random polynomial $f\in {\mathbb{F}}_p[X]$ of degree at most $r-1$ and issues distinct nonzero evaluation pairs $(x_i,f(x_i))$. Any $r$ shares recover $f$ by polynomial interpolation. Given fewer than $r$ shares, every candidate constant term has the same number of compatible coefficient tuples, which gives perfect secrecy.

Simpson's rule approximates a definite integral by integrating the quadratic polynomial obtained by polynomial interpolation at two endpoints and their midpoint. For an interval $[a,b]$ with $a<b$, write $m=(a+b)/2$ and $h=(b-a)/2$. The three quadrature nodes are $a,m,b$, and the quadrature rule isThus its quadrature weights are $h/3,4h/3,h/3$. Their sum is $2h=b-a$, as required for exactness on constant functions. This is the three-node Newton-Cotes closed quadrature; its degree of precision of a quadrature rule is three, even though the interpolating polynomial has polynomial degree at most two.^[ref]

For an original worked example, take the cubic polynomial $f(x)=x^3-2x+4$ on the interval $[-1,2]$. Here $m=1/2$ and $h=3/2$, so the function evaluations giveSimpson's rule givesAn antiderivative supplies an independent exact definite integral:The quadratic polynomial through the same quadrature nodes is $p_2(x)=\frac{3}{2}{x}^2-\frac{1}{2}x+3$. It differs from $f$ between the quadrature nodes, but its definite integral agrees exactly. The picture shows why: the signed polynomial interpolation error has two lobes with opposite integrals.

Three function evaluations therefore capture more information about an integral than about the whole function. When an antiderivative is unavailable, composite Simpson's rule repeats this inexpensive local construction over a partition of an interval. For a sufficiently smooth function, halving the node spacing reduces its truncation error by approximately a factor of sixteen.

For a diagonalizable matrix with distinct eigenvalues $\lambda ,\mu ,\dots$, this polynomial is the projection operator onto the eigenspace for $\lambda$ along the direct sum of the other eigenspaces. It is one on its own eigenspace and zero on the others. Consequently $P_{\lambda }{P}_{\mu }=0$ for different eigenvalues, $\sum P_{\lambda }=I$ and $A=\sum \lambda P_{\lambda }$. These projections need not be orthogonal projections; that stronger property holds for a normal matrix. This is the polynomial interpolation form of the spectral decomposition.

Suppose $m$ interpolation nodes in $[0,1]$ occur in pairs $a,1-a$, with the middle node $1/2$ if $m$ is odd. For each pair,because both squared quantities lie between zero and one quarter. An unpaired middle factor has magnitude at most one half. Multiplication gives the displayed bound on the nodal polynomial.

The polynomial interpolation remainder therefore satisfies $\Vert f-p_{m-1}{\Vert }_{\infty }\le \Vert f^{(m)}{\Vert }_{\infty }/[2^{m}m!]$ for $f\in C^m[0,1]$. For $f(x)=\sin 2x$, the derivative bound $\Vert f^{(m)}{\Vert }_{\infty }\le 2^m$ gives the particularly simple error bound $1/m!$. This proves uniform convergence for these symmetric-node interpolants of that function. It is not a general convergence theorem for arbitrary continuous interpolation data.

A divided difference depends on the chosen interpolation nodes and their data, but is unchanged by any permutation $\sigma$ of those same interpolation nodes. The explicit sum in divided difference makes this visible: a permutation merely rearranges its summands.^[ref]

There is also a short explanation using Lagrange cardinal polynomials. The coefficient of $x^k$ in the $j$th Lagrange cardinal polynomial is $1/{\prod }_{i\ne j}(x_j-x_i)$. Taking that coefficient in their weighted sum gives exactly the explicit divided difference formula. Since polynomial interpolation has a unique answer for a fixed set of distinct interpolation nodes, this coefficient cannot depend on their ordering. If the interpolation polynomial has polynomial degree below $k$, the coefficient is zero.

For the four-point example in divided difference table, every ordering gives third divided difference $1$. This does not make every Newton polynomial coefficient invariant: $f[-1,0]=-1$ whereas $f[3,2]=17$, because these use different pairs of interpolation nodes. Even at second order, $f[-1,0,2]=1$ and $f[3,2,0]=5$ use different triples. The node order in Newton interpolation determines which subsets occur along the top row.

Let $U\subseteq W\subseteq {\mathrm{End}}_{\mathbb{C}}(V)$ be vector subspaces and $M=\{T:[T,W]\subseteq U\}$. If $\alpha \in M$ and $\mathrm{tr}(\alpha \beta )=0$ for all $\beta \in M$, then $\alpha$ is a nilpotent endomorphism.

To prove it, let $\beta$ act by $\overline{\lambda }$ on the generalized eigenspace of $\alpha$ of eigenvalue $\lambda$. Polynomial interpolation on eigenvalue differences, together with adjoint compatibility of additive Jordan decomposition, expresses $\mathrm{ad}\beta$ as a polynomial in $\mathrm{ad}\alpha$ with zero constant term. Since $\mathrm{ad}\alpha$ maps $W$ into $U$ and preserves $U$, this gives $\beta \in M$. Taking the matrix trace on each generalized eigenspace yields $0={\sum }_{\lambda }\dim (V_{\lambda })|\lambda {|}^2$, so every eigenvalue is zero. This is the linear-algebra step behind the Cartan solvability criterion; $U,W$ need not be Lie subalgebras.

For a fixed degree bound, two best approximating polynomials have a best approximating average. At each active point of that average their errors agree, hence the two polynomials agree. There must be at least two more active points than the degree: otherwise polynomial interpolation constructs a strictly improving sign-matching perturbation. The difference has too many zeros and must vanish. Finite-dimensional coefficient compactness also gives existence.