Return to Article Details On the interpolation in linear normed spaces using multiple nodes

On the Interpolation in Linear Normed Spaces
using multiple nodes

Adrian Diaconu $^{*}$

April 10, 2015.

$^{*}$ Babeş-Bolyai University, Faculty of Mathematics and Computer Science, M. Kogălniceanu St, No. 1, 3400 Cluj-Napoca, Romania, e-mail: adiaconu@math.ubbcluj.ro.

Dedicated to prof. I. Păvăloiu on the occasion of his 75th anniversary

In the papers [ 2 ] , [ 3 ] , [ 4 ] , [ 6 ] , [ 7 ] we indicated a method of extending the notion of interpolation polynomial to the case of a non-linear mapping $f : X \to Y$ where $X$ and $Y$ are linear spaces with special structures. This extension offers the possibility to establish, in this general and abstract case as well, the main properties known in the case of the interpolation of real functions.

To switch to the case using multiple nodes, case that compulsorily uses the notion of Fréchet differential of the first order as well as of higher orders, we will point out the definition and certain properties of these differentials. On this basis we can present the manner of building an abstract interpolation polynomial with multiple nodes.

MSC. 41A05, 46B70.

Keywords. interpolation in linear normed spaces, multiple nodes.

1 Introduction

The topic of the interpolation of the functions defined between linear spaces or between linear normed spaces has been approached by Păvăloiu, I. in [ 9 ] , [ 10 ] , [ 11 ] Prenter, M. in [ 12 ] , Argyros, I. K. [ 1 ] , Makarov, V. L., Hlobistov, V. V. [ 8 ] and by myself in [ 2 ] , [ 3 ] , [ 4 ] , [ 6 ] , [ 7 ] .

We will recall the elements of the construction of the abstract interpolation polynomial with simple nodes.

Let us consider $X$ and $Y$ two linear spaces and $f : X \to Y$ a non-linear mapping.

We note by $L (X, Y)$ the set of the linear mappings from $X$ to $Y$ and by ${(X, Y)}^{*}$ the subset of $L (X, Y)$ that contains linear and continuous mappings from $X$ to $Y .$

For $n \geq 2$ we introduce the set $L_{n} (X, Y) = L (X, L_{n - 1} (X, Y))$ with
$L_{1} (X, Y) = L (X, Y)$ and similarly ${(X^{n}, Y)}^{*} = {(X, {(X^{n - 1}, Y)}^{*})}^{*}$ with
${(X^{1}, Y)}^{*} = {(X, Y)}^{*} .$

For $n = 2$ the set $L_{2} (X, Y)$ represents the set of the bi-linear mappings from $X \times X$ to $Y .$

Let $θ_{X}$ and $θ_{Y}$ be the null elements of the space $X$ and $Y$ respectively. We will note by $Θ_{n}$ the null element of the space $L_{n} (X, Y) .$ For $n = 1$ we will use the notation $Θ .$

Let us consider now the bilinear mapping $B \in L_{2} (Y, Y)$ that verifies
$B (u, v) = B (v, u)$ for any $u, v \in Y$ and $B (B (u, v), w) = B (u, B (v, w))$ for any $u, v, w \in Y .$

We will now suppose the following properties:

there exists $u_{0} \in Y$ the identity element of the semi-group $(Y, B)$ and as well $Y_{0} \subseteq Y$ with $u_{0} \in Y_{0}$ so that $(Y_{0}, B)$ form a group.
there exists $X_{0} \subseteq X$ and the linear and bijective mapping $U_{0} : X_{0} \to Y_{0} .$
there exists the linear mapping $U : X \to Y$ so that ${U |}_{X_{0}} = U_{0} .$

Using the mappings $U \in L (X, Y)$ and $B \in L_{2} (Y, Y)$ we will introduce the sequence ${(A_{n})}_{n \in N}$ with $A_{n} : X^{n} \to Y$ where $A_{n} \in L_{n} (X, Y)$ so that:

\begin{array}{ll} A_{1} (y) = U (y), & for\ y \in X; \\ A_{n} (y_{1}, \dots, y_{n}) = B (A_{n - 1} (y_{1}, \dots, y_{n - 1}), U (y_{n})), & for\ y_{1}, \dots, y_{n} \in X . \end{array}

We consider now the points $x_{0}, x_{1}, \dots, x_{n} \in X_{0}$ and the mapping:

w_{0, n} : X \to Y, w_{0, n} (x) = A_{n + 1} (x - x_{0}, \dots, x - x_{n})

and for any $i \in {0, 1, \dots, n}$ the mappings:

\begin{matrix} w_{0, n}^{'} (x_{i}) \in L (X, Y), \\ w_{0, n}^{'} (x_{i}) h = A_{n + 1} (x_{i} - x_{0}, \dots, x_{i} - x_{i - 1}, x_{i} - x_{i + 1}, \dots, x_{i} - x_{n}, h), \end{matrix}

noting that $w_{0, n}^{'} (x_{i})$ represents the Fréchet differential of the mapping defined by $(???),$ evidently in the case where $X$ and $Y$ are linear normed spaces.

A first result from [ 2 ] , [ 7 ] shows that the restrictions to $X_{0}$ of the mappings $(???)$ have values in $Y_{0}$ and are bijective, so we can speak of

w_{0, n}^{'} {(x_{i})}^{- 1} : Y_{0} \to X_{0}

and this mapping can be prolonged through linearity to $s p (Y_{0})$ and in the case where $Y$ has a topological structure (for example it is a linear normed space), the prolongation can be extended to $c l (s p (Y_{0})) .$

If we denote by $Y_{1}$ the maximal subspace from $Y$ to which the introduced mappings can be extended and we suppose that for any $i \in {0, 1, . . ., n}$ we have $f (x_{i}) \in Y_{1}$ and we can define the mappings:

\begin{aligned} L (x_{0}, x_{1}, . . ., x_{n}; f) : X \to Y; \\ L (x_{0}, x_{1}, . . ., x_{n}; f) (x) = \\ = \sum_{i = 0}^{n} A_{n + 1} (x - x_{0}, . . ., x - x_{i - 1}, x - x_{i + 1}, . . ., x - x_{n}; Z_{n, i}), \end{aligned}

where:

Z_{n, i} = w_{0, n}^{'} {(x_{i})}^{- 1} f (x_{i})

and these mappings verify, for any $i = \overset{―}{0, n},$ the equalities:

L (x_{0}, x_{1}, . . ., x_{n}; f) (x_{i}) = f (x_{i}) .

Because $A_{n + 1} \in L_{n + 1} (X, Y),$ there exists $D_{0} \in Y$ and for any $k \in {1, 2, \dots,$ $n}$ the mappings $D_{k} : X^{k} \to Y$ so that:

D_{k} x^{k} = D_{k} (\underset{k times}{\underset{⏟}{x, \dots, x}}),

we will have:

L (x_{0}, x_{1}, \dots, x_{n}; f) (x) = \medskip D_{n} x^{n} + D_{n - 1} x^{n - 1} + \dots + D_{1} x + D_{0} .

The relation $(???)$ is the expression of the character of an abstract polynomial of the mapping $(???)$ , so this relation together with the relation $(???)$ prove the fact that this mapping can be denominated an abstract interpolation polynomial.

2 The Fréchet differential of a mapping. Special properties

Let us consider the linear normed spaces $(X, {‖ \cdot ‖}_{X})$ and $(Y, {‖ \cdot ‖}_{Y}) .$ We consider as well the nonlinear mapping $f : X \to Y$ with $D \subseteq X .$ For $x \in D$ let be the set:

E_{D, x} = {h \in X : x + h \in D} .

First we will have the following:

Definition 1

The mapping $f : D \to Y$ admits a Fréchet differential in the point $x \in D,$ if there exists $T \in {(X, Y)}^{*}$ and $ω : D \times (E_{D, x} ╲ {θ_{X}}) \to Y$ so that:

f (x + h) - f (x) = T (h) + {‖ h ‖}_{X} ω (x, h)

and:

lim_{h \to θ_{X}} {‖ ω (x, h) ‖}_{Y} = 0.

For the mapping $T \in {(X, Y)}^{*}$ we have:

Remark 2

We can easily prove that there exists at most a mapping $T \in {(X, Y)}^{*}$ that corresponds to the requirements of the Definition 1.â–¡

In this way Definition 1 is completed with:

Definition 3

The mapping $T \in {(X, Y)}^{*}$ from Definition 1 that is attached to the function $f : D \to Y$ and to the point $x,$ is called the Fréchet differential of this mapping at the point $x,$ and is denoted through $f^{'} (x) .$

Now we have:

Remark 4

Usually there exists a subset $A \subseteq D$ so that for any $u \in A,$ the function $f : D \to Y$ is Fréchet differentiable at every point $u .$ In this case it is possible to define the function:

d f : A \to {(X, Y)}^{*}, d f (u) = f^{'} (u) .

The definition of the previous function allows for the introduction of differentials with higher orders.â–¡

Thus we have:

Definition 5

Besides the data from Definition 1 let us consider a number $p \in N .$

If:

there exists $V$ a neighborhood of the point $x \in D,$ so that for any $u \in V \cap D$ there exists the differential of the order $p - 1$ of the mapping $f : D \to Y$ at the point $u,$ denoted by $f^{(p - 1)} (u) \in {(X^{p - 1}, Y)}^{*},$ so the function:

$d^{p - 1} f : V \cap D \to {(X^{p - 1}, Y)}^{*}; (d^{p - 1} f) (u) = f^{(p - 1)} (u)$
7

is defined;
the function defined by $(???)$ is a differential (of the first order) at the point $x;$ then we can say that the mapping $f : D \to Y$ admits a differential with the order $p$ at the point $x$ and in this case:

$f^{(p)} (x) := {(d^{p - 1} f)}^{'} (x) = {(f^{(p - 1)})}^{'} (x) \in {(X, {(X^{p - 1}, Y)}^{*})}^{*} = {(X^{p}, Y)}^{*} .$

In the paper [ 5 ] , we have established certain properties of the Fréchet differentials of higher orders, which are relevant for the statements below.

We will recall some of these properties.

I) Let us consider the bilinear and symmetrical mapping $B \in L_{2} (Y, Y)$ together with the non-linear mappings $f, g : D \to Y$ with $D \subseteq X .$

With the aid of this mappings we consider:

F : D \to Y, F (x) = B (f (x), g (x)) .

We have the following proposition:

Proposition 6

If the non-linear mappings $f, g : D \to Y$ admit Fréchet differential up to the order $n,$ included, at the point $x \in D,$ then the mapping introduced by $(???)$ admits a Fréchet differential up to the same order $n,$ at the same point $x$ , and for any $h_{1}, \dots, h_{n} \in X$ we have:

\begin{equation} F^{\left( n\right) }\left( x\right) h_{1}...h_{n} ={\sum \limits _{k=0}^{n}} \; {\sum \limits _{1\leq i_{1}<... 9

where, for a fixed $i_{1}, i_{2}, . . ., i_{k} \in N$ with $1 \leq i_{1} < . . . < i_{k} \leq n,$ we will choose ${j_{1}, . . ., j_{n - k}} \in {1, . . ., n} ╲ {i_{1}, . . ., i_{k}}$ with $j_{1} < . . . < j_{n - k} .$

For the case $h_{1} = . . . = h_{n} = h$ we have:

F^{(n)} (x) h^{n} = \sum_{k = 0}^{n} (\binom{n}{k}) B (f^{(k)} (x) h^{k}, g^{(n - k)} (x) h^{n - k})

We can notice that the equation $(???)$ represents an extension of the well-known Leibnitz derivation formula.

II) It is necessary to generalize the property expressed by Proposition 6.

For this extension let us consider the sequence of mappings ${(Q_{m})}_{m \in N, m \geq 2}$ with $Q_{m} \in L_{m} (X, Y)$ and:

\begin{array}{l} Q_{2} (u_{1}, u_{2}) = B (u_{1}, u_{2}); \\ Q_{m} (u_{1}, . . ., u_{m}) = B (Q_{m - 1} (u_{1}, . . ., u_{m - 1}), u_{m}), m \in N, m \geq 2, \end{array}

where by $u_{1}, . . ., u_{m}$ we have denoted arbitrary elements of $Y .$

We will now consider the natural numbers $p, s$ with $s \leq p$ and the set of distinct elements:

H = {x_{1}, x_{2}, . . ., x_{p}} .

We introduce the set:

C_{p, s} (H) = {(x_{i_{1}}, . . ., x_{i_{s}}) \in H^{s} : 1 \leq i_{1} < i_{2} < . . . < i_{s} \leq p}

and obviously:

| C_{p, s} (H) | = \frac{p!}{s! (p - s)!},

where $| H |$ denotes the number of elements of the set $H .$

Let us now consider $m \in N$ and $α_{1}, . . ., α_{m} \in N$ so that $α_{1} + . . . + α_{m} = n$ and to start with we denote:

{\begin{cases} H_{1} = {1, 2, . . ., n}; p_{1} = n; \\ G_{1} = {(i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}) \in H_{1}^{α_{1}} : i_{1}^{(1)} < . . . < i_{α_{1}}^{(1)}} . \end{cases}

For a fixed $(i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}) \in G_{1}$ we choose:

{\begin{cases} H_{2} = {1, 2, . . ., n} ╲ {i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}}; p_{2} = n - α_{1}; \\ G_{2} = {(i_{1}^{(2)}, . . ., i_{α_{2}}^{(2)}) \in H_{2}^{α_{2}} : i_{1}^{(2)} < . . . < i_{α_{2}}^{(2)}} . \end{cases}

For $k \in N, k \leq m$ and a fixed

(i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}) \in G_{1}, . . ., (i_{1}^{(k - 1)}, . . ., i_{α_{k - 1}}^{(k - 1)}) \in G_{k - 1}

we choose:

{\begin{cases} H_{k} = {1, 2, . . ., n} ╲ {i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}, . . ., i_{1}^{(k - 1)}, . . ., i_{α_{k - 1}}^{(k - 1)}}; \\ p_{k} = n - (α_{1} + . . . + α_{k - 1}); \medskip \\ G_{k} = {(i_{1}^{(k)}, . . ., i_{α_{k}}^{(k)}) \in H_{k}^{α_{k}} : i_{1}^{(k)} < . . . < i_{α_{k}}^{(k)}} . \end{cases}

Finally, for a fixed $(i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}) \in G_{1}, . . ., (i_{1}^{(m - 1)}, . . ., i_{α_{m - 1}}^{(m - 1)}) \in G_{m - 1}$ we choose:

{\begin{cases} H_{m} = {1, 2, . . ., n} ╲ {i_{1}^{(1)}, . . ., i_{α_{1}}^{(1)}, . . ., i_{1}^{(m - 1)}, . . ., i_{α_{m - 1}}^{(m - 1)}}; \medskip \\ p_{m} = n - (α_{1} + . . . + α_{m - 1}); \medskip \\ G_{m} = {(i_{1}^{(m)}, . . ., i_{α_{m}}^{(m)}) \in H_{m}^{α_{m}} : i_{1}^{(m)} < . . . < i_{α_{m}}^{(m)}} . \end{cases}

It is clear that for any $k \in N$ we have $G_{k} \in C_{p_{k}, α_{k}} (H_{k})$ and consequently:

| G_{k} | = \frac{p_{k}!}{α_{k}! (p_{k} - α_{k})!} = \frac{[n - (α_{1} + \dots + α_{k - 1})]!}{α_{k}! [n - (α_{1} + \dots + α_{k - 1} + α_{k})]!} .

Let us denote by $A_{n}^{[α_{1}, \dots, α_{m}]}$ the set of all systems $(G_{1}, \dots, G_{m}),$ where for any $i \in {1, 2, \dots, m}$ the system of indexes $G_{i}$ obtained in the aforementioned manner.

It is obvious that:

\begin{aligned} | A_{n}^{[α_{1}, \dots, α_{m}]} | & = | G_{1} | \cdot . . . \cdot | G_{m} | = \prod_{k = 1}^{m} \frac{p_{k}!}{α_{k}! (p_{k} - α_{k})!} \\ = \frac{1}{α_{1}! . . . α_{m}!} \prod_{k = 1}^{m} \frac{[n - (α_{1} + . . . + α_{k - 1})]!}{[n - (α_{1} + . . . + α_{k - 1} + α_{k})]!} \\ = \frac{1}{α_{1}! . . . α_{m}!} \cdot \frac{n!}{(n - (α_{1} + . . . + α_{m}))!} . \end{aligned}

But $(n - (α_{1} + \dots + α_{m}))! = (n - n)! = 0! = 1,$ so:

| A_{n}^{[α_{1}, \dots, α_{m}]} | = \frac{n!}{α_{1}! . . . α_{m}!} .

Let us consider now the non-linear mappings $f_{i} : A \to Y,$ for $i = \overset{―}{1, m}$ where $A \subseteq X .$ Using these mappings and the $n$ -linear mapping $Q_{m} : Y^{m} \to Y$ introduced by $(???)$ consider the mapping:

F : A \to Y, F (x) = Q_{m} (f_{1} (x), \dots, f_{m} (x)),

which represents a more general case of the mappings $(???) .$

In this way we have the following extension of the Proposition 6.

Proposition 7

If the mappings $f_{i} : A \to Y; i = \overset{―}{1, m}$ and $A \subseteq X$ admit the Fréchet differentials of the $n$ order at the point $x \in A,$ then the mapping $F : A \to Y$ defined by $(???)$ admits as well the Fréchet differential of the $n$ order at the same point $x$ and for any $h_{1}, \dots, h_{n} \in X$ we have the equality:

F^{(n)} (x) h_{1} . . . h_{n} = \sum_{α_{1} + . . . + α_{m} = n} \sum_{(G_{1}, \dots, G_{m}) \in A_{n}^{[α_{1}, \dots, α_{m}]}} T_{G_{1}, . . ., G_{m}},

where for $T_{G_{1}, . . ., G_{m}}$ we have denoted the expression:

\sum_{(i_{1}^{(k)}, \dots, i_{α_{k}}^{(k)}) \in G_{k}; k = \overset{―}{1, m}} Q_{m} (f_{1}^{(α_{1})} (x) h_{i_{1}^{(1)}} . . . h_{i_{α_{1}}^{(1)}}, \dots, f_{m}^{(α_{m})} (x) h_{i_{1}^{(m)}} . . . h_{i_{α_{m}}^{(m)}}) .

For the case $h_{1} = . . . = h_{m} = h$ we have:

F^{(n)} (x) h^{n} = \sum_{α_{1} + \dots + α_{m} = n} \frac{n!}{α_{1}! . . . α_{m}!} Q_{m} (f_{1}^{(α_{1})} (x) h^{α_{1}}, \dots, f_{m}^{(α_{m})} (x) h^{α_{m}}) .

III) Let us consider now for a fixed $a \in X,$ the mapping:

T_{m} : X \to Y, T_{m} (x) = A_{m} (\underset{m times}{\underset{⏟}{x - a, \dots, x - a})} \overset{not}{=} A_{m} {(x - a)}^{m},

where $A_{m} \in L_{m} (X, Y)$ is introduced by $(???)$ and the mappings $B \in L_{2} (Y, Y)$ and $U \in L (X, Y)$ verify the specified conditions.

For these mappings we have:

Proposition 8

The mappings defined by $(???)$ admit Fréchet differentials of any order $n \in N$ and for any $h_{1}, . . ., h_{n} \in X$ we have:

\begin{equation} T_{m}^{\left( n\right) }h_{1}...h_{n}= \begin{cases} \theta _{Y}, & \text{for}\ n>m\ A_{m}\left( h_{1},\ldots ,h_{m}\right), & \text{for}\ m=n\ \tfrac {m!}{\left( m-n\right) !}A_{n}\left( x-a\right) ^{m-n}h_{1}...h_{n}, & \text{ for}\ m 17

IV) Taking into account the mappings ${(A_{m})}_{m \in N},$ with $A_{m} \in L_{m} (X, Y)$ introduced by $(???),$ and if the numbers $r_{1}, \dots, r_{m} \in N$ we can consider the mapping:

F : X \to Y, F (x) = A_{r_{1} + \dots + r_{m}} ({(x - x_{1})}^{r_{1}}, \dots, {(x - x_{m})}^{r_{m}}),

where $x_{1}, \dots, x_{m} \in X$ are arbitrary.

We have the following result:

Proposition 9

The mappings defined by $(???)$ admit Fréchet differentials up to the order $n$ included, where $n \leq r_{1} + r_{2} + \dots + r_{m}$ at any point $x \in X$ and:

\begin{aligned} F^{(n)} (x) h_{1} . . . h_{n} = \\ = n! \sum_{α_{1} + . . . + α_{m} = n} \prod_{i = 1}^{m} (\binom{r_{i}}{α_{i}}) A_{r_{1} + . . . + r_{m}} ({(x - x_{1})}^{r_{1} - α_{1}}, \dots, {(x - x_{m})}^{r_{m} - α_{m}}, h_{1}, \dots, h_{n}) \end{aligned}

V) We will also consider another extension of Leibnitz’ formula concerning the derivative with the $n$ order.

In this way let us consider $X, Y, Z$ linear normed spaces and the mappings $f : X \to {(Y, Z)}^{*}$ and $g : X \to Y .$

Using the considered functions we consider the function:

F : X \to Y, F (x) = [f (x)] g (x)

and for this function we have:

Proposition 10

If the mappings $f : X \to {(Y, Z)}^{*}$ and $g : X \to Y$ admit Fréchet differentials of the order $n,$ at the point $x \in X,$ then the mapping defined by $(???)$ also admits the Fréchet differential of the same order at the same point $x$ and:

\begin{aligned} F^{(n)} (x) h_{1} . . . h_{n} = \\ = \sum_{k = 0}^{n} \sum_{1 \leq i_{1} < . . . < i_{k} \leq n} [f^{(k)} (x) h_{i_{1}} . . . h_{i_{k}}] g^{(n - k)} (x) h_{j_{1}} . . . h_{j_{n - k}} \end{aligned}

where ${j_{1}, \dots, j_{n - k}} = {1, \dots, n} ╲ {i_{1}, \dots, i_{k}}$ with $j_{1} < j_{2} < . . . < j_{n - k} .$

For the case where $h_{1} = . . . h_{n} = h$ we have:

F^{(n)} (x) h^{n} = \sum_{k = 0}^{n} (\binom{n}{k}) [f^{(k)} (x) h^{k}] g^{(n - k)} (x) h^{n - k} .

VI) Let us consider now the mapping $f : X \to {(X, Y)}^{*}$ supposing that for every $x \in X$ the linear mapping $f (x) : X \to Y$ has an inverse mapping ${[f (x)]}^{- 1} : Y \to X .$

Therefore we can consider the mapping:

g : X \to {(Y, X)}^{*}, g (x) = {[f (x)]}^{- 1} .

We obtain the following result:

Proposition 11

If the non-linear mapping $f : X \to {(X, Y)}^{*}$ has a Fréchet differential at the point $x,$ then the mapping $g : X \to {(Y, X)}^{*}$ introduced by $(???)$ also has a Fréchet differential at the same point $x,$ and:

g^{'} (x) h = - {[f (x)]}^{- 1} f^{'} (x) h {[f (x)]}^{- 1},

for every $h \in Y .$

3 The Fréchet differential of certain essential mappings that appear in the interpolation with multiple nodes

We will consider the sequence of mappings ${(A_{n})}_{n \in N}$ where $A_{n} : X^{n} \to Y$ are given by $(???)$ and $B \in {(Y^{2}, Y)}^{*}, U \in {(X, Y)}^{*}$ verify the assumptions specified in the first paragraph of the present paper.

For $x_{1}, \dots, x_{m} \in X$ and $p_{1}, \dots, p_{m} \in N$ we consider the mapping:

\begin{matrix} ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) \in {(X, Y)}^{*}, \\ ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h = A_{p_{1} + \dots + p_{m} + 1} ({(x - x_{1})}^{p_{1}}, \dots, {(x - x_{m})}^{p_{m}}, h) . \end{matrix}

It is clear that if $x - x_{i} \in X_{0}$ for any $i = \overset{―}{1, m}$ , from the imposed hypotheses it results that the mappings defined by $(???)$ are bijections from $X_{0}$ to $Y_{0} .$ Thus we can consider the inverse mapping defined on $Y_{0}$ , which can be extended first by linearity to $s p (Y_{0})$ and then by continuity to $c l (s p (Y_{0})) .$

We can thus consider the mapping:

g : X \to {(c l (s p (Y_{0})), X)}^{*}, g (x) = {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} .

Concerning this mapping we have:

Proposition 12

If for any $k = \overset{―}{1, m}$ we have $x - x_{k} \in X_{0},$ then for any $n \in N,$ the mapping defined by $(???)$ admits a Fréchet differential of the order $n .$ For any $h_{1}, . . ., h_{n} \in X$ and $t \in c l (s p (Y_{0}))$ we have:

\begin{aligned} [g^{(n)} (x) h_{1} . . . h_{n}] t = \\ = {(- 1)}^{n} n! \sum_{α_{1} + . . . + α_{m} = n} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) A_{n + 1} ({[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x)]}^{- 1} t, h_{1}, . . ., h_{n}) \end{aligned}

Proof â–¼

Based on Proposition 11 we deduce that:

g^{'} (x) h = - {[P (x)]}^{- 1} P^{'} (x) h {[P (x)]}^{- 1},

where:

P (x) = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) .

Taking into account Propositions 7 and 9 we deduce that:

P^{'} (x) h u = ω^{'} (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h u = \sum_{k = 1}^{m} p_{k} C_{p_{1}, . . ., p_{m}}^{(k)} (x, h, u),

for any $h, u \in X,$ where we denote by $C_{p_{1}, . . ., p_{m}}^{(k)} (x, h, u)$ the value of the mapping $A_{p_{1} + . . . + p_{m} + 1}$ on the arguments:

\begin{matrix} {(x - x_{1})}^{p_{1}}, . . ., {(x - x_{k - 1})}^{p_{k - 1}}, {(x - x_{k})}^{p_{k} - 1}, {(x - x_{k + 1})}^{p_{k + 1}}, . . ., {(x - x_{m})}^{p_{m}}, h, u . \end{matrix}

If we choose $t \in c l (s p (Y_{0}))$ and:

u = {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t \in X,

after that for $k \in {1, 2, . . ., m}$ it has been proved that:

C_{p_{1}, . . ., p_{m}}^{(k)} (x, h, u) = \medskip B (E_{p_{1}, . . ., p_{k - 1}, p_{k} - 1, p_{k + 1}, . . ., p_{m}}^{(k)} (x, h), U (u)),

where $E_{p_{1}, . . ., p_{k - 1}, p_{k} - 1, p_{k + 1}, . . ., p_{m}}^{(k)} (x, h)$ is the value of $A_{p_{1} + . . . + p_{m}}$ at the arguments:

{(x - x_{1})}^{p_{1}}, . . ., {(x - x_{k - 1})}^{p_{k - 1}}, {(x - x_{k})}^{p_{k} - 1}, {(x - x_{k + 1})}^{p_{k + 1}}, . . ., {(x - x_{m})}^{p_{m}}, h;

so:

E_{p_{1}, . . ., p_{k - 1}, p_{k} - 1, p_{k + 1}, . . ., p_{m}}^{(k)} (x, h) = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} - 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x) h .

Thus:

\begin{aligned} ω^{'} (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t = \\ = \sum_{k = 1}^{m} p_{k} B (ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} - 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x) h, U (u)) \end{aligned}

We now show the equality:

\begin{aligned} U (u) & = U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t \\ = A_{2} (x - x_{k}, {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t) . \end{aligned}

Because the extension from $t \in Y_{0}$ to $t \in c l (s p (Y_{0}))$ is evident it is enough to suppose that $t \in Y_{0.}$

From the bijectivity of the mappings $(???)$ for $t \in Y_{0}$ we deduce the existence with a unique determination of the elements $h, u \in X_{0}$ so that:

t = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x) u .

The first member of this equality can be written as:

B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), U (h))

and the second is the value of the mapping $A_{p_{1} + . . . + p_{m} + 2}$ at the arguments:

{(x - x_{1})}^{p_{1}}, . . ., {(x - x_{k - 1})}^{p_{k - 1}}, {(x - x_{k})}^{p_{k} + 1}, {(x - x_{k + 1})}^{p_{k + 1}}, . . ., {(x - x_{m})}^{p_{m}}, u

and this can be written as:

B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), A_{2} (x - x_{k}, u)),

consequently the equality $(???)$ becomes:

B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), U (h) - A_{2} (x - x_{k}, u)) = θ_{Y} .

Because for every $k \in {1, 2, . . ., m}$ we have $x - x_{k} \in X_{0}$ we deduce that:

A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}) \in Y_{0},

consequently the equality $(???)$ will be possible only if:

U (h) = A_{2} (x - x_{k}, u) .

But from the same relation $(???)$ it is clear that:

u = {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t

and:

h = {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t,

after that replacing these values in $(???),$ we obtain the relation $(???) .$

Because of the relation $(???)$ we have the equality:

\begin{aligned} ω^{'} (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t = \\ = \sum_{k = 1}^{m} p_{k} B (E_{p_{1}, . . ., p_{k - 1}, p_{k} - 1, p_{k + 1}, . . ., p_{m}}^{(k)} (x, h), A_{2} (x - x_{k}, q_{k}^{- 1} t)) \end{aligned}

where:

q_{k} = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x) .

So:

\begin{aligned} B (E_{p_{1}, . . ., p_{k - 1}, p_{k} - 1, p_{k + 1}, . . ., p_{m}}^{(k)} (x, h), A_{2} (x - x_{k}, q_{k}^{- 1} t)) = \\ = A_{p_{1} + . . . + p_{m} + 2} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}, q_{k}^{- 1} t, h) \\ = B (A_{p_{1} + . . . + p_{m} + 1} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}, q_{k}^{- 1} t), U (h)) \\ = B (ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) q_{k}^{- 1} t, U (h)), \end{aligned}

consequently:

\begin{aligned} ω^{'} (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) h {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t = \\ = \sum_{k = 1}^{m} p_{k} B (ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) q_{k}^{- 1} t, U (h)) \end{aligned}

We remark that for any $a \in Y_{0}$ it exists a $\overset{―}{y} \in Y_{0}$ so that for any $s \in Y$ we have:

B (s, B (a, \overset{―}{y})) = s,

this fact being evident, the element $\overset{―}{y} \in Y_{0}$ is the symmetrical element of the element $a$ in the group $(Y_{0}, B) .$

Because the fact that $x - x_{k} \in X_{0}$ for any $k = \overset{―}{1, m}$ we can deduce that:

a = A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}) \in Y_{0}

from where, using the relation $(???),$ we deduce that for any $s \in Y$ we have:

B (s, B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), \overset{―}{y})) = s,

from where through the properties of the bilinear mapping $B \in {(Y^{2}, Y)}^{*}$ we have:

\begin{aligned} s & = B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), B (s, \overset{―}{y})) \\ = B (A_{p_{1} + . . . + p_{m}} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}), U (U^{- 1} B (s, \overset{―}{y}))) \\ = A_{p_{1} + . . . + p_{m} + 1} ({(x - x_{1})}^{p_{1}}, . . ., {(x - x_{m})}^{p_{m}}, U^{- 1} B (s, \overset{―}{y})); \end{aligned}

consequently:

ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) U^{- 1} B (s, \overset{―}{y}) = s,

from where:

B (s, \overset{―}{y}) = U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} s .

For the beginning let be $s = B (u, v) \in Y$ with $u, v \in Y$ in the previous relation, so we have:

\begin{aligned} U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} B (u, v) & = B (B (u, v), \overset{―}{y}) = B (B (\overset{―}{y} u), v) \\ = B (U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} u, v) . \end{aligned}

Then in the previous relation we consider, with $t \in Y,$ the elements:

u = ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x) {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t

and:

v = U (h),

consequently:

\begin{aligned} U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} B (u, U (h)) = \\ = B (U {[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t, h) \\ = A_{2} ({[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t, h), \end{aligned}

thus:

\begin{aligned} [g^{'} (x) h] t = \\ = - \sum_{k = 1}^{m} p_{k} U^{- 1} A_{2} ({[ω (\binom{x_{1}}{p_{1}}, . . ., \binom{x_{k - 1}}{p_{k - 1}}, \binom{x_{k}}{p_{k} + 1}, \binom{x_{k + 1}}{p_{k + 1}}, . . ., \binom{x_{m}}{p_{m}}; x)]}^{- 1} t, h) \\ = - \sum_{α_{1} + . . . + α_{m} = 1} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) U^{- 1} A_{2} ({[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x)]}^{- 1} t, h) \end{aligned}

so the relation $(???)$ is true for $n = 1.$

Let us suppose now that the relation $(???)$ is true for $n = k,$ namely:

\begin{aligned} [g^{(k)} (x) h_{2} . . . h_{k + 1}] t = {(- 1)}^{k} k! \times \\ \times \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) U^{- 1} A_{k + 1} ({[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x)]}^{- 1} t, h_{2}, . . ., h_{k + 1}) \end{aligned}

and for $h_{1} \in X$ as well:

\begin{aligned} [g^{(k)} (x + h_{1}) h_{2} . . . h_{k + 1}] t = {(- 1)}^{k} k! \times \\ \times \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) U^{- 1} A_{k + 1} ({[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x + h_{1})]}^{- 1} t, h_{2}, . . ., h_{k + 1}) \end{aligned}

From the relations $(???)$ and $(???)$ through substraction, member by member, we obtain:

\begin{aligned} [(g^{(k)} (x + h_{1}) - g^{(k)} (x)) h_{2} . . . h_{k + 1}] t = \\ = {(- 1)}^{k} k! \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) U^{- 1} A_{k + 1} (Z (x, h_{1}) t, h_{2}, . . ., h_{k + 1}), \end{aligned}

where:

\begin{aligned} Z (x, h_{1}) & = {[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x + h_{1})]}^{- 1} - \medskip \\ - {[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x)]}^{- 1} \in {(Y, X)}^{*} . \end{aligned}

At the same time:

Z (x, h_{1}) = {{[ω (\binom{x_{1}}{p_{1} + α_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m}}; x)]}^{- 1}}^{'} h_{1} + {‖ h_{1} ‖}_{X} R (x, h_{1}),

where $R (x, h_{1}) \in {(Y, X)}^{*}$ and $lim_{h_{1} \to θ_{X}} ‖ R (x, h_{1}) ‖ = 0.$

Because $A_{k + 1} : X^{k + 1} \to Y$ is a $k + 1$ linear mapping, from the already proved relation $(???)$ we obtain:

\begin{aligned} [(g^{(k)} (x + h_{1}) - g^{(k)} (x)) h_{2} . . . h_{k + 1}] t = \\ = {(- 1)}^{k + 1} k! \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) \sum_{β_{1} + . . . + β_{m} = 1} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} + β_{i} - 1}{β_{i}}) \times \\ \times U^{- 1} A_{k + 1} (U^{- 1} A_{2} (Ω_{α_{1} + β_{1}, . . ., α_{m} + β_{m}} (x) t, h_{1}), h_{2}, . . ., h_{m}) + \\ + {‖ h_{1} ‖}_{X} \cdot R (x; h_{1}, h_{2}, . . ., h_{k + 1}) \end{aligned}

where:

Ω_{α_{1} + β_{1}, . . ., α_{m} + β_{m}} (x) = {[ω (\binom{x_{1}}{p_{1} + α_{1} + β_{1}}, . . ., \binom{x_{m}}{p_{m} + α_{m} + β_{m}}; x)]}^{- 1} \in {(Y, X)}^{*}

and:

\begin{aligned} R (x; h_{1}, h_{2}, . . ., h_{k + 1}) = \\ = {(- 1)}^{k} k! \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) U^{- 1} A_{k + 1} (R (x, h_{1}) t, h_{2}, . . ., h_{m}) . \end{aligned}

Therefore:

\begin{aligned} {‖ R (x; h_{1}, h_{2}, . . ., h_{k + 1}) ‖}_{Y} & \leq k! ‖ U^{- 1} ‖ \cdot ‖ A_{k + 1} ‖ \cdot {‖ t ‖}_{Y} \cdot {‖ h_{2} ‖}_{X} . . . {‖ h_{m} ‖}_{X} \times \\ \times \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) {‖ R (x, h) ‖}_{X}, \end{aligned}

from where:

lim_{h_{1} \to θ_{X}} {‖ R (x; h_{1}, h_{2}, . . ., h_{k + 1}) ‖}_{Y} = 0.

If we denote $γ_{i} = α_{i} + β_{i}$ for $i = \overset{―}{1, m}$ it evidently results that:

γ_{1} + . . . + γ_{m} = (α_{1} + . . . + α_{m}) + (β_{1} + . . . + β_{m}) = k + 1

and:

(\binom{p_{i} + α_{i} - 1}{α_{i}}) \cdot (\binom{p_{i} + α_{i} + β_{i} - 1}{β_{i}}) = (\binom{γ_{i}}{α_{i}}) \cdot (\binom{p_{i} + γ_{i} - 1}{γ_{i}}),

so if we denote:

T_{α_{1} + β_{1}, . . ., α_{m} + β_{m}} = U^{- 1} A_{k + 1} (U^{- 1} A_{2} (Ω_{α_{1} + β_{1}, . . ., α_{m} + β_{m}} (x) t, h_{1}), h_{2}, . . ., h_{m}),

we have:

\begin{aligned} \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} - 1}{α_{i}}) \sum_{β_{1} + . . . + β_{m} = 1} \prod_{i = 1}^{m} (\binom{p_{i} + α_{i} + β_{i} - 1}{β_{i}}) T_{α_{1} + β_{1}, . . ., α_{m} + β_{m}} = \\ = \sum_{γ_{1} + . . . + γ_{m} = k + 1} \prod_{i = 1}^{m} (\binom{p_{i} + γ_{i} - 1}{γ_{i}}) T_{γ_{1}, . . ., γ_{m}} \cdot \sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{γ_{i}}{α_{i}}) \\ = (k + 1) \sum_{γ_{1} + . . . + γ_{m} = k + 1} \prod_{i = 1}^{m} (\binom{p_{i} + γ_{i} - 1}{γ_{i}}) T_{γ_{1}, . . ., γ_{m}} . \end{aligned}

We have used the identity:

\sum_{α_{1} + . . . + α_{m} = k} \prod_{i = 1}^{m} (\binom{γ_{i}}{α_{i}}) = (\binom{γ_{1} + . . . + γ_{m}}{α_{1} + . . . + α_{m}}) = (\binom{k + 1}{k}) = k + 1.

In this way, because $k! (k + 1) = (k + 1)!,$ we are able to write the relation:

\begin{aligned} [(g^{(k)} (x + h_{1}) - g^{(k)} (x)) h_{2} . . . h_{k + 1}] t = \\ = {(- 1)}^{k + 1} (k + 1)! \sum_{γ_{1} + . . . + γ_{m} = k + 1} \prod_{i = 1}^{m} (\binom{p_{i} + γ_{i} - 1}{γ_{i}}) T_{γ_{1}, . . ., γ_{m}} \\ + {‖ h_{1} ‖}_{X} \cdot R (x; h_{1}, h_{2}, . . ., h_{k + 1}); \end{aligned}

whence we deduce that there exists the mapping $g^{(k + 1)} (x) \in {(Y^{k + 1}, X)}^{*} .$

It is clear that:

\begin{aligned} T_{γ_{1}, . . ., γ_{m}} & = U^{- 1} A_{k + 1} (U^{- 1} A_{2} ([ω (\binom{x_{1}}{p_{1} + γ_{1}}, \dots, \binom{x_{m}}{p_{m} + γ_{m}}; x)]^{- 1} t, h_{1}), h_{2}, \dots, h_{k + 1}) \\ = U^{- 1} A_{k + 1} (U^{- 1} A_{2} (W_{γ_{1}, . . . γ_{m}} (t), h_{1}), h_{2}, . . ., h_{k + 1}) \\ = U^{- 1} B (U U^{- 1} A_{2} (W_{γ_{1}, . . . γ_{m}} (t), h_{1}), A_{k} (h_{2}, . . ., h_{k + 1})) \\ = U^{- 1} A_{k + 1} (W_{γ_{1}, . . . γ_{m}} (t), h_{1}, h_{2}, . . ., h_{k + 1}), \end{aligned}

where we have denoted:

W_{γ_{1}, . . . γ_{m}} = {[ω (\binom{x_{1}}{p_{1} + γ_{1}}, . . ., \binom{x_{m}}{p_{m} + γ_{m}}; x)]}^{- 1} \in {(Y, X)}^{*} .

Therefore:

\begin{aligned} [g^{(k + 1)} (x) h_{1} . . . h_{k + 1}] (t) = {(- 1)}^{k + 1} (k + 1)! \times \\ \times \sum_{γ_{1} + . . . + γ_{m} = k + 1} \prod_{i = 1}^{m} (\binom{p_{i} + γ_{i} - 1}{γ_{i}}) U^{- 1} A_{k + 1} (W_{γ_{1}, . . . γ_{m}} (t), h_{1}, h_{2}, . . ., h_{k + 1}), \end{aligned}

and so the equality $(???)$ is true for $n = k + 1.$

Based on the principle of mathematical induction the equality $(???)$ is true for every $n \in N .$

Proposition 12 is proved.

4 The construction of an abstract interpolation polynomial with multiple nodes

Let us consider the linear normed spaces $X$ and $Y,$ the set $D \subseteq X$ and the function $f : D \to Y .$

The general interpolation problem has the following setting.

Being given the distinct elements $x_{0}, x_{1}, . . ., x_{m} \in D,$ the numbers $r_{0}, r_{1}, . . .,$ $r_{m} \in N$ and the values $f^{(j)} (x_{i}) \in {(X^{j}, Y)}^{*}$ with $j = \overset{―}{0, r_{i} - 1};$ $i = \overset{―}{0, m},$ determine a $(U - B)$ polynomial $P : X \to Z$ with the minimum degree so that for any $i = \overset{―}{0, m}$ and $j = \overset{―}{0, r_{i} - 1}$ we have $P^{(j)} (x_{i}) = f^{(j)} (x_{i}),$ the equality being understood as one between the elements of ${(X^{j}, Y)}^{*} .$

To provide an answer to this problem let us suppose that the hypotheses from the preliminaries are fulfilled. Then let us consider the mappings that we have introduced by $(???) .$

To simplify the writing we will introduce:

\begin{aligned} X_{i} & = (x_{1}, . . ., x_{i - 1}, x_{i + 1}, . . ., x_{m}) \in X^{m - 1}, \\ R_{i} & = (r_{1}, . . ., r_{i - 1}, r_{i + 1}, . . ., r_{m}) \in N^{m - 1}, \\ J_{i} & = (α_{1}, . . ., α_{i - 1}, α_{i + 1}, . . ., α_{m}) \in N^{m - 1}, \\ | J_{i} | & = α_{1} + . . . + α_{i - 1} + α_{i + 1} + . . . + α_{m} \in N . \end{aligned}

together with the mapping from ${(X, Y)}^{*} :$

W_{m, i}^{(X_{i}, R_{i}, J_{i})} = ω (\binom{x_{1}}{r_{1} + α_{1}}, . . ., \binom{x_{i - 1}}{r_{i - 1} + α_{i - 1}}, \binom{x_{i + 1}}{r_{i + 1} + α_{i + 1}}, . . ., \binom{x_{m}}{r_{m} + α_{m}}; x_{i}) .

If $x_{i} - x_{j} \in X_{0}$ for any $i, j \in {1, 2, . . ., m}$ then, based on what we have established in the previous paragraph, the mapping $(???)$ is invertible on $Y_{0},$ and it is possible to prolong the inverted mapping to $c l (s p (Y_{0})) .$

We denote this inverted mapping as ${[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} \in {(Y, X)}^{*} .$

As an answer to the aforementioned interpolation problem, we have the following theorem:

Theorem 13

If for every $i, j \in {1, 2, . . ., m}$ with $i \neq j$ we have $x_{i} - x_{j} \in X_{0}$ and $f^{(j)} (x_{i}) \in {(X, c l (s p (Y_{0})))}^{*},$ there exists a $(U - B)$ polynomial with the degree $n = r_{1} + . . . + r_{m} - 1$ that fulfills the conditions of the general interpolation problem. The expression of this $(U - B)$ polynomial is:

H_{n} (\binom{x_{1}}{r_{1}}, . . ., \binom{x_{m}}{r_{m}}; f) (x) = \sum_{i = 1}^{m} \sum_{j = 0}^{r_{i} - 1} l_{i j} (f) (x),

where $l_{i j} (f) : X \to Y$ has the form:

l_{i j} (f) (x) = \frac{1}{j!} \sum_{k = 0}^{r_{i} - j - 1} {(- 1)}^{k} Q_{n, i, j, k} (f; x)

where $Q_{n, i, j, k} (f; x)$ is the value of the mapping $A_{n - r_{i} + k + 2} \in {(X^{n - r_{i} + k + 2}, Y)}^{*}$ at the arguments:

{(x - x_{1})}^{r_{1}}, . . ., {(x - x_{i - 1})}^{r_{i - 1}}, {(x - x_{i})}^{k}, {(x - x_{i + 1})}^{r_{i + 1}}, . . ., {(x - x_{m})}^{r_{m}}; Z_{n, i, j, k} (x)

with:

Z_{n, i, j, k} (x) = \sum_{| J_{i} | = k} \prod_{j = 1, j \neq i}^{m} (\binom{r_{j} + α_{j} - 1}{α_{j}}) {[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} f^{(j)} (x_{i}) {(x - x_{i})}^{j} .

Proof â–¼

To simplify the writing we will use the notation:

H_{n} (\binom{x_{1}}{r_{1}}, . . ., \binom{x_{m}}{r_{m}}; f) = H_{n} : X \to Y .

The theorem is proved, if in the form $(???)$ the element $l_{i j} (f) (x)$ is under the form $(???)$ with the specification $(???) .$

As $H_{n} : X \to Y$ is an abstract interpolation polynomial it is necessary that:

{[l_{i j} (f)]}^{(t)} (x_{s}) = δ_{i s} δ_{t j} f^{(j)} (x_{i})

where $δ_{p q}$ is Kronecker’s symbol. In the equality $(???)$ we have the values $i, s \in {1, 2, . . ., m}$ and for a fixed $i$ the indices $j, t \in {0, 1, . . ., r_{i - 1}} .$

In order to fulfill the conditions $(???)$ we search the mappings $l_{i j} (f) : X \to Y$ under the form:

l_{i j} (f) (x) = B (g_{i} (x), S_{i j} (x)); j = \overset{―}{0, r_{i} - 1}; i = \overset{―}{1, m};

where for any $i = \overset{―}{1, m}$ we have:

g_{i} (x) = A_{n - r_{i} + 1} ({(x - x_{1})}^{r_{1}}, . . . \underset{i}{|} . . ., {(x - x_{m})}^{r_{m}})

here, ${(x - x_{1})}^{r_{1}}, . . . \underset{i}{|} . . ., {(x - x_{m})}^{r_{m}}$ is an abbreviation for:

{(x - x_{1})}^{r_{1}}, . . ., {(x - x_{i - 1})}^{r_{i - 1}}, {(x - x_{i + 1})}^{r_{i + 1}}, . . ., {(x - x_{m})}^{r_{m}}

and:

S_{i j} (x) = B (A_{j} {(x - x_{i})}^{j}, h_{i j} (x)); j = \overset{―}{0, r_{i} - 1}; i = \overset{―}{1, m};

where $h_{i j} : X \to Y$ is a mapping to be determined.

From the relations $(???), (???)$ and $(???)$ it is clear that:

l_{i j}^{(t)} (f) (x_{s}) = 0

for $s \neq i,$ but also in the situation where $s = i$ and $t < j .$

We will determine the mappings $h_{i j} : X \to Y$ from $(???)$ so that:

l_{i j}^{(j)} (f) (x_{i}) = f^{(j)} (x_{i}), and l_{i j}^{(t)} (f) (x_{i}) = 0 \  for t > j .

The relations $(???)$ – $(???)$ indicate that for the abstract interpolation polynomial to be determined, it is necessary to choose for $h_{i j}$ a $(U - B)$ abstract polynomial with the degree $r_{i} - j - 1.$

We will now consider Taylor’s formula for the case of non-linear mappings between linear normed spaces, formula which for a function $F : Ω \to Y,$ where $Ω$ is an open and convex set of the linear normed space $X,$ that admits Fréchet differentials up to the $n + 1$ Fréchet differential, included, is expressed through:

‖ F (x) - \sum_{k = 0}^{n} \frac{F^{(k)} (x_{0})}{k!} {(x - x_{0})}^{k} ‖_{Y} \leq \frac{{‖ x - x_{0} ‖}_{X}^{n + 1}}{(n + 1)!} sup_{θ \in [0, 1]} ‖ F^{(n + 1)} (x_{0} + θ (x - x_{0})) ‖ .

If $F : Ω \to Y$ is a $(U - B)$ abstract polynomial with the degree $\leq n$ then using the proposition 8 we deduce that $F^{(n + 1)} (y) = Θ_{n + 1},$ therefore from the inequality $(???)$ we deduce that in this case we will have:

F (x) = \sum_{k = 0}^{n} \frac{F^{(k)} (x_{0})}{k!} {(x - x_{0})}^{k} .

Because the mapping $h_{i j} : X \to Y$ from the equality $(???)$ is a $(U - B)$ abstract polynomial with the degree $r_{i} - j - 1,$ we have:

h_{i j} (x) = \sum_{k = 0}^{r_{i} - j - 1} \frac{1}{k!} h_{i j}^{(k)} (x_{i}) {(x - x_{i})}^{k} .

From $(???), (???)$ and $(???)$ we deduce that:

l_{i j} (f) (x) = \sum_{k = 0}^{r_{i} - j - 1} \frac{1}{k!} B (g_{i} (x), B (A_{i j} {(x - x_{i})}^{j}, h_{i j}^{(k)} (x_{i}) {(x - x_{i})}^{k}))

and this relation indicates that the problem is solved if the elements
$h_{i j}^{(k)} (x_{i}) \in {(X^{k}, Y)}^{*}$ are determined and the equalities $(???)$ are fulfilled.

Let us define for every $x \in X$ the mapping ${\tilde{g}}_{i} (x) \in {(Y, Y)}^{*}$ by ${\tilde{g}}_{i} (x) t = B (g_{i} (x), t)$ for $t \in Y .$

From this equality we deduce that:

B (A_{j} {(x - x_{i})}^{j}, h_{i j} (x)) = {[{\tilde{g}}_{i} (x)]}^{- 1} l_{i j} (f) (x) .

Considering the equality of the Fréchet differentials of the order $j + k$ of the mappings from the first and the second member of the equality $(???)$ and using the relations $(???)$ and $(???)$ we obtain:

\begin{aligned} \sum_{s = 0}^{j + k} (\binom{j + k}{s}) B ([A_{j} {(x - x_{i})}^{j}]^{(j + k - s)} t^{j + k - s}, h_{i j}^{(s)} (x) t^{s}) = \\ = \sum_{s = 0}^{j + k} (\binom{j + k}{s}) {({[{\tilde{g}}_{i} (x)]}^{- 1})^{(j + k - s)} t^{j + k - s}} l_{i j}^{(s)} (x) t^{s} . \end{aligned}

On the account of Proposition 8 and of the fact that:

l_{i j}^{(s)} (f) (x_{i}) = δ_{s j} f^{(j)} (x_{i}),

if in the equality $(???)$ we replace $x = x_{i}$ we obtain:

j! B (A_{j} t^{j}, h_{i j}^{(k)} (x_{i}) t^{k}) = {({[{\tilde{g}}_{i} (x)]}^{- 1})_{x = x_{i}}^{(k)} t^{k}} f^{(j)} (x_{i}) t^{j} .

If we introduce:

{\tilde{\tilde{g}}}_{i} (x) = ω (\binom{x_{1}}{r_{1}}, . . ., \binom{x_{i - 1}}{r_{i - 1}}, \binom{x_{i + 1}}{r_{i + 1}}, . . ., \binom{x_{m}}{r_{m}}; x) \in {(X, Y)}^{*}

it is obvious that ${\tilde{g}}_{i} (x) t = {\tilde{\tilde{g}}}_{i} (x) U^{- 1} (t) .$

On account of the Proposition 12 we deduce that:

\begin{aligned} {{([{\tilde{\tilde{g}}}_{i} (x)]^{- 1})}^{(k)} t^{k}} u = \\ = {(- 1)}^{k} k! \sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) U^{- 1} A_{k + 1} ([W_{m, i}^{(X_{i}, R_{i}, J_{i})}]^{- 1} u, t^{k}) . \end{aligned}

From ${\tilde{g}}_{i} (x) = {\tilde{\tilde{g}}}_{i} (x) U^{- 1}$ we have ${[{\tilde{g}}_{i} (x)]}^{- 1} = U [{\tilde{\tilde{g}}}_{i} (x)]^{- 1}$ therefore from $(???)$ we deduce that:

\begin{aligned} {{({[{\tilde{g}}_{i} (x)]}^{- 1})}^{(k)} t^{k}} u = \\ = {(- 1)}^{k} k! \sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) A_{k + 1} ({[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} u, t^{k}) \end{aligned}

From $(???)$ and $(???)$ we immediately deduce that:

\begin{aligned} B (A_{j} t^{j}, h_{i j}^{(k)} (x_{i}) t^{k}) & = {(- 1)}^{k} \frac{k!}{j!} \sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) \times \\ \times A_{k + 1} ({[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} f^{(j)} (x_{i}) t^{j}, t^{k}) \end{aligned}

Replacing now in $(???)$ $t = x - x_{i}$ we obtain:

\begin{aligned} B (A_{j}^{j} (x - x_{i}), h_{i j}^{(k)} (x_{i}) {(x - x_{i})}^{k}) = \\ = {(- 1)}^{k} \frac{k!}{j!} \sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) \times \\ \times A_{k + 1} ({[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} f^{(j)} (x_{i}) {(x - x_{i})}^{j}, {(x - x_{i})}^{k}) \end{aligned}

and from the relations $(???)$ and $(???)$ results the equality:

\begin{aligned} l_{i j} (f) (x) & = \frac{1}{j!} \sum_{k = 0}^{r_{i} - j - 1} {(- 1)}^{k} \sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) \times \\ \times Δ_{n, i, j, k}^{(r_{1}, . . ., r_{i - 1}, r_{i + 1}, . . ., r_{m})} (f), \end{aligned}

where $Δ_{n, i, j, k}^{(r_{1}, . . ., r_{i - 1}, r_{i + 1}, . . ., r_{m})} (f)$ is the value of the mapping $A_{n - r_{i} + k + 2}$ at the arguments:

\begin{matrix} {(x - x_{1})}^{r_{1}}, . . ., {(x - x_{i - 1})}^{r_{i - 1}}, {(x - x_{i})}^{k}, {(x - x_{i + 1})}^{r_{i + 1}}, . . . \\ . . ., {(x - x_{m})}^{r_{m}}, {[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} f^{(j)} (x_{i}) {(x - x_{i})}^{j} . \end{matrix}

Because:

\sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) {[W_{m, i}^{(X_{i}, R_{i}, J_{i})}]}^{- 1} f^{(j)} (x_{i}) {(x - x_{i})}^{j} = \medskip Z_{n, i, j, k} (x)

evidently:

\sum_{| J_{i} | = k} \prod_{s = 1, s \neq i}^{m} (\binom{r_{s} + α_{s} - 1}{α_{s}}) Δ_{n, i, j, k}^{(r_{1}, . . ., r_{i - 1}, r_{i + 1}, . . ., r_{m})} (f) = Q_{n, i, j, k} (f; x) .

This last equality indicates that the theorem is proved.

Bibliography

1: I. K. Argyros, Polynomial Operator Equation in Abstract Spaces and Applications, CRC Press Boca Raton Boston London New York Washington D.C., (1998).
2: A. Diaconu, Interpolation dans les espaces abstraits. Méthodes itératives pour la resolution des équation opérationnelles obtenues par l’interpolation inverse (I), Babeş-Bolyai University, Faculty of Mathematics, Research Seminars, Preprint No. 4, 1981, Seminar of Functional Analysis and Numerical Methods, pp. 1–52.
3: A. Diaconu, Interpolation dans les espaces abstraits. Méthodes itératives pour la resolution des équation opérationnelles obtenues par l’interpolation inverse (II), Babeş-Bolyai University, Faculty of Mathematics, Research Seminars, Preprint No. 1, 1984, Seminar of Functional Analysis and Numerical Methods, pp. 41–97.
4: A. Diaconu, Interpolation dans les espaces abstraits. Méthodes itératives pour la resolution des équation opérationnelles obtenues par l’interpolation inverse (III), Babeş-Bolyai University, Faculty of Mathematics, Research Seminars, Preprint No. 1, 1985, Seminar of Functional Analysis and Numerical Methods, pp. 21–71.
5: A. Diaconu, Sur quelques propriétés des dérivées de type Fréchet d’ordre supérieur, Babeş-Bolyai University, Faculty of Mathematics, Research Seminaries, Seminar of Functional Analysis and Numerical Methods, Preprint No. 1, (1983), pp. 13–26.
6: A. Diaconu, Remarks on Interpolation in Certain Linear Spaces (I), Studii ın metode de analiză numerică şi optimizare, Chişinău: USM-UCCM., 2, 2(1), (2000), pp. 3–14.
7: A. Diaconu, Remarks on Interpolation in Certain Linear Spaces (II), Studii ın metode de analiză numerică şi optimizare, Chişinău: USM-UCCM., 2, 2 (4), (2000), pp. 143–161.
8: V. L. Makarov and V. V. Hlobistov, Osnovı teorii polinomialnogo operatornogo interpolirovania, Institut Mathematiki H.A.H. Ukrain, Kiev, (1998) ( in Russian ).
9: I. Păvăloiu, Interpolation dans des espaces linéaires normés et application, Mathematica, Cluj, 12(35), 1, (1970), pp. 149–158.
10: I. Păvăloiu, Consideraţii asupra metodelor iterative obţinute prin interpolare inversă, Studii şi cercetări matematice, 23, 10, (1971), pp. 1545–1549 (in Romanian).
11: I. Păvăloiu, Introducere ın teoria aproximării soluţiilor ecuaţiilor, Editura Dacia, Cluj-Napoca, (1976), ( in Romanian ).
12: P. M. Prenter, Lagrange and Hermite interpolation in Banach spaces, J. Approx. Theory, 4 (1971), pp. 419–432. $\includegraphics[scale=0.1]{ext-link.png}$