The problem of formulating embedding theorems for main spaces of differentiable functions defined in a domain of the Euclidean space En is connected to the problem of finding an extremal (in a certain sense) n -dimensional vector satisfying a number of linear constraints determined by three groups of parameters: parameters of the original class of functions, parameters characterizing the embedding, and parameters characterizing some properties of the domain of the functions. Determination of the extremal vector is reduced to a linear programming problem. The vector thus obtained determines the form of the inequalities which determine the embedding under given relations between parameters. In those cases where this vector does not coincide with the extremal vector found for the same values of parameters of the original class of functions but for the domain G=En there is a kind of saturation of properties of the type of embedding theorems. An example is given, in which the linear programming problem is solved by the simplex method.
Read full abstract