Мне в голову пришел вот какой вопрос. Вот взять эту функцию из книги Рудина (в ОП посте):
![$g(t) = f(t) - P(t) - M(t - a)^n$ $g(t) = f(t) - P(t) - M(t - a)^n$](https://dxdy-02.korotkov.co.uk/f/9/1/6/9160634ac568ef22f3c6c57a02945daa82.png)
Эта функция должна быть равна 0 в двух точках, чтобы применить теорему Ролля. Это уже давно понятно. Но разве эта функция не означает, что для любой функции, для которой мы можем построить ряд Тейлора, следующая разность:
![$f - P - M(t - a)^n$ $f - P - M(t - a)^n$](https://dxdy-04.korotkov.co.uk/f/f/c/b/fcb08b986d380ddd1de59526bed7713c82.png)
тоже всегда должна быть равна 0 в каких-то двух точках? Я имею в виду, где
![$f$ $f$](https://dxdy-02.korotkov.co.uk/f/1/9/0/190083ef7a1625fbc75f243cffb9c96d82.png)
- точная функция,
![$P$ $P$](https://dxdy-02.korotkov.co.uk/f/d/f/5/df5a289587a2f0247a5b97c1e8ac58ca82.png)
- разложение Тейлора функции
![$f$ $f$](https://dxdy-02.korotkov.co.uk/f/1/9/0/190083ef7a1625fbc75f243cffb9c96d82.png)
, а
![$M(t - a)^n$ $M(t - a)^n$](https://dxdy-04.korotkov.co.uk/f/3/f/f/3ff154146a5fbf523a99a90dadfc065182.png)
- остаток.
-- 03.11.2024, 08:38 --Я ведь еще создавал вопрос на Math StackExchange и дали мне там вот такой комментарий:
Цитата:
You ask whether a way to try to solve problems is "really valid". Mathematicians do not do all their scratch work using strict logic. They play around with various ideas, sometimes based on guesses or intuition. The role of experience can't be ignored. What seems what like an unmotivated step to one person can seem natural to another. In this case, we hope the remainder has a certain appearance and play around to make that work out. You see in writing only the end result.
Меня больше всего удивляет вот этот момент:
Цитата:
In this case, we hope the remainder has a certain appearance and play around to make that work out.
We hope, понимаете? We, hope.
Ну что это такое
![Sad :-(](./images/smilies/icon_sad.gif)
Если я уже с этим надоел, то я прошу прощения, но я скажу.
Мне математики всегда представлялись как люди которые понимают "откуда в сыре дырочки". Как люди которые в своих работах всегда отталкиваются от строгой и обоснованной логики. А тут выясняется что математики оказывается могут "надеяться" (я понимаю как это звучит, простите).
Ну и что в итоге? Получается не только функцию
![$g(t)$ $g(t)$](https://dxdy-02.korotkov.co.uk/f/d/7/f/d7fa2e4d77695901e92c044a71d1e1fb82.png)
выдумали но и саму форму остатка тоже просто "выдумали", в надежде что это сработает и оп-па, сработало? Действительно, вышло что остаток и правда такой и "надежды" оправдались?
А еще, собственно, по теме, мне подали вот такую идею:
Цитата:
As we think about
![$f(t) = P(t) + error$ $f(t) = P(t) + error$](https://dxdy-03.korotkov.co.uk/f/2/f/a/2fa1087acdc3c50f7d5ebb31bfe22fd582.png)
we would expect that the
![$error$ $error$](https://dxdy-02.korotkov.co.uk/f/9/4/0/94095c988723b8c4074e227b7719cbcd82.png)
would grow in line with
![$(t-A)^n$ $(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/9/9/5/995096358754fe734420e8c6ab798cc582.png)
. We can express this by decomposing the error as
![$h(t)(t-A)^n$ $h(t)(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/9/d/4/9d44d1ef444dc4058333c173d167792e82.png)
, and hoping that
![$h(t)$ $h(t)$](https://dxdy-02.korotkov.co.uk/f/5/d/b/5db6a630447f3e1510ef30b4769ee0aa82.png)
is well-behaved (i.e. doesn't really grow as
![$t$ $t$](https://dxdy-01.korotkov.co.uk/f/4/f/4/4f4f4e395762a3af4575de74c019ebb582.png)
moves away from
![$A$ $A$](https://dxdy-02.korotkov.co.uk/f/5/3/d/53d147e7f3fe6e47ee05b88b166bd3f682.png)
). This isn't me pulling a function
![$h$ $h$](https://dxdy-03.korotkov.co.uk/f/2/a/d/2ad9d098b937e46f9f58968551adac5782.png)
out of a hat, this is just giving a label for whatever the error is when divided by
![$(t-A)^n$ $(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/9/9/5/995096358754fe734420e8c6ab798cc582.png)
.
So we've got as far as
![$f(t) = P(t) + h(t)(t-A)^n$ $f(t) = P(t) + h(t)(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/9/4/9/949c1fe18d8120e8ffca9abab7dd3aa982.png)
Now this is the (slightly) subtle bit: if we want to specifically calculate (or at least put a bound on)
![$h(t)$ $h(t)$](https://dxdy-02.korotkov.co.uk/f/5/d/b/5db6a630447f3e1510ef30b4769ee0aa82.png)
at some specific point
![$B$ $B$](https://dxdy-03.korotkov.co.uk/f/6/1/e/61e84f854bc6258d4108d08d4c4a085282.png)
, in other words say something about
![$h(B)$ $h(B)$](https://dxdy-04.korotkov.co.uk/f/b/b/7/bb72f6351d59759481ee01ac08e1842c82.png)
(which we can call
![$M$ $M$](https://dxdy-04.korotkov.co.uk/f/f/b/9/fb97d38bcc19230b0acd442e17db879c82.png)
for convenience), we can sort of do a new expansion of
![$h(t)$ $h(t)$](https://dxdy-02.korotkov.co.uk/f/5/d/b/5db6a630447f3e1510ef30b4769ee0aa82.png)
around
![$t = B$ $t = B$](https://dxdy-02.korotkov.co.uk/f/9/5/8/958143382c159bced678c562e2dd315882.png)
:
![$h(t) = M + k(t)$ $h(t) = M + k(t)$](https://dxdy-01.korotkov.co.uk/f/c/4/0/c40494e184742b060f8653544e6efd9f82.png)
where
![$k(B) = 0$ $k(B) = 0$](https://dxdy-01.korotkov.co.uk/f/4/a/2/4a268f72e9bd30ff7f35d20b134497c382.png)
. (You might even think of writing
![$k(t)$ $k(t)$](https://dxdy-02.korotkov.co.uk/f/d/c/1/dc1df253dd3e063c495a9d1f19c5ddbf82.png)
as
![$j(t)(t-B)$ $j(t)(t-B)$](https://dxdy-02.korotkov.co.uk/f/9/7/c/97c751243cd18081ee6b7b7e0a7711cd82.png)
because you'd expect a linear term to factor out, but it turns out that's unnecessary detail). Again, the function
![$k(t)$ $k(t)$](https://dxdy-02.korotkov.co.uk/f/d/c/1/dc1df253dd3e063c495a9d1f19c5ddbf82.png)
is not something I've pulled out of a hat, it's just a useful way of splitting
![$h$ $h$](https://dxdy-03.korotkov.co.uk/f/2/a/d/2ad9d098b937e46f9f58968551adac5782.png)
into these two parts.
So now I've got
![$f(t) = P(t) + (M + k(t))(t-A)^n$ $f(t) = P(t) + (M + k(t))(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/9/c/5/9c5603a9472ae582328c19d95de1f30f82.png)
which I can write
![$f(t) = P(t) + M(t-A)^n + k(t)(t-A)^n$ $f(t) = P(t) + M(t-A)^n + k(t)(t-A)^n$](https://dxdy-02.korotkov.co.uk/f/1/f/c/1fc590f2bc531eecdb7a86381c96259d82.png)
At this point we realise that we know
![$k(t)(t-A)^n$ $k(t)(t-A)^n$](https://dxdy-04.korotkov.co.uk/f/b/7/0/b706ea520243a5977a334fd4de686c3382.png)
is
![$0$ $0$](https://dxdy-03.korotkov.co.uk/f/2/9/6/29632a9bf827ce0200454dd32fc3be8282.png)
when
![$t = A$ $t = A$](https://dxdy-02.korotkov.co.uk/f/5/f/c/5fc4abf7cbbc48b8ac86fcb3a5c7784882.png)
and when
![$t = B$ $t = B$](https://dxdy-02.korotkov.co.uk/f/9/5/8/958143382c159bced678c562e2dd315882.png)
, and think about applying the MVT to the function
![$k(t)(t-A)^n$ $k(t)(t-A)^n$](https://dxdy-04.korotkov.co.uk/f/b/7/0/b706ea520243a5977a334fd4de686c3382.png)
. This suggests, it might be easier to write
![$k(t)(t-A)^n$ $k(t)(t-A)^n$](https://dxdy-04.korotkov.co.uk/f/b/7/0/b706ea520243a5977a334fd4de686c3382.png)
as a single function and see where that gets us. We call this single function
![$g(t)$ $g(t)$](https://dxdy-02.korotkov.co.uk/f/d/7/f/d7fa2e4d77695901e92c044a71d1e1fb82.png)
for convenience; again not pulled out of a hat, just finally the realisation that
![$f(t)$ $f(t)$](https://dxdy-03.korotkov.co.uk/f/2/7/0/27099e26220f898359382d05f75b941c82.png)
can be split into these three parts:
![$f(t) = P(t) + M(t-A)^n + g(t)$ $f(t) = P(t) + M(t-A)^n + g(t)$](https://dxdy-04.korotkov.co.uk/f/7/d/2/7d2a06b546c669a51cb10da4d7c917e882.png)
and while we know how the first two parts behave we want to understand the third part, so writing
![$g(t) = f(t) - P(t) - M(t-A)^n$ $g(t) = f(t) - P(t) - M(t-A)^n$](https://dxdy-01.korotkov.co.uk/f/8/9/0/890f4731516b74571bb081e78a81cf0282.png)
is just a way of focussing the mind on the residual error term.
Это уже хоть что-то.