{"id":37,"date":"2020-02-05T16:39:57","date_gmt":"2020-02-05T16:39:57","guid":{"rendered":"https:\/\/integralsandseries.in\/?p=37"},"modified":"2025-11-13T15:49:54","modified_gmt":"2025-11-13T15:49:54","slug":"weyls-equidistribution-theorem","status":"publish","type":"post","link":"https:\/\/integralsandseries.in\/?p=37","title":{"rendered":"Weyl&#8217;s Equidistribution Theorem"},"content":{"rendered":"\n<p>In this post, we will prove the Weyl&#8217;s Equidistribution theorem. A sequence of real numbers $x_1, x_2, \\cdots$ is said to be equidistributed  (mod 1) if for every sub-interval $(a,b)\\subset [0,1]$, we have\n$$\\lim_{N\\to \\infty}\\frac{|\\{1\\leq n\\leq N:\\; \\langle x_n \\rangle\\in (a,b)\\}|}{N} = b-a$$\nwhere $\\langle x \\rangle$ denotes the fractional part of $x$. Weyl&#8217;s equidistribution criteria states that the following statements are equivalent:\n<ol>\n<li>$x_1, x_2, \\cdots$ are equidistributed (mod 1).<\/li>\n<li>For each non-zero integer $k$, we have $$\\lim_{N\\to\\infty}\\frac{1}{N}\\sum_{n=1}^N e^{2\\pi i k x_n}=0$$<\/li>\n<li>For each Riemann integrable function $f:[0,1]\\to\\mathbb{C}$, we have $$\\lim_{N\\to \\infty}\\frac{1}{N}\\sum_{n=1}^N f(\\langle x_n \\rangle) = \\int_0^1 f(x) dx$$<\/li>\n<\/ol>\n<\/p>\n<p>\n<b>Proof: (1) &rArr; (3)<\/b><\/p>\n<p>Let $I=[a,b)\\subseteq [0,1]$ and note that\n$$ \\frac{|\\{1 \\leq n \\leq N: \\langle x_n \\rangle\\in [a,b) \\}|}{N}=\\frac{1}{N}\\sum_{n=1}^N \\chi_{[a,b)}(\\langle x_n \\rangle) $$\nwhere $\\chi_{[a,b)}(x)$ equals 1 if $x\\in [a,b)$ and 0 otherwise. This shows that (3) holds for the case when $f$ is a characteristic function. Now, let $\\lambda_1, \\lambda_2\\in \\mathbb{R}$ and $f_1$, $f_2$ be functions for which (3) holds. Then,\n$$ \\begin{aligned}\\lim_{N\\to \\infty}\\sum_{n=1}^N (\\lambda_1 f_1 + \\lambda_2 f_2)(\\langle x_n \\rangle) &#038;= \\lim_{N\\to \\infty} \\frac{\\lambda_1}{N}\\sum_{n=1}^N f_1(\\langle x_n\\rangle) + \\lim_{N\\to \\infty}\\frac{\\lambda_2}{N}\\sum_{n=1}^Nf_2(\\langle x_n\\rangle) \\\\ &#038;= \\lambda_1\\int_0^1 f_1(x) dx + \\lambda_2 \\int_0^1 f_2(x) dx \\\\ &#038;= \\int_0^1 (\\lambda_1 f_1 + \\lambda_2 f_2)(x) dx\\end{aligned} $$\nThus, (3) holds for all linear combinations of characteristic functions of subintervals of $[0,1]$. <\/p>\n<p>\nNow, let $f:[0,1]\\to \\mathbb{R}$ be an integrable function, and let $\\epsilon >0$. Choose step functions $f_1$ and $f_2$ such that:\n<ul>\n<li>$f_1\\leq f\\leq f_2$ pointwise <\/li>\n<li>$\\int_0^1 (f_2(x)-f_1(x))dx &lt; \\frac{\\epsilon}{2}$ <\/li>\n<li>There exists $N_0$ such that $\\left|\\int_0^1 f_1(x)dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f_1(\\langle x_n\\rangle) \\right| &lt; \\frac{\\epsilon}{2}$ and $\\left|\\int_0^1 f_2(x)dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f_2(\\langle x_n\\rangle) \\right| &lt; \\frac{\\epsilon}{2}$ for all $N\\geq N_0$<\/li>\n<\/ul>\nIt follows that for $N\\geq N_0$,\n$$\n\\begin{aligned}\n\\int_0^1 f(x) dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f(\\langle x_n\\rangle) &#038;\\leq \\int_0^1 f(x) dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f_1(\\langle x_n\\rangle) \\\\\n&#038;&lt; \\int_0^1 f(x) dx -\\int_0^1 f_1(x) dx +\\frac{\\epsilon}{2} \\\\\n&#038;&lt; \\int_0^1 (f_2(x)-f_1(x)) dx + \\frac{\\epsilon}{2} \\\\\n&#038;&lt; \\epsilon\n\\end{aligned}\n$$\nIn a similar way, we can prove that\n$$\n\\int_0^1 f(x) dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f(\\langle x_n\\rangle) &gt; -\\epsilon \\quad \\forall\\; N\\geq N_0\n$$\nTherefore, we have\n$$\n\\left|\\int_0^1 f(x) dx &#8211; \\frac{1}{N}\\sum_{n=1}^N f(\\langle x_n\\rangle) \\right| &lt; \\epsilon \\quad \\forall\\; N\\geq N_0\n$$\nTo see that (3) holds when $f$ is complex valued, we need only consider the real and imaginary parts separately.\n<\/p>\n<p><b>(2) &rArr; (3)<\/b><\/p>\n<p>\nLet $f:[0,1]\\to \\mathbb{R}$ be continuous, and let $\\epsilon &gt; 0$. The <a href=\"https:\/\/en.wikipedia.org\/wiki\/Stone%E2%80%93Weierstrass_theorem\">Stone-Weierstrass Theorem<\/a> allows us to choose a trigonometric polynomial $p$ such that:\n$$\n\\sup_{x\\in [0,1]} |f(x) &#8211; p(x)| &lt; \\frac{\\epsilon}{3}\n$$\nAlso, (2) implies the existence of an $N_0$ such that for $N\\geq N_0$, we have\n$$\\left|\\frac{1}{N}\\sum_{n=1}^N p(\\langle x_n \\rangle)-\\int_0^1 p(x) dx \\right| &lt; \\frac{\\epsilon}{3}$$\nNow,\n$$\n\\begin{aligned}\n&#038;\\; \\left|\\frac{1}{N}\\sum_{n=1}^N f(\\langle x_n\\rangle) &#8211; \\int_0^1 f(x) dx\\right| \\\\ &#038;= \\left|\\frac{1}{N}\\sum_{n=1}^N (f(\\langle x_n \\rangle) &#8211; p(\\langle x_n \\rangle)) + \\int_0^1 (p(x)-f(x))dx + \\frac{1}{N}\\sum_{n=1}^N p(\\langle x_n \\rangle) &#8211; \\int_0^1 p(x) dx\\right| \\\\\n&#038;&lt; \\frac{1}{N}\\sum_{n=1}^N\\left|f(\\langle x_n \\rangle) &#8211; p(\\langle x_n \\rangle) \\right| + \\int_0^1 \\left|p(x)-f(x) \\right| dx + \\left|\\frac{1}{N}\\sum_{n=1}^N p(\\langle x_n \\rangle) &#8211; \\int_0^1 p(x) dx \\right| \\\\\n&#038;&lt; \\frac{\\epsilon}{3}+\\frac{\\epsilon}{3}+\\frac{\\epsilon}{3} \\\\\n&#038;= \\epsilon\n\\end{aligned}\n$$\nfor all $N\\geq N_0$. Thus, (3) holds for continuous functions on $[0,1]$. By the proof of (1) &rArr; (3), it is sufficient to show that (3) holds for all step functions on $[0,1]$. If $g$ is a step function on $[0,1]$, we can find continuous functions $g_1, g_2$ such that $g_1\\leq g\\leq g_2$ and $\\int_0^1 (g_1(x)-g_2(x))dx &lt; \\epsilon$. We again conclude that (3) holds for $g$.\n<\/p>\n<p>The implications <b>(3) &rArr; (1)<\/b> and <b>(3) &rArr; (2)<\/b> are obvious.<\/p>\n<p><h2>References<\/h2><p>\n<ul>\n<li>Hannigan-Daley, Brad. Equidistribution and Weyl\u2019s criterion. Retrieved from <i>http:\/\/individual.utoronto.ca\/hannigandaley\/equidistribution.pdf<\/i>. Accessed 5 Feb. 2020.<\/li>\n<li>Stein, Elias M. and Shakarchi, Rami. <i>Fourier Analysis: An Introduction<\/i>. Princeton University Press, 2003 <\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will prove the Weyl&#8217;s Equidistribution theorem. A sequence of real numbers $x_1, x_2, \\cdots$ is said to be equidistributed (mod 1) if for every sub-interval $(a,b)\\subset [0,1]$, we have $$\\lim_{N\\to \\infty}\\frac{|\\{1\\leq n\\leq N:\\; \\langle x_n \\rangle\\in &hellip; <a href=\"https:\/\/integralsandseries.in\/?p=37\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[2],"tags":[],"class_list":["post-37","post","type-post","status-publish","format-standard","hentry","category-number-theory"],"_links":{"self":[{"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/posts\/37","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=37"}],"version-history":[{"count":51,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/posts\/37\/revisions"}],"predecessor-version":[{"id":1168,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=\/wp\/v2\/posts\/37\/revisions\/1168"}],"wp:attachment":[{"href":"https:\/\/integralsandseries.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=37"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=37"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/integralsandseries.in\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=37"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}