We give some estimates for the minimal projector norm under linear interpolation on a compact subset of {R^n}. Let { ₁} ({R^n}) be the space of polynomials in n variables of degree at most 1, is a compactum in {R^n}, and K = conv (). We will assume that vol (K) > 0. Let {x^{ (j) }}, 1 j n + 1, be the vertices of an n -dimensional nondegenerate simplex. The interpolation projector P: C () { ₁} ({R^n}) with the nodes {x^{ (j) }} is defined by the equalities 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. Let sim{{p}₍} () be the maximum volume of a simplex with vertices in. We establish the inequalities ₍^{ - 1} ({{vol (K) }{{sim{{p}₍} () }}}) { ₍} () n + 1. Here { ₍} is the standardized Legendre polynomial of degree n. The lower estimate is proved using the obtained characterization of the 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^n}: | {{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 { ₍} () c n. Also we formulate some open questions.
M. V. Nevskii (Mon,) studied this question.