Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. H.-J. Rack and R. Vajda, Optimal cubic Lagrange interpolation: Extremal node systems with minimal Lebesgue constant, Stud. Univ. Babeş-Bolyai Math. 60 (2015), no. 2, 151--171; the edition read is named on the source card.
Statement
Setting. is the right endpoint of the parameter interval in Theorem 4.2; is the constant (3.5) of the optimal canonical system . In the proof of Theorem 5.2 (p. 165) is the point where the Lebesgue function of that canonical system, there (6.6), equals .
Lemma 4.3 (p. 157). is the unique positive root of the degree-18 integer polynomial
and numerically (4.3); (4.6) on p. 158 gives more digits.
Lemma 4.4 (pp. 157-158). is given by radicals in terms of as
which is the printed (4.4) with its two repeated subexpressions named and . Substituting (3.5) for gives a long expression for by radicals alone, printed as (4.5) on p. 158.
Proof pointer
Lemma 4.3: Section 6.4, p. 166. Mathematica's RootReduce applied to the equation (6.6) , with and given as roots of (3.1) and of (input (6.10)), returns (output (6.11)). Lemma 4.4: Section 6.5, p. 167. With (3.9), the equation becomes the cubic (6.13), solved by Cardan's formula.
Read depth
Claims checked: both lemmas and (4.2) were read on the page image of the print, and the coefficients of (4.2) were matched against the printed output (6.11). The computer-algebra steps were not re-run, and (4.5) was not transcribed or checked. Nothing here is independently reviewed.
Dependencies
The cubic constants (3.1)-(3.9), recorded by the paper from its references [23], [24], [29], [30]; see the Theorem 5.2 page.
Bears on
- Problem 1129: the lemmas identify the constant that bounds the parameter ranges in the paper's description of all minimizing four-node systems (Theorem 5.2).