$\begin{array}{ll}\hfill \sum {l}_{i}\left(x\right){\left({X}_{i}-x\right)}^{2}& =\sum \frac{{w}_{i}\left(x\right)\left[{c}_{2}\left(x\right)-{c}_{1}\left(x\right)\left({X}_{i}-x\right)\right]{\left({X}_{i}-x\right)}^{2}}{{c}_{2}\left(x\right)-{c}_{1}{\left(x\right)}^{2}}\hfill \\ =\frac{{c}_{2}{\left(x\right)}^{2}-{c}_{1}\left(x\right){c}_{3}\left(x\right)}{{c}_{2}\left(x\right)-{c}_{1}{\left(x\right)}^{2}}.\hfill \end{array}$

For any nonnegative integer r, using Chebychev’s inequality, it can be established that

$\begin{array}{l}{\left(n{h}_{n}^{s+1}\right)}^{-1}\sum K\left(\left(x-{X}_{i}\right)/{h}_{n}\right){\left({X}_{i}-x\right)}^{s}\hfill \\ ={\left(n{h}_{n}\right)}^{-1}\sum K\left(\left(x-{X}_{i}\right)/{h}_{n}\right){\left\{\left({X}_{i}-x\right)/{h}_{n}\right\}}^{s}\stackrel{P}{\to }\int {u}^{s}K\left(u\right)duf\left(x\right).\hfill \end{array}$

Noting that $\int {u}^{s}K\left(u\right)du=0$ for s = 1 and s = 3 (since K is symmetric about 0), we have

$\begin{array}{ll}\hfill {c}_{1}\left(x\right)& ={h}_{n}\left[\int uK\left(u\right)du+{o}_{P}\left(1\right)\right]={o}_{P}\left({h}_{n}\right),\hfill \\ \hfill {c}_{2}\left(x\right)& ={h}_{n}^{2}\left[\int {u}^{2}K\left(u\right)du+{o}_{P}\left(1\right)\right]={h}_{n}^{2}\left[{\sigma }_{K}^{2}+{o}_{P}\left(1\right)\right],\text{and}\hfill \\ \hfill {c}_{3}\left(x\right)& ={h}_{n}^{3}\left[\int {u}^{3}K\left(u\right)du+{o}_{P}\left(1\right)\right]={o}_{P}\left({h}_{n}^{3}\right).\hfill \end{array}$

Plugging in these approximations for ${c}_{1}\left(x\right)$, ${c}_{2}\left(x\right)$, and ${c}_{3}\left(x\right)$ in the expression ...

Get Theory and Methods of Statistics now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 7, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.oreilly.com/library/view/theory-and-methods/9780128041239/B9780128024409000096_2.xhtml", "fetch_time": 1643259426000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-05/segments/1642320305141.20/warc/CC-MAIN-20220127042833-20220127072833-00632.warc.gz", "warc_record_offset": 959515046, "warc_record_length": 19412, "token_count": 735, "char_count": 1806, "score": 3.5625, "int_score": 4, "crawl": "CC-MAIN-2022-05", "snapshot_type": "latest", "language": "en", "language_score": 0.5328095555305481, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00024-of-00064.parquet"}