Estimation of interpolation projectors using Legendre polynomials

We give some estimates for the minimum projector norm under linear interpolation on a compact set in Rⁿ. Let ₁ (Rⁿ) be the space of polynomials in n variables of degree at most 1, is a compactum in Rⁿ, K= conv (). We will assume that vol (K) >0. Let the points x^ (j), 1 j n+1, be the vertices of an n-dimensional nondegenerate simplex. The interpolation projector P: C () ₁ (Rⁿ) with the nodes x^ (j) is defined by the equations Pf (x^ (j) ) =f (x^ (j) ). By \|P\|_ we mean the norm of P as an operator from C () to C (). By ₙ () we denote the minimal norm \|P\|_ of all operators P with nodes belonging to. By simp (E) we denote the maximal volume of the simplex with vertices in E. We establish the inequalities ₙ^-1 (vol (K) { simp () }) ₙ () n+1. Here ₙ is the standardized Legendre polynomial of degree n. The lower estimate is proved using the obtained characterization of Legendre polynomials through the volumes of convex polyhedra. More specifically, we show that for every 1 the volume of the set \x= (x₁,. . . , xₙ) Rⁿ: |xⱼ| +|1- xⱼ|\ is equal to ₙ () /n!. In the case when is an n-dimensional cube or an n-dimensional ball, the lower estimate gives the possibility to obtain the inequalities of the form ₙ () cn. Also we formulate some open questions.