<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Mark H. Kim</title>
	<atom:link href="http://markhkim.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://markhkim.com</link>
	<description></description>
	<lastBuildDate>Sun, 05 Feb 2012 13:27:39 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
		<item>
		<title>Interpolation on Lebesgue Spaces</title>
		<link>http://markhkim.com/2011/12/interpolation-on-lebesgue-spaces/</link>
		<comments>http://markhkim.com/2011/12/interpolation-on-lebesgue-spaces/#comments</comments>
		<pubDate>Sat, 17 Dec 2011 08:57:04 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[ca.classical-analysis]]></category>
		<category><![CDATA[Expository]]></category>
		<category><![CDATA[fa.functional-analysis]]></category>
		<category><![CDATA[complex interpolation]]></category>
		<category><![CDATA[Fourier transform]]></category>
		<category><![CDATA[Hardy spaces]]></category>
		<category><![CDATA[Hardy-Littlewood maximal function]]></category>
		<category><![CDATA[Hilbert trasnform]]></category>
		<category><![CDATA[real interpolation]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=3445</guid>
		<description><![CDATA[This is the set of notes I wrote up for the talk I gave at the student analysis seminar on December 1 and December 8. * * * * * Let be an operator between vector spaces satisfying some linearity condition. We fix Banach subspaces and fo and and of . If the restrictions and <a href='http://markhkim.com/2011/12/interpolation-on-lebesgue-spaces/'>[...]</a>]]></description>
			<content:encoded><![CDATA[<p>This is the set of notes I wrote up for the talk I gave at the <a title="Rutgers Graduate Student Analysis Seminar, Fall 2011" href="../../seminars/f11-rutgers-student-analysis-seminar/">student analysis seminar</a> on December 1 and December 8.</p>
<p style="text-align: center;">* * * * *</p>
<p>Let <img src='http://s0.wp.com/latex.php?latex=T%3AX+%5Cto+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T:X &#92;to Y' title='T:X &#92;to Y' class='latex' /> be an operator between vector spaces satisfying some linearity condition. We fix Banach subspaces <img src='http://s0.wp.com/latex.php?latex=A_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A_0' title='A_0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=A_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A_1' title='A_1' class='latex' /> fo <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=B_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B_0' title='B_0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=B_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B_1' title='B_1' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' />. If the restrictions <img src='http://s0.wp.com/latex.php?latex=T%7C_%7BA_0%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T|_{A_0}' title='T|_{A_0}' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=T%7C_%7BA_1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T|_{A_1}' title='T|_{A_1}' class='latex' /> are operators into <img src='http://s0.wp.com/latex.php?latex=B_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B_0' title='B_0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=B_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B_1' title='B_1' class='latex' />, respectively, satisfying some norm estimates, then an <em>interpolation theorem</em> tells us that we can often find &#8220;intermediate&#8221; Banach spaces <img src='http://s0.wp.com/latex.php?latex=%28A_t%2CB_t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(A_t,B_t)' title='(A_t,B_t)' class='latex' /> between <img src='http://s0.wp.com/latex.php?latex=%28A_0%2CB_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(A_0,B_0)' title='(A_0,B_0)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%28A_1%2CB_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(A_1,B_1)' title='(A_1,B_1)' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=T%7C_%7BA_t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T|_{A_t}' title='T|_{A_t}' class='latex' />, for each <img src='http://s0.wp.com/latex.php?latex=t+%5Cin+%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t &#92;in [0,1]' title='t &#92;in [0,1]' class='latex' />, is a bounded operator into <img src='http://s0.wp.com/latex.php?latex=B_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B_t' title='B_t' class='latex' /> with its norm depending canonically on the norm estimates at the endpoints.</p>
<p><strong><span style="text-decoration: underline;">Contents</span></strong></p>
<ul>
<li><em><a href="#complex-interpolation">Lecture 1 &#8211; Strong Endpoint Estimates: The theorems of Riesz-Thorin and Stein</a></em>. If a linear map <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is bounded as an operator from <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp_0%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p_0}' title='L^{p_0}' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bq_0%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{q_0}' title='L^{q_0}' class='latex' /> and from <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp_1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p_1}' title='L^{p_1}' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bq_1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{q_1}' title='L^{q_1}' class='latex' />, respectively, the the Riesz-Thorin interpolation theorem establishes the boundedness of <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> as an operator from <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp_t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p_t}' title='L^{p_t}' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bq_t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{q_t}' title='L^{q_t}' class='latex' />, where <img src='http://s0.wp.com/latex.php?latex=p_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_t' title='p_t' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=q_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='q_t' title='q_t' class='latex' /> depend on the exponents and the parameter <img src='http://s0.wp.com/latex.php?latex=t+%5Cin+%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t &#92;in [0,1]' title='t &#92;in [0,1]' class='latex' />. As an immediate application, we shall prove the Hausdorff-Young inequality for the Fourier transform and the generalized Young&#8217;s inequality. We also mention the variable-parameter version of Riesz-Throin, proven by E. Stein in his 1955 thesis.
<ol>
<li><a href="#1-1">The Fourier transform</a></li>
<li><a href="#1-2">The Riesz-Thorin interpolation theorem</a></li>
<li><a href="#1-3">Applications: two inequalities</a></li>
<li><a href="#1-4">Interpolation on analytic families of operators</a></li>
</ol>
</li>
<li><em><a href="#real-interpolation">Lecture 2 &#8211; Weak Endpoint Estimates: The theorems of Marcinkiewicz and Fefferman-Stein</a></em>. What if an operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> just fails to be bounded at the endpoints? In the second part of the talk, we shall consider the <em>weak-type</em> operators, which are bounded as an operator from a Lebesgue space to a <em>weak Lebesgue space</em>. The prototypical examples of such operators are the <em>Hardy-Littlewood maximal function</em> in the theory of differentiation and the <em>Hilbert transform</em> in the theory of singular integrals. We also mention an extension of Stein&#8217;s interpolation theorem by C. Fefferman, which allows the endpoint-operator to be bounded from a Lebesgue space to a <em>Hardy space</em>.
<ol>
<li><a href="#2-1">The Hardy-Littlewood maximal function</a></li>
<li><a href="#2-2">The Marcinkiewicz interpolation theorem</a></li>
<li><a href="#2-3">Application: the Hilbert transform</a></li>
<li><a href="#2-4">Interpolation on Hardy Spaces: <img src='http://s0.wp.com/latex.php?latex=H%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1' title='H^1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=BMO&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='BMO' title='BMO' class='latex' /></a></li>
</ol>
</li>
</ul>
<p><span id="more-3445"></span></p>
<h4 id="complex-interpolation">Lecture 1. Strong Endpoint Estimates: The theorems of Riesz-Throin and Stein</h4>
<p>The first theorem on our list is the interpolation theorem of M. Riesz and Thorin, concerning operators on Lebesgue spaces. The theorem depends on complex-analytic methods for its proof, whence the operators must take complex scalars. The general theorems of its kind, pioneered by Calderón, are known as <em>complex interpolation</em>.</p>
<p style="text-align: center;"><strong><a id="1-1">- 1. The Fourier transform -</a></strong></p>
<p>To motivate the Riesz-Thorin interpolation theorem, we briefly review the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2' title='L^2' class='latex' /> theory of the Fourier transform on Euclidean spaces. For each <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^1(&#92;mathbb{R}^d)' title='f &#92;in L^1(&#92;mathbb{R}^d)' class='latex' />, we define the <em>Fourier transform</em> <img src='http://s0.wp.com/latex.php?latex=%5Chat%7Bf%7D%3A%5Cmathbb%7BR%7D%5Ed+%5Cto+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;hat{f}:&#92;mathbb{R}^d &#92;to &#92;mathbb{C}' title='&#92;hat{f}:&#92;mathbb{R}^d &#92;to &#92;mathbb{C}' class='latex' /> by setting</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Chat%7Bf%7D%28%5Cxi%29+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+f%28x%29+e%5E%7B-2+%5Cpi+i+x+%5Ccdot+%5Cxi%7D+%5C%2C+dx%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;hat{f}(&#92;xi) = &#92;int_{&#92;mathbb{R}^d} f(x) e^{-2 &#92;pi i x &#92;cdot &#92;xi} &#92;, dx,' title='&#92;displaystyle &#92;hat{f}(&#92;xi) = &#92;int_{&#92;mathbb{R}^d} f(x) e^{-2 &#92;pi i x &#92;cdot &#92;xi} &#92;, dx,' class='latex' /></p>
<p>where <img src='http://s0.wp.com/latex.php?latex=x+%5Ccdot+%5Cxi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;cdot &#92;xi' title='x &#92;cdot &#92;xi' class='latex' /> is the standard dot product of <img src='http://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x' title='x' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cxi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;xi' title='&#92;xi' class='latex' />. We immediately see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7C%5Chat%7Bf%7D%5C%7C_%5Cinfty+%5Cleq+%5C%7Cf%5C%7C_1%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_1,' title='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_1,' class='latex' /></p>
<p>which shows that the Fourier transform is a bounded operator from <img src='http://s0.wp.com/latex.php?latex=L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(&#92;mathbb{R}^d)' title='L^1(&#92;mathbb{R}^d)' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E%5Cinfty%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^&#92;infty(&#92;mathbb{R}^d)' title='L^&#92;infty(&#92;mathbb{R}^d)' class='latex' />. Straightforward computation yields the following basic properties of the Fourier transform&#8212;here we let <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^1(&#92;mathbb{R}^d)' title='f &#92;in L^1(&#92;mathbb{R}^d)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Ctau+%5Cin+%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;tau &#92;in &#92;mathbb{R}^d' title='&#92;tau &#92;in &#92;mathbb{R}^d' class='latex' />:</p>
<ol>
<li>If <img src='http://s0.wp.com/latex.php?latex=f_%5Ctau%28x%29+%3D+f%28x-%5Ctau%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_&#92;tau(x) = f(x-&#92;tau)' title='f_&#92;tau(x) = f(x-&#92;tau)' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5Cwidehat%7Bf_%5Ctau%7D+%28x%29+%3D+e%5E%7B-2+%5Cpi+i+%5Ctau+%5Ccdot+%5Cxi%7D+%5Chat%7Bf%7D%28%5Cxi%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;widehat{f_&#92;tau} (x) = e^{-2 &#92;pi i &#92;tau &#92;cdot &#92;xi} &#92;hat{f}(&#92;xi)' title='&#92;widehat{f_&#92;tau} (x) = e^{-2 &#92;pi i &#92;tau &#92;cdot &#92;xi} &#92;hat{f}(&#92;xi)' class='latex' />.</li>
<li>If <img src='http://s0.wp.com/latex.php?latex=e_%5Ctau%28x%29+%3D+e%5E%7B2+%5Cpi+i+x+%5Ccdot+%5Ctau%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='e_&#92;tau(x) = e^{2 &#92;pi i x &#92;cdot &#92;tau}' title='e_&#92;tau(x) = e^{2 &#92;pi i x &#92;cdot &#92;tau}' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5Cwidehat%7Be_%5Ctau+f%7D%28%5Cxi%29+%3D+%5Chat%7Bf%7D%28%5Cxi+-+%5Ctau%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;widehat{e_&#92;tau f}(&#92;xi) = &#92;hat{f}(&#92;xi - &#92;tau)' title='&#92;widehat{e_&#92;tau f}(&#92;xi) = &#92;hat{f}(&#92;xi - &#92;tau)' class='latex' />.</li>
<li>If <img src='http://s0.wp.com/latex.php?latex=%5Ctilde%7Bf%7D%28x%29+%3D+%5Coverline%7Bf%28-x%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;tilde{f}(x) = &#92;overline{f(-x)}' title='&#92;tilde{f}(x) = &#92;overline{f(-x)}' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5Cwidehat%7B%5Ctilde%7Bf%7D%7D+%3D+%5Coverline%7B%5Chat%7Bf%7D%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;widehat{&#92;tilde{f}} = &#92;overline{&#92;hat{f}}' title='&#92;widehat{&#92;tilde{f}} = &#92;overline{&#92;hat{f}}' class='latex' />.</li>
</ol>
<p>A natural setting for the study of the Fourier transform is the <em>Schwartz space</em> <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{S}(&#92;mathbb{R}^d)' title='&#92;mathbb{S}(&#92;mathbb{R}^d)' class='latex' />, which is the collection of smooth functions on <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}^d' title='&#92;mathbb{R}^d' class='latex' /> that are rapidly decreasing. The formal definition is stated succinctly with the aid of <em>multi-indices</em>, which are vectors in <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}^d' title='&#92;mathbb{R}^d' class='latex' /> with nonnegative integer components. Each multi-index <img src='http://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha' title='&#92;alpha' class='latex' /> comes with the following set of shorthand notations:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+D%5E%5Calpha+%3D+%5Cfrac%7B%5Cpartial%5E%7B%5Calpha_1%7D%7D%7B%5Cpartial+x_1%5E%7B%5Calpha_1%7D%7D+%5Ccdots+%5Cfrac%7B%5Cpartial%5E%7B%5Calpha_1%7D%7D%7B%5Cpartial+x_d%5E%7B%5Calpha_d%7D%7D%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle D^&#92;alpha = &#92;frac{&#92;partial^{&#92;alpha_1}}{&#92;partial x_1^{&#92;alpha_1}} &#92;cdots &#92;frac{&#92;partial^{&#92;alpha_1}}{&#92;partial x_d^{&#92;alpha_d}};' title='&#92;displaystyle D^&#92;alpha = &#92;frac{&#92;partial^{&#92;alpha_1}}{&#92;partial x_1^{&#92;alpha_1}} &#92;cdots &#92;frac{&#92;partial^{&#92;alpha_1}}{&#92;partial x_d^{&#92;alpha_d}};' class='latex' /></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+x%5E%5Calpha+%3D+x_1%5E%7B%5Calpha_1%7D+%5Ccdots+x_d%5E%7B%5Calpha_d%7D%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle x^&#92;alpha = x_1^{&#92;alpha_1} &#92;cdots x_d^{&#92;alpha_d};' title='&#92;displaystyle x^&#92;alpha = x_1^{&#92;alpha_1} &#92;cdots x_d^{&#92;alpha_d};' class='latex' /></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%7C%5Calpha%7C+%3D+%5Calpha_1+%2B+%5Ccdots+%2B+%5Calpha_d.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|&#92;alpha| = &#92;alpha_1 + &#92;cdots + &#92;alpha_d.' title='|&#92;alpha| = &#92;alpha_1 + &#92;cdots + &#92;alpha_d.' class='latex' /></p>
<p style="text-align: left;">We are now ready to state the</p>
<p style="text-align: left;"><strong>Definition.</strong> <em>The </em>Schwartz space<em> <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{S}(&#92;mathbb{R}^d)' title='&#92;mathscr{S}(&#92;mathbb{R}^d)' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}^d' title='&#92;mathbb{R}^d' class='latex' /> is the collection of <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BC%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{C}^&#92;infty' title='&#92;mathscr{C}^&#92;infty' class='latex' />-functions <img src='http://s0.wp.com/latex.php?latex=%5Cvarphi%3A%5Cmathbb%7BR%7D%5Ed+%5Cto+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varphi:&#92;mathbb{R}^d &#92;to &#92;mathbb{C}' title='&#92;varphi:&#92;mathbb{R}^d &#92;to &#92;mathbb{C}' class='latex' /> such that</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csup_%7Bx+%5Cin+%5Cmathbb%7BR%7D%5Ed%7D+%7Cx%5E%5Calpha+D%5E%5Cbeta+%5Cvarphi%28x%29%7C+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sup_{x &#92;in &#92;mathbb{R}^d} |x^&#92;alpha D^&#92;beta &#92;varphi(x)| &lt; &#92;infty' title='&#92;displaystyle &#92;sup_{x &#92;in &#92;mathbb{R}^d} |x^&#92;alpha D^&#92;beta &#92;varphi(x)| &lt; &#92;infty' class='latex' /></em></p>
<p style="text-align: left;"><em>for every pair of multi-indices <img src='http://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha' title='&#92;alpha' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cbeta&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;beta' title='&#92;beta' class='latex' />.</em></p>
<p style="text-align: left;">We remark that <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{S}(&#92;mathbb{R}^d)' title='&#92;mathscr{S}(&#92;mathbb{R}^d)' class='latex' /> contains <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BC%7D_0%5E%5Cinfty%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{C}_0^&#92;infty(&#92;mathbb{R}^d)' title='&#92;mathscr{C}_0^&#92;infty(&#92;mathbb{R}^d)' class='latex' />, hence there are plenty of Schwartz functions. In fact, <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{S}(&#92;mathbb{R}^d)' title='&#92;mathscr{S}(&#92;mathbb{R}^d)' class='latex' /> is dense in <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(&#92;mathbb{R}^d)' title='L^p(&#92;mathbb{R}^d)' class='latex' /> for <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; &#92;infty' title='1 &#92;leq p &lt; &#92;infty' class='latex' />. Furthermore, the Fourier transform of a Schwartz function is again a Schwartz function.</p>
<p style="text-align: left;">An important result in the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' /> theory of the Fourier transform is the <em>Fourier inversion theorem</em>. We shall only need a simple case of the theorem: see pp.5-17 of [SW71] for a discussion of the general version.</p>
<p style="text-align: left;"><strong>Theorem 1</strong> (Fourier inversion theorem). <em>If <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^1(&#92;mathbb{R}^d)' title='f &#92;in L^1(&#92;mathbb{R}^d)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Chat%7Bf%7D+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;hat{f} &#92;in L^1(&#92;mathbb{R}^d)' title='&#92;hat{f} &#92;in L^1(&#92;mathbb{R}^d)' class='latex' />, then</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f%28x%29+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7Bf%7D%28%5Cxi%29+e%5E%7B2+%5Cpi+i+%5Cxi+%5Ccdot+x%7D+%5C%2C+d%5Cxi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f(x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d&#92;xi' title='&#92;displaystyle f(x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d&#92;xi' class='latex' /></em></p>
<p style="text-align: left;"><em>for almost every <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in &#92;mathbb{R}^d' title='x &#92;in &#92;mathbb{R}^d' class='latex' />.</em></p>
<p style="text-align: left;"><em>Proof</em>. We first note that the Fourier transform of the <em>Gaussican</em> <img src='http://s0.wp.com/latex.php?latex=%5CGamma%28x%29+%3D+e%5E%7B-%5Cpi+%7Cx%7C%5E2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma(x) = e^{-&#92;pi |x|^2}' title='&#92;Gamma(x) = e^{-&#92;pi |x|^2}' class='latex' /> is again the Gaussian, whence Theorem 1 holds for <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' />. Setting</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5CGamma_%7B%5Cvarepsilon%7D%28x%29+%3D+e%5E%7B-%5Cpi+%5Cvarepsilon%5E2+%7Cx%7C%5E2%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;Gamma_{&#92;varepsilon}(x) = e^{-&#92;pi &#92;varepsilon^2 |x|^2}' title='&#92;displaystyle &#92;Gamma_{&#92;varepsilon}(x) = e^{-&#92;pi &#92;varepsilon^2 |x|^2}' class='latex' /></p>
<p style="text-align: left;">for each <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varepsilon &gt; 0' title='&#92;varepsilon &gt; 0' class='latex' />, we see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cwidehat%7B%5CGamma_%5Cvarepsilon%7D%28%5Cxi%29+%3D+%5Cvarepsilon%5E%7B-d%7D+e%5E%7B-%5Cpi+%5Cvarepsilon%5E%7B-2%7D+%7C%5Cxi%7C%5E2%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;widehat{&#92;Gamma_&#92;varepsilon}(&#92;xi) = &#92;varepsilon^{-d} e^{-&#92;pi &#92;varepsilon^{-2} |&#92;xi|^2},' title='&#92;displaystyle &#92;widehat{&#92;Gamma_&#92;varepsilon}(&#92;xi) = &#92;varepsilon^{-d} e^{-&#92;pi &#92;varepsilon^{-2} |&#92;xi|^2},' class='latex' /></p>
<p style="text-align: left;">whereby the theorem also holds for all <img src='http://s0.wp.com/latex.php?latex=%5CGamma_%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_&#92;varepsilon' title='&#92;Gamma_&#92;varepsilon' class='latex' />.</p>
<p style="text-align: left;">We also observe that a simple application of the Fubini-Tonelli theorem yields the following multiplication formula for <img src='http://s0.wp.com/latex.php?latex=f%2Cg+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f,g &#92;in L^1(&#92;mathbb{R}^d)' title='f,g &#92;in L^1(&#92;mathbb{R}^d)' class='latex' />:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7Bf%7D%28t%29+g%28t%29+%5C%2C+dt+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+f%28t%29+%5Chat%7Bg%7D%28t%29+%5C%2C+dt.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(t) g(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} f(t) &#92;hat{g}(t) &#92;, dt.' title='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(t) g(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} f(t) &#92;hat{g}(t) &#92;, dt.' class='latex' /></p>
<p style="text-align: left;">Lastly, we will need the following standard fact, whose proof can be found, for example, in page 243 of [Fol99] or page 63 of [Ste70].</p>
<p style="text-align: left;"><strong>Lemma 2</strong> (Approximation to the identity).<em>Let <img src='http://s0.wp.com/latex.php?latex=%5Cvarphi+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varphi &#92;in L^1(&#92;mathbb{R}^d)' title='&#92;varphi &#92;in L^1(&#92;mathbb{R}^d)' class='latex' /> and set</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cvarphi_%5Cvarepsilon%28x%29+%3D+%5Cvarepsilon%5E%7B-d%7D+%5Cvarphi%28%5Cvarepsilon%5E%7B-1%7D+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;varphi_&#92;varepsilon(x) = &#92;varepsilon^{-d} &#92;varphi(&#92;varepsilon^{-1} x)' title='&#92;displaystyle &#92;varphi_&#92;varepsilon(x) = &#92;varepsilon^{-d} &#92;varphi(&#92;varepsilon^{-1} x)' class='latex' /></em></p>
<p style="text-align: left;"><em>for each <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varepsilon &gt; 0' title='&#92;varepsilon &gt; 0' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cvarphi_%5Cvarepsilon%28x%29+%5C%2C+dx+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;int_{&#92;mathbb{R}^d} &#92;varphi_&#92;varepsilon(x) &#92;, dx = 0' title='&#92;int_{&#92;mathbb{R}^d} &#92;varphi_&#92;varepsilon(x) &#92;, dx = 0' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon+%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varepsilon &gt;0' title='&#92;varepsilon &gt;0' class='latex' />, then</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7B%5Cvarepsilon+%5Cto+0%7D+%5C%7Cf+%2A+%5Cvarphi_%5Cvarepsilon+-+f%5C%7C_p+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} &#92;|f * &#92;varphi_&#92;varepsilon - f&#92;|_p = 0' title='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} &#92;|f * &#92;varphi_&#92;varepsilon - f&#92;|_p = 0' class='latex' /></em></p>
<p style="text-align: left;"><em>for every <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p(&#92;mathbb{R}^d)' title='f &#92;in L^p(&#92;mathbb{R}^d)' class='latex' /> with a fixed <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; &#92;infty' title='1 &#92;leq p &lt; &#92;infty' class='latex' />.</em></p>
<p style="text-align: left;">We are now ready to prove Theorem 1. Consider the following modification of the inversion formula:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+I_%5Cvarepsilon+%28x%29+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7Bf%7D%28%5Cxi%29+e%5E%7B-+%5Cpi+%5Cvarepsilon%5E2+%7Cxi%7C%5E2%7D+e%5E%7B2+%5Cpi+i+%5Cxi+%5Ccdot+x%7D+%5C%2C+d%5Cxi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle I_&#92;varepsilon (x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{- &#92;pi &#92;varepsilon^2 |xi|^2} e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d&#92;xi' title='&#92;displaystyle I_&#92;varepsilon (x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{- &#92;pi &#92;varepsilon^2 |xi|^2} e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d&#92;xi' class='latex' />.</p>
<p style="text-align: left;">Since <img src='http://s0.wp.com/latex.php?latex=%5Chat%7Bf%7D+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;hat{f} &#92;in L^1(&#92;mathbb{R}^d)' title='&#92;hat{f} &#92;in L^1(&#92;mathbb{R}^d)' class='latex' />, the dominated convergence theorem implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7B%5Cvarepsilon+%5Cto+0%7D+I_%5Cvarepsilon%28x%29+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7Bf%7D%28%5Cxi%29+e%5E%7B2+%5Cpi+i+%5Cxi+%5Ccdot+x%7D+%5C%2C+d+%5Cxi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} I_&#92;varepsilon(x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d &#92;xi' title='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} I_&#92;varepsilon(x) = &#92;int_{&#92;mathbb{R}^d} &#92;hat{f}(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x} &#92;, d &#92;xi' class='latex' />.</p>
<p style="text-align: left;">We set <img src='http://s0.wp.com/latex.php?latex=g_%5Cvarepsilon%28%5Cxi%29+%3D+e%5E%7B-%5Cpi+%5Cvarepsilon%5E2+%7C%5Cxi%7C%5E2%7D+e%5E%7B2+%5Cpi+i+%5Cxi+%5Ccdot+x%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_&#92;varepsilon(&#92;xi) = e^{-&#92;pi &#92;varepsilon^2 |&#92;xi|^2} e^{2 &#92;pi i &#92;xi &#92;cdot x}' title='g_&#92;varepsilon(&#92;xi) = e^{-&#92;pi &#92;varepsilon^2 |&#92;xi|^2} e^{2 &#92;pi i &#92;xi &#92;cdot x}' class='latex' /> and note that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+I_%5Cvarepsilon+%28x%29+%3D+%5Cint+%5Chat%7Bf%7D%28t%29+g%28t%29+%5C%2C+dt+%3D+%5Cint+f%28t%29+%5Chat%7Bg%7D%28t%29+%5C%2C+dt%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle I_&#92;varepsilon (x) = &#92;int &#92;hat{f}(t) g(t) &#92;, dt = &#92;int f(t) &#92;hat{g}(t) &#92;, dt,' title='&#92;displaystyle I_&#92;varepsilon (x) = &#92;int &#92;hat{f}(t) g(t) &#92;, dt = &#92;int f(t) &#92;hat{g}(t) &#92;, dt,' class='latex' /></p>
<p>by the multiplication formula. Since <img src='http://s0.wp.com/latex.php?latex=g%28%5Cxi%29+%3D+%5CGamma_%5Cvarepsilon%28%5Cxi%29+e%5E%7B2+%5Cpi+i+%5Cxi+%5Ccdot+x%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g(&#92;xi) = &#92;Gamma_&#92;varepsilon(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x}' title='g(&#92;xi) = &#92;Gamma_&#92;varepsilon(&#92;xi) e^{2 &#92;pi i &#92;xi &#92;cdot x}' class='latex' />, we see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Chat%7Bg%7D%28t%29+%3D+%5Cwidehat%7B%5CGamma_%5Cvarepsilon%7D%28t-s%29+%3D+%5CGamma%5E%5Cvarepsilon%28s-t%29%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;hat{g}(t) = &#92;widehat{&#92;Gamma_&#92;varepsilon}(t-s) = &#92;Gamma^&#92;varepsilon(s-t),' title='&#92;displaystyle &#92;hat{g}(t) = &#92;widehat{&#92;Gamma_&#92;varepsilon}(t-s) = &#92;Gamma^&#92;varepsilon(s-t),' class='latex' /></p>
<p>where <img src='http://s0.wp.com/latex.php?latex=%5CGamma%5E%5Cvarepsilon%28t%29+%3D+%5Cvarepsilon%5E%7B-d%7D+%5CGamma%28%5Cvarepsilon%5E%7B-1%7D+t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma^&#92;varepsilon(t) = &#92;varepsilon^{-d} &#92;Gamma(&#92;varepsilon^{-1} t)' title='&#92;Gamma^&#92;varepsilon(t) = &#92;varepsilon^{-d} &#92;Gamma(&#92;varepsilon^{-1} t)' class='latex' />. Observing that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+I_%5Cvarepsilon+%3D+f+%2A+%5CGamma%5E%5Cvarepsilon%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle I_&#92;varepsilon = f * &#92;Gamma^&#92;varepsilon,' title='&#92;displaystyle I_&#92;varepsilon = f * &#92;Gamma^&#92;varepsilon,' class='latex' /></p>
<p>we conclude from Lemma 2 that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7B%5Cvarepsilon+%5Cto+0%7D+%5C%7CI_%5Cvarepsilon+-+f%5C%7C_1+%3D+0.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} &#92;|I_&#92;varepsilon - f&#92;|_1 = 0.' title='&#92;displaystyle &#92;lim_{&#92;varepsilon &#92;to 0} &#92;|I_&#92;varepsilon - f&#92;|_1 = 0.' class='latex' /></p>
<p>The theorem now follows. <img src='http://s0.wp.com/latex.php?latex=%5Csquare&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;square' title='&#92;square' class='latex' /></p>
<p>Note that the inversion theorem can be reformulated as</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cwidehat%7B%5Chat%7Bf%7D%7D%28x%29+%3D+f%28-x%29.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;widehat{&#92;hat{f}}(x) = f(-x).' title='&#92;displaystyle &#92;widehat{&#92;hat{f}}(x) = f(-x).' class='latex' /></p>
<p>If <img src='http://s0.wp.com/latex.php?latex=%5Cvarphi%2C%5Cphi+%5Cin+%5Cmathcal%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varphi,&#92;phi &#92;in &#92;mathcal{S}(&#92;mathbb{R}^d)' title='&#92;varphi,&#92;phi &#92;in &#92;mathcal{S}(&#92;mathbb{R}^d)' class='latex' />, then the inversion theorem implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cvarphi%28t%29+%5Cbar%7B%5Cphi%7D%28t%29+%5C%2C+dt+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cwidehat%7B%5Chat%7B%5Cvarphi%7D%7D%28-t%29+%5Cbar%7B%5Cphi%7D%28t%29+%5C%2C+dt+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cwidehat%7B%5Chat%7B%5Cvarphi%7D%7D%28-t%29+%5Coverline%7B%5Cphi%28-t%29%7D+%5C%2C+dt.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;varphi(t) &#92;bar{&#92;phi}(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}}(-t) &#92;bar{&#92;phi}(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}}(-t) &#92;overline{&#92;phi(-t)} &#92;, dt.' title='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;varphi(t) &#92;bar{&#92;phi}(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}}(-t) &#92;bar{&#92;phi}(t) &#92;, dt = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}}(-t) &#92;overline{&#92;phi(-t)} &#92;, dt.' class='latex' /></p>
<p>Therefore,</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7B%5Cvarphi%7D+%5Coverline%7B%5Chat%7B%5Cphi%7D%7D+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cwidehat%7B%5Chat%7B%5Cvarphi%7D%7D+%5Ctilde%7B%5Cphi%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;overline{&#92;hat{&#92;phi}} = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}} &#92;tilde{&#92;phi},' title='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;overline{&#92;hat{&#92;phi}} = &#92;int_{&#92;mathbb{R}^d} &#92;widehat{&#92;hat{&#92;varphi}} &#92;tilde{&#92;phi},' class='latex' /></p>
<p>whence by the multiplication formula we obtain</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Cvarphi+%5Coverline%7B%5Cphi%7D+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7B%5Cvarphi%7D+%5Cwidehat%7B%5Ctilde%7B%5Cphi%7D%7D+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+%5Chat%7B%5Cvarphi%7D+%5Coverline%7B%5Chat%7B%5Cphi%7D%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;varphi &#92;overline{&#92;phi} = &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;widehat{&#92;tilde{&#92;phi}} = &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;overline{&#92;hat{&#92;phi}}.' title='&#92;displaystyle &#92;int_{&#92;mathbb{R}^d} &#92;varphi &#92;overline{&#92;phi} = &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;widehat{&#92;tilde{&#92;phi}} = &#92;int_{&#92;mathbb{R}^d} &#92;hat{&#92;varphi} &#92;overline{&#92;hat{&#92;phi}}.' class='latex' /></p>
<p>This implies that the Fourier transform restricted to <img src='http://s0.wp.com/latex.php?latex=%5Cmathcal%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathcal{S}(&#92;mathbb{R}^d)' title='&#92;mathcal{S}(&#92;mathbb{R}^d)' class='latex' /> is an isometry in the <img src='http://s0.wp.com/latex.php?latex=L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2' title='L^2' class='latex' />-norm. Since the Schwartz space <img src='http://s0.wp.com/latex.php?latex=%5Cmathcal%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathcal{S}(&#92;mathbb{R}^d)' title='&#92;mathcal{S}(&#92;mathbb{R}^d)' class='latex' /> is dense in <img src='http://s0.wp.com/latex.php?latex=L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2(&#92;mathbb{R}^d)' title='L^2(&#92;mathbb{R}^d)' class='latex' />, there exists a unique norm-preserving extension of the Fourier transform onto all of <img src='http://s0.wp.com/latex.php?latex=L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2(&#92;mathbb{R}^d)' title='L^2(&#92;mathbb{R}^d)' class='latex' />. We concede that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7C%5Chat%7Bf%7D%5C%7C_2+%3D+%5C%7Cf%5C%7C_2.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_2 = &#92;|f&#92;|_2.' title='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_2 = &#92;|f&#92;|_2.' class='latex' /></p>
<p style="text-align: center;"><strong><a id="1-2">- 2. The Riesz-Thorin interpolation theorem -</a></strong></p>
<p>We have thus seen that the Fourier transform <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BF%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{F}' title='&#92;mathscr{F}' class='latex' /> is a bounded linear operator from <img src='http://s0.wp.com/latex.php?latex=L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(&#92;mathbb{R}^d)' title='L^1(&#92;mathbb{R}^d)' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E%5Cinfty%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^&#92;infty(&#92;mathbb{R}^d)' title='L^&#92;infty(&#92;mathbb{R}^d)' class='latex' /> and from <img src='http://s0.wp.com/latex.php?latex=L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2(&#92;mathbb{R}^d)' title='L^2(&#92;mathbb{R}^d)' class='latex' /> to <img src='http://s0.wp.com/latex.php?latex=L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2(&#92;mathbb{R}^d)' title='L^2(&#92;mathbb{R}^d)' class='latex' />, each with the operator norm at most 1. Since the natural &#8220;intermediate Banach spaces&#8221; of <img src='http://s0.wp.com/latex.php?latex=L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(&#92;mathbb{R}^d)' title='L^1(&#92;mathbb{R}^d)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2(&#92;mathbb{R}^d)' title='L^2(&#92;mathbb{R}^d)' class='latex' /> are <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(&#92;mathbb{R}^d)' title='L^p(&#92;mathbb{R}^d)' class='latex' /> for <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; 2' title='1 &lt; p &lt; 2' class='latex' />, an interpolation theorem for our example should<em></em> give us a norm estimate of the Fourier transform operator on <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(&#92;mathbb{R}^d)' title='L^p(&#92;mathbb{R}^d)' class='latex' />.</p>
<p>Note, however, that the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' /> Fourier transform and the <img src='http://s0.wp.com/latex.php?latex=L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2' title='L^2' class='latex' /> Fourier transform are, formally speaking, two different operators. We must find a way to describe an operator that takes, in a suitable sense, multiple domains. Taking a cue from how we defined the <img src='http://s0.wp.com/latex.php?latex=L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2' title='L^2' class='latex' /> Fourier transform, we shall consider an operator defined on a collection of functions that is dense in each <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />.</p>
<p><strong>Definition</strong>. <em>Let <img src='http://s0.wp.com/latex.php?latex=%28X%2C%5Cmu%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(X,&#92;mu)' title='(X,&#92;mu)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%28Y%2C%5Cnu%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(Y,&#92;nu)' title='(Y,&#92;nu)' class='latex' /> be <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />-finite measure spaces and fix a vector space <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=%5Cmu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mu' title='&#92;mu' class='latex' />-measurable complex-valued functions on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> that</em></p>
<ul>
<li><em>contains characteristic functions of sets of finite measure, and</em></li>
<li><em>is closed under </em>truncation<em> of <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in D' title='f &#92;in D' class='latex' />, viz., a <img src='http://s0.wp.com/latex.php?latex=%5Cmu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mu' title='&#92;mu' class='latex' />-measurable complex-valued  function <img src='http://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g' title='g' class='latex' /> defined by</em>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+g%28x%29+%3D+%5Cbegin%7Bcases%7D+f%28x%29+%26+%5Cmbox%7B+if+%7D+r_1+%3C+%7Cf%28x%29%7C+%5Cleq+r_2%3B+%5C%5C+0+%26+%5Cmbox%7B+otherwise%7D%3B+%5Cend%7Bcases%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle g(x) = &#92;begin{cases} f(x) &amp; &#92;mbox{ if } r_1 &lt; |f(x)| &#92;leq r_2; &#92;&#92; 0 &amp; &#92;mbox{ otherwise}; &#92;end{cases}' title='&#92;displaystyle g(x) = &#92;begin{cases} f(x) &amp; &#92;mbox{ if } r_1 &lt; |f(x)| &#92;leq r_2; &#92;&#92; 0 &amp; &#92;mbox{ otherwise}; &#92;end{cases}' class='latex' /></em></p>
</li>
</ul>
<p><em>for some nonnegative real numbers <img src='http://s0.wp.com/latex.php?latex=r_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r_1' title='r_1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=r_2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r_2' title='r_2' class='latex' />. Given <em><img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p%2Cq+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p,q &#92;leq &#92;infty' title='1 &#92;leq p,q &#92;leq &#92;infty' class='latex' /></em>, a linear operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /></em> <em>into a vector space of <img src='http://s0.wp.com/latex.php?latex=%5Cnu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;nu' title='&#92;nu' class='latex' />-measurable complex-valued functions on <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is of </em>type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /><em> if there exists a constant <img src='http://s0.wp.com/latex.php?latex=k%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k&gt;0' title='k&gt;0' class='latex' /> such that</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CTf%5C%7C_q+%5Cleq+k+%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq k &#92;|f&#92;|_p' title='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq k &#92;|f&#92;|_p' class='latex' /></em></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+D+%5Ccap+L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in D &#92;cap L^p(X)' title='f &#92;in D &#92;cap L^p(X)' class='latex' />. The smallest such <img src='http://s0.wp.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k' title='k' class='latex' /> is the </em><img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' />-norm <em>of <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />.</em></p>
<p>Since <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> is dense in <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(X)' title='L^p(X)' class='latex' />, each linear operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> of type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> can be extended uniquely to the operator <img src='http://s0.wp.com/latex.php?latex=T%27%3AL%5Ep%28X%29+%5Cto+L%5Eq%28Y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T&#039;:L^p(X) &#92;to L^q(Y)' title='T&#039;:L^p(X) &#92;to L^q(Y)' class='latex' /> with the same operator norm. With this definition, we can now state the Riesz-Thorin interpolation theorem as follows:</p>
<p><strong>Theorem 3</strong> (Riesz-Thorin). <em>If a linear operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%28p_0%2Cq_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_0,q_0)' title='(p_0,q_0)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%28p_0%2Cq_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_0,q_0)' title='(p_0,q_0)' class='latex' />-norm <img src='http://s0.wp.com/latex.php?latex=k_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_0' title='k_0' class='latex' /> and </em><em>of type <img src='http://s0.wp.com/latex.php?latex=%28p_1%2Cq_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_1,q_1)' title='(p_1,q_1)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%28p_1%2Cq_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_1,q_1)' title='(p_1,q_1)' class='latex' />-norm <img src='http://s0.wp.com/latex.php?latex=k_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_1' title='k_1' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of</em> <em>type <img src='http://s0.wp.com/latex.php?latex=%28p_t%2Cq_t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_t,q_t)' title='(p_t,q_t)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%28p_t%2Cq_t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_t,q_t)' title='(p_t,q_t)' class='latex' />-norm <img src='http://s0.wp.com/latex.php?latex=k_t+%5Cleq+k_0%5E%7B1-t%7D+k_1%5Et&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_t &#92;leq k_0^{1-t} k_1^t' title='k_t &#92;leq k_0^{1-t} k_1^t' class='latex' /> </em><em>for each <img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+t+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq t &#92;leq 1' title='0 &#92;leq t &#92;leq 1' class='latex' />,</em> <em>where</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+p_t%5E%7B-1%7D+%3D+%281-t%29p_0%5E%7B-1%7D+%2B+p_1%5E%7B-1%7D%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' title='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' class='latex' /></em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+q_t%5E%7B-1%7D+%3D+%281-t%29q_0%5E%7B-1%7D+%2B+tq_1%5E%7B-1%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' title='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' class='latex' /></em></p>
<p><em></em>We shall need the following lemma, which is the complex-analytic method we have advertised:</p>
<p><strong>Lemma 4</strong> (Hadamard&#8217;s three lines lemma). <em>Let <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> be a holomorphic function in the interior of the closed strip</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+S+%3D+%5C%7Bz+%5Cin+%5Cmathbb%7BC%7D%3A+0+%5Cleq+%5Cmathrm%7BRe%7D+z+%5Cleq+1%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle S = &#92;{z &#92;in &#92;mathbb{C}: 0 &#92;leq &#92;mathrm{Re} z &#92;leq 1&#92;}' title='&#92;displaystyle S = &#92;{z &#92;in &#92;mathbb{C}: 0 &#92;leq &#92;mathrm{Re} z &#92;leq 1&#92;}' class='latex' /></p>
<p><em>and a bounded continuous function on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%7CF%28z%29%7C+%5Cleq+m_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|F(z)| &#92;leq m_0' title='|F(z)| &#92;leq m_0' class='latex' /> on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BIm%7D+z+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Im} z = 0' title='&#92;mathrm{Im} z = 0' class='latex' /> and if <img src='http://s0.wp.com/latex.php?latex=%7CF%28z%29%7C+%5Cleq+m_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|F(z)| &#92;leq m_1' title='|F(z)| &#92;leq m_1' class='latex' /> on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BIm%7D+z+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Im} z = 1' title='&#92;mathrm{Im} z = 1' class='latex' />, then, for each <img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+t+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq t &#92;leq 1' title='0 &#92;leq t &#92;leq 1' class='latex' />, we have the inequality</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7CF%28z%29%7C+%5Cleq+m_0%5E%7B1-t%7D+m_1%5Et&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |F(z)| &#92;leq m_0^{1-t} m_1^t' title='&#92;displaystyle |F(z)| &#92;leq m_0^{1-t} m_1^t' class='latex' /></p>
<p><em>on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BIm%7D+z+%3D+t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Im} z = t' title='&#92;mathrm{Im} z = t' class='latex' />.</em></p>
<p>The proof of the lemma is an instance of a widely-used maximum modulus principle argument, known as the <em>Phragmén–Lindelöf principle</em>.</p>
<p><em>Proof of Lemma</em>. We define holomorphic functions</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+G%28z%29+%3D+%5Cfrac%7BF%28z%29%7D%7Bm_0%5E%7B1-z%7Dm_1%5Ez%7D+%5Cmbox%7B+and+%7D+G_n%28z%29+%3D+G%28z%29e%5E%7B%28z%5E2-1%29%2Fn%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle G(z) = &#92;frac{F(z)}{m_0^{1-z}m_1^z} &#92;mbox{ and } G_n(z) = G(z)e^{(z^2-1)/n},' title='&#92;displaystyle G(z) = &#92;frac{F(z)}{m_0^{1-z}m_1^z} &#92;mbox{ and } G_n(z) = G(z)e^{(z^2-1)/n},' class='latex' /></p>
<p>so that <img src='http://s0.wp.com/latex.php?latex=G_n+%5Cto+G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G_n &#92;to G' title='G_n &#92;to G' class='latex' /> as <img src='http://s0.wp.com/latex.php?latex=n+%5Cto+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n &#92;to &#92;infty' title='n &#92;to &#92;infty' class='latex' />. We wish to show that <img src='http://s0.wp.com/latex.php?latex=%7CG%28z%29%7C+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G(z)| &#92;leq 1' title='|G(z)| &#92;leq 1' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />.</p>
<p>We first note that <img src='http://s0.wp.com/latex.php?latex=%7CG%28z%29%7C+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G(z)| &#92;leq 1' title='|G(z)| &#92;leq 1' class='latex' /> on the lines <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BIm%7D+z+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Im} z = 0' title='&#92;mathrm{Im} z = 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BIm%7D+z+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Im} z = 1' title='&#92;mathrm{Im} z = 1' class='latex' />. Moreover, <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is bounded above on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=m_0%5E%7B1-z%7D+m_1%5Ez&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='m_0^{1-z} m_1^z' title='m_0^{1-z} m_1^z' class='latex' /> is bounded below on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />, hence we have the bound <img src='http://s0.wp.com/latex.php?latex=%7CG%28z%29%7C+%5Cleq+M&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G(z)| &#92;leq M' title='|G(z)| &#92;leq M' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />. Noting the inequality</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7CG_n%28z%29%7C+%5Cleq+Me%5E%7B-%5Cmathrm%7BIm%7D%28z%29%5E2+%2F+n%7D+e%5E%7B%28%5Cmathrm%7BRe%7D%28z%29%5E2-1%29%2Fn%7D+%5Cleq+Me%5E%7B-%5Cmathrm%7BIm%7D%28z%29%5E2%2Fn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |G_n(z)| &#92;leq Me^{-&#92;mathrm{Im}(z)^2 / n} e^{(&#92;mathrm{Re}(z)^2-1)/n} &#92;leq Me^{-&#92;mathrm{Im}(z)^2/n}' title='&#92;displaystyle |G_n(z)| &#92;leq Me^{-&#92;mathrm{Im}(z)^2 / n} e^{(&#92;mathrm{Re}(z)^2-1)/n} &#92;leq Me^{-&#92;mathrm{Im}(z)^2/n}' class='latex' />,</p>
<p>we see that <img src='http://s0.wp.com/latex.php?latex=G_n%28z%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G_n(z)' title='G_n(z)' class='latex' /> converges uniformly to 0 as <img src='http://s0.wp.com/latex.php?latex=%7Cy%7C+%5Cto+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|y| &#92;to &#92;infty' title='|y| &#92;to &#92;infty' class='latex' />. We can therefore find <img src='http://s0.wp.com/latex.php?latex=y_n+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y_n &gt; 0' title='y_n &gt; 0' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%7CG_n%28z%29%7C+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G_n(z)| &#92;leq 1' title='|G_n(z)| &#92;leq 1' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=%7C%5Cmathrm%7BIm%7D%28z%29%7C+%5Cgeq+y_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|&#92;mathrm{Im}(z)| &#92;geq y_n' title='|&#92;mathrm{Im}(z)| &#92;geq y_n' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+%5Cmathrm%7BRe%7D%28z%29+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq &#92;mathrm{Re}(z) &#92;leq 1' title='0 &#92;leq &#92;mathrm{Re}(z) &#92;leq 1' class='latex' />, whence by the maximum modulus principle we have <img src='http://s0.wp.com/latex.php?latex=%7CG_n%28z%29%7C+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G_n(z)| &#92;leq 1' title='|G_n(z)| &#92;leq 1' class='latex' /> on the rectangle</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Bz+%5Cin+%5Cmathbb%7BC%7D+%3A+0+%5Cleq+%5Cmathrm%7BRe%7D%28z%29+%5Cleq+1+%5Cmbox%7B+and+%7D+-y_n+%5Cleq+%5Cmathrm%7BIm%7D%28z%29+%5Cleq+y_n%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;{z &#92;in &#92;mathbb{C} : 0 &#92;leq &#92;mathrm{Re}(z) &#92;leq 1 &#92;mbox{ and } -y_n &#92;leq &#92;mathrm{Im}(z) &#92;leq y_n&#92;}' title='&#92;displaystyle &#92;{z &#92;in &#92;mathbb{C} : 0 &#92;leq &#92;mathrm{Re}(z) &#92;leq 1 &#92;mbox{ and } -y_n &#92;leq &#92;mathrm{Im}(z) &#92;leq y_n&#92;}' class='latex' />.</p>
<p>It follows that <img src='http://s0.wp.com/latex.php?latex=%7CG_n%28z%29%7C+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|G_n(z)| &#92;leq 1' title='|G_n(z)| &#92;leq 1' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=n+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n &#92;in &#92;mathbb{N}' title='n &#92;in &#92;mathbb{N}' class='latex' />, and letting <img src='http://s0.wp.com/latex.php?latex=n+%5Cto+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n &#92;to &#92;infty' title='n &#92;to &#92;infty' class='latex' /> yields the desired result. <img src='http://s0.wp.com/latex.php?latex=%5Csquare&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;square' title='&#92;square' class='latex' /></p>
<p>We are now ready to present a proof of the Riesz-Thorin interpolation theorem. We write <img src='http://s0.wp.com/latex.php?latex=p%27&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p&#039;' title='p&#039;' class='latex' /> to denote the conjugate exponent of <img src='http://s0.wp.com/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p' title='p' class='latex' />, so that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cfrac%7B1%7D%7Bp%7D+%2B+%5Cfrac%7B1%7D%7Bp%27%7D+%3D+1.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;frac{1}{p} + &#92;frac{1}{p&#039;} = 1.' title='&#92;displaystyle &#92;frac{1}{p} + &#92;frac{1}{p&#039;} = 1.' class='latex' /></p>
<p>The following proof is taken from pp. 181-183 of [SW71]:</p>
<p><em>Proof of Theorem 3.</em> Fix <img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+t+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq t &#92;leq 1' title='0 &#92;leq t &#92;leq 1' class='latex' />. For notational convenience, we let</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Calpha_0+%3D+%5Cfrac%7B1%7D%7Bp_0%7D%2C+%5Calpha_1+%3D+%5Cfrac%7B1%7D%7Bp_1%7D%2C+%5Calpha+%3D+%5Cfrac%7B1%7D%7Bp_t%7D%2C+%5Cbeta_0+%3D+%5Cfrac%7B1%7D%7Bq_0%7D%2C+%5Cbeta_1+%3D+%5Cfrac%7B1%7D%7Bq_1%7D%2C+%5Cbeta+%3D+%5Cfrac%7B1%7D%7Bq_t%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;alpha_0 = &#92;frac{1}{p_0}, &#92;alpha_1 = &#92;frac{1}{p_1}, &#92;alpha = &#92;frac{1}{p_t}, &#92;beta_0 = &#92;frac{1}{q_0}, &#92;beta_1 = &#92;frac{1}{q_1}, &#92;beta = &#92;frac{1}{q_t}.' title='&#92;displaystyle &#92;alpha_0 = &#92;frac{1}{p_0}, &#92;alpha_1 = &#92;frac{1}{p_1}, &#92;alpha = &#92;frac{1}{p_t}, &#92;beta_0 = &#92;frac{1}{q_0}, &#92;beta_1 = &#92;frac{1}{q_1}, &#92;beta = &#92;frac{1}{q_t}.' class='latex' /></p>
<p>With this notation, we set</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Calpha%28z%29+%3D+%281-z%29%5Calpha_0+%2B+z%5Calpha_1+%5Cmbox%7B+and+%7D+%5Cbeta%28z%29+%3D+%281-z%29%5Cbeta_0+%2B+z%5Cbeta_1%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;alpha(z) = (1-z)&#92;alpha_0 + z&#92;alpha_1 &#92;mbox{ and } &#92;beta(z) = (1-z)&#92;beta_0 + z&#92;beta_1,' title='&#92;displaystyle &#92;alpha(z) = (1-z)&#92;alpha_0 + z&#92;alpha_1 &#92;mbox{ and } &#92;beta(z) = (1-z)&#92;beta_0 + z&#92;beta_1,' class='latex' /></p>
<p>so that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Calpha%280%29+%3D+%5Calpha_0%2C+%5Calpha%281%29+%3D+%5Calpha_1%2C+%5Calpha%28t%29+%3D+%5Calpha%2C+%5Cbeta%280%29+%3D+%5Cbeta_0%2C+%5Cbeta%281%29+%3D+%5Cbeta_1%2C+%5Cbeta%28t%29+%3D+%5Cbeta.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;alpha(0) = &#92;alpha_0, &#92;alpha(1) = &#92;alpha_1, &#92;alpha(t) = &#92;alpha, &#92;beta(0) = &#92;beta_0, &#92;beta(1) = &#92;beta_1, &#92;beta(t) = &#92;beta.' title='&#92;displaystyle &#92;alpha(0) = &#92;alpha_0, &#92;alpha(1) = &#92;alpha_1, &#92;alpha(t) = &#92;alpha, &#92;beta(0) = &#92;beta_0, &#92;beta(1) = &#92;beta_1, &#92;beta(t) = &#92;beta.' class='latex' /></p>
<p>We shall first prove the theorem for simple functions, which evidently belong to <img src='http://s0.wp.com/latex.php?latex=D+%5Ccap+L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D &#92;cap L^p(X)' title='D &#92;cap L^p(X)' class='latex' />. By the Riesz representation theorem, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CTf%5C%7C_q+%3D+%5Csup+%5Cleft%7C+%5Cint_Y+%28Tf%29+g+%5C%2C+d%5Cnu+%5Cright%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Tf&#92;|_q = &#92;sup &#92;left| &#92;int_Y (Tf) g &#92;, d&#92;nu &#92;right|' title='&#92;displaystyle &#92;|Tf&#92;|_q = &#92;sup &#92;left| &#92;int_Y (Tf) g &#92;, d&#92;nu &#92;right|' class='latex' /></p>
<p>for each simple function <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />, where the supremum is taken over all simple functions <img src='http://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g' title='g' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bq%27%7D%28Y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{q&#039;}(Y)' title='L^{q&#039;}(Y)' class='latex' />-norm at most one. Therefore, it suffices to show that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%7C+%5Cint_Y+%28Tf%29g+%5C%2C+d%5Cnu+%5Cright%7C+%5Cleq+k_0%5E%7B1-t%7Dk_1%5E%7Bt%7D%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left| &#92;int_Y (Tf)g &#92;, d&#92;nu &#92;right| &#92;leq k_0^{1-t}k_1^{t}&#92;|f&#92;|_p' title='&#92;displaystyle &#92;left| &#92;int_Y (Tf)g &#92;, d&#92;nu &#92;right| &#92;leq k_0^{1-t}k_1^{t}&#92;|f&#92;|_p' class='latex' /></p>
<p>for each such <img src='http://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g' title='g' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%5C%7Cf%5C%7C_p+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|f&#92;|_p = 0' title='&#92;|f&#92;|_p = 0' class='latex' />, then there is nothing to prove, and so we can assume by renormalization of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> that <img src='http://s0.wp.com/latex.php?latex=%5C%7Cf%5C%7C_p+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|f&#92;|_p = 1' title='&#92;|f&#92;|_p = 1' class='latex' />. We therefore set out to establish <img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%7C+%5Cint_Y+%28Tf%29g+%5C%2C+d%5Cnu+%5Cright%7C+%5Cleq+k_0%5E%7B1-t%7Dk_1%5E%7Bt%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left| &#92;int_Y (Tf)g &#92;, d&#92;nu &#92;right| &#92;leq k_0^{1-t}k_1^{t}' title='&#92;displaystyle &#92;left| &#92;int_Y (Tf)g &#92;, d&#92;nu &#92;right| &#92;leq k_0^{1-t}k_1^{t}' class='latex' /> for all simple functions <img src='http://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g' title='g' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%5C%7Cg%5C%7C_%7Bq%27%7D%3D1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|g&#92;|_{q&#039;}=1' title='&#92;|g&#92;|_{q&#039;}=1' class='latex' />.</p>
<p>We now suppose that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f+%3D+%5Csum_%7Bj%3D1%7D%5Em+a_j+%5Cchi_%7BE_j%7D+%5Cmbox%7B+and+%7D+g+%3D+%5Csum_%7Bj%3D1%7D%5En+b_k+%5Cchi_%7BF_k%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f = &#92;sum_{j=1}^m a_j &#92;chi_{E_j} &#92;mbox{ and } g = &#92;sum_{j=1}^n b_k &#92;chi_{F_k}' title='&#92;displaystyle f = &#92;sum_{j=1}^m a_j &#92;chi_{E_j} &#92;mbox{ and } g = &#92;sum_{j=1}^n b_k &#92;chi_{F_k}' class='latex' /></p>
<p>are two simple functions satisfying the above conditions. We also assume without loss of generality that <img src='http://s0.wp.com/latex.php?latex=p_t+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_t &lt; &#92;infty' title='p_t &lt; &#92;infty' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=q_t+%3E+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='q_t &gt; 1' title='q_t &gt; 1' class='latex' />, so that <img src='http://s0.wp.com/latex.php?latex=%5Calpha+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha &gt; 0' title='&#92;alpha &gt; 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cbeta+%3C+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;beta &lt; 1' title='&#92;beta &lt; 1' class='latex' />. Write <img src='http://s0.wp.com/latex.php?latex=a_j+%3D+%7Ca_j%7C+e%5E%7Bi%5Ctheta_j%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='a_j = |a_j| e^{i&#92;theta_j}' title='a_j = |a_j| e^{i&#92;theta_j}' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=b_k+%3D+%7Cb_k%7C+e%5E%7Bi%5Cvarphi_k%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='b_k = |b_k| e^{i&#92;varphi_k}' title='b_k = |b_k| e^{i&#92;varphi_k}' class='latex' /> and set</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f_z+%3D+%5Csum_%7Bj%3D1%7D%5Em+%7Ca_j%7C%5E%7B%5Calpha%28z%29%2F%5Calpha%7De%5E%7Bi%5Ctheta_j%7D+%5Cchi_%7BE_j%7D+%5Cmbox%7B+and+%7D+g_z+%3D+%5Csum_%7Bk%3D1%7D%5Em+%7Cb_k%7C%5E%7B%281-%5Cbeta%28z%29%29%2F%281-%5Cbeta%29%7De%5E%7Bi%5Cvarphi_k%7D%5Cchi_%7BF_k%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f_z = &#92;sum_{j=1}^m |a_j|^{&#92;alpha(z)/&#92;alpha}e^{i&#92;theta_j} &#92;chi_{E_j} &#92;mbox{ and } g_z = &#92;sum_{k=1}^m |b_k|^{(1-&#92;beta(z))/(1-&#92;beta)}e^{i&#92;varphi_k}&#92;chi_{F_k}' title='&#92;displaystyle f_z = &#92;sum_{j=1}^m |a_j|^{&#92;alpha(z)/&#92;alpha}e^{i&#92;theta_j} &#92;chi_{E_j} &#92;mbox{ and } g_z = &#92;sum_{k=1}^m |b_k|^{(1-&#92;beta(z))/(1-&#92;beta)}e^{i&#92;varphi_k}&#92;chi_{F_k}' class='latex' /></p>
<p>for each <img src='http://s0.wp.com/latex.php?latex=z+%5Cin+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='z &#92;in &#92;mathbb{C}' title='z &#92;in &#92;mathbb{C}' class='latex' />. Then</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+F%28z%29+%3D+%5Cint_Y+%28Tf_z%29+g_z+%5C%2C+d%5Cnu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle F(z) = &#92;int_Y (Tf_z) g_z &#92;, d&#92;nu' title='&#92;displaystyle F(z) = &#92;int_Y (Tf_z) g_z &#92;, d&#92;nu' class='latex' /></p>
<p>is an entire function such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+F%28t%29+%3D+%5Cint_Y+%28Tf%29+g+%5C%2C+d%5Cnu.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle F(t) = &#92;int_Y (Tf) g &#92;, d&#92;nu.' title='&#92;displaystyle F(t) = &#92;int_Y (Tf) g &#92;, d&#92;nu.' class='latex' /></p>
<p>We note, in particular, that <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is holomorphic in the interior of <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' /> and is continuous on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />. Since <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is linear, we see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+F%28z%29+%3D+%5Csum_%7Bj%3D1%7D%5Em%5Csum_%7Bk%3D1%7D%5En+%7Ca_j%7C%5E%7B%5Calpha%28z%29%2F%5Calpha%7D+%7Cb_k%7C%5E%7B%281-%5Cbeta%28z%29%29%2F%281-%5Cbeta%29%7D%5Cleft%28e%5E%7Bi%28%5Ctheta_j+%2B+%5Cvarphi_k%29%7D+%5Cint_Y+%28T%5Cchi_%7BE_j%7D%29+%5Cchi_%7BF_k%7D+%5Cright%29%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle F(z) = &#92;sum_{j=1}^m&#92;sum_{k=1}^n |a_j|^{&#92;alpha(z)/&#92;alpha} |b_k|^{(1-&#92;beta(z))/(1-&#92;beta)}&#92;left(e^{i(&#92;theta_j + &#92;varphi_k)} &#92;int_Y (T&#92;chi_{E_j}) &#92;chi_{F_k} &#92;right),' title='&#92;displaystyle F(z) = &#92;sum_{j=1}^m&#92;sum_{k=1}^n |a_j|^{&#92;alpha(z)/&#92;alpha} |b_k|^{(1-&#92;beta(z))/(1-&#92;beta)}&#92;left(e^{i(&#92;theta_j + &#92;varphi_k)} &#92;int_Y (T&#92;chi_{E_j}) &#92;chi_{F_k} &#92;right),' class='latex' /></p>
<p>whence <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is bounded on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />.</p>
<p>We now furnish a bound for <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> on the lines <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z = 0' title='&#92;mathrm{Re} z = 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z = 1' title='&#92;mathrm{Re} z = 1' class='latex' />. Note first that <img src='http://s0.wp.com/latex.php?latex=%7CF%28z%29%7C+%5Cleq+%5C%7CTf_z%5C%7C_%7Bq_0%7D+%5C%7Cg_z%5C%7C_%7Bq%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|F(z)| &#92;leq &#92;|Tf_z&#92;|_{q_0} &#92;|g_z&#92;|_{q&#039;}' title='|F(z)| &#92;leq &#92;|Tf_z&#92;|_{q_0} &#92;|g_z&#92;|_{q&#039;}' class='latex' /> by Hölder&#8217;s inequality. Observing the identities <img src='http://s0.wp.com/latex.php?latex=%5Calpha%28z%29+%3D+%5Calpha_0+%2B+z%28%5Calpha_1+-%5Calpha_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha(z) = &#92;alpha_0 + z(&#92;alpha_1 -&#92;alpha_0)' title='&#92;alpha(z) = &#92;alpha_0 + z(&#92;alpha_1 -&#92;alpha_0)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=1-%5Cbeta%28z%29+%3D+%281-%5Cbeta_0%29+-+z%28%5Cbeta_1+-+%5Cbeta_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1-&#92;beta(z) = (1-&#92;beta_0) - z(&#92;beta_1 - &#92;beta_0)' title='1-&#92;beta(z) = (1-&#92;beta_0) - z(&#92;beta_1 - &#92;beta_0)' class='latex' /> on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z =0' title='&#92;mathrm{Re} z =0' class='latex' />, we see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7Cf_z%7C%5E%7Bp_0%7D+%3D+%7Ce%5E%7Bi+%5Carg+f%7D+%7Cf%7C%5E%7Bz+%28%5Calpha_1-%5Calpha_0%29%2F%5Calpha%7D+%7Cf%7C%5E%7Bp%2Fp_0%7D%7C%5E%7Bp_0%7D+%3D+%7Cf%7C%5Ep%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |f_z|^{p_0} = |e^{i &#92;arg f} |f|^{z (&#92;alpha_1-&#92;alpha_0)/&#92;alpha} |f|^{p/p_0}|^{p_0} = |f|^p;' title='&#92;displaystyle |f_z|^{p_0} = |e^{i &#92;arg f} |f|^{z (&#92;alpha_1-&#92;alpha_0)/&#92;alpha} |f|^{p/p_0}|^{p_0} = |f|^p;' class='latex' /></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7Cg_z%7C%5E%7Bq_0%27%7D+%3D+%7Ce%5E%7Bi+%5Carg+g%7D+%7Cg%7C%5E%7B-z+%28%5Cbeta_1+-+%5Cbeta_0%29%2F%281-%5Cbeta%29%7D+%7Cg%7C%5E%7Bq%27%2Fq_0%27%7D%7C%5E%7Bq_0%27%7D+%3D+%7Cg%7C%5E%7Bq%27%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |g_z|^{q_0&#039;} = |e^{i &#92;arg g} |g|^{-z (&#92;beta_1 - &#92;beta_0)/(1-&#92;beta)} |g|^{q&#039;/q_0&#039;}|^{q_0&#039;} = |g|^{q&#039;}.' title='&#92;displaystyle |g_z|^{q_0&#039;} = |e^{i &#92;arg g} |g|^{-z (&#92;beta_1 - &#92;beta_0)/(1-&#92;beta)} |g|^{q&#039;/q_0&#039;}|^{q_0&#039;} = |g|^{q&#039;}.' class='latex' /></p>
<p>Since <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%28p_0%2Cq_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_0,q_0)' title='(p_0,q_0)' class='latex' />, it thus follows that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cbegin%7Barray%7D%7Brcl%7D+%5Cdisplaystyle+%7CF%28z%29%7C+%26%5Cleq%26+%5Cdisplaystyle+%5C%7CTf_z%5C%7C_%7Bq_0%7D+%5C%7Cg_z%5C%7C_%7Bq%27%7D+%5C%5C+%26%5Cleq%26+%5Cdisplaystyle+k_0+%5C%7Cf_z%5C%7C_%7Bp_0%7D%5C%7Cg_z%5C%7C_%7Bq_0%27%7D+%5C%5C+%26%3D%26+%5Cdisplaystyle+k_0+%5Cleft%28+%5Cint_X+%7Cf%7C%5Ep+%5C%2C+d%5Cmu+%5Cright%29%5E%7B1%2Fp_0%7D+%5Cleft%28+%5Cint_Y+%7Cg%7C%5E%7Bq_0%27%7D+%5C%2C+d%5Cnu+%5Cright%29%5E%7B1%2Fq_0%7D+%5C%5C+%26%5Cleq%26+%5Cdisplaystyle+k_0+%5C%7Cf%5C%7C_p%5E%7Bp%2Fp_0%7D+%5C%7Cg%5C%7C_q%5E%7Bq%27%2Fq_0%27%7D+%5C%5C+%26%5Cleq%26+%5Cdisplaystyle+k_0+%5Cend%7Barray%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;begin{array}{rcl} &#92;displaystyle |F(z)| &amp;&#92;leq&amp; &#92;displaystyle &#92;|Tf_z&#92;|_{q_0} &#92;|g_z&#92;|_{q&#039;} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;|f_z&#92;|_{p_0}&#92;|g_z&#92;|_{q_0&#039;} &#92;&#92; &amp;=&amp; &#92;displaystyle k_0 &#92;left( &#92;int_X |f|^p &#92;, d&#92;mu &#92;right)^{1/p_0} &#92;left( &#92;int_Y |g|^{q_0&#039;} &#92;, d&#92;nu &#92;right)^{1/q_0} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;|f&#92;|_p^{p/p_0} &#92;|g&#92;|_q^{q&#039;/q_0&#039;} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;end{array}' title='&#92;displaystyle &#92;begin{array}{rcl} &#92;displaystyle |F(z)| &amp;&#92;leq&amp; &#92;displaystyle &#92;|Tf_z&#92;|_{q_0} &#92;|g_z&#92;|_{q&#039;} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;|f_z&#92;|_{p_0}&#92;|g_z&#92;|_{q_0&#039;} &#92;&#92; &amp;=&amp; &#92;displaystyle k_0 &#92;left( &#92;int_X |f|^p &#92;, d&#92;mu &#92;right)^{1/p_0} &#92;left( &#92;int_Y |g|^{q_0&#039;} &#92;, d&#92;nu &#92;right)^{1/q_0} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;|f&#92;|_p^{p/p_0} &#92;|g&#92;|_q^{q&#039;/q_0&#039;} &#92;&#92; &amp;&#92;leq&amp; &#92;displaystyle k_0 &#92;end{array}' class='latex' /></p>
<p>on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z = 0' title='&#92;mathrm{Re} z = 0' class='latex' />. A similar computation establishes the bound <img src='http://s0.wp.com/latex.php?latex=%7CF%28z%29%7C+%5Cleq+k_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|F(z)| &#92;leq k_1' title='|F(z)| &#92;leq k_1' class='latex' /> on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z = 1' title='&#92;mathrm{Re} z = 1' class='latex' />, whence by Hadamard&#8217;s three lines theorem we have the inequality</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7CF%28z%29%7C+%5Cleq+k_0%5E%7B1-t%7Dk_1%5Et&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |F(z)| &#92;leq k_0^{1-t}k_1^t' title='&#92;displaystyle |F(z)| &#92;leq k_0^{1-t}k_1^t' class='latex' /></p>
<p>on the line <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D+z+%3D+t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re} z = t' title='&#92;mathrm{Re} z = t' class='latex' />. Setting <img src='http://s0.wp.com/latex.php?latex=z+%3D+t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='z = t' title='z = t' class='latex' />, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%7C%5Cint_Y+%28Tf%29+g+%5C%2C+d%5Cnu%5Cright%7C+%3D+%7CF%28t%29%7C+%5Cleq+k_0%5E%7B1-t%7D+k_1%5Et%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left|&#92;int_Y (Tf) g &#92;, d&#92;nu&#92;right| = |F(t)| &#92;leq k_0^{1-t} k_1^t,' title='&#92;displaystyle &#92;left|&#92;int_Y (Tf) g &#92;, d&#92;nu&#92;right| = |F(t)| &#92;leq k_0^{1-t} k_1^t,' class='latex' /></p>
<p>which is the desired inequality.</p>
<p>Having established the theorem for simple functions, we now prove the theorem for the general <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+D+%5Ccap+L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in D &#92;cap L^p(X)' title='f &#92;in D &#92;cap L^p(X)' class='latex' />. To this end, we shall furnish a sequence <img src='http://s0.wp.com/latex.php?latex=%28f_n%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(f_n)_{n=1}^&#92;infty' title='(f_n)_{n=1}^&#92;infty' class='latex' /> of simple functions such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+%5C%7Cf_n+-+f%5C%7C_p+%3D+0+%5Cmbox%7B+and+%7D+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+%28T+f_n%29%28x%29+%3D+%28Tf%29%28x%29%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{n &#92;to &#92;infty} &#92;|f_n - f&#92;|_p = 0 &#92;mbox{ and } &#92;lim_{n &#92;to &#92;infty} (T f_n)(x) = (Tf)(x),' title='&#92;displaystyle &#92;lim_{n &#92;to &#92;infty} &#92;|f_n - f&#92;|_p = 0 &#92;mbox{ and } &#92;lim_{n &#92;to &#92;infty} (T f_n)(x) = (Tf)(x),' class='latex' /></p>
<p>for then Fatou&#8217;s lemma yields the inequality</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CTf%5C%7C_q+%5Cleq+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+%5C%7CTf_n%5C%7C_q+%5Cleq+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+k_0%5E%7B1-t%7D+k_1%5Et+%5C%7Cf_n%5C%7C_p+%3D+k_0%5E%7B1-t%7D+k_1%5Et+%5C%7Cf%5C%7C_p.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq &#92;lim_{n &#92;to &#92;infty} &#92;|Tf_n&#92;|_q &#92;leq &#92;lim_{n &#92;to &#92;infty} k_0^{1-t} k_1^t &#92;|f_n&#92;|_p = k_0^{1-t} k_1^t &#92;|f&#92;|_p.' title='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq &#92;lim_{n &#92;to &#92;infty} &#92;|Tf_n&#92;|_q &#92;leq &#92;lim_{n &#92;to &#92;infty} k_0^{1-t} k_1^t &#92;|f_n&#92;|_p = k_0^{1-t} k_1^t &#92;|f&#92;|_p.' class='latex' /></p>
<p>Therefore, the task of proving the theorem reduces to finding such a sequence.</p>
<p>We assume without loss of generality that <img src='http://s0.wp.com/latex.php?latex=f+%5Cgeq+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;geq 0' title='f &#92;geq 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=p_0+%5Cleq+p_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_0 &#92;leq p_1' title='p_0 &#92;leq p_1' class='latex' />. Let <img src='http://s0.wp.com/latex.php?latex=f%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^0' title='f^0' class='latex' /> be the truncation of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />, defined as</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f%5E0%28x%29+%3D+%5Cbegin%7Bcases%7D+f%28x%29+%26+%5Cmbox%7B+if+%7D+f%28x%29+%3E+1%3B+%5C%5C+0+%26+%5Cmbox%7B+if+%7D+f%28x%29+%5Cleq+1%3B+%5Cend%7Bcases%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f^0(x) = &#92;begin{cases} f(x) &amp; &#92;mbox{ if } f(x) &gt; 1; &#92;&#92; 0 &amp; &#92;mbox{ if } f(x) &#92;leq 1; &#92;end{cases}' title='&#92;displaystyle f^0(x) = &#92;begin{cases} f(x) &amp; &#92;mbox{ if } f(x) &gt; 1; &#92;&#92; 0 &amp; &#92;mbox{ if } f(x) &#92;leq 1; &#92;end{cases}' class='latex' /></p>
<p>and <img src='http://s0.wp.com/latex.php?latex=f%5E1%3Df-f%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^1=f-f^0' title='f^1=f-f^0' class='latex' /> another truncation. <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> contains all truncations of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=%28f%5E0%29%5E%7Bp_0%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(f^0)^{p_0}' title='(f^0)^{p_0}' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%28f%5E1%29%5E%7Bp_1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(f^1)^{p_1}' title='(f^1)^{p_1}' class='latex' /> are bounded by <img src='http://s0.wp.com/latex.php?latex=f%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^p' title='f^p' class='latex' />, hence <img src='http://s0.wp.com/latex.php?latex=f%5E0+%5Cin+D+%5Ccap+L%5E%7Bp_0%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^0 &#92;in D &#92;cap L^{p_0}(X)' title='f^0 &#92;in D &#92;cap L^{p_0}(X)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=f%5E1+%5Cin+D+%5Ccap+L%5E%7Bp_1%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^1 &#92;in D &#92;cap L^{p_1}(X)' title='f^1 &#92;in D &#92;cap L^{p_1}(X)' class='latex' />. We can find a monotonically increasing sequence <img src='http://s0.wp.com/latex.php?latex=%28g_m%29_%7Bm%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(g_m)_{m=1}^&#92;infty' title='(g_m)_{m=1}^&#92;infty' class='latex' /> converging to <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />, which satisfies</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7Bm+%5Cto+%5Cinfty%7D+%5C%7Cg_m+-+f%5C%7C_p+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|g_m - f&#92;|_p = 0' title='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|g_m - f&#92;|_p = 0' class='latex' /></p>
<p>by the monotone convergence theorem. If <img src='http://s0.wp.com/latex.php?latex=g_m%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_m^0' title='g_m^0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g_m%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_m^1' title='g_m^1' class='latex' /> are truncations of <img src='http://s0.wp.com/latex.php?latex=g_m&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_m' title='g_m' class='latex' /> defined in the same way as <img src='http://s0.wp.com/latex.php?latex=f%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^0' title='f^0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=f%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f^1' title='f^1' class='latex' />, then we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7Bm+%5Cto+%5Cinfty%7D+%5C%7Cg_m%5E0+-+f%5E0%5C%7C_p+%3D+%5Clim_%7Bm+%5Cto+%5Cinfty%7D+%5C%7Cg_m%5E1+f%5E1%5C%7C_p+%3D+0.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|g_m^0 - f^0&#92;|_p = &#92;lim_{m &#92;to &#92;infty} &#92;|g_m^1 f^1&#92;|_p = 0.' title='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|g_m^0 - f^0&#92;|_p = &#92;lim_{m &#92;to &#92;infty} &#92;|g_m^1 f^1&#92;|_p = 0.' class='latex' /></p>
<p>Since <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of types <img src='http://s0.wp.com/latex.php?latex=%28p_0%2Cq_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_0,q_0)' title='(p_0,q_0)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%28p_1%2Cq_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_1,q_1)' title='(p_1,q_1)' class='latex' />, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7Bm+%5Cto+%5Cinfty%7D+%5C%7CTg_m%5E0+-+Tf%5E0%5C%7C_%7Bq_0%7D+%3D+%5Clim_%7Bm+%5Cto+%5Cinfty%7D+%5C%7CTg_m%5E1+Tf%5E1%5C%7C_%7Bq_1%7D%3D+0.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|Tg_m^0 - Tf^0&#92;|_{q_0} = &#92;lim_{m &#92;to &#92;infty} &#92;|Tg_m^1 Tf^1&#92;|_{q_1}= 0.' title='&#92;displaystyle &#92;lim_{m &#92;to &#92;infty} &#92;|Tg_m^0 - Tf^0&#92;|_{q_0} = &#92;lim_{m &#92;to &#92;infty} &#92;|Tg_m^1 Tf^1&#92;|_{q_1}= 0.' class='latex' /></p>
<p>We can then find a subsequence of <img src='http://s0.wp.com/latex.php?latex=%28T+g_m%5E0%29_%7Bm%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(T g_m^0)_{m=1}^&#92;infty' title='(T g_m^0)_{m=1}^&#92;infty' class='latex' /> converging almost everywhere to <img src='http://s0.wp.com/latex.php?latex=Tf%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Tf^0' title='Tf^0' class='latex' />, whence we may as well assume that the full sequence converges almost everywhere to <img src='http://s0.wp.com/latex.php?latex=Tf%5E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Tf^0' title='Tf^0' class='latex' />. Similarly, we can find a subsequence <img src='http://s0.wp.com/latex.php?latex=%28g_%7Bm_n%7D%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(g_{m_n})_{n=1}^&#92;infty' title='(g_{m_n})_{n=1}^&#92;infty' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=%28g_m%29_%7Bm%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(g_m)_{m=1}^&#92;infty' title='(g_m)_{m=1}^&#92;infty' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%28T+g_%7Bm_n%7D%5E1%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(T g_{m_n}^1)_{n=1}^&#92;infty' title='(T g_{m_n}^1)_{n=1}^&#92;infty' class='latex' /> converges almost everywhere to <img src='http://s0.wp.com/latex.php?latex=Tf%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Tf^1' title='Tf^1' class='latex' />, whence the sequence <img src='http://s0.wp.com/latex.php?latex=%28f_n%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(f_n)_{n=1}^&#92;infty' title='(f_n)_{n=1}^&#92;infty' class='latex' /> defined by setting</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f_n+%3D+g_%7Bm_n%7D%5E0+%2B+g_%7Bm_n%7D%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f_n = g_{m_n}^0 + g_{m_n}^1' title='&#92;displaystyle f_n = g_{m_n}^0 + g_{m_n}^1' class='latex' /></p>
<p>is the desired sequence. This completes the proof of the Riesz-Thorin interpolation theorem. <img src='http://s0.wp.com/latex.php?latex=%5Csquare&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;square' title='&#92;square' class='latex' /></p>
<p style="text-align: center;"><strong><a id="1-3">- 3. Applications: two inequalities -</a></strong></p>
<p>We now return to the task of establishing the <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-boundedness of the Fourier transform. The Fourier transform operator on <img src='http://s0.wp.com/latex.php?latex=L%5E1+%5Ccap+L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1 &#92;cap L^2' title='L^1 &#92;cap L^2' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%281%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(1,&#92;infty)' title='(1,&#92;infty)' class='latex' /> and of type <img src='http://s0.wp.com/latex.php?latex=%282%2C2%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(2,2)' title='(2,2)' class='latex' /> with the norm at most one in each case. It then follows from the Riesz-Thorin interpolation theorem that the Fourier transform operator is of type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cp%27%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,p&#039;)' title='(p,p&#039;)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%28p%2Cp%27%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,p&#039;)' title='(p,p&#039;)' class='latex' />-norm at most one for all <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%5Cleq+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &#92;leq 2' title='1 &#92;leq p &#92;leq 2' class='latex' />. We therefore have the following inequality:</p>
<p><strong>Corollary 5</strong> (Hausdorff-Young). <em>If <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%5Cleq+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &#92;leq 2' title='1 &#92;leq p &#92;leq 2' class='latex' />, then</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7C%5Chat%7Bf%7D%5C%7C_%7Bp%27%7D+%5Cleq+%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_{p&#039;} &#92;leq &#92;|f&#92;|_p' title='&#92;displaystyle &#92;|&#92;hat{f}&#92;|_{p&#039;} &#92;leq &#92;|f&#92;|_p' class='latex' /></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p(&#92;mathbb{R}^d)' title='f &#92;in L^p(&#92;mathbb{R}^d)' class='latex' />.</em></p>
<p>We also extend the classical inequality of Young, which can be stated as follows:</p>
<p><strong>Theorem 6</strong> (Young). <em>If <img src='http://s0.wp.com/latex.php?latex=l+%5Cleq+r+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l &#92;leq r &#92;leq &#92;infty' title='l &#92;leq r &#92;leq &#92;infty' class='latex' />, then</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Cf+%2A+g%5C%7C_p+%5Cleq+%5C%7Cf%5C%7C_p+%5C%7Cg%5C%7C_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|f * g&#92;|_p &#92;leq &#92;|f&#92;|_p &#92;|g&#92;|_1' title='&#92;displaystyle &#92;|f * g&#92;|_p &#92;leq &#92;|f&#92;|_p &#92;|g&#92;|_1' class='latex' /></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%5B%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p[(&#92;mathbb{R}^d)' title='f &#92;in L^p[(&#92;mathbb{R}^d)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g &#92;in L^1(&#92;mathbb{R}^d)' title='g &#92;in L^1(&#92;mathbb{R}^d)' class='latex' />.</em></p>
<p>This implies that the convolution operator <img src='http://s0.wp.com/latex.php?latex=Tg%3D+f+%2A+g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Tg= f * g' title='Tg= f * g' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%281%2Cp%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(1,p)' title='(1,p)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%281%2Cp%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(1,p)' title='(1,p)' class='latex' />-norm at most <img src='http://s0.wp.com/latex.php?latex=%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|f&#92;|_p' title='&#92;|f&#92;|_p' class='latex' />. We also note that Hölder&#8217;s inequality yields the estimate</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Cf+%2A+g%5C%7C_%7B%5Cinfty%7D+%5Cleq+%5C%7Cf%5C%7C_%7Bp%7D+%5C%7Cg%5C%7C_%7Bp%27%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|f * g&#92;|_{&#92;infty} &#92;leq &#92;|f&#92;|_{p} &#92;|g&#92;|_{p&#039;},' title='&#92;displaystyle &#92;|f * g&#92;|_{&#92;infty} &#92;leq &#92;|f&#92;|_{p} &#92;|g&#92;|_{p&#039;},' class='latex' /></p>
<p>whence <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%28p%27%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p&#039;,&#92;infty)' title='(p&#039;,&#92;infty)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%28p%27%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p&#039;,&#92;infty)' title='(p&#039;,&#92;infty)' class='latex' />-norm at most <img src='http://s0.wp.com/latex.php?latex=%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|f&#92;|_p' title='&#92;|f&#92;|_p' class='latex' />. It then follows that <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%5Cleft%28+%5B%281-t%29+%2B+tp%27%5D%5E%7B-1%7D%2C+%5B%281-t%29p%5D%5E%7B-1%7D+%5Cright%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;left( [(1-t) + tp&#039;]^{-1}, [(1-t)p]^{-1} &#92;right)' title='&#92;left( [(1-t) + tp&#039;]^{-1}, [(1-t)p]^{-1} &#92;right)' class='latex' /> with the operator norm at most <img src='http://s0.wp.com/latex.php?latex=%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|f&#92;|_p' title='&#92;|f&#92;|_p' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=t+%5Cin+%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t &#92;in [0,1]' title='t &#92;in [0,1]' class='latex' />. We therefore have the following inequality:</p>
<p><strong>Corollary 7</strong> (Young). <em>If <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p%2Cq%2Cr+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p,q,r &#92;leq &#92;infty' title='1 &#92;leq p,q,r &#92;leq &#92;infty' class='latex' /> such that</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cfrac%7B1%7D%7Bp%7D+%2B+%5Cfrac%7B1%7D%7Bq%7D+%3D+1+%2B+%5Cfrac%7B1%7D%7Br%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;frac{1}{p} + &#92;frac{1}{q} = 1 + &#92;frac{1}{r},' title='&#92;displaystyle &#92;frac{1}{p} + &#92;frac{1}{q} = 1 + &#92;frac{1}{r},' class='latex' /></p>
<p><em>then</em></p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Cf%2Ag%5C%7C_r+%5Cleq+%5C%7Cf%5C%7C_p+%5C%7Cg%5C%7C_q&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|f*g&#92;|_r &#92;leq &#92;|f&#92;|_p &#92;|g&#92;|_q' title='&#92;displaystyle &#92;|f*g&#92;|_r &#92;leq &#92;|f&#92;|_p &#92;|g&#92;|_q' class='latex' /></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p(&#92;mathbb{R}^d)' title='f &#92;in L^p(&#92;mathbb{R}^d)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g+%5Cin+L%5Eq%28%5Cmathbb%7BR%7D%5Ed%29.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g &#92;in L^q(&#92;mathbb{R}^d).' title='g &#92;in L^q(&#92;mathbb{R}^d).' class='latex' /></em></p>
<p style="text-align: center;"><strong><a id="1-4">- 4. Interpolation on analytic families of operators -</a></strong></p>
<p> We note that the proof of Riesz-Thorin was a study of the function</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+F%28z%29+%3D+%5Cint_Y+%28T+f_z%29+g_z+%5C%2C+d%5Cnu%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle F(z) = &#92;int_Y (T f_z) g_z &#92;, d&#92;nu,' title='&#92;displaystyle F(z) = &#92;int_Y (T f_z) g_z &#92;, d&#92;nu,' class='latex' /></p>
<p>where <img src='http://s0.wp.com/latex.php?latex=F%28z%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(z)' title='F(z)' class='latex' /> was holomorphic in virtue of <img src='http://s0.wp.com/latex.php?latex=f_z&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_z' title='f_z' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g_z&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_z' title='g_z' class='latex' /> depending holomorphically on the complex variable <img src='http://s0.wp.com/latex.php?latex=z&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='z' title='z' class='latex' />. The two endpoint norm estimates on the operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> gave bounds on the lines <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D%28z%29+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re}(z) = 0' title='&#92;mathrm{Re}(z) = 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BRe%7D%28z%29+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{Re}(z) = 1' title='&#92;mathrm{Re}(z) = 1' class='latex' />, whence the three lines lemma yielded the interpolated bound on <img src='http://s0.wp.com/latex.php?latex=F%28z%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(z)' title='F(z)' class='latex' />. The corresponding bound for <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> was then obtained by a &#8220;duality argument&#8221;, using the Riesz representation theorem.</p>
<p>What if we add the <img src='http://s0.wp.com/latex.php?latex=z&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='z' title='z' class='latex' /> to the operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> and study</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+G%28z%29+%3D+%5Cint_Y+%28T_z+f_z%29+g_z+%5C%2C+d%5Cnu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle G(z) = &#92;int_Y (T_z f_z) g_z &#92;, d&#92;nu' title='&#92;displaystyle G(z) = &#92;int_Y (T_z f_z) g_z &#92;, d&#92;nu' class='latex' /></p>
<p>instead? If the operator &#8220;varies holomorphically&#8221; over the strip</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+S+%3D+%5C%7Bz+%5Cin+%5Cmathbb%7BC%7D%3A+0+%5Cleq+%5Cmathrm%7BRe%7D+z+%5Cleq+1%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle S = &#92;{z &#92;in &#92;mathbb{C}: 0 &#92;leq &#92;mathrm{Re} z &#92;leq 1&#92;}' title='&#92;displaystyle S = &#92;{z &#92;in &#92;mathbb{C}: 0 &#92;leq &#92;mathrm{Re} z &#92;leq 1&#92;}' class='latex' /></p>
<p>so that <img src='http://s0.wp.com/latex.php?latex=G%28z%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G(z)' title='G(z)' class='latex' /> is holomorphic in <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />, then we could argue as above to obtain an interpolation theorem that allows for varying operators. A collection of such operators is called an <em>analytic family of operators</em>, following the traditional practice of referring to complex analysis as the theory of analytic functions.</p>
<p>Formally, we suppose that <img src='http://s0.wp.com/latex.php?latex=T_z&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T_z' title='T_z' class='latex' />, for each <img src='http://s0.wp.com/latex.php?latex=z+%5Cin+S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='z &#92;in S' title='z &#92;in S' class='latex' />, is a linear operator on the space of simple functions in <img src='http://s0.wp.com/latex.php?latex=L%5E1%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(X)' title='L^1(X)' class='latex' /> into measurable functions on <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%28T_zf%29g+%5Cin+L%5E1%28Y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(T_zf)g &#92;in L^1(Y)' title='(T_zf)g &#92;in L^1(Y)' class='latex' /> for all simple functions <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=L%5E1%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(X)' title='L^1(X)' class='latex' /> and all simple functions <img src='http://s0.wp.com/latex.php?latex=g&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g' title='g' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=L%5E1%28Y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(Y)' title='L^1(Y)' class='latex' />. The family <img src='http://s0.wp.com/latex.php?latex=%5C%7BT_z+%3A+z+%5Cin+S%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{T_z : z &#92;in S&#92;}' title='&#92;{T_z : z &#92;in S&#92;}' class='latex' /> of operators is said to be <em>admissible</em> if the function</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+G%28z%29+%3D+%5Cint_Y+%28T_zf%29+g+%5C%2C+d%5Cnu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle G(z) = &#92;int_Y (T_zf) g &#92;, d&#92;nu' title='&#92;displaystyle G(z) = &#92;int_Y (T_zf) g &#92;, d&#92;nu' class='latex' /></p>
<p>is holomorphic in the interior of <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />, continuous on <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' />, and admits a constant <img src='http://s0.wp.com/latex.php?latex=a+%3C+%5Cpi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='a &lt; &#92;pi' title='a &lt; &#92;pi' class='latex' /> such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csup_%7Bz+%5Cin+S%7D+e%5E%7B-a+%7C%5Cmathrm%7BIm%7D%28z%29%7C%7D+%5Clog+%5Cleft%7C+%5Cint_Y+%28T_z+f%29+g+%5C%2C+d%5Cnu+%5Cright%7C+%3C+%5Cinfty.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sup_{z &#92;in S} e^{-a |&#92;mathrm{Im}(z)|} &#92;log &#92;left| &#92;int_Y (T_z f) g &#92;, d&#92;nu &#92;right| &lt; &#92;infty.' title='&#92;displaystyle &#92;sup_{z &#92;in S} e^{-a |&#92;mathrm{Im}(z)|} &#92;log &#92;left| &#92;int_Y (T_z f) g &#92;, d&#92;nu &#92;right| &lt; &#92;infty.' class='latex' /></p>
<p>The interpolation theorem of Stein can then be stated as follows:</p>
<p><strong>Theorem 8</strong> (Stein). <em>If <img src='http://s0.wp.com/latex.php?latex=%5C%7BT_z+%3A+z+%3D+x%2Biy+%5Cin+S%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{T_z : z = x+iy &#92;in S&#92;}' title='&#92;{T_z : z = x+iy &#92;in S&#92;}' class='latex' /> is an admissible family of linear operators with the norm estimates</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CT_%7Biy%7Df%5C%7C_%7Bq_0%7D+M_0%28y%29+%5C%7Cf%5C%7C_%7Bp_0%7D+%5Cmbox%7B+and+%7D+%5C%7CT_%7B1%2Biy%7D+f%5C%7C_%7Bq_1%7D+%5Cleq+M_1%28y%29+%5C%7Cf%5C%7C_%7Bp_1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|T_{iy}f&#92;|_{q_0} M_0(y) &#92;|f&#92;|_{p_0} &#92;mbox{ and } &#92;|T_{1+iy} f&#92;|_{q_1} &#92;leq M_1(y) &#92;|f&#92;|_{p_1}' title='&#92;displaystyle &#92;|T_{iy}f&#92;|_{q_0} M_0(y) &#92;|f&#92;|_{p_0} &#92;mbox{ and } &#92;|T_{1+iy} f&#92;|_{q_1} &#92;leq M_1(y) &#92;|f&#92;|_{p_1}' class='latex' /></p>
<p><em>for all simple functions <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=L%5E1%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(X)' title='L^1(X)' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p_j%2Cq_j+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p_j,q_j &#92;leq &#92;infty' title='1 &#92;leq p_j,q_j &#92;leq &#92;infty' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=M_j%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='M_j(y)' title='M_j(y)' class='latex' /> satisfies</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csup%7B-%5Cinfty+%3C+y+%3C+%5Cinfty%7D+e%5E%7B-b%7Cy%7C%7D+%5Clog+M_j%28y%29+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sup{-&#92;infty &lt; y &lt; &#92;infty} e^{-b|y|} &#92;log M_j(y) &lt; &#92;infty' title='&#92;displaystyle &#92;sup{-&#92;infty &lt; y &lt; &#92;infty} e^{-b|y|} &#92;log M_j(y) &lt; &#92;infty' class='latex' /></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> and some <img src='http://s0.wp.com/latex.php?latex=b+%3C+%5Cpi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='b &lt; &#92;pi' title='b &lt; &#92;pi' class='latex' />, then</em>, for <img src='http://s0.wp.com/latex.php?latex=t+%5Cin+%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t &#92;in [0,1]' title='t &#92;in [0,1]' class='latex' />, there exists a constant <img src='http://s0.wp.com/latex.php?latex=M_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='M_t' title='M_t' class='latex' /> such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CT_t+f%5C%7C_%7Bq_t%7D+%5Cleq+M_t+%5C%7Cf%5C%7C_%7Bp_t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|T_t f&#92;|_{q_t} &#92;leq M_t &#92;|f&#92;|_{p_t}' title='&#92;displaystyle &#92;|T_t f&#92;|_{q_t} &#92;leq M_t &#92;|f&#92;|_{p_t}' class='latex' /></p>
<p><em>for all such simple functions f, where</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+p_t%5E%7B-1%7D+%3D+%281-t%29p_0%5E%7B-1%7D+%2B+p_1%5E%7B-1%7D%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' title='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' class='latex' /></em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+q_t%5E%7B-1%7D+%3D+%281-t%29q_0%5E%7B-1%7D+%2B+tq_1%5E%7B-1%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' title='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' class='latex' /></em></p>
<p style="text-align: left;"><em>In fact, we can take</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+M_t+%3D+%5Cexp+%5Cleft%28+%5Cfrac%7B1%7D%7B2%7D+%5Csin%28%5Cpi+t%29+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+%5Cfrac%7B%5Clog+M_0%28y%29%7D%7B%5Ccosh+%5Cpi+y+-+%5Ccos+%5Cpi+t%7D+%2B+%5Cfrac%7B+%5Clog+M_1%28y%29%7D%7B%5Ccosh+%5Cpi+y+%2B+%5Ccos+%5Cpi+t%7D+%5C%2C+dy+%5Cright%29.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle M_t = &#92;exp &#92;left( &#92;frac{1}{2} &#92;sin(&#92;pi t) &#92;int_{-&#92;infty}^&#92;infty &#92;frac{&#92;log M_0(y)}{&#92;cosh &#92;pi y - &#92;cos &#92;pi t} + &#92;frac{ &#92;log M_1(y)}{&#92;cosh &#92;pi y + &#92;cos &#92;pi t} &#92;, dy &#92;right).' title='&#92;displaystyle M_t = &#92;exp &#92;left( &#92;frac{1}{2} &#92;sin(&#92;pi t) &#92;int_{-&#92;infty}^&#92;infty &#92;frac{&#92;log M_0(y)}{&#92;cosh &#92;pi y - &#92;cos &#92;pi t} + &#92;frac{ &#92;log M_1(y)}{&#92;cosh &#92;pi y + &#92;cos &#92;pi t} &#92;, dy &#92;right).' class='latex' /></p>
<p>We will not discuss the formal proof here: see, for example, pp.206-209 of [SW71]. See also <a href="http://terrytao.wordpress.com/2011/05/03/steins-interpolation-theorem/" target="_blank">Terry Tao&#8217;s blog post</a>, which offers a detailed discussion of the theorem.</p>
<h4 id="real-interpolation">Lecture 2. Weak Endpoint Estimates: The theorems of Marcinkiewicz and Fefferman-Stein</h4>
<p>We now shift gears to study the classical real interpolation theorem of Marcinkiewicz. Unlike Stein&#8217;s interpolation theorem, the Marcinkiewicz interpolation theorem does not allow the operator to vary. The improvement, however, is that we may now interpolate with weaker endpoint conditions&#8212;the extent of which we shall make precise in what follows. Due to the real-variable nature of the proof, we may take the scalars to be either real or complex.</p>
<p style="text-align: center;"><strong><a id="2-1">- 1. The Hardy-Littlewood maximal function -</a></strong></p>
<p>Recall the differentiation theorem of Lebesgue, which states that we have the almost-everywhere pointwise convergence</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Clim_%7B%5Cdelta+%5Cto+0%7D+%5Cfrac%7B1%7D%7Bm%28B_%5Cdelta%28x%29%29%7D+%5Cint_%7BB_%5Cdelta%28x%29%7D+f%28y%29+%5C%2C+dy+%3D+f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;lim_{&#92;delta &#92;to 0} &#92;frac{1}{m(B_&#92;delta(x))} &#92;int_{B_&#92;delta(x)} f(y) &#92;, dy = f(x)' title='&#92;displaystyle &#92;lim_{&#92;delta &#92;to 0} &#92;frac{1}{m(B_&#92;delta(x))} &#92;int_{B_&#92;delta(x)} f(y) &#92;, dy = f(x)' class='latex' /></p>
<p>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5E1_%7B%5Cmbox%7Bloc%7D%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^1_{&#92;mbox{loc}}(&#92;mathbb{R}^d)' title='f &#92;in L^1_{&#92;mbox{loc}}(&#92;mathbb{R}^d)' class='latex' />. Crucial in establishing this theorem is the <em>Hardy-Littlewood maximal function</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28Mf%29%28x%29+%3D+%5Csup_%7B%5Cdelta+%3E+0%7D+%5Cfrac%7B1%7D%7Bm%28B_%5Cdelta%28x%29%29%7D+%5Cint_%7BB_%5Cdelta%28x%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (Mf)(x) = &#92;sup_{&#92;delta &gt; 0} &#92;frac{1}{m(B_&#92;delta(x))} &#92;int_{B_&#92;delta(x)}' title='&#92;displaystyle (Mf)(x) = &#92;sup_{&#92;delta &gt; 0} &#92;frac{1}{m(B_&#92;delta(x))} &#92;int_{B_&#92;delta(x)}' class='latex' /></p>
<p>and the corresponding <em>weak-type</em> inequality</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5C%7Bx+%5Cin+%5Cmathbb%7BR%7D%5Ed+%3A+Mf%28x%29+%3E+%5Calpha%5C%7D%29+%5Cleq+%5Cfrac%7BA%7D%7B%5Calpha%7D+%5C%7Cf%5C%7C_1%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle m(&#92;{x &#92;in &#92;mathbb{R}^d : Mf(x) &gt; &#92;alpha&#92;}) &#92;leq &#92;frac{A}{&#92;alpha} &#92;|f&#92;|_1,' title='&#92;displaystyle m(&#92;{x &#92;in &#92;mathbb{R}^d : Mf(x) &gt; &#92;alpha&#92;}) &#92;leq &#92;frac{A}{&#92;alpha} &#92;|f&#92;|_1,' class='latex' /></p>
<p>where <img src='http://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A' title='A' class='latex' /> is a constant independent of <img src='http://s0.wp.com/latex.php?latex=%5Calpha&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha' title='&#92;alpha' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />. This inequality cannot be improved for general <img src='http://s0.wp.com/latex.php?latex=L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(&#92;mathbb{R}^d)' title='L^1(&#92;mathbb{R}^d)' class='latex' />-functions. Consider, for example, the action of the maximal operator on <img src='http://s0.wp.com/latex.php?latex=%28A%2F2%29+%5Cchi_%7B%280%2C1%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(A/2) &#92;chi_{(0,1)}' title='(A/2) &#92;chi_{(0,1)}' class='latex' />, a one-dimensional characteristic function. Since</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+m%28%5C%7Bx+%3A+M%5Cchi_%7B%280%2C1%29%7D%28x%29+%3E+%5Calpha%5C%7D%29+%3D+%5Cbegin%7Bcases%7D+A%2F2+%26+%5Cmbox%7B+if+%7D+%5Calpha+%3C+1%3B+%5C%5C+0+%26+%5Cmbox%7B+if+%7D+%5Calpha+%5Cgeq+1%3B+%5Cend%7Bcases%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle m(&#92;{x : M&#92;chi_{(0,1)}(x) &gt; &#92;alpha&#92;}) = &#92;begin{cases} A/2 &amp; &#92;mbox{ if } &#92;alpha &lt; 1; &#92;&#92; 0 &amp; &#92;mbox{ if } &#92;alpha &#92;geq 1; &#92;end{cases}' title='&#92;displaystyle m(&#92;{x : M&#92;chi_{(0,1)}(x) &gt; &#92;alpha&#92;}) = &#92;begin{cases} A/2 &amp; &#92;mbox{ if } &#92;alpha &lt; 1; &#92;&#92; 0 &amp; &#92;mbox{ if } &#92;alpha &#92;geq 1; &#92;end{cases}' class='latex' /></p>
<p>setting <img src='http://s0.wp.com/latex.php?latex=%5Calpha+%3D+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;alpha = 2' title='&#92;alpha = 2' class='latex' /> yields the equality.</p>
<p>Surprisingly, the weak <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' />-bound, combined with the <img src='http://s0.wp.com/latex.php?latex=L%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^&#92;infty' title='L^&#92;infty' class='latex' />-bound</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CMf%5C%7C_%5Cinfty+%5Cleq+%5C%7Cf%5C%7C_%5Cinfty%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Mf&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_&#92;infty,' title='&#92;displaystyle &#92;|Mf&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_&#92;infty,' class='latex' /></p>
<p>is sufficient to guarantee that the maximal operator can be extended to a bounded operator <img src='http://s0.wp.com/latex.php?latex=M%3AL%5Ep+%5Cto+L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='M:L^p &#92;to L^p' title='M:L^p &#92;to L^p' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; &#92;infty' title='1 &lt; p &lt; &#92;infty' class='latex' />. The proof of this fact can be generalized considerably, and we are led to yet another interpolation theorem&#8212;the <em>Marcinkiewicz interpolation theorem</em>.</p>
<p style="text-align: center;"><strong><a id="2-2">- 2. The Marcinkiewicz interpolation theorem -</a></strong></p>
<p>Before we state the interpolation theorem, let us introduce a way to measure the size of a measurable function in a global manner.</p>
<p><strong>Definition</strong>. <em>The</em> distribution function <em>of a measurable function <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on a <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />-finite measure space is</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+d_f%28%5Calpha%29+%3D+%5Cmu%28%5C%7Bx+%3A+%7Cf%28x%29%7C+%3E+%5Calpha%5C%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle d_f(&#92;alpha) = &#92;mu(&#92;{x : |f(x)| &gt; &#92;alpha&#92;})' title='&#92;displaystyle d_f(&#92;alpha) = &#92;mu(&#92;{x : |f(x)| &gt; &#92;alpha&#92;})' class='latex' />.</p>
<p>With this notation, we can write the weak-type inequality of the Hardy-Littlewood maximal function as</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+d_%7BMf%7D%28%5Calpha%29+%5Cleq+%5Cfrac%7BA%5C%7Cf%5C%7C_1%7D%7B%5Calpha%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle d_{Mf}(&#92;alpha) &#92;leq &#92;frac{A&#92;|f&#92;|_1}{&#92;alpha}.' title='&#92;displaystyle d_{Mf}(&#92;alpha) &#92;leq &#92;frac{A&#92;|f&#92;|_1}{&#92;alpha}.' class='latex' /></p>
<p>In general, we define weak-type operators as follows:</p>
<p><strong>Definition</strong>. <em>Let <img src='http://s0.wp.com/latex.php?latex=%28X%2C%5Cmu%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(X,&#92;mu)' title='(X,&#92;mu)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%28Y%2C+%5Cnu%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(Y, &#92;nu)' title='(Y, &#92;nu)' class='latex' /> be <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />-finite measure spaces and fix a vector space <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=%5Cmu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mu' title='&#92;mu' class='latex' />-measurable functions on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> that</em></p>
<ol>
<li><em>contains characteristic functions of sets of finite measure, and</em></li>
<li><em>is closed under truncation of <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in D' title='f &#92;in D' class='latex' />.</em></li>
</ol>
<p><em>An operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> into a vector space of <img src='http://s0.wp.com/latex.php?latex=%5Cnu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;nu' title='&#92;nu' class='latex' />-measurable functions is </em>subadditive<em> if</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%7CT%28f_1+%2B+f_2%29%28x%29%7C+%5Cleq+%7C%28T+f_1%29%28x%29%7C+%2B+%7C%28T+f_2%29%28x%29%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle |T(f_1 + f_2)(x)| &#92;leq |(T f_1)(x)| + |(T f_2)(x)|' title='&#92;displaystyle |T(f_1 + f_2)(x)| &#92;leq |(T f_1)(x)| + |(T f_2)(x)|' class='latex' /></p>
<p><em>for almost every <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in Y' title='x &#92;in Y' class='latex' />, whenever <img src='http://s0.wp.com/latex.php?latex=f_1%2C+f_2+%5Cin+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_1, f_2 &#92;in D' title='f_1, f_2 &#92;in D' class='latex' />. Given <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p&#92;leq &#92;infty' title='1 &#92;leq p&#92;leq &#92;infty' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+q+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq q &lt; &#92;infty' title='1 &#92;leq q &lt; &#92;infty' class='latex' />, a subadditive operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of </em>weak type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> <em>if there exists a constant <img src='http://s0.wp.com/latex.php?latex=k+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k &gt; 0' title='k &gt; 0' class='latex' /> such that</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+d_%7BTf%7D%28%5Calpha%29+%5Cleq+%5Cleft%28+%5Cfrac%7Bk+%5C%7Cf%5C%7C_p%7D%7B%5Calpha%7D+%5Cright%29%5Eq&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle d_{Tf}(&#92;alpha) &#92;leq &#92;left( &#92;frac{k &#92;|f&#92;|_p}{&#92;alpha} &#92;right)^q' title='&#92;displaystyle d_{Tf}(&#92;alpha) &#92;leq &#92;left( &#92;frac{k &#92;|f&#92;|_p}{&#92;alpha} &#92;right)^q' class='latex' /></p>
<p><em>for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+D+%5Ccap+L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in D &#92;cap L^p(X)' title='f &#92;in D &#92;cap L^p(X)' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=q+%3D+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='q = &#92;infty' title='q = &#92;infty' class='latex' />, the above inequality is replaced by the condition</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CTf%5C%7C_q+%5Cleq+k%5C%7Cf%5C%7C_p.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq k&#92;|f&#92;|_p.' title='&#92;displaystyle &#92;|Tf&#92;|_q &#92;leq k&#92;|f&#92;|_p.' class='latex' /></em></p>
<p><em>The smallest such <img src='http://s0.wp.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k' title='k' class='latex' /> is the </em>weak <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' />-norm<em> of  <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />.</em></p>
<p>Of course, <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' /> is dense in <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(X)' title='L^p(X)' class='latex' />, and so each subadditive operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> of weak type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> can be extended uniquely to a &#8220;bounded&#8221; operator on <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(X)' title='L^p(X)' class='latex' /> with the same norm. What, then, is the target space of <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />? Evidently, we need a larger space than the classical Lebesgue spaces. Natural substitutes in this case are the <em>weak Lebesgue spaces</em>, which we define below:</p>
<p><strong>Definition</strong>. <em>For <img src='http://s0.wp.com/latex.php?latex=0+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &lt; p &lt; &#92;infty' title='0 &lt; p &lt; &#92;infty' class='latex' />, the  </em>weak Lebesgue space <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp%2C%5Cinfty%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p,&#92;infty}(X)' title='L^{p,&#92;infty}(X)' class='latex' /><em> is the collection of all <img src='http://s0.wp.com/latex.php?latex=%5Cmu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mu' title='&#92;mu' class='latex' />-measurable functions <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> such that</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Cf%5C%7C_%7BL%5E%7Bp%2C%5Cinfty%7D%7D+%3D+%5Cinf+%5Cleft%5C%7B+k+%3E+0+%3A+d_f%28%5Calpha%29+%5Cleq+%5Cleft%28+%5Cfrac%7Bk%7D%7B%5Calpha%7D+%5Cright%29%5Ep+%5Cmbox%7B+for+all+%7D+%5Calpha+%3E+0%5Cright%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|f&#92;|_{L^{p,&#92;infty}} = &#92;inf &#92;left&#92;{ k &gt; 0 : d_f(&#92;alpha) &#92;leq &#92;left( &#92;frac{k}{&#92;alpha} &#92;right)^p &#92;mbox{ for all } &#92;alpha &gt; 0&#92;right&#92;}' title='&#92;displaystyle &#92;|f&#92;|_{L^{p,&#92;infty}} = &#92;inf &#92;left&#92;{ k &gt; 0 : d_f(&#92;alpha) &#92;leq &#92;left( &#92;frac{k}{&#92;alpha} &#92;right)^p &#92;mbox{ for all } &#92;alpha &gt; 0&#92;right&#92;}' class='latex' /></p>
<p><em>is finite</em>.</p>
<p>We remark that <img src='http://s0.wp.com/latex.php?latex=%5C%7C%5Ccdot%5C%7C_%7BL%5E%7Bp%2C%5Cinfty%7D%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|&#92;cdot&#92;|_{L^{p,&#92;infty}}' title='&#92;|&#92;cdot&#92;|_{L^{p,&#92;infty}}' class='latex' /> is not a norm. In fact, the weak Lebesgue spaces are merely <a href="http://en.wikipedia.org/wiki/Quasinorm" target="_blank">quasi-normed vector spaces</a>. A subadditive operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> of weak type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> can nevertheless be extended uniquely to an operator <img src='http://s0.wp.com/latex.php?latex=T%3AL%5Ep%28X%29+%5Cto+L%5E%7Bq%2C%5Cinfty%7D%28Y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T:L^p(X) &#92;to L^{q,&#92;infty}(Y)' title='T:L^p(X) &#92;to L^{q,&#92;infty}(Y)' class='latex' />, which is <em>bounded</em> in the sense that <img src='http://s0.wp.com/latex.php?latex=%5C%7CT+f%5C%7C_%7BL%5E%7Bq%2C%5Cinfty%7D%7D+%5Cleq+k+%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|T f&#92;|_{L^{q,&#92;infty}} &#92;leq k &#92;|f&#92;|_p' title='&#92;|T f&#92;|_{L^{q,&#92;infty}} &#92;leq k &#92;|f&#92;|_p' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p(X)' title='f &#92;in L^p(X)' class='latex' />, where <img src='http://s0.wp.com/latex.php?latex=k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k' title='k' class='latex' /> is the weak <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' />-norm of <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />.</p>
<p>We also note that the definition of linear operators of type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> can be extended in an obvious manner to include subadditive operators. Every operator of type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' /> is then of weak type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cq%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,q)' title='(p,q)' class='latex' />.  The interpolation theorem of Marcinkiewicz can now be stated as follows:</p>
<p><strong>Theorem 9</strong> (Marcinkiewicz). <em>Fix <img src='http://s0.wp.com/latex.php?latex=p_0%2Cp_1%2Cq_0%2Cq_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_0,p_1,q_0,q_1' title='p_0,p_1,q_0,q_1' class='latex' /> such that</em></p>
<ul>
<li><em><img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p_0+%5Cleq+q_0+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p_0 &#92;leq q_0 &#92;leq &#92;infty' title='1 &#92;leq p_0 &#92;leq q_0 &#92;leq &#92;infty' class='latex' />,</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p_1+%5Cleq+q_1+%5Cleq+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p_1 &#92;leq q_1 &#92;leq &#92;infty' title='1 &#92;leq p_1 &#92;leq q_1 &#92;leq &#92;infty' class='latex' />,</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=p_0+%3C+p_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_0 &lt; p_1' title='p_0 &lt; p_1' class='latex' />, and</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=q_0+%5Cneq+q_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='q_0 &#92;neq q_1' title='q_0 &#92;neq q_1' class='latex' />.</em></li>
</ul>
<p><em>If a subadditive operator <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of weak type <img src='http://s0.wp.com/latex.php?latex=%28p_0%2Cq_0%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_0,q_0)' title='(p_0,q_0)' class='latex' /> with weak $(p_0,q_0)$-norm <img src='http://s0.wp.com/latex.php?latex=k_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_0' title='k_0' class='latex' /> and of weak type <img src='http://s0.wp.com/latex.php?latex=%28p_1%2Cq_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_1,q_1)' title='(p_1,q_1)' class='latex' /> with weak <img src='http://s0.wp.com/latex.php?latex=%28p_1%2Cq_1%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_1,q_1)' title='(p_1,q_1)' class='latex' />-norm <img src='http://s0.wp.com/latex.php?latex=k_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_1' title='k_1' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> is of type <img src='http://s0.wp.com/latex.php?latex=%28p_t%2Cq_t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_t,q_t)' title='(p_t,q_t)' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=t+%5Cin+%5B0%2C1%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t &#92;in [0,1]' title='t &#92;in [0,1]' class='latex' />, where</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+p_t%5E%7B-1%7D+%3D+%281-t%29p_0%5E%7B-1%7D+%2B+p_1%5E%7B-1%7D%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' title='&#92;displaystyle p_t^{-1} = (1-t)p_0^{-1} + p_1^{-1};' class='latex' /></em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+q_t%5E%7B-1%7D+%3D+%281-t%29q_0%5E%7B-1%7D+%2B+tq_1%5E%7B-1%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' title='&#92;displaystyle q_t^{-1} = (1-t)q_0^{-1} + tq_1^{-1}.' class='latex' /></em></p>
<p>In the interest of time, we will not present a proof of the interpolation theorem. Instead, we merely point out a few key features of the theorem. We first note that, unlike Riesz-Thorin, there is no nice estimate for the interpolated bound. It is known, for example, that the <img src='http://s0.wp.com/latex.php?latex=%28p_t%2Cq_t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p_t,q_t)' title='(p_t,q_t)' class='latex' />-norm <img src='http://s0.wp.com/latex.php?latex=k_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k_t' title='k_t' class='latex' /> satisfies the inequality</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+k_t+%5Cleq+2+%5Cleft%28+%5Cfrac%7Bp_t%7D%7Bp_t+-+p_0%7D+%2B+%5Cfrac%7Bp_t%7D%7Bp_1+-+p_0%7D+%5Cright%29%5E%7B1%2Fp_t%7D+k_0%5E%7B%5Cfrac%7B%5Cfrac%7B1%7D%7Bp_t%7D+-+%5Cfrac%7B1%7D%7Bp_1%7D%7D%7B%5Cfrac%7B1%7D%7Bp_0%7D-%5Cfrac%7B1%7D%7Bp_1%7D%7D%7D+k_1%5E%7B+%5Cfrac%7B+%5Cfrac%7B1%7D%7Bp_0%7D+-+%5Cfrac%7B1%7D%7Bp_t%7D+%7D%7B+%5Cfrac%7B1%7D%7Bp_0%7D+-+%5Cfrac%7B1%7D%7Bp_1%7D+%7D+%7D%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle k_t &#92;leq 2 &#92;left( &#92;frac{p_t}{p_t - p_0} + &#92;frac{p_t}{p_1 - p_0} &#92;right)^{1/p_t} k_0^{&#92;frac{&#92;frac{1}{p_t} - &#92;frac{1}{p_1}}{&#92;frac{1}{p_0}-&#92;frac{1}{p_1}}} k_1^{ &#92;frac{ &#92;frac{1}{p_0} - &#92;frac{1}{p_t} }{ &#92;frac{1}{p_0} - &#92;frac{1}{p_1} } },' title='&#92;displaystyle k_t &#92;leq 2 &#92;left( &#92;frac{p_t}{p_t - p_0} + &#92;frac{p_t}{p_1 - p_0} &#92;right)^{1/p_t} k_0^{&#92;frac{&#92;frac{1}{p_t} - &#92;frac{1}{p_1}}{&#92;frac{1}{p_0}-&#92;frac{1}{p_1}}} k_1^{ &#92;frac{ &#92;frac{1}{p_0} - &#92;frac{1}{p_t} }{ &#92;frac{1}{p_0} - &#92;frac{1}{p_1} } },' class='latex' /></p>
<p>provided that <img src='http://s0.wp.com/latex.php?latex=p_0+%3D+q_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_0 = q_0' title='p_0 = q_0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=p_1+%3D+q_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p_1 = q_1' title='p_1 = q_1' class='latex' />. see, for example, pp. 31-34 of [Gra10] for a proof of this bound.</p>
<p>The classical proof of the theorem makes use of <a href="http://en.wikipedia.org/wiki/Hardy%27s_inequality" target="_blank">Hardy&#8217;s inequality</a> and relies heavily on the notion of non-increasing rearrangement of a measurable function <img src='http://s0.wp.com/latex.php?latex=h&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='h' title='h' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5En&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}^n' title='&#92;mathbb{R}^n' class='latex' /> that preserves the distribution function and the <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-norm of $h$. Such a rearrangement is given by</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+h%5E%2A%28t%29+%3D+%5Cinf%5C%7B%5Calpha+%3A+d_h%28%5Calpha%29+%5Cleq+t%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle h^*(t) = &#92;inf&#92;{&#92;alpha : d_h(&#92;alpha) &#92;leq t&#92;}' title='&#92;displaystyle h^*(t) = &#92;inf&#92;{&#92;alpha : d_h(&#92;alpha) &#92;leq t&#92;}' class='latex' /></p>
<p>on <img src='http://s0.wp.com/latex.php?latex=%280%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(0,&#92;infty)' title='(0,&#92;infty)' class='latex' />. Appendix B of [Ste70] contains a proof of the interpolation theorem for <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}^d' title='&#92;mathbb{R}^d' class='latex' />.</p>
<p>The proper setting for the weak-type endpoint estimates is the<em><a href="http://en.wikipedia.org/wiki/Lorentz_space" target="_blank">Lorentz space</a> </em><img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp%2Cq%7D%28X%2C%5Cmu%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p,q}(X,&#92;mu)' title='L^{p,q}(X,&#92;mu)' class='latex' />, which is a collection of <img src='http://s0.wp.com/latex.php?latex=%5Cmu&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mu' title='&#92;mu' class='latex' />-measurable functions on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> such that the <em>Lorentz norm</em></p>
<p><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7Cf%5C%7C_%7BL%5E%7Bp%2Cq%7D%7D+%3D+%5Cbegin%7Bcases%7D+%5Cdisplaystyle+%5Cleft%28+%5Cint_0%5E%5Cinfty+%5Cleft%28+t%5E%7B1%2Fp%7D+f%5E%2A%28t%29+%5Cright%29%5Eq+%5Cfrac%7Bdt%7D%7Bt%7D+%5Cright%29%5E%7B1%2Fq%7D+%26+%5Cmbox%7B+if+%7D+q+%3C+%5Cinfty%3B+%5C%5C+%5Cdisplaystyle+%5Csup_%7Bt+%3E+0%7D+t%5E%7B1%2Fp%7D+f%5E%2A%28t%29+%26+%5Cmbox%7B+if+%7D+q+%3D+%5Cinfty%3B+%5Cend%7Bcases%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|f&#92;|_{L^{p,q}} = &#92;begin{cases} &#92;displaystyle &#92;left( &#92;int_0^&#92;infty &#92;left( t^{1/p} f^*(t) &#92;right)^q &#92;frac{dt}{t} &#92;right)^{1/q} &amp; &#92;mbox{ if } q &lt; &#92;infty; &#92;&#92; &#92;displaystyle &#92;sup_{t &gt; 0} t^{1/p} f^*(t) &amp; &#92;mbox{ if } q = &#92;infty; &#92;end{cases}' title='&#92;displaystyle &#92;|f&#92;|_{L^{p,q}} = &#92;begin{cases} &#92;displaystyle &#92;left( &#92;int_0^&#92;infty &#92;left( t^{1/p} f^*(t) &#92;right)^q &#92;frac{dt}{t} &#92;right)^{1/q} &amp; &#92;mbox{ if } q &lt; &#92;infty; &#92;&#92; &#92;displaystyle &#92;sup_{t &gt; 0} t^{1/p} f^*(t) &amp; &#92;mbox{ if } q = &#92;infty; &#92;end{cases}' class='latex' /></p>
<p>is finite&#8212;here $0 &lt; p,q \leq \infty$. The <em>off-diagonal Marcinkiewicz interpolation theorem</em>, due to Zygmund, provides an interpolation result over Lorentz spaces and can be found in Chapter 5, section 3 of [SW71]. An improvement of this result, due to Grakafos, can be found in <img src='http://s0.wp.com/latex.php?latex=%5CS1.4.4&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;S1.4.4' title='&#92;S1.4.4' class='latex' /> of [Gra10].</p>
<p style="text-align: center;"><strong><a id="2-3">- 3. Application: the Hilbert transform -</a></strong></p>
<p>We now apply the interpolation theorem to the study of the <em>Hilbert transform</em>, which is, in a sense, the only singular integral operator in one dimension. First, a definition:</p>
<p><strong>Definition</strong>. <em>The</em> Hilbert transform <em>of <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+%5Cmathscr%7BS%7D%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in &#92;mathscr{S}(&#92;mathbb{R})' title='f &#92;in &#92;mathscr{S}(&#92;mathbb{R})' class='latex' /> is</em></p>
<p style="text-align: center;"><em></em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28Hf%29%28x%29+%3D+%5Cfrac%7B1%7D%7B%5Cpi%7D+%5Clim_%7B%5Cvarepsilon+%5Cto+0%7D+%5Cint_%7B%7Cy%7C+%5Cgeq+%5Cvarepsilon%7D+%5Cfrac%7Bf%28x-y%29%7D%7By%7D+%5C%2C+dy+%3D+%5Cfrac%7B1%7D%7B%5Cpi%7D+%5Clim_%7B%5Cvarepsilon+%5Cto+0%7D+%5Cint_%7B%7Cy%7C+%5Cgeq+%5Cvarepsilon%7D+%5Cfrac%7Bf%28y%29%7D%7Bx-y%7D+%5C%2C+dy.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (Hf)(x) = &#92;frac{1}{&#92;pi} &#92;lim_{&#92;varepsilon &#92;to 0} &#92;int_{|y| &#92;geq &#92;varepsilon} &#92;frac{f(x-y)}{y} &#92;, dy = &#92;frac{1}{&#92;pi} &#92;lim_{&#92;varepsilon &#92;to 0} &#92;int_{|y| &#92;geq &#92;varepsilon} &#92;frac{f(y)}{x-y} &#92;, dy.' title='&#92;displaystyle (Hf)(x) = &#92;frac{1}{&#92;pi} &#92;lim_{&#92;varepsilon &#92;to 0} &#92;int_{|y| &#92;geq &#92;varepsilon} &#92;frac{f(x-y)}{y} &#92;, dy = &#92;frac{1}{&#92;pi} &#92;lim_{&#92;varepsilon &#92;to 0} &#92;int_{|y| &#92;geq &#92;varepsilon} &#92;frac{f(y)}{x-y} &#92;, dy.' class='latex' /></p>
<p>If we set <img src='http://s0.wp.com/latex.php?latex=K%28x%29+%3D+1%2Fx&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='K(x) = 1/x' title='K(x) = 1/x' class='latex' />, then the Hilbert transform can be written as a convolution operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28Hf%29%28x%29+%3D+%28f+%2A+K%29%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (Hf)(x) = (f * K)(x)' title='&#92;displaystyle (Hf)(x) = (f * K)(x)' class='latex' />.</p>
<p>In the sense of <a href="http://en.wikipedia.org/wiki/Distribution_%28mathematics%29#Tempered_distributions_and_Fourier_transform" target="_blank">tempered distributions</a>, the Fourier transform of <img src='http://s0.wp.com/latex.php?latex=y+%5Cmapsto+1%2F%5Cpi+y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y &#92;mapsto 1/&#92;pi y' title='y &#92;mapsto 1/&#92;pi y' class='latex' /> is <img src='http://s0.wp.com/latex.php?latex=%5Cxi+%5Cmapsto+-+i+%5Cmathrm%7Bsgn%7D%28%5Cxi%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;xi &#92;mapsto - i &#92;mathrm{sgn}(&#92;xi)' title='&#92;xi &#92;mapsto - i &#92;mathrm{sgn}(&#92;xi)' class='latex' />, and so</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cwidehat%7BHf%7D%28%5Cxi%29+%3D+-+%5Cmathrm%7Bsgn%7D%28%5Cxi%29+%5Chat%7Bf%7D%28%5Cxi%29.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;widehat{Hf}(&#92;xi) = - &#92;mathrm{sgn}(&#92;xi) &#92;hat{f}(&#92;xi).' title='&#92;displaystyle &#92;widehat{Hf}(&#92;xi) = - &#92;mathrm{sgn}(&#92;xi) &#92;hat{f}(&#92;xi).' class='latex' /></p>
<p>It thus follows from Plancherel&#8217;s theorem that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CHf%5C%7C_2+%3D+%5C%7C%5Cwidehat%7BHf%7D%5C%7C_2+%3D+%5C%7C-i+%5Cmathrm%7Bsgn%7D%28%5Cxi%29+%5Chat%7Bf%7D%28%5Cxi%29%5C%7C_2+%3D+%5C%7C%5Chat%7Bf%7D%5C%7C_2+%3D+%5C%7Cf%5C%7C_2%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Hf&#92;|_2 = &#92;|&#92;widehat{Hf}&#92;|_2 = &#92;|-i &#92;mathrm{sgn}(&#92;xi) &#92;hat{f}(&#92;xi)&#92;|_2 = &#92;|&#92;hat{f}&#92;|_2 = &#92;|f&#92;|_2,' title='&#92;displaystyle &#92;|Hf&#92;|_2 = &#92;|&#92;widehat{Hf}&#92;|_2 = &#92;|-i &#92;mathrm{sgn}(&#92;xi) &#92;hat{f}(&#92;xi)&#92;|_2 = &#92;|&#92;hat{f}&#92;|_2 = &#92;|f&#92;|_2,' class='latex' /></p>
<p>and so the Hilbert transform is of type (2,2).</p>
<p>It can also be shown that the Hilbert transform is of weak type (1,1). The proof, which can be found in pp. 187-188 of [SW71], requires a basic knowledge of Fourier analysis on tempered distributions and will not be reproduced here. We assume the weak bound here and apply the Marcinkiewicz interpolation theorem to obtain the interpolated bound</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CHf%5C%7C_p+%5Cleq+A_p+%5C%7Cf%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Hf&#92;|_p &#92;leq A_p &#92;|f&#92;|_p' title='&#92;displaystyle &#92;|Hf&#92;|_p &#92;leq A_p &#92;|f&#92;|_p' class='latex' /></p>
<p>for <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%5Cleq+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &#92;leq 2' title='1 &lt; p &#92;leq 2' class='latex' />.</p>
<p>Using the above result, we can obtain, &#8220;by duality&#8221;, the <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-bound for all <img src='http://s0.wp.com/latex.php?latex=2+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='2 &lt; p &lt; &#92;infty' title='2 &lt; p &lt; &#92;infty' class='latex' />. Recall that if <img src='http://s0.wp.com/latex.php?latex=%5Cpsi+%5Cin+L%5E1_%7B%5Cmbox%7Bloc%7D%7D%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;psi &#92;in L^1_{&#92;mbox{loc}}(&#92;mathbb{R})' title='&#92;psi &#92;in L^1_{&#92;mbox{loc}}(&#92;mathbb{R})' class='latex' /> such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csup_%7B+%5Csubstack%7B+%5Cvarphi+%5Cin+%5Cmathscr%7BC%7D_c%28%5Cmathbb%7BR%7D%29+%5C%5C+%5C%7C%5Cvarphi%5C%7C_%7Bp%27%7D+%5Cleq+1+%7D+%7D+%5Cleft%7C+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+%5Cpsi%28x%29+%5Cvarphi%28x%29+%5C%2C+dx+%5Cright%7C+%3D+A+%3C+%5Cinfty%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sup_{ &#92;substack{ &#92;varphi &#92;in &#92;mathscr{C}_c(&#92;mathbb{R}) &#92;&#92; &#92;|&#92;varphi&#92;|_{p&#039;} &#92;leq 1 } } &#92;left| &#92;int_{-&#92;infty}^&#92;infty &#92;psi(x) &#92;varphi(x) &#92;, dx &#92;right| = A &lt; &#92;infty,' title='&#92;displaystyle &#92;sup_{ &#92;substack{ &#92;varphi &#92;in &#92;mathscr{C}_c(&#92;mathbb{R}) &#92;&#92; &#92;|&#92;varphi&#92;|_{p&#039;} &#92;leq 1 } } &#92;left| &#92;int_{-&#92;infty}^&#92;infty &#92;psi(x) &#92;varphi(x) &#92;, dx &#92;right| = A &lt; &#92;infty,' class='latex' /></p>
<p>then <img src='http://s0.wp.com/latex.php?latex=%5Cpsi+%5Cin+L%5Ep%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;psi &#92;in L^p(&#92;mathbb{R})' title='&#92;psi &#92;in L^p(&#92;mathbb{R})' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5C%7C%5Cpsi%5C%7C_p+%3D+A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|&#92;psi&#92;|_p = A' title='&#92;|&#92;psi&#92;|_p = A' class='latex' />. We fix <img src='http://s0.wp.com/latex.php?latex=2+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='2 &lt; p &lt; &#92;infty' title='2 &lt; p &lt; &#92;infty' class='latex' />, <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5E1%28%5Cmathbb%7BR%7D%29+%5Ccap+L%5Ep%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^1(&#92;mathbb{R}) &#92;cap L^p(&#92;mathbb{R})' title='f &#92;in L^1(&#92;mathbb{R}) &#92;cap L^p(&#92;mathbb{R})' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=%5Cvarphi+%5Cin+L%5E%7Bp%27%7D%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varphi &#92;in L^{p&#039;}(&#92;mathbb{R})' title='&#92;varphi &#92;in L^{p&#039;}(&#92;mathbb{R})' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%5C%7C%5Cvarphi%5C%7C_%7Bp%27%7D+%5Cleq+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|&#92;varphi&#92;|_{p&#039;} &#92;leq 1' title='&#92;|&#92;varphi&#92;|_{p&#039;} &#92;leq 1' class='latex' />. Since $latex  K \in latex L^2(\mathbb{R})$, the double integral</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+K%28x-y%29+f%28y%29+%5Cvarphi%28x%29+%5C%2C+dx+%5C%2C+dy&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;int_{-&#92;infty}^&#92;infty &#92;int_{-&#92;infty}^&#92;infty K(x-y) f(y) &#92;varphi(x) &#92;, dx &#92;, dy' title='&#92;displaystyle &#92;int_{-&#92;infty}^&#92;infty &#92;int_{-&#92;infty}^&#92;infty K(x-y) f(y) &#92;varphi(x) &#92;, dx &#92;, dy' class='latex' /></p>
<p>converges absolutely. Therefore, we may rewrite the above integral as the iterated integral</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+I+%3D+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+f%28y%29+%5Cleft%28+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+K%28x-y%29+%5Cvarphi%28x%29+%5C%2C+dx+%5Cright%29+%5C%2C+dy.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle I = &#92;int_{-&#92;infty}^&#92;infty f(y) &#92;left( &#92;int_{-&#92;infty}^&#92;infty K(x-y) &#92;varphi(x) &#92;, dx &#92;right) &#92;, dy.' title='&#92;displaystyle I = &#92;int_{-&#92;infty}^&#92;infty f(y) &#92;left( &#92;int_{-&#92;infty}^&#92;infty K(x-y) &#92;varphi(x) &#92;, dx &#92;right) &#92;, dy.' class='latex' /></p>
<p>Using the bound for <img src='http://s0.wp.com/latex.php?latex=p%27+%5Cin+%281%2C2%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p&#039; &#92;in (1,2)' title='p&#039; &#92;in (1,2)' class='latex' />&#8212;with the kernel <img src='http://s0.wp.com/latex.php?latex=K%28-x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='K(-x)' title='K(-x)' class='latex' /> instead of <img src='http://s0.wp.com/latex.php?latex=K%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='K(x)' title='K(x)' class='latex' /> but with the same constant <img src='http://s0.wp.com/latex.php?latex=A_%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A_{p&#039;}' title='A_{p&#039;}' class='latex' />&#8212;we can check that <img src='http://s0.wp.com/latex.php?latex=%5Cint+K%28x-y%29%5Cvarphi%28x%29+%5C%2C+dx&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;int K(x-y)&#92;varphi(x) &#92;, dx' title='&#92;int K(x-y)&#92;varphi(x) &#92;, dx' class='latex' /> belongs to <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(&#92;mathbb{R})' title='L^p(&#92;mathbb{R})' class='latex' />. Furthermore, its <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p&#039;}' title='L^{p&#039;}' class='latex' /> norm is bounded by <img src='http://s0.wp.com/latex.php?latex=A_%7Bp%27%7D%5C%7C%5Cvarphi%5C%7C_%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A_{p&#039;}&#92;|&#92;varphi&#92;|_{p&#039;}' title='A_{p&#039;}&#92;|&#92;varphi&#92;|_{p&#039;}' class='latex' />, which is at most <img src='http://s0.wp.com/latex.php?latex=A_%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A_{p&#039;}' title='A_{p&#039;}' class='latex' />. By Hölder&#8217;s inequality, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%7C+%5Cint_%7B-%5Cinfty%7D%5E%5Cinfty+%28Hf%29%28x%29+%5Cvarphi%28x%29+%5C%2C+dx+%5Cright%7C+%3D+%7CI%7C+%5Cleq+A_%7Bp%27%7D%5C%7Cf%5C%7C_p%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left| &#92;int_{-&#92;infty}^&#92;infty (Hf)(x) &#92;varphi(x) &#92;, dx &#92;right| = |I| &#92;leq A_{p&#039;}&#92;|f&#92;|_p,' title='&#92;displaystyle &#92;left| &#92;int_{-&#92;infty}^&#92;infty (Hf)(x) &#92;varphi(x) &#92;, dx &#92;right| = |I| &#92;leq A_{p&#039;}&#92;|f&#92;|_p,' class='latex' /></p>
<p>whence taking the supremum over all <img src='http://s0.wp.com/latex.php?latex=%5Cvarphi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varphi' title='&#92;varphi' class='latex' /> yields</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5C%7CHf%5C%7C_p+%5Cleq+A_%7Bp%27%7D+%5C%7Cf%5C%7C_p.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;|Hf&#92;|_p &#92;leq A_{p&#039;} &#92;|f&#92;|_p.' title='&#92;displaystyle &#92;|Hf&#92;|_p &#92;leq A_{p&#039;} &#92;|f&#92;|_p.' class='latex' /></p>
<p>The duality argument presented above is quite general and can be applied to a large class of operators known as <em>singular integrals</em>. Indeed, we have the following theorem:</p>
<p><strong>Theorem 10</strong> (Calderón–Zygmund). <em>Let <img src='http://s0.wp.com/latex.php?latex=K+%5Cin+L%5E2%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='K &#92;in L^2(&#92;mathbb{R}^d)' title='K &#92;in L^2(&#92;mathbb{R}^d)' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%7C%5Chat%7BK%7D%28%5Cxi%29%7C+%5Cleq+B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|&#92;hat{K}(&#92;xi)| &#92;leq B' title='|&#92;hat{K}(&#92;xi)| &#92;leq B' class='latex' /> for almost every <img src='http://s0.wp.com/latex.php?latex=%5Cxi+%5Cin+%5Cmathbb%7BR%7D%5Ed&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;xi &#92;in &#92;mathbb{R}^d' title='&#92;xi &#92;in &#92;mathbb{R}^d' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%7C%5Cnabla+K%28x%29%7C+%5Cleq+B%2F%7Cx%7C%5E%7Bd%2B1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|&#92;nabla K(x)| &#92;leq B/|x|^{d+1}' title='|&#92;nabla K(x)| &#92;leq B/|x|^{d+1}' class='latex' />, then the operator</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28Tf%29%28x%29+%3D+%5Cint_%7B%5Cmathbb%7BR%7D%5Ed%7D+K%28x-y%29+f%28y%29+%5C%2C+dy&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (Tf)(x) = &#92;int_{&#92;mathbb{R}^d} K(x-y) f(y) &#92;, dy' title='&#92;displaystyle (Tf)(x) = &#92;int_{&#92;mathbb{R}^d} K(x-y) f(y) &#92;, dy' class='latex' /></p>
<p><em>is of type <img src='http://s0.wp.com/latex.php?latex=%28p%2Cp%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,p)' title='(p,p)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; &#92;infty' title='1 &lt; p &lt; &#92;infty' class='latex' />. The <img src='http://s0.wp.com/latex.php?latex=%28p%2Cp%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(p,p)' title='(p,p)' class='latex' />-norm of <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' /> only depends on p, B, and d; in particular, it does not depend on <img src='http://s0.wp.com/latex.php?latex=%5C%7CK%5C%7C_2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|K&#92;|_2' title='&#92;|K&#92;|_2' class='latex' />.</em></p>
<p>The idea of the proof is as follows. The weak-type (2,2) bound is established via a Plancherel argument, and the famous <a href="http://en.wikipedia.org/wiki/Calder%C3%B3n%E2%80%93Zygmund_lemma#Calder.C3.B3n.E2.80.93Zygmund_decomposition" target="_blank"><em>Calderón–Zygmund decomposition</em></a> is used to establish the weak-type (1,1) bound. Marcinkiewicz establishes the interpolated bound between (1,1) and (2,2), and a duality argument gives a bound for the rest. For a detailed discussion, see Chapter 2 of [Ste70].</p>
<p style="text-align: center;"><strong><a id="2-4">- 4. Interpolation on Hardy spaces: <img src='http://s0.wp.com/latex.php?latex=H%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1' title='H^1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=BMO&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='BMO' title='BMO' class='latex' /> -</a></strong></p>
<p>The idea of allowing for weaker endpoint estimates can be applied in the context of complex interpolation as well. As a concluding remark, we mention here the Fefferman&#8217;s extension of Stein&#8217;s interpolation theorem, which allows for varying operators. The natural substitutes for the Lebesgue spaces in this setting are the (real-variable) <a href="http://en.wikipedia.org/wiki/Hardy_space" target="_blank">Hardy spaces</a>, which behave much nicer under the action of various operators used frequently in harmonic analysis. Formally, the <em>Hardy space</em> <img src='http://s0.wp.com/latex.php?latex=H%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^p(&#92;mathbb{R}^d)' title='H^p(&#92;mathbb{R}^d)' class='latex' /> is a collection of tempered distributions <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> such that, for some <img src='http://s0.wp.com/latex.php?latex=%5CPhi+%5Cin+%5Cmathscr%7BS%7D%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Phi &#92;in &#92;mathscr{S}(&#92;mathbb{R}^d)' title='&#92;Phi &#92;in &#92;mathscr{S}(&#92;mathbb{R}^d)' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=%5Cint+%5CPhi+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;int &#92;Phi = 1' title='&#92;int &#92;Phi = 1' class='latex' />, the maximal function</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28M_%5CPhi+f%29%28x%29+%3D+%5Csup_%7Bt+%3E+0%7D+%7C%28f%2A%5CPhi%29%28x%29%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (M_&#92;Phi f)(x) = &#92;sup_{t &gt; 0} |(f*&#92;Phi)(x)|' title='&#92;displaystyle (M_&#92;Phi f)(x) = &#92;sup_{t &gt; 0} |(f*&#92;Phi)(x)|' class='latex' /></p>
<p>is in <img src='http://s0.wp.com/latex.php?latex=L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p(&#92;mathbb{R}^d)' title='L^p(&#92;mathbb{R}^d)' class='latex' />. It turns out that <img src='http://s0.wp.com/latex.php?latex=H%5Ep%28%5Cmathbb%7BR%7D%5Ed%29+%3D+L%5Ep%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^p(&#92;mathbb{R}^d) = L^p(&#92;mathbb{R}^d)' title='H^p(&#92;mathbb{R}^d) = L^p(&#92;mathbb{R}^d)' class='latex' /> for <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; &#92;infty' title='1 &lt; p &lt; &#92;infty' class='latex' />.</p>
<p>Note, however, that <img src='http://s0.wp.com/latex.php?latex=H%5E1%28%5Cmathbb%7BR%7D%5Ed%29+%5Csupseteq+L%5E1%28%5Cmathbb%7BR%7D%5Ed%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1(&#92;mathbb{R}^d) &#92;supseteq L^1(&#92;mathbb{R}^d)' title='H^1(&#92;mathbb{R}^d) &#92;supseteq L^1(&#92;mathbb{R}^d)' class='latex' />. In particular, the Hilbert transform maps <img src='http://s0.wp.com/latex.php?latex=L%5E1%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1(&#92;mathbb{R})' title='L^1(&#92;mathbb{R})' class='latex' /> into <img src='http://s0.wp.com/latex.php?latex=H%5E1%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1(&#92;mathbb{R})' title='H^1(&#92;mathbb{R})' class='latex' />. The interpolation theorem, as was introduced in [FS72], replaces the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' /> bound in Stein&#8217;s interpolation theorem with an <img src='http://s0.wp.com/latex.php?latex=H%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1' title='H^1' class='latex' /> bound. By a similar duality argument as the one given above, this interpolation theorem can be extended to <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=p%3E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p&gt;2' title='p&gt;2' class='latex' />. The key fact is that the dual of <img src='http://s0.wp.com/latex.php?latex=H%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^1' title='H^1' class='latex' /> is the <a href="http://en.wikipedia.org/wiki/Bounded_mean_oscillation" target="_blank">John-Nirenberg space of bounded mean oscillation</a> (BMO)&#8212;this was one of the main theorems in [FS72].</p>
<p>We will not discuss the interpolation theory on Hardy spaces any further. See Chapters 3 and 4 of [Ste93] for a detailed exposition of real-variable Hardy-space theory: a Fefferman-Stein type interpolation theorem is proved in Chapter 4, section 5.</p>
<h4 id="references">References</h4>
<ul>
<li>[FS72] Charles Fefferman and Elias M. Stein, &#8220;<img src='http://s0.wp.com/latex.php?latex=H%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^p' title='H^p' class='latex' /> spaces of several variables&#8221;, Acta Math. <strong>129</strong> (1972), no. 3-4, 137-193.</li>
<li>[Fol99] Gerald B. Folland, <em>Real Analysis: Modern Techniques and Their Applications</em>, second ed., John Wiley &amp; Sons, 1999.</li>
<li>[Gra10] Loukas Grafakos, <em>Classical Fourier Analysis</em>, Springer, 2010.</li>
<li>[SS05] Elias M. Stein and Rami Shakarchi, <em>Real Analysis: Measure Theory, Integration, and Hilbert Spaces</em>, Princeton University Press, 2005.</li>
<li>[SS11] Elias M. Stein and Rami Shakarchi, <em>Functional Analysis: Introduction to Further Topics in Analysis</em>, Princeton University Press, 2011.</li>
<li>[Ste70] Elias M. Stein, <em>Singular Integrals and Differentiability Properties of Functions</em>, Princeton University Press, 1970.</li>
<li>[Ste93] Elias M. Stein, <em>Harmonic Analysis</em>, Princeton University Press, 1993.</li>
<li>[SW71] Elias M. Stein and Guido Weiss, <em>Introduction to Fourier Analysis on Euclidean Spaces</em>, Princeton University Press, 1971.</li>
<li>[Tao11] Terence Tao, &#8220;<a href="http://terrytao.wordpress.com/2011/05/03/steins-interpolation-theorem/" target="_blank">Stein&#8217;s interpolation theorem</a>&#8220;, What&#8217;s new (<a href="http://terrytao.wordpress.com/" target="_blank">http://terrytao.wordpress.com/</a>), May 3, 2011.</li>
<li>[Wol03] Thomas H. Wolff, <em>Lectures on Harmonic Analysis</em>, American Mathematical Society, 2003.</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2011/12/interpolation-on-lebesgue-spaces/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Triangular Fourier Series and Physical Reality</title>
		<link>http://markhkim.com/2011/10/triangular-fourier-series-and-physical-reality/</link>
		<comments>http://markhkim.com/2011/10/triangular-fourier-series-and-physical-reality/#comments</comments>
		<pubDate>Thu, 20 Oct 2011 03:55:41 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[ca.classical-analysis]]></category>
		<category><![CDATA[ds.dynamical-systems]]></category>
		<category><![CDATA[la.linear-algebra]]></category>
		<category><![CDATA[AKNS systems]]></category>
		<category><![CDATA[Carleson-Hunt theorem]]></category>
		<category><![CDATA[circular n-body problem]]></category>
		<category><![CDATA[Hilbert transform]]></category>
		<category><![CDATA[multilinear analysis]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=3232</guid>
		<description><![CDATA[This is a transcription of the September 15 talk by Prof. Camil Muscalu at the Courant Institute. Any errors in this post are due to my interpretation of the talk. * * * * * Part 1. Triangular Fourier Series What is a triangular Fourier series? Let us suppose that is a -periodic function on <a href='http://markhkim.com/2011/10/triangular-fourier-series-and-physical-reality/'>[...]</a>]]></description>
			<content:encoded><![CDATA[<p>This is a transcription of the September 15 talk by Prof. <a href="http://www.math.cornell.edu/~camil/">Camil Muscalu</a> at the Courant Institute. Any errors in this post are due to my interpretation of the talk.</p>
<p style="text-align: center;">* * * * *</p>
<h4>Part 1. Triangular Fourier Series</h4>
<p>What is a triangular Fourier series? Let us suppose that <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is a <img src='http://s0.wp.com/latex.php?latex=2%5Cpi&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='2&#92;pi' title='2&#92;pi' class='latex' />-periodic function on <img src='http://s0.wp.com/latex.php?latex=%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathbb{R}' title='&#92;mathbb{R}' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=f+%5Cin+L%5Ep%28%5B0%2C2%5Cpi%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f &#92;in L^p([0,2&#92;pi])' title='f &#92;in L^p([0,2&#92;pi])' class='latex' /> for some <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; &#92;infty' title='1 &lt; p &lt; &#92;infty' class='latex' />, we know that the classical Fourier series</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csum_%7Bn%3D-%5Cinfty%7D%5E%7B%5Cinfty%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Bi+n+x%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sum_{n=-&#92;infty}^{&#92;infty} &#92;hat{f}(n) e^{i n x}' title='&#92;displaystyle &#92;sum_{n=-&#92;infty}^{&#92;infty} &#92;hat{f}(n) e^{i n x}' class='latex' /></p>
<p>converges to <img src='http://s0.wp.com/latex.php?latex=f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(x)' title='f(x)' class='latex' />, both in the <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-sense (<a href="http://en.wikipedia.org/wiki/Hilbert_transform#Boundedness">M. Riesz</a>) and in the pointwise almost-everywhere sense (<a href="http://en.wikipedia.org/wiki/Carleson%27s_theorem">L. Carleson and R. Hunt</a>). These results can be phrased in terms of boundedness of certain operators. For one, the <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-convergence happens if and only if the operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f+%5Cmapsto+%5Csum_%7B-N+%5Cleq+n+%5Cleq+N%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Binx%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f &#92;mapsto &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx}' title='&#92;displaystyle f &#92;mapsto &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx}' class='latex' /></p>
<p>is bounded on <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N' title='N' class='latex' />. Similarly, the almost-everywhere convergence happens if and only if the operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f+%5Cmapsto+%5Csup_N+%5Cleft%7C+%5Csum_%7B-N+%5Cleq+n+%5Cleq+N%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Binx%7D+%5Cright%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f &#92;mapsto &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right|' title='&#92;displaystyle f &#92;mapsto &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right|' class='latex' /></p>
<p>is bounded on <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />.</p>
<p>So then, we have a clear notion of the convergence</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n+%5Cleq+N%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Binx%7D+%5Cxrightarrow%7BN+%5Cto+%5Cinfty%7D+f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;xrightarrow{N &#92;to &#92;infty} f(x)' title='&#92;displaystyle &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;xrightarrow{N &#92;to &#92;infty} f(x)' class='latex' />.</p>
<p>Why not take the square, and obtain:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%28+%5Csum_%7B-N+%5Cleq+n+%5Cleq+N%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Binx%7D+%5Cright%29%5E2+%5Cxrightarrow%7BN+%5Cto+%5Cinfty%7D+f%28x%29%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left( &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right)^2 &#92;xrightarrow{N &#92;to &#92;infty} f(x)^2' title='&#92;displaystyle &#92;left( &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right)^2 &#92;xrightarrow{N &#92;to &#92;infty} f(x)^2' class='latex' />.</p>
<p>We expand the left-hand side as follows:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Barray%7D%7Brcl%7D+%5Cdisplaystyle+%5Cleft%28+%5Csum_%7B-N+%5Cleq+n+%5Cleq+N%7D+%5Chat%7Bf%7D%28n%29+e%5E%7Binx%7D+%5Cright%29%5E2+%26%3D%26+%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1%2Cn_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29+%5Chat%7Bf%7D%28n_2%29+e%5E%7Bin_1x%7D+e%5E%7Bin_2x%7D+%5C%5C+%26%3D%26+%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29%5Chat%7Bf%7D%28n_2%29+e%5E%7Bin_1x%7De%5E%7Bin_2x%7D+%5C%5C+%26+%26+%2B+%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_2+%3C+n_1+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29%5Chat%7Bf%7D%28n_2%29+e%5E%7Bin_1x%7De%5E%7Bin_2x%7D+%5C%5C+%26+%26+%2B+%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1+%3D+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29%5Chat%7Bf%7D%28n_2%29+e%5E%7Bin_1x%7De%5E%7Bin_2x%7D%5Cend%7Barray%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{array}{rcl} &#92;displaystyle &#92;left( &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right)^2 &amp;=&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1,n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{f}(n_2) e^{in_1x} e^{in_2x} &#92;&#92; &amp;=&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x} &#92;&#92; &amp; &amp; + &#92;displaystyle &#92;sum_{-N &#92;leq n_2 &lt; n_1 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x} &#92;&#92; &amp; &amp; + &#92;displaystyle &#92;sum_{-N &#92;leq n_1 = n_2 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x}&#92;end{array}' title='&#92;begin{array}{rcl} &#92;displaystyle &#92;left( &#92;sum_{-N &#92;leq n &#92;leq N} &#92;hat{f}(n) e^{inx} &#92;right)^2 &amp;=&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1,n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{f}(n_2) e^{in_1x} e^{in_2x} &#92;&#92; &amp;=&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x} &#92;&#92; &amp; &amp; + &#92;displaystyle &#92;sum_{-N &#92;leq n_2 &lt; n_1 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x} &#92;&#92; &amp; &amp; + &#92;displaystyle &#92;sum_{-N &#92;leq n_1 = n_2 &#92;leq N} &#92;hat{f}(n_1)&#92;hat{f}(n_2) e^{in_1x}e^{in_2x}&#92;end{array}' class='latex' />.</p>
<p style="text-align: left;">The last term is the convolution <img src='http://s0.wp.com/latex.php?latex=%28f%2Af%29%282x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(f*f)(2x)' title='(f*f)(2x)' class='latex' />.</p>
<p style="text-align: left;">We can now ask ourselves the following questions: (1) Does the following convergence happen?</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29+%5Chat%7Bf%7D%28n_2%29+e%5E%7Bin_1x%7D+e%5E%7Bin_2x%7D+%5Cto+%5Cfrac%7B1%7D%7B2%7D+%28f%28x%29%5E2+-+%28f%2Af%29%282x%29%29%3B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{f}(n_2) e^{in_1x} e^{in_2x} &#92;to &#92;frac{1}{2} (f(x)^2 - (f*f)(2x));' title='&#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{f}(n_2) e^{in_1x} e^{in_2x} &#92;to &#92;frac{1}{2} (f(x)^2 - (f*f)(2x));' class='latex' /></p>
<p style="text-align: left;">(2) Similarly, does the following convergence happen?</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Ctextbf%7B%281%29+%7D%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29+%5Chat%7Bg%7D%28n_2%29+e%5E%7Bin_1x%7D+e%5E%7Bin_2x%7D+%5Cto+%5Cfrac%7B1%7D%7B2%7D%28f%28x%29g%28x%29+-+%28f%2Ag%29%282x%29%29%2C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;textbf{(1) }&#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{in_1x} e^{in_2x} &#92;to &#92;frac{1}{2}(f(x)g(x) - (f*g)(2x)),' title='&#92;textbf{(1) }&#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{in_1x} e^{in_2x} &#92;to &#92;frac{1}{2}(f(x)g(x) - (f*g)(2x)),' class='latex' /></p>
<p style="text-align: left;">where <img src='http://s0.wp.com/latex.php?latex=f%2Cg+%5Cin+L%5E2%28%5B0%2C2%5Cpi%5D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f,g &#92;in L^2([0,2&#92;pi])' title='f,g &#92;in L^2([0,2&#92;pi])' class='latex' />?</p>
<p style="text-align: left;"><span id="more-3232"></span></p>
<p style="text-align: left;">As it turns out, we indeed have both convergence results, in the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' />-sense (M. Lacey and C. Thiele), and in the almost-everywhere pointwise sense (C. Muscalu, T. Tao, C. Thiele). Equation (1) is, in fact, the simplest example of <em>triangular Fourier series</em>, whose name is perhaps best explained by the following graph of the range of summation:</p>
<div id="attachment_3243" class="wp-caption aligncenter" style="width: 385px"><a href="http://markhkim.com/index/wp-content/uploads/2011/10/triangular-fourier-series.jpg"><img class="size-full wp-image-3243" title="triangular-fourier-series" src="http://markhkim.com/index/wp-content/uploads/2011/10/triangular-fourier-series.jpg" alt="" width="375" height="318" /></a><p class="wp-caption-text"><img src='http://s0.wp.com/latex.php?latex=-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='-N &#92;leq n_1 &lt; n_2 &#92;leq N' title='-N &#92;leq n_1 &lt; n_2 &#92;leq N' class='latex' />, when <img src='http://s0.wp.com/latex.php?latex=N+%3D+5&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N = 5' title='N = 5' class='latex' />.</p></div>
<p>To establish the <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' />-theorem, we need to prove that the <img src='http://s0.wp.com/latex.php?latex=L%5E2+%5Ctimes+L%5E2+%5Cto+L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2 &#92;times L^2 &#92;to L^1' title='L^2 &#92;times L^2 &#92;to L^1' class='latex' /> operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28f%2Cg%29+%5Cmapsto+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29+%5Chat%7Bg%7D%28n_2%29+e%5E%7Bi+n_1+x%7D+e%5E%7Bi+n_2+x%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (f,g) &#92;mapsto &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{i n_1 x} e^{i n_2 x}' title='&#92;displaystyle (f,g) &#92;mapsto &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{i n_1 x} e^{i n_2 x}' class='latex' /></p>
<p>is bounded uniformly in <img src='http://s0.wp.com/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N' title='N' class='latex' />.  Similarly, establishing the pointwise almost-everywhere convergence amounts to proving that the <img src='http://s0.wp.com/latex.php?latex=L%5E2+%5Ctimes+L%5E2+%5Cto+L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2 &#92;times L^2 &#92;to L^1' title='L^2 &#92;times L^2 &#92;to L^1' class='latex' /> operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28f%2Cg%29+%5Cmapsto+%5Csup_N+%5Cleft%7C+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%5Cleq+N%7D+%5Chat%7Bf%7D%28n_1%29+%5Chat%7Bg%7D%28n_2%29+e%5E%7Bin_1x%7D+e%5E%7Bin_2x%7D+%5Cright%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (f,g) &#92;mapsto &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{in_1x} e^{in_2x} &#92;right|' title='&#92;displaystyle (f,g) &#92;mapsto &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n_1 &lt; n_2 &#92;leq N} &#92;hat{f}(n_1) &#92;hat{g}(n_2) e^{in_1x} e^{in_2x} &#92;right|' class='latex' /></p>
<p>is bounded uniformly in <img src='http://s0.wp.com/latex.php?latex=N&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N' title='N' class='latex' />. More generally, we can consider the multilinear operators <img src='http://s0.wp.com/latex.php?latex=L%5E2+%5Ctimes+%5Ccdots+%5Ctimes+L%5E2+%5Cto+L%5E%7B2%2Fd%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2 &#92;times &#92;cdots &#92;times L^2 &#92;to L^{2/d}' title='L^2 &#92;times &#92;cdots &#92;times L^2 &#92;to L^{2/d}' class='latex' /></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Barray%7D%7Brcl%7D+%5Cdisplaystyle+%28f_1%2Cf_2%2C%5Cldots%2Cf_d%29+%26%5Cmapsto%26+%5Cdisplaystyle+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%3C+%5Ccdots+%3C+n_d+%5Cleq+N%7D+%5Ccdots+%5C%5C+%28f_1%2Cf_2%2C%5Cldots%2Cf_d%29+%26%5Cmapsto%26+%5Cdisplaystyle+%5Csup_N+%5Cleft%7C+%5Csum_%7B-N+%5Cleq+n_1+%3C+n_2+%3C+%5Ccdots+%3C+n_d+%5Cleq+N%7D+%5Ccdots+%5Cright%7C+%5Cend%7Barray%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{array}{rcl} &#92;displaystyle (f_1,f_2,&#92;ldots,f_d) &amp;&#92;mapsto&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &lt; &#92;cdots &lt; n_d &#92;leq N} &#92;cdots &#92;&#92; (f_1,f_2,&#92;ldots,f_d) &amp;&#92;mapsto&amp; &#92;displaystyle &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n_1 &lt; n_2 &lt; &#92;cdots &lt; n_d &#92;leq N} &#92;cdots &#92;right| &#92;end{array}' title='&#92;begin{array}{rcl} &#92;displaystyle (f_1,f_2,&#92;ldots,f_d) &amp;&#92;mapsto&amp; &#92;displaystyle &#92;sum_{-N &#92;leq n_1 &lt; n_2 &lt; &#92;cdots &lt; n_d &#92;leq N} &#92;cdots &#92;&#92; (f_1,f_2,&#92;ldots,f_d) &amp;&#92;mapsto&amp; &#92;displaystyle &#92;sup_N &#92;left| &#92;sum_{-N &#92;leq n_1 &lt; n_2 &lt; &#92;cdots &lt; n_d &#92;leq N} &#92;cdots &#92;right| &#92;end{array}' class='latex' />.</p>
<h4>Part 2. The Physical Reality</h4>
<p>Why do we care about triangular Fourier series? Let us imagine that we have <img src='http://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n' title='n' class='latex' /> particles (bodies) on the plane, which move in circular orbits. For the sake of simplicity, we assume that the trajectories of the particles are concentric at 0. We can then write <img src='http://s0.wp.com/latex.php?latex=u_j%28t%29+%3D+c_j+e%5E%7Bi+d_j+t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='u_j(t) = c_j e^{i d_j t}' title='u_j(t) = c_j e^{i d_j t}' class='latex' /> to denote the position of the <em>j</em>th particle on the complex plane; we note immediately that <img src='http://s0.wp.com/latex.php?latex=u_j%27%28t%29+%3D+i+d_j+u_j%28t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='u_j&#039;(t) = i d_j u_j(t)' title='u_j&#039;(t) = i d_j u_j(t)' class='latex' />. Finally, let us also assume that each <img src='http://s0.wp.com/latex.php?latex=d_j&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d_j' title='d_j' class='latex' /> is distinct from one another.</p>
<p>Suppose that the particles influence each other in the following way, where <img src='http://s0.wp.com/latex.php?latex=a_%7Bkj%7D%28t%29+%5Cin+%5Cmathbb%7BC%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='a_{kj}(t) &#92;in &#92;mathbb{C}' title='a_{kj}(t) &#92;in &#92;mathbb{C}' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='t' title='t' class='latex' />:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+u_j%27%28t%29+%3D+i+d_1+u_1+%28t%29+%2B+%5Csum_%7Bk+%5Cneq+1%7D+a_%7Bkj%7D%28t%29+u_k%28t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle u_j&#039;(t) = i d_1 u_1 (t) + &#92;sum_{k &#92;neq 1} a_{kj}(t) u_k(t)' title='&#92;displaystyle u_j&#039;(t) = i d_1 u_1 (t) + &#92;sum_{k &#92;neq 1} a_{kj}(t) u_k(t)' class='latex' />.</p>
<p>In this case, we can write <img src='http://s0.wp.com/latex.php?latex=u%27+%3D+iDu+%2B+Au&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='u&#039; = iDu + Au' title='u&#039; = iDu + Au' class='latex' />, where</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+u+%3D+%5Cbegin%7Bpmatrix%7D+u_1%28t%29+%5C%5C+u_2%28t%29+%5C%5C+%5Cvdots+%5C%5C+u_n%28t%29+%5Cend%7Bpmatrix%7D%2C+%5Cmbox%7B+%7D+D+%3D+%5Cbegin%7Bpmatrix%7D+d_1+%26+%5Ccdots+%26+0+%5C%5C+%5Cvdots+%26+%5Cddots+%26+%5Cvdots+%5C%5C+0+%26+%5Ccdots+%26+d_n+%5Cend%7Bpmatrix%7D%2C+%5Cmbox%7B+%7D+A+%3D+%5Cbegin%7Bpmatrix%7D+0+%26+%26+a_%7Bij%7D+%5C%5C+%26+%5Cddots+%26+%5C%5C+a_%7Bij%7D+%26+%26+0+%5Cend%7Bpmatrix%7D.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle u = &#92;begin{pmatrix} u_1(t) &#92;&#92; u_2(t) &#92;&#92; &#92;vdots &#92;&#92; u_n(t) &#92;end{pmatrix}, &#92;mbox{ } D = &#92;begin{pmatrix} d_1 &amp; &#92;cdots &amp; 0 &#92;&#92; &#92;vdots &amp; &#92;ddots &amp; &#92;vdots &#92;&#92; 0 &amp; &#92;cdots &amp; d_n &#92;end{pmatrix}, &#92;mbox{ } A = &#92;begin{pmatrix} 0 &amp; &amp; a_{ij} &#92;&#92; &amp; &#92;ddots &amp; &#92;&#92; a_{ij} &amp; &amp; 0 &#92;end{pmatrix}.' title='&#92;displaystyle u = &#92;begin{pmatrix} u_1(t) &#92;&#92; u_2(t) &#92;&#92; &#92;vdots &#92;&#92; u_n(t) &#92;end{pmatrix}, &#92;mbox{ } D = &#92;begin{pmatrix} d_1 &amp; &#92;cdots &amp; 0 &#92;&#92; &#92;vdots &amp; &#92;ddots &amp; &#92;vdots &#92;&#92; 0 &amp; &#92;cdots &amp; d_n &#92;end{pmatrix}, &#92;mbox{ } A = &#92;begin{pmatrix} 0 &amp; &amp; a_{ij} &#92;&#92; &amp; &#92;ddots &amp; &#92;&#92; a_{ij} &amp; &amp; 0 &#92;end{pmatrix}.' class='latex' /></p>
<p style="text-align: left;">We can now ask the following:</p>
<blockquote>
<p style="text-align: left;"><strong>Question 1.</strong> Do we have <img src='http://s0.wp.com/latex.php?latex=%5C%7Ca_%7Bij%7D%5C%7C_%5Cinfty+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|a_{ij}&#92;|_&#92;infty &lt; &#92;infty' title='&#92;|a_{ij}&#92;|_&#92;infty &lt; &#92;infty' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='j' title='j' class='latex' />?</p>
</blockquote>
<p style="text-align: left;">To answer this question, we shall embed the system into a more general system</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=u%27+%3D+i+%5Clambda+D+u+%2B+A+u&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='u&#039; = i &#92;lambda D u + A u' title='u&#039; = i &#92;lambda D u + A u' class='latex' />,</p>
<p style="text-align: left;">where <img src='http://s0.wp.com/latex.php?latex=%5Clambda+%5Cin+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;lambda &#92;in &#92;mathbb{R}' title='&#92;lambda &#92;in &#92;mathbb{R}' class='latex' />. We can then ask the similar question:</p>
<blockquote><p><strong>Question 2.</strong> Do we have <img src='http://s0.wp.com/latex.php?latex=%5C%7Ca_%7Bij%7D%5E%5Clambda%5C%7C_%5Cinfty+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|a_{ij}^&#92;lambda&#92;|_&#92;infty &lt; &#92;infty' title='&#92;|a_{ij}^&#92;lambda&#92;|_&#92;infty &lt; &#92;infty' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=j&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='j' title='j' class='latex' /> and for almost every <img src='http://s0.wp.com/latex.php?latex=%5Clambda+%5Cin+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;lambda &#92;in &#92;mathbb{R}' title='&#92;lambda &#92;in &#92;mathbb{R}' class='latex' />?</p></blockquote>
<p>These systems are called <em>AKNS systems</em>, which are connected to mathematical physics, <a href="http://en.wikipedia.org/wiki/Korteweg%E2%80%93de_Vries_equation">KdV</a>, <a href="http://en.wikipedia.org/wiki/Nonlinear_Schr%C3%B6dinger_equation">NLS</a>, and so on.</p>
<p>Let us now solved the problem posed above. An <a href="http://en.wikipedia.org/wiki/Ansatz"><em>ansatz</em></a> is that the solutions are of the form</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=u_j%28t%29+%3D+e%5E%7Bi+%5Clambda+d_j+t%7D+v_j%28t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='u_j(t) = e^{i &#92;lambda d_j t} v_j(t)' title='u_j(t) = e^{i &#92;lambda d_j t} v_j(t)' class='latex' /></p>
<p>for some <img src='http://s0.wp.com/latex.php?latex=v_j%28t%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='v_j(t)' title='v_j(t)' class='latex' />. If this is the case, then we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=v+%27+%3D+Wv&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='v &#039; = Wv' title='v &#039; = Wv' class='latex' /></p>
<p>where <img src='http://s0.wp.com/latex.php?latex=W&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='W' title='W' class='latex' /> is an <em>n</em>-by-<em>n</em> matrix such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=W_%7Blm%7D%28t%29+%3D+a_%7Blm%7D%28t%29+%5Ccdot+e%5E%7Bi+%5Clambda+%28d_l-d_m%29+t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='W_{lm}(t) = a_{lm}(t) &#92;cdot e^{i &#92;lambda (d_l-d_m) t}' title='W_{lm}(t) = a_{lm}(t) &#92;cdot e^{i &#92;lambda (d_l-d_m) t}' class='latex' />.</p>
<p>We consider <img src='http://s0.wp.com/latex.php?latex=n+%3D+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n = 2' title='n = 2' class='latex' /> first, as it is as difficult as the whole problem. In fact, if we can understand this case in full generality, then we will have obtained an understanding of the whole problem.</p>
<p>Since we hope to simplify the system further, we would like as many zeroes in our matrix as possible. In other words, we solve the following system:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Barray%7D%7Brcl%7D+a_%7B12%7D%28t%29+%26%3D%26+f%28t%29+%5C%5C+a_%7B21%7D%28t%29+%26%3D%26+0+%5Cend%7Barray%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{array}{rcl} a_{12}(t) &amp;=&amp; f(t) &#92;&#92; a_{21}(t) &amp;=&amp; 0 &#92;end{array}' title='&#92;begin{array}{rcl} a_{12}(t) &amp;=&amp; f(t) &#92;&#92; a_{21}(t) &amp;=&amp; 0 &#92;end{array}' class='latex' />.</p>
<p>This yields a 2-by-2 upper triangular system</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Bpmatrix%7D+0+%26+f%28t%29+e%5E%7Bi%5Clambda%28d_1-d_2%29t%7D+%5C%5C+0+%26+0+%5Cend%7Bpmatrix%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{pmatrix} 0 &amp; f(t) e^{i&#92;lambda(d_1-d_2)t} &#92;&#92; 0 &amp; 0 &#92;end{pmatrix}' title='&#92;begin{pmatrix} 0 &amp; f(t) e^{i&#92;lambda(d_1-d_2)t} &#92;&#92; 0 &amp; 0 &#92;end{pmatrix}' class='latex' />,</p>
<p>whence we obtain</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Bpmatrix%7Dv_1%27%28t%29+%5C%5C+v_2%27%28t%29+%5Cend%7Bpmatrix%7D+%5Cbegin%7Bpmatrix%7D+0+%26+f%28t%29+e%5E%7Bi%5Clambda%28d_1-d_2%29t%7D+%5C%5C+0+%26+0+%5Cend%7Bpmatrix%7D+%5Cbegin%7Bpmatrix%7D+v_1%28t%29+%5C%5C+v_2%28t%29+%5Cend%7Bpmatrix%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{pmatrix}v_1&#039;(t) &#92;&#92; v_2&#039;(t) &#92;end{pmatrix} &#92;begin{pmatrix} 0 &amp; f(t) e^{i&#92;lambda(d_1-d_2)t} &#92;&#92; 0 &amp; 0 &#92;end{pmatrix} &#92;begin{pmatrix} v_1(t) &#92;&#92; v_2(t) &#92;end{pmatrix}' title='&#92;begin{pmatrix}v_1&#039;(t) &#92;&#92; v_2&#039;(t) &#92;end{pmatrix} &#92;begin{pmatrix} 0 &amp; f(t) e^{i&#92;lambda(d_1-d_2)t} &#92;&#92; 0 &amp; 0 &#92;end{pmatrix} &#92;begin{pmatrix} v_1(t) &#92;&#92; v_2(t) &#92;end{pmatrix}' class='latex' />.</p>
<p>If we work in the simple subcase of <img src='http://s0.wp.com/latex.php?latex=d_1-d_2+%3D+1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d_1-d_2 = 1' title='d_1-d_2 = 1' class='latex' />, then we can solve this system <em>by hand</em> using linear algebra:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cbegin%7Barray%7D%7Brcl%7D+v_1%27%28t%29+%26%3D%26+f%28t%29+e%5E%7B%5Clambda+t%7Dv_2%28t%29+%5C%5C+v_2%27%28t%29+%26%3D%26+0.+%5Cend%7Barray%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;begin{array}{rcl} v_1&#039;(t) &amp;=&amp; f(t) e^{&#92;lambda t}v_2(t) &#92;&#92; v_2&#039;(t) &amp;=&amp; 0. &#92;end{array}' title='&#92;begin{array}{rcl} v_1&#039;(t) &amp;=&amp; f(t) e^{&#92;lambda t}v_2(t) &#92;&#92; v_2&#039;(t) &amp;=&amp; 0. &#92;end{array}' class='latex' /></p>
<p>This yields, <img src='http://s0.wp.com/latex.php?latex=v_2%5E%5Clambda+%3D+c_%5Clambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='v_2^&#92;lambda = c_&#92;lambda' title='v_2^&#92;lambda = c_&#92;lambda' class='latex' />, which implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=v_1%27%28t%29+%3D+c+%5Ccdot+f%28t%29+e%5E%7Bi+%5Clambda+t%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='v_1&#039;(t) = c &#92;cdot f(t) e^{i &#92;lambda t}' title='v_1&#039;(t) = c &#92;cdot f(t) e^{i &#92;lambda t}' class='latex' />,</p>
<p>whence</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+v_1%28t%29+%3D+c+%5Cint_%7B-%5Cinfty%7D%5Et+f%28s%29+e%5E%7Bi+%5Clambda+s%7D+%5C%2C+ds&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle v_1(t) = c &#92;int_{-&#92;infty}^t f(s) e^{i &#92;lambda s} &#92;, ds' title='&#92;displaystyle v_1(t) = c &#92;int_{-&#92;infty}^t f(s) e^{i &#92;lambda s} &#92;, ds' class='latex' />.</p>
<p>The above identity yields the bound</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5C%7Cv_1%28t%29%5C%7C_%5Cinfty+%5Cleq+%5C%7Cf%5C%7C_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|v_1(t)&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_1' title='&#92;|v_1(t)&#92;|_&#92;infty &#92;leq &#92;|f&#92;|_1' class='latex' />.</p>
<p>We would like to have <img src='http://s0.wp.com/latex.php?latex=%5C%7Cv_1%28t%29%5C%7C_%5Cinfty+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|v_1(t)&#92;|_&#92;infty &lt; &#92;infty' title='&#92;|v_1(t)&#92;|_&#92;infty &lt; &#92;infty' class='latex' />, so that the particles will not fly away. One way to obtain this bound is to have <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> be an <img src='http://s0.wp.com/latex.php?latex=L%5E1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^1' title='L^1' class='latex' />-function, whence our problem reduces to investigating the boundedness of</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+f+%5Cmapsto+%5Csup_t+%5Cleft%7C+%5Cint_%7B-%5Cinfty%7D%5Et+f%28s%29+e%5E%7Bi+%5Clambda+s%7D+%5C%2C+ds+%5Cright%7C.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle f &#92;mapsto &#92;sup_t &#92;left| &#92;int_{-&#92;infty}^t f(s) e^{i &#92;lambda s} &#92;, ds &#92;right|.' title='&#92;displaystyle f &#92;mapsto &#92;sup_t &#92;left| &#92;int_{-&#92;infty}^t f(s) e^{i &#92;lambda s} &#92;, ds &#92;right|.' class='latex' /></p>
<p>We can consider another continuous analogue <img src='http://s0.wp.com/latex.php?latex=C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='C' title='C' class='latex' /> of the Carleson operator introduced in the first part of the talk, known as <em>Carleson&#8217;s operator</em>:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+C%28g%29+%3D+%5Csup_N+%5Cleft%7C+%5Cint_%7B%5Cxi+%3C+N%7D+%5Chat%7Bg%7D%28%5Cxi%29+e%5E%7B-i+%5Clambda+%5Cxi%7D+%5C%2C+d%5Cxi+%5Cright%7C.&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle C(g) = &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;hat{g}(&#92;xi) e^{-i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right|.' title='&#92;displaystyle C(g) = &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;hat{g}(&#92;xi) e^{-i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right|.' class='latex' /></p>
<p>By Carleson-Hunt, we know that <img src='http://s0.wp.com/latex.php?latex=C%3AL%5Ep+%5Cto+L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='C:L^p &#92;to L^p' title='C:L^p &#92;to L^p' class='latex' /> is bounded for <img src='http://s0.wp.com/latex.php?latex=1+%3C+p+%3C+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; p &lt; &#92;infty' title='1 &lt; p &lt; &#92;infty' class='latex' />. Let us study this operator further.</p>
<p>If <img src='http://s0.wp.com/latex.php?latex=%5Chat%7Bg%7D+%5Cin+L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;hat{g} &#92;in L^p' title='&#92;hat{g} &#92;in L^p' class='latex' /> for some <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; 2' title='1 &#92;leq p &lt; 2' class='latex' />, and if <img src='http://s0.wp.com/latex.php?latex=p%27&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p&#039;' title='p&#039;' class='latex' /> is the conjugate exponent of <img src='http://s0.wp.com/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p' title='p' class='latex' />, then Carleson-Hunt yields</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5C%7CC%28%5Chat%7Bg%7D%29%5C%7C_%7Bp%27%7D+%5Clesssim+%5C%7C%5Chat%7B%5Chat%7Bg%7D%7D%5C%7C_%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|C(&#92;hat{g})&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{&#92;hat{g}}&#92;|_{p&#039;}' title='&#92;|C(&#92;hat{g})&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{&#92;hat{g}}&#92;|_{p&#039;}' class='latex' />,</p>
<p>whence we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5C%7C%5Chat%7B%5Chat%7Bg%7D%7D%5C%7C_%7Bp%27%7D+%5Clesssim+%5C%7C%5Chat%7Bg%7D%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|&#92;hat{&#92;hat{g}}&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{g}&#92;|_p' title='&#92;|&#92;hat{&#92;hat{g}}&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{g}&#92;|_p' class='latex' /></p>
<p>by the <a href="http://en.wikipedia.org/wiki/Hausdorff%E2%80%93Young_inequality">Hausdorff-Young inequality</a>. Therefore, we have the following inequality:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cleft%5C%7C+%5Csup_N+%5Cleft%7C+%5Cint_%7B%5Cxi+%3C+N%7D+%5Chat%7Bg%7D%28%5Cxi%29+e%5E%7Bi+%5Clambda+%5Cxi%7D+%5C%2C+d%5Cxi+%5Cright%7C+%5Cright%5C%7C_%7Bp%27%7D+%5Clesssim+%5C%7C%5Chat%7Bg%7D%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;left&#92;| &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;hat{g}(&#92;xi) e^{i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right| &#92;right&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{g}&#92;|_p' title='&#92;displaystyle &#92;left&#92;| &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;hat{g}(&#92;xi) e^{i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right| &#92;right&#92;|_{p&#039;} &#92;lesssim &#92;|&#92;hat{g}&#92;|_p' class='latex' />.</p>
<p style="text-align: left;">We note, however, that the <img src='http://s0.wp.com/latex.php?latex=L%5E%7Bp%27%7D+%5Cto+L%5E%7Bp%27%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{p&#039;} &#92;to L^{p&#039;}' title='L^{p&#039;} &#92;to L^{p&#039;}' class='latex' /> boundedness of</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5CXi+%5Cmapsto+%5Csup_N+%5Cleft%7C+%5Cint_%7B%5Cxi+%3C+N%7D+%5CXi%28%5Cxi%29+e%5E%7Bi+%5Clambda+%5Cxi%7D+%5C%2C+d%5Cxi+%5Cright%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;Xi &#92;mapsto &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;Xi(&#92;xi) e^{i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right|' title='&#92;displaystyle &#92;Xi &#92;mapsto &#92;sup_N &#92;left| &#92;int_{&#92;xi &lt; N} &#92;Xi(&#92;xi) e^{i &#92;lambda &#92;xi} &#92;, d&#92;xi &#92;right|' class='latex' /></p>
<p style="text-align: left;">is given by Menshow-Zygmund (1930s) and so does not require Carleson-Hunt. (If <img src='http://s0.wp.com/latex.php?latex=p+%3D+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p = 2' title='p = 2' class='latex' />, then we&#8217;d need Carleson, which requires much more effort.) So then, what does Carleson by itself give? First and foremost, we have the following inequality for <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; 2' title='1 &#92;leq p &lt; 2' class='latex' />:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5C%7CC%28g%29%5C%7C_p+%5Clesssim+%5C%7Cg%5C%7C_p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|C(g)&#92;|_p &#92;lesssim &#92;|g&#92;|_p' title='&#92;|C(g)&#92;|_p &#92;lesssim &#92;|g&#92;|_p' class='latex' />.</p>
<p style="text-align: left;">If <img src='http://s0.wp.com/latex.php?latex=f+%3D+%5Chat%7Bg%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f = &#92;hat{g}' title='f = &#92;hat{g}' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g+%5Cin+L%5Eq&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g &#92;in L^q' title='g &#92;in L^q' class='latex' /> for some <img src='http://s0.wp.com/latex.php?latex=2+%5Cleq+q+%3C+3&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='2 &#92;leq q &lt; 3' title='2 &#92;leq q &lt; 3' class='latex' />, then once again Carleson gives the above estimate. Indeed, the Fourier transform of an <img src='http://s0.wp.com/latex.php?latex=L%5E%7B1%2B%5Cvarepsilon%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^{1+&#92;varepsilon}' title='L^{1+&#92;varepsilon}' class='latex' /> function decays very, very slowly.</p>
<p style="text-align: left;">The conclusion is that the question posed above has an affirmative answer if we have a potential in <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' /> for some <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; 2' title='1 &#92;leq p &lt; 2' class='latex' />. Furthermore, the question also has an affirmative answer if we have a potential which is the Fourier transform of an <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-function for some <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; 2' title='1 &#92;leq p &lt; 2' class='latex' />.</p>
<p style="text-align: left;">We might ask ourselves whether this is true in general. In other words, if, for some <img src='http://s0.wp.com/latex.php?latex=1+%5Cleq+p+%3C+2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &#92;leq p &lt; 2' title='1 &#92;leq p &lt; 2' class='latex' />, the functions <img src='http://s0.wp.com/latex.php?latex=a_%7Bij%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='a_{ij}' title='a_{ij}' class='latex' /> are either themselves <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' /> or are Fourier transforms of <img src='http://s0.wp.com/latex.php?latex=L%5Ep&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^p' title='L^p' class='latex' />-functions, could we say that no particles fly away? The first question has an affirmative answer, by a result of M. Christ and A. Kiselev from about ten years ago. The second question is a bit more complicated. For simplicity&#8217;s sake, we shall consider the problem in <img src='http://s0.wp.com/latex.php?latex=L%5E2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L^2' title='L^2' class='latex' />. The general case of our problem considers an <em>n</em>-by-<em>n</em> upper triangular matrix, which yields the operator</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%28f_1%2Cf_2%2C%5Cldots%2Cf_d%29+%5Cmapsto+%5Csup_t+%5Cleft%7C+%5Cint_%7Bs_1+%3C+s_2+%3C+%5Ccdots+%3C+s_d+%3C+t%7D+f_1%28s_1%29+f_2%28s_2%29+%5Ccdots+f_d%28s_d%29+e%5E%7Bi+%5Clambda+%28%5C%23_1+s_1+%2B+%5C%23_2+s_2+%2B+%5Ccdots+%2B+%5C%23_d+s_d%29%7D+%5C%2C+ds_1+%5Ccdots+s_d+%5Cright%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle (f_1,f_2,&#92;ldots,f_d) &#92;mapsto &#92;sup_t &#92;left| &#92;int_{s_1 &lt; s_2 &lt; &#92;cdots &lt; s_d &lt; t} f_1(s_1) f_2(s_2) &#92;cdots f_d(s_d) e^{i &#92;lambda (&#92;#_1 s_1 + &#92;#_2 s_2 + &#92;cdots + &#92;#_d s_d)} &#92;, ds_1 &#92;cdots s_d &#92;right|' title='&#92;displaystyle (f_1,f_2,&#92;ldots,f_d) &#92;mapsto &#92;sup_t &#92;left| &#92;int_{s_1 &lt; s_2 &lt; &#92;cdots &lt; s_d &lt; t} f_1(s_1) f_2(s_2) &#92;cdots f_d(s_d) e^{i &#92;lambda (&#92;#_1 s_1 + &#92;#_2 s_2 + &#92;cdots + &#92;#_d s_d)} &#92;, ds_1 &#92;cdots s_d &#92;right|' class='latex' />.</p>
<p style="text-align: left;"><em>In general</em>, the above operator is bounded. There is also the Carleson variation of this operator&#8212;this just means we put a hat on each <img src='http://s0.wp.com/latex.php?latex=f_j&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_j' title='f_j' class='latex' />.</p>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2011/10/triangular-fourier-series-and-physical-reality/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Hahn-Banach Theorem and Symmetry Invariance II</title>
		<link>http://markhkim.com/2011/10/the-hahn-banach-theorem-and-symmetry-invariance-ii/</link>
		<comments>http://markhkim.com/2011/10/the-hahn-banach-theorem-and-symmetry-invariance-ii/#comments</comments>
		<pubDate>Wed, 12 Oct 2011 02:20:39 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[fa.functional-analysis]]></category>
		<category><![CDATA[Agnew-Morse theorem]]></category>
		<category><![CDATA[Hahn-Banach theorem]]></category>
		<category><![CDATA[semigroups]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=3162</guid>
		<description><![CDATA[This is the set of notes I wrote up for the talk I gave at the student analysis seminar on September 14. * * * * * Recall that we adopt the notation of Agnew and Morse [AM38] and write to denote the following: is a real vector space; is a sublinear functional on ; <a href='http://markhkim.com/2011/10/the-hahn-banach-theorem-and-symmetry-invariance-ii/'>[...]</a>]]></description>
			<content:encoded><![CDATA[<p>This is the set of notes I wrote up for the talk I gave at the <a title="Rutgers Graduate Student Analysis Seminar, Fall 2011" href="http://markhkim.com/seminars/f11-rutgers-student-analysis-seminar/">student analysis seminar</a> on September 14.</p>
<p style="text-align: center;">* * * * *</p>
<p>Recall that we adopt the notation of Agnew and Morse [AM38] and write <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathscr{L},&#92;rho,f,X]' title='[&#92;mathscr{L},&#92;rho,f,X]' class='latex' /> to denote the following:</p>
<ol>
<li><img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is a real vector space;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> is a sublinear functional on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is a linear functional defined on a subspace <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is dominated by <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=f%28x%29+%5Cleq+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(x) &#92;leq &#92;rho(x)' title='f(x) &#92;leq &#92;rho(x)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in Y' title='x &#92;in Y' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' /> is a collection of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=%5Crho+%28+%5CLambda+x+%29+%3D+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho ( &#92;Lambda x ) = &#92;rho(x)' title='&#92;rho ( &#92;Lambda x ) = &#92;rho(x)' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathscr%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathscr{L}' title='&#92;Lambda &#92;in &#92;mathscr{L}' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=f%28%5CLambda+x%29+%3D+f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(&#92;Lambda x) = f(x)' title='f(&#92;Lambda x) = f(x)' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathscr%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathscr{L}' title='&#92;Lambda &#92;in &#92;mathscr{L}' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=%5CLambda%28Y%29+%5Csubseteq+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda(Y) &#92;subseteq Y' title='&#92;Lambda(Y) &#92;subseteq Y' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathscr%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathscr{L}' title='&#92;Lambda &#92;in &#92;mathscr{L}' class='latex' />.</li>
</ol>
<p>Furthermore, if <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathscr{L},&#92;rho,f,X]' title='[&#92;mathscr{L},&#92;rho,f,X]' class='latex' /> is satisfied, we write <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathscr{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathscr{L},&#92;rho,f,X&#92;}' class='latex' /> to denote the collection of extensions <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is still dominated by <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' />, and that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F+%28+%5CLambda+x+%29+%3D+F%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F ( &#92;Lambda x ) = F(x)' title='F ( &#92;Lambda x ) = F(x)' class='latex' /></p>
<p>for all <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathscr%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathscr{L}' title='&#92;Lambda &#92;in &#92;mathscr{L}' class='latex' />. In this notation, the classical Hahn-Banach theorem can be phrased as follows:</p>
<p><strong>Theorem 1</strong> (Hahn-Banach). <em>Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a real vector space, and <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BL%7D%3D%5C%7BI%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{L}=&#92;{I&#92;}' title='&#92;mathscr{L}=&#92;{I&#92;}' class='latex' />, where <img src='http://s0.wp.com/latex.php?latex=I%3AX+%5Cto+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I:X &#92;to X' title='I:X &#92;to X' class='latex' /> is the identity mapping. If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathscr{L},&#92;rho,f,X]' title='[&#92;mathscr{L},&#92;rho,f,X]' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathscr{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathscr{L},&#92;rho,f,X&#92;}' class='latex' /> is nonempty.</em></p>
<p>Recall that a <em>semigroup</em> is a set with an associative binary operation. In the last talk, we have proved the following symmetry-invariant extension of Hahn-Banach:</p>
<p><strong>Theorem 2</strong> (Agnew-Morse). <em>Let <img src='http://s0.wp.com/latex.php?latex=%5Cmathscr%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathscr{L}' title='&#92;mathscr{L}' class='latex' /> be a semigroup of commuting endomorphisms on a real vector space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathscr{L},&#92;rho,f,X]' title='[&#92;mathscr{L},&#92;rho,f,X]' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathscr%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathscr{L},&#92;rho,f,X]' title='&#92;{&#92;mathscr{L},&#92;rho,f,X]' class='latex' /> is nonempty.</em></p>
<p>For a proof, see pages 25-27 of Lax [Lax02].</p>
<p>We also recall the key example from <a title="The Hahn-Banach Theorem and Symmetry Invariance I" href="http://markhkim.com/2011/09/the-hahn-banach-theorem-and-symmetry-invariance-i/">the last talk</a>. We write <img src='http://s0.wp.com/latex.php?latex=X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X^*' title='X^*' class='latex' /> to denote the space of all real-valued sequences, and <img src='http://s0.wp.com/latex.php?latex=X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_b' title='X_b' class='latex' /> to denote the space <img src='http://s0.wp.com/latex.php?latex=l%5E%5Cinfty%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l^&#92;infty(&#92;mathbb{R})' title='l^&#92;infty(&#92;mathbb{R})' class='latex' /> of all bounded real-valued sequences. The classical Banach limit extend the usual limit in the following manner:</p>
<p><strong>Theorem 3</strong>. <em>There exists an operator <img src='http://s0.wp.com/latex.php?latex=L%3AX_b+%5Cto+X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L:X_b &#92;to X_b' title='L:X_b &#92;to X_b' class='latex' />, called a </em>generalized limit<em> or a </em>Banach limit<em>, such that</em></p>
<ol>
<li><em>The generalized limit agrees with the usual limit if the usual limit exists;</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=L+%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%2B+%28y_n%29_%7Bn%3D1%7D%5E%5Cinfty%29++%3D+L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%2B+L%28+%28y_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L ((x_n)_{n=1}^&#92;infty + (y_n)_{n=1}^&#92;infty)  = L( (x_n)_{n=1}^&#92;infty ) + L( (y_n)_{n=1}^&#92;infty )' title='L ((x_n)_{n=1}^&#92;infty + (y_n)_{n=1}^&#92;infty)  = L( (x_n)_{n=1}^&#92;infty ) + L( (y_n)_{n=1}^&#92;infty )' class='latex' />;<br />
</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%3D+L%28+%28x_n%29_%7Bn%3Dk%7D%5E%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L( (x_n)_{n=1}^&#92;infty ) = L( (x_n)_{n=k}^&#92;infty)' title='L( (x_n)_{n=1}^&#92;infty ) = L( (x_n)_{n=k}^&#92;infty)' class='latex' /> for any <img src='http://s0.wp.com/latex.php?latex=k+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k &#92;in &#92;mathbb{N}' title='k &#92;in &#92;mathbb{N}' class='latex' />;</em><br />
<em></em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Climinf_%7Bn+%5Cto+%5Cinfty%7D+x_n+%5Cleq+L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%5Cleq+%5Climsup_%7Bn+%5Cto+%5Cinfty%7D+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L( (x_n)_{n=1}^&#92;infty ) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' title='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L( (x_n)_{n=1}^&#92;infty ) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' class='latex' />.</em></li>
</ol>
<p>We now see that the above theorem is an easy consequence of the Agnew-Morse theorem. Indeed, the Agnew-Morse theorem furnishes an extension of the regular limit operator that is invariant under the translation operator. A slight modification of the Agnew-Morse theorem allows us to extend the limit operator even further. <span id="more-3162"></span>First, some definitions:</p>
<p><strong>Definition 4</strong>. <img src='http://s0.wp.com/latex.php?latex=X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X^*' title='X^*' class='latex' /> is the space of all real-valued sequences. Let <img src='http://s0.wp.com/latex.php?latex=x+%3D+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%5Cin+X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x = (x_n)_{n=1}^&#92;infty &#92;in X^*' title='x = (x_n)_{n=1}^&#92;infty &#92;in X^*' class='latex' />.</p>
<ul>
<li><img src='http://s0.wp.com/latex.php?latex=T%3AX%5E%2A+%5Cto+X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T:X^* &#92;to X^*' title='T:X^* &#92;to X^*' class='latex' /> is the <em>translation operator</em>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=T%28x%29+%3D+%28x_2%2Cx_3%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T(x) = (x_2,x_3,&#92;ldots)' title='T(x) = (x_2,x_3,&#92;ldots)' class='latex' />.</p>
</li>
<li><img src='http://s0.wp.com/latex.php?latex=H%3AX%5E%2A+%5Cto+X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H:X^* &#92;to X^*' title='H:X^* &#92;to X^*' class='latex' /> is the <em>Hölder mean operator</em>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=H%28x%29+%3D+%28x_1%2C%5Bx_1%2Bx_2%5D%2F2%2C%5Bx_1%2Bx_2%2Bx_3%5D%2F3%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H(x) = (x_1,[x_1+x_2]/2,[x_1+x_2+x_3]/3,&#92;ldots)' title='H(x) = (x_1,[x_1+x_2]/2,[x_1+x_2+x_3]/3,&#92;ldots)' class='latex' />.</p>
</li>
<li>For each integer <img src='http://s0.wp.com/latex.php?latex=r%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r&gt;0' title='r&gt;0' class='latex' />, the map <img src='http://s0.wp.com/latex.php?latex=I_r%3AH%5E%2A+%5Cto+H%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I_r:H^* &#92;to H^*' title='I_r:H^* &#92;to H^*' class='latex' /> is the <em><img src='http://s0.wp.com/latex.php?latex=r&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r' title='r' class='latex' />-fold iteration operator</em>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=I_r%28x%29+%3D+%28x_1%2C%5Cldots%2Cx_1%2Cx_2%2C%5Cldots%2Cx_2%2Cx_3%5Cldots%2Cx_3%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I_r(x) = (x_1,&#92;ldots,x_1,x_2,&#92;ldots,x_2,x_3&#92;ldots,x_3,&#92;ldots)' title='I_r(x) = (x_1,&#92;ldots,x_1,x_2,&#92;ldots,x_2,x_3&#92;ldots,x_3,&#92;ldots)' class='latex' />,</p>
<p>where each term is repeated <img src='http://s0.wp.com/latex.php?latex=r&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r' title='r' class='latex' /> times.</li>
</ul>
<p><strong>Definition 5</strong>. We define the following subspaces of $X^*$..</p>
<ul>
<li><img src='http://s0.wp.com/latex.php?latex=X_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_0' title='X_0' class='latex' /> is the space of all convergent sequences with limit 0.</li>
<li><img src='http://s0.wp.com/latex.php?latex=X_c&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_c' title='X_c' class='latex' /> is the space of all convergent sequences.</li>
<li><img src='http://s0.wp.com/latex.php?latex=X_b%3D+l%5E%5Cinfty%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_b= l^&#92;infty(&#92;mathbb{R})' title='X_b= l^&#92;infty(&#92;mathbb{R})' class='latex' /> is the space of all bounded sequences.</li>
<li>For each integer <img src='http://s0.wp.com/latex.php?latex=k%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k&gt;0' title='k&gt;0' class='latex' />, <img src='http://s0.wp.com/latex.php?latex=X_k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_k' title='X_k' class='latex' /> is the space of all <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X^*' title='x &#92;in X^*' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=H%5Ek+x+%5Cin+X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^k x &#92;in X_b' title='H^k x &#92;in X_b' class='latex' />.</li>
<li><img src='http://s0.wp.com/latex.php?latex=X_%7Bo%28n%29%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_{o(n)}' title='X_{o(n)}' class='latex' /> is the set of all sequences <img src='http://s0.wp.com/latex.php?latex=%28x_1%2C%5Cldots%2Cx_n%2C%5Cldots%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(x_1,&#92;ldots,x_n,&#92;ldots)' title='(x_1,&#92;ldots,x_n,&#92;ldots)' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=X%5E%2A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X^*' title='X^*' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=%7Cx_n%7C+%3D+o%28n%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|x_n| = o(n)' title='|x_n| = o(n)' class='latex' />, that is, <img src='http://s0.wp.com/latex.php?latex=%7Cx_n%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='|x_n|' title='|x_n|' class='latex' /> is dominated by <img src='http://s0.wp.com/latex.php?latex=n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='n' title='n' class='latex' /> asymptotically.</li>
<li><img src='http://s0.wp.com/latex.php?latex=X+%3D+X_%7Bo%28n%29%7D+%5Ccap+%5B%5Cbigcup_%7Bk%3D1%7D%5E%5Cinfty+X_k%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X = X_{o(n)} &#92;cap [&#92;bigcup_{k=1}^&#92;infty X_k]' title='X = X_{o(n)} &#92;cap [&#92;bigcup_{k=1}^&#92;infty X_k]' class='latex' />.</li>
</ul>
<p>The extended result is the following, which is Theorem 4 in [MWW69]:</p>
<p><strong>Theorem 6</strong>.<em> On <img src='http://s0.wp.com/latex.php?latex=%5Cbigcup_%7Bk%3D1%7D%5E%5Cinfty+X_k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;bigcup_{k=1}^&#92;infty X_k' title='&#92;bigcup_{k=1}^&#92;infty X_k' class='latex' />, there exists a positive linear functional <img src='http://s0.wp.com/latex.php?latex=f_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_1' title='f_1' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=f_1%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_1(x)' title='f_1(x)' class='latex' /> is the limit of the sequence <img src='http://s0.wp.com/latex.php?latex=H%5Ek+x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^k x' title='H^k x' class='latex' /> whenever <img src='http://s0.wp.com/latex.php?latex=H%5Ek+x+%5Cin+X_c&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H^k x &#92;in X_c' title='H^k x &#92;in X_c' class='latex' />. Furthermore, <img src='http://s0.wp.com/latex.php?latex=f_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_1' title='f_1' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=%5Cbigcup_%7Bk%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;bigcup_{k=1}^&#92;infty' title='&#92;bigcup_{k=1}^&#92;infty' class='latex' /> is invariant under all elements in the semigroup generated by <img src='http://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H' title='H' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=f_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f_1' title='f_1' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is invariant under all elements in the semigroup generated by <img src='http://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H' title='H' class='latex' />, <img src='http://s0.wp.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='T' title='T' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=I_r&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I_r' title='I_r' class='latex' />, where <img src='http://s0.wp.com/latex.php?latex=r+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='r &#92;in &#92;mathbb{N}' title='r &#92;in &#92;mathbb{N}' class='latex' />.</em></p>
<p>We omit the proof of this result. Interested readers can find a proof in [MWW69]. We merely point out the variant of the Agnew-Morse theorem required to establish the above theorem. To state the variant, we need some definitions.</p>
<p><strong>Definition 7</strong>. A set <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is said to <em>act</em> on a subset <img src='http://s0.wp.com/latex.php?latex=X_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_1' title='X_1' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> <em>commutatively to within left <img src='http://s0.wp.com/latex.php?latex=H&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='H' title='H' class='latex' />-factors</em> if each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X_1' title='x &#92;in X_1' class='latex' /> and every <img src='http://s0.wp.com/latex.php?latex=g_1%2Cg_2+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_1,g_2 &#92;in G' title='g_1,g_2 &#92;in G' class='latex' /> furnish <img src='http://s0.wp.com/latex.php?latex=h_1%2Ch_2+%5Cin+H&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='h_1,h_2 &#92;in H' title='h_1,h_2 &#92;in H' class='latex' /> such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=h_1g_1g_2%28x%29+%3D+h_2g_2g_1%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='h_1g_1g_2(x) = h_2g_2g_1(x)' title='h_1g_1g_2(x) = h_2g_2g_1(x)' class='latex' />.</p>
<p><strong>Definition 8</strong>. Let <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> be s set of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=X_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_1' title='X_1' class='latex' /> a subset of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />. We say that <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> is <em>left-solvable</em> over <img src='http://s0.wp.com/latex.php?latex=X_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_1' title='X_1' class='latex' /> if there exists a sequence</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=G+%3D+G_n+%5Csupseteq+G_%7Bn-1%7D+%5Csupseteq+%5Ccdots+%5Csupseteq+G_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G = G_n &#92;supseteq G_{n-1} &#92;supseteq &#92;cdots &#92;supseteq G_0' title='G = G_n &#92;supseteq G_{n-1} &#92;supseteq &#92;cdots &#92;supseteq G_0' class='latex' /></p>
<p>of endomorphisms such that, for each <img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+k+leq+n-1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq k leq n-1' title='0 &#92;leq k leq n-1' class='latex' />, the set <img src='http://s0.wp.com/latex.php?latex=G_%7Bk%2B1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G_{k+1}' title='G_{k+1}' class='latex' /> acts on <img src='http://s0.wp.com/latex.php?latex=X_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_1' title='X_1' class='latex' /> commutatively to within left <img src='http://s0.wp.com/latex.php?latex=G_k&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G_k' title='G_k' class='latex' />-factors, and if <img src='http://s0.wp.com/latex.php?latex=G_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G_0' title='G_0' class='latex' /> is commutative.</p>
<p>Here is the required variant, which is Theorem 2 in [MWW69]; interested readers can find a proof in [MWW69]:</p>
<p><strong>Theorem 9</strong>. <em>Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a partially ordered linear space and <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> a set of order-preserving linear transformations of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> into itself. Let</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=X_0+%5Csubseteq+X_1+%5Csubseteq+%5Ccdots&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_0 &#92;subseteq X_1 &#92;subseteq &#92;cdots' title='X_0 &#92;subseteq X_1 &#92;subseteq &#92;cdots' class='latex' /></em></p>
<p><em>be a set of <img src='http://s0.wp.com/latex.php?latex=%5Cbar%7Bn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;bar{n}' title='&#92;bar{n}' class='latex' /> <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' />-invariant subspaces (<img src='http://s0.wp.com/latex.php?latex=%5Cbar%7Bn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;bar{n}' title='&#92;bar{n}' class='latex' /> may be infinity) such that the union is <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />. We assume that, for each <img src='http://s0.wp.com/latex.php?latex=1+%3C+n+%3C+%5Cbar%7Bn%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='1 &lt; n &lt; &#92;bar{n}' title='1 &lt; n &lt; &#92;bar{n}' class='latex' />, either</em></p>
<ol>
<li><em><img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> is left-solvable over <img src='http://s0.wp.com/latex.php?latex=X_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_n' title='X_n' class='latex' />, and for each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X' title='x &#92;in X' class='latex' />, there is an <img src='http://s0.wp.com/latex.php?latex=s+%5Cin+X_%7Bn-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='s &#92;in X_{n-1}' title='s &#92;in X_{n-1}' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=s+%5Cgeq+x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='s &#92;geq x' title='s &#92;geq x' class='latex' />; or</em></li>
<li><em>for each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X_n' title='x &#92;in X_n' class='latex' />, there is a <img src='http://s0.wp.com/latex.php?latex=g+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g &#92;in G' title='g &#92;in G' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=g%28x%29+%5Cin+X_%7Bn-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g(x) &#92;in X_{n-1}' title='g(x) &#92;in X_{n-1}' class='latex' />; and for each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X_n' title='x &#92;in X_n' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g_1%2Cg_2%2Cg_3+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_1,g_2,g_3 &#92;in G' title='g_1,g_2,g_3 &#92;in G' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=g_1%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_1(x)' title='g_1(x)' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=g_2g_3%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='g_2g_3(x)' title='g_2g_3(x)' class='latex' /> are in <img src='http://s0.wp.com/latex.php?latex=X_%7Bn-1%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_{n-1}' title='X_{n-1}' class='latex' />, there are <img src='http://s0.wp.com/latex.php?latex=h_1%2Ch_2+%5Cin+G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='h_1,h_2 &#92;in G' title='h_1,h_2 &#92;in G' class='latex' /> such that</em>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=h_1g_1g_2g_3%28x%29+%3D+h_2g_2g_3g_1%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='h_1g_1g_2g_3(x) = h_2g_2g_3g_1(x)' title='h_1g_1g_2g_3(x) = h_2g_2g_3g_1(x)' class='latex' />.</em></p>
</li>
</ol>
<p><em>Then every <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' />-invariant positive linear functional on <img src='http://s0.wp.com/latex.php?latex=X_0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_0' title='X_0' class='latex' /> can be extended to a <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' />-invariant positive linear functional on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />.</em></p>
<p>As another application of the Agnew-Morse theorem, we consider generalizations of the Lebesgue measure:</p>
<p><strong>Theorem 10</strong>. There exists a nonnegative finitely additive set function <img src='http://s0.wp.com/latex.php?latex=m%3A+%5Cmathcal%7BP%7D%28%5Cmathbb%7BS%7D%5E1%29+%5Cto+%5B0%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='m: &#92;mathcal{P}(&#92;mathbb{S}^1) &#92;to [0,&#92;infty)' title='m: &#92;mathcal{P}(&#92;mathbb{S}^1) &#92;to [0,&#92;infty)' class='latex' /> that is invariant under rotation.</p>
<p>A proof was presented in the talk, which is taken directly from [Lax02]. Interested readers can find a proof in pages 33-34 of [Lax02]. Powered by Theorem 9, we can generalize the above theorem to the following:</p>
<p><strong>Theorem 11</strong>. Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a compact Hausdorff space and <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> a semigroup of continuous endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> containing the identity such that <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' /> is right-solvable over itself. Then there is a Baire measure on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> which is <img src='http://s0.wp.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='G' title='G' class='latex' />-invariant and <a href="http://mathworld.wolfram.com/ErgodicMeasure.html">ergodic</a>.</p>
<p>This is Theorem 6 in [MWW69]. No proof of the above result was presented in the talk. The paper contains a partial proof.</p>
<p><strong>References</strong></p>
<ul>
<li>[AM38] A. G. Agnew and A. P. Morse, &#8220;Extensions of linear functionals, with applications to limits, integrals, measures, and densities,&#8221; Annals of Mathematics <strong>39 </strong>(1938), no. 1, 20-30.</li>
<li>[Lax02] Peter D. Lax, <em>Functional Analysis</em>, John Wiley &amp; Sons. 2002.</li>
<li>[MWW69] E. J. McShane, R. B. Warfield, and V. M. Warfield. &#8220;Invariant extensions of linear functionals, with applications to measures and stochastic processes,&#8221; Pacific Journal of Mathematics <strong>28</strong> (1969), no. 1, 121-142.</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2011/10/the-hahn-banach-theorem-and-symmetry-invariance-ii/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Hahn-Banach Theorem and Symmetry Invariance I</title>
		<link>http://markhkim.com/2011/09/the-hahn-banach-theorem-and-symmetry-invariance-i/</link>
		<comments>http://markhkim.com/2011/09/the-hahn-banach-theorem-and-symmetry-invariance-i/#comments</comments>
		<pubDate>Fri, 23 Sep 2011 12:50:16 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[fa.functional-analysis]]></category>
		<category><![CDATA[Agnew-Morse theorem]]></category>
		<category><![CDATA[Hahn-Banach theorem]]></category>
		<category><![CDATA[semigroups]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=3092</guid>
		<description><![CDATA[This is the set of notes I wrote up for the talk I gave at the student analysis seminar on September 13. * * * * * Definition 1. Let be a real vector space. A sublinear functional on is a real-valued function on satisfying Positive homogeneity. for all and ; Subadditivity. for all . <a href='http://markhkim.com/2011/09/the-hahn-banach-theorem-and-symmetry-invariance-i/'>[...]</a>]]></description>
			<content:encoded><![CDATA[<p>This is the set of notes I wrote up for the talk I gave at the <a title="Rutgers Graduate Student Analysis Seminar, Fall 2011" href="http://markhkim.com/seminars/f11-rutgers-student-analysis-seminar/">student analysis seminar</a> on September 13.</p>
<p style="text-align: center;">* * * * *</p>
<p><strong>Definition 1</strong>. Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a real vector space. A <em>sublinear functional</em> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is a real-valued function <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> satisfying</p>
<ol>
<li><strong>Positive homogeneity</strong>. <img src='http://s0.wp.com/latex.php?latex=%5Crho%28a+x%29+%3D+a+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(a x) = a &#92;rho(x)' title='&#92;rho(a x) = a &#92;rho(x)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=a+%3E+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='a &gt; 0' title='a &gt; 0' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X' title='x &#92;in X' class='latex' />;</li>
<li><strong>Subadditivity</strong>. <img src='http://s0.wp.com/latex.php?latex=%5Crho%28x%2By%29+%5Cleq+%5Crho%28x%29%2B%5Crho%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(x+y) &#92;leq &#92;rho(x)+&#92;rho(y)' title='&#92;rho(x+y) &#92;leq &#92;rho(x)+&#92;rho(y)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=x%2Cy+%5Cin+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x,y &#92;in X' title='x,y &#92;in X' class='latex' />.</li>
</ol>
<p>A <em>linear functional</em> is a sublinear functional that is <strong>additive</strong>, viz.,</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Crho%28x%2By%29+%3D+%5Crho%28x%29%2B%5Crho%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(x+y) = &#92;rho(x)+&#92;rho(y)' title='&#92;rho(x+y) = &#92;rho(x)+&#92;rho(y)' class='latex' /></p>
<p>for all <img src='http://s0.wp.com/latex.php?latex=x%2Cy+%5Cin+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x,y &#92;in X' title='x,y &#92;in X' class='latex' />.<strong></strong></p>
<p><strong>Theorem 2</strong> (Hahn, 1927; Banach, 1932). <em>If a linear functional <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on a subspace <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> of a real vector space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is</em><br />
<em>dominated by a sublinear functional on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />, then there exists an extension of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> still dominated by the same sublinear functional.</em></p>
<p><em>Proof</em>. Extend the linear functional by one dimension and use transfinite induction.</p>
<p>We now discuss a well-known application of the Hahn-Banach theorem, known as <em>Banach limits</em>, which extends the notion of limit to a more general class of sequences.</p>
<p><strong>Definition 3</strong>. <img src='http://s0.wp.com/latex.php?latex=X_b+%3D+l%5E%5Cinfty%28%5Cmathbb%7BR%7D%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_b = l^&#92;infty(&#92;mathbb{R})' title='X_b = l^&#92;infty(&#92;mathbb{R})' class='latex' /> is the normed linear space of all bounded real-valued sequences with the norm</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5C%7C%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty%5C%7C+%3D+%5Csup_%7Bn+%5Cin+%5Cmathbb%7BN%7D%7D+%7Cx_n%7C&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;|(x_n)_{n=1}^&#92;infty&#92;| = &#92;sup_{n &#92;in &#92;mathbb{N}} |x_n|' title='&#92;|(x_n)_{n=1}^&#92;infty&#92;| = &#92;sup_{n &#92;in &#92;mathbb{N}} |x_n|' class='latex' />.</p>
<p>Of course, not every bounded sequence converges. The classical Banach limit extends the notion of limit as follows:</p>
<p><strong>Theorem 4</strong>. <em>There exists an operator <img src='http://s0.wp.com/latex.php?latex=L%3AX_b+%5Cto+X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L:X_b &#92;to X_b' title='L:X_b &#92;to X_b' class='latex' />, called a </em>generalized limit<em> or a </em>Banach limit<em>, such that</em></p>
<ol>
<li><em>The generalized limit agrees with the usual limit if the usual limit exists;</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=L+%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%2B+%28y_n%29_%7Bn%3D1%7D%5E%5Cinfty%29++%3D+L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%2B+L%28+%28y_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L ((x_n)_{n=1}^&#92;infty + (y_n)_{n=1}^&#92;infty)  = L( (x_n)_{n=1}^&#92;infty ) + L( (y_n)_{n=1}^&#92;infty )' title='L ((x_n)_{n=1}^&#92;infty + (y_n)_{n=1}^&#92;infty)  = L( (x_n)_{n=1}^&#92;infty ) + L( (y_n)_{n=1}^&#92;infty )' class='latex' />;<br />
</em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%3D+L%28+%28x_n%29_%7Bn%3Dk%7D%5E%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L( (x_n)_{n=1}^&#92;infty ) = L( (x_n)_{n=k}^&#92;infty)' title='L( (x_n)_{n=1}^&#92;infty ) = L( (x_n)_{n=k}^&#92;infty)' class='latex' /> for any <img src='http://s0.wp.com/latex.php?latex=k+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='k &#92;in &#92;mathbb{N}' title='k &#92;in &#92;mathbb{N}' class='latex' />;</em><br />
<em></em></li>
<li><em><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Climinf_%7Bn+%5Cto+%5Cinfty%7D+x_n+%5Cleq+L%28+%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty+%29+%5Cleq+%5Climsup_%7Bn+%5Cto+%5Cinfty%7D+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L( (x_n)_{n=1}^&#92;infty ) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' title='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L( (x_n)_{n=1}^&#92;infty ) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' class='latex' />.</em></li>
</ol>
<p><em>Proof</em>. We define <img src='http://s0.wp.com/latex.php?latex=p%3AX_b+%5Cto+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p:X_b &#92;to &#92;mathbb{R}' title='p:X_b &#92;to &#92;mathbb{R}' class='latex' /> by setting</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+p%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty%29+%3D+%5Climsup_%7Bn+%5Cto+%5Cinfty%7D+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle p((x_n)_{n=1}^&#92;infty) = &#92;limsup_{n &#92;to &#92;infty} x_n' title='&#92;displaystyle p((x_n)_{n=1}^&#92;infty) = &#92;limsup_{n &#92;to &#92;infty} x_n' class='latex' /></p>
<p>This is a sublinear functional on <img src='http://s0.wp.com/latex.php?latex=X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_b' title='X_b' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' /> is the <em>left-translation map</em></p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=S%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty%29+%3D+%28x_n%29_%7Bn%3D2%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S((x_n)_{n=1}^&#92;infty) = (x_n)_{n=2}^&#92;infty' title='S((x_n)_{n=1}^&#92;infty) = (x_n)_{n=2}^&#92;infty' class='latex' />,</p>
<p>then <img src='http://s0.wp.com/latex.php?latex=p%28Sx%29%3Dp%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p(Sx)=p(x)' title='p(Sx)=p(x)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X_b' title='x &#92;in X_b' class='latex' />. Let <img src='http://s0.wp.com/latex.php?latex=X_c&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_c' title='X_c' class='latex' /> be the space of convergent real-valued sequences, which is a linear subspace of <img src='http://s0.wp.com/latex.php?latex=X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X_b' title='X_b' class='latex' />. We define a linear functional <img src='http://s0.wp.com/latex.php?latex=l%3AY+%5Cto+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l:Y &#92;to &#92;mathbb{R}' title='l:Y &#92;to &#92;mathbb{R}' class='latex' /> by</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+l%28%28y_n%29_%7Bn%3D1%7D%5E%5Cinfty%29+%3D+%5Clim_%7Bn+%5Cto+%5Cinfty%7D+y_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle l((y_n)_{n=1}^&#92;infty) = &#92;lim_{n &#92;to &#92;infty} y_n' title='&#92;displaystyle l((y_n)_{n=1}^&#92;infty) = &#92;lim_{n &#92;to &#92;infty} y_n' class='latex' />.</p>
<p>Then <img src='http://s0.wp.com/latex.php?latex=l%28y%29%3Dp%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l(y)=p(y)' title='l(y)=p(y)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=y+%5Cin+X_c&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y &#92;in X_c' title='y &#92;in X_c' class='latex' />, and <img src='http://s0.wp.com/latex.php?latex=l%28Sy%29%3Dl%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l(Sy)=l(y)' title='l(Sy)=l(y)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=y+%5Cin+X_c&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y &#92;in X_c' title='y &#92;in X_c' class='latex' />. We invoke the Hahn-Banach theorem to furnish an extension <img src='http://s0.wp.com/latex.php?latex=L%3AX_b+%5Cto+%5Cmathbb%7BR%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L:X_b &#92;to &#92;mathbb{R}' title='L:X_b &#92;to &#92;mathbb{R}' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=l&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='l' title='l' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L' title='L' class='latex' /> is dominated by <img src='http://s0.wp.com/latex.php?latex=p&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='p' title='p' class='latex' /> and that <img src='http://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L' title='L' class='latex' /> is invariant under left translation. In particular,</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Climinf_%7Bn+%5Cto+%5Cinfty%7D+x_n+%5Cleq+L%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty%29+%5Cleq+%5Climsup_%7Bn+%5Cto+%5Cinfty%7D+x_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L((x_n)_{n=1}^&#92;infty) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' title='&#92;displaystyle &#92;liminf_{n &#92;to &#92;infty} x_n &#92;leq L((x_n)_{n=1}^&#92;infty) &#92;leq &#92;limsup_{n &#92;to &#92;infty} x_n' class='latex' />,</p>
<p>for each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X_b&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X_b' title='x &#92;in X_b' class='latex' /> satisfies the inequality <img src='http://s0.wp.com/latex.php?latex=-p%28-x%29+%5Cleq+L%28x%29+%5Cleq+p%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='-p(-x) &#92;leq L(x) &#92;leq p(x)' title='-p(-x) &#92;leq L(x) &#92;leq p(x)' class='latex' />. It thus follows that <img src='http://s0.wp.com/latex.php?latex=L&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L' title='L' class='latex' /> is the desired map. <img src='http://s0.wp.com/latex.php?latex=%5Csquare&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;square' title='&#92;square' class='latex' /></p>
<p>Note that one of the key properties of the limit operator was &#8220;invariance under the translation operator,&#8221; viz.,</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=L%28%28x_n%29_%7Bn%3Dk%7D%5E%5Cinfty%29+%3D+L%28%28x_n%29_%7Bn%3D1%7D%5E%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L((x_n)_{n=k}^&#92;infty) = L((x_n)_{n=1}^&#92;infty)' title='L((x_n)_{n=k}^&#92;infty) = L((x_n)_{n=1}^&#92;infty)' class='latex' />.</p>
<p>Keeping this in mind, we introduce a new notation, which will bring out the key elements of the Hahn-Banach theorem. The following is a slightly modified version of the notation employed in Agnew and Morse [AM38].</p>
<p>We shall write <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathfrak{L},&#92;rho,f,X]' title='[&#92;mathfrak{L},&#92;rho,f,X]' class='latex' /> to denote the following:</p>
<ol>
<li><img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is a real vector space;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> is a sublinear functional on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is a linear functional defined on a subspace <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is dominated by <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=f%28x%29+%5Cleq+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(x) &#92;leq &#92;rho(x)' title='f(x) &#92;leq &#92;rho(x)' class='latex' /> for all <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in Y' title='x &#92;in Y' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' /> is a collection of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CLambda+x%29+%3D%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Lambda x) =&#92;rho(x)' title='&#92;rho(&#92;Lambda x) =&#92;rho(x)' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathfrak{L}' title='&#92;Lambda &#92;in &#92;mathfrak{L}' class='latex' />.</li>
<li><img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=f%28%5CLambda+x%29+%3D+f%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(&#92;Lambda x) = f(x)' title='f(&#92;Lambda x) = f(x)' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathfrak{L}' title='&#92;Lambda &#92;in &#92;mathfrak{L}' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' />, viz., <img src='http://s0.wp.com/latex.php?latex=%5CLambda%28Y%29+%5Csubseteq+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda(Y) &#92;subseteq Y' title='&#92;Lambda(Y) &#92;subseteq Y' class='latex' /> for each <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathfrak{L}' title='&#92;Lambda &#92;in &#92;mathfrak{L}' class='latex' />.</li>
</ol>
<p>If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathfrak{L},&#92;rho,f,X]' title='[&#92;mathfrak{L},&#92;rho,f,X]' class='latex' />, then we write <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' class='latex' /> to denote the set of extensions <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is still dominated by <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' />, and that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F%28%5CLambda+x%29+%3D+F%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(&#92;Lambda x) = F(x)' title='F(&#92;Lambda x) = F(x)' class='latex' /></p>
<p>for all <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathfrak{L}' title='&#92;Lambda &#92;in &#92;mathfrak{L}' class='latex' />. With the new shorthand, we can rephrase the classical Hahn-Banach theorem as follows:</p>
<p><strong>Theorem 5</strong> (Hahn-Banach, as stated in [AM38]).  <em>Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a real vector space, and <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D%3D%5C%7BI%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}=&#92;{I&#92;}' title='&#92;mathfrak{L}=&#92;{I&#92;}' class='latex' />, where <img src='http://s0.wp.com/latex.php?latex=I%3AX+%5Cto+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I:X &#92;to X' title='I:X &#92;to X' class='latex' /> is the identity mapping. If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathfrak{L},&#92;rho,f,X]' title='[&#92;mathfrak{L},&#92;rho,f,X]' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' class='latex' /> is nonempty.</em></p>
<p>The main theorem of the talk is the symmetry-invariant version of the Hahn-Banach theorem known as the <em>Agnew-Morse theorem</em>. The theorem was first proven by A. G. Agnew and A. P. Morse in 1938 [AM38], and was subsequently generalized by E. J. McShane, R. B. Warfield, and V. M. Warfield in 1969 [MWW69]. We state here the minor generalization of the McShane-Warfield-Warfield formulation of the theorem, as stated in [Lax02]:<em></em></p>
<p><strong>Theorem 6</strong> (Agnew-Morse, 1937; McShane-Warfield-Warfield, 1969; Lax, 2002). <em>Let <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> be a real vector space, and <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> be a collection of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> that commute, viz.,</em></p>
<p style="text-align: center;"><em><img src='http://s0.wp.com/latex.php?latex=%5CLambda_t+%5CLambda_s+%3D+%5CLambda_s+%5CLambda_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t &#92;Lambda_s = &#92;Lambda_s &#92;Lambda_t' title='&#92;Lambda_t &#92;Lambda_s = &#92;Lambda_s &#92;Lambda_t' class='latex' /></em></p>
<p><em>for any pair of operators <img src='http://s0.wp.com/latex.php?latex=%5CLambda_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t' title='&#92;Lambda_t' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5CLambda_s&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_s' title='&#92;Lambda_s' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathfrak{L},&#92;rho,f,X]' title='[&#92;mathfrak{L},&#92;rho,f,X]' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' class='latex' /> is nonempty.</em></p>
<p><span id="more-3092"></span></p>
<p>A remark is in order. If <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is invariant under a pair of operators <img src='http://s0.wp.com/latex.php?latex=%5CLambda_t%2C+%5CLambda_s+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t, &#92;Lambda_s &#92;in &#92;mathfrak{L}' title='&#92;Lambda_t, &#92;Lambda_s &#92;in &#92;mathfrak{L}' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is also invariant under <img src='http://s0.wp.com/latex.php?latex=%5CLambda_t+%5CLambda_s&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t &#92;Lambda_s' title='&#92;Lambda_t &#92;Lambda_s' class='latex' />. Moreover, if <img src='http://s0.wp.com/latex.php?latex=%5CLambda_t&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t' title='&#92;Lambda_t' class='latex' /> and $\Lambda_s$ commute with every operator in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />, then so does <img src='http://s0.wp.com/latex.php?latex=%5CLambda_t%5CLambda_s&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda_t&#92;Lambda_s' title='&#92;Lambda_t&#92;Lambda_s' class='latex' />. We may thus enlarge <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> by adding the identity <img src='http://s0.wp.com/latex.php?latex=I&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='I' title='I' class='latex' /> and all finite products of the elements therein; this turns <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> into a <em>semigroup</em>, which we now define:</p>
<p><strong>Definition 7</strong>. A <em>semigroup</em> is a set <img src='http://s0.wp.com/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='S' title='S' class='latex' /> with an associative binary operation.</p>
<p>For example, <img src='http://s0.wp.com/latex.php?latex=%5B0%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[0,&#92;infty)' title='[0,&#92;infty)' class='latex' /> with the usual addition is a semigroup. We note that the term &#8220;semigroup&#8221; in functional analysis usually refers to the following:</p>
<p><strong>Definition 8</strong>. A <em>one-parameter semigroup</em> of operators over a Banach space $latexX$ is a family <img src='http://s0.wp.com/latex.php?latex=%5C%7BX+%5Cxrightarrow%7BL_t%7D+X%5C%7D_%7Bt+%5Cgeq+0%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{X &#92;xrightarrow{L_t} X&#92;}_{t &#92;geq 0}' title='&#92;{X &#92;xrightarrow{L_t} X&#92;}_{t &#92;geq 0}' class='latex' /> of bounded operators such that</p>
<ol>
<li>  <img src='http://s0.wp.com/latex.php?latex=L%280%29+%3D+I&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L(0) = I' title='L(0) = I' class='latex' />;</li>
<li><img src='http://s0.wp.com/latex.php?latex=L_%7Bt%2Bs%7D+%3D+L_tL_s&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='L_{t+s} = L_tL_s' title='L_{t+s} = L_tL_s' class='latex' /> for all $t,s \geq 0$.</li>
</ol>
<p>Note that a one-parameter semigroup is essentially a &#8220;representation&#8221; of the semigroup <img src='http://s0.wp.com/latex.php?latex=%5B0%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[0,&#92;infty)' title='[0,&#92;infty)' class='latex' /> on the Banach space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />: it is a homomorphism of <img src='http://s0.wp.com/latex.php?latex=%5B0%2C%5Cinfty%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[0,&#92;infty)' title='[0,&#92;infty)' class='latex' /> into the collection <img src='http://s0.wp.com/latex.php?latex=%5Cmathrm%7BEnd%7D%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathrm{End}(X)' title='&#92;mathrm{End}(X)' class='latex' /> of endomorphisms on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />.</p>
<p>Let us now return to the main theorem. We have shown that proving <strong>Theorem 6</strong> amounts to proving the following variant:</p>
<p><strong>Theorem 9</strong> (Agnew-Morse, the semigroup version)<br />
Let <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> be a semigroup of commuting endomorphisms on a real vector space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />. If <img src='http://s0.wp.com/latex.php?latex=%5B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='[&#92;mathfrak{L},&#92;rho,f,X]' title='[&#92;mathfrak{L},&#92;rho,f,X]' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=%5C%7B%5Cmathfrak%7BL%7D%2C%5Crho%2Cf%2CX%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' title='&#92;{&#92;mathfrak{L},&#92;rho,f,X&#92;}' class='latex' /> is nonempty.</p>
<p>This is the statement of the Agnew-Morse found in [MWW69]. The following proof is taken from [Lax02], pp.25-27:</p>
<p><em>Proof</em>. Let <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' /> denote a convex combination of operators in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />, viz.,</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5CGamma+%3D+%5Csum_n+a_n+%5CLambda_n&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma = &#92;sum_n a_n &#92;Lambda_n' title='&#92;Gamma = &#92;sum_n a_n &#92;Lambda_n' class='latex' />,</p>
<p>where <img src='http://s0.wp.com/latex.php?latex=%28a_n%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(a_n)_{n=1}^&#92;infty' title='(a_n)_{n=1}^&#92;infty' class='latex' /> is a nonnegative sequence whose sum is 1, and <img src='http://s0.wp.com/latex.php?latex=%28%5CLambda_n%29_%7Bn%3D1%7D%5E%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='(&#92;Lambda_n)_{n=1}^&#92;infty' title='(&#92;Lambda_n)_{n=1}^&#92;infty' class='latex' /> a sequence of operators in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />. We set</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Csigma%28x%29+%3D+%5Cinf+%5Crho%28%5CGamma+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(x) = &#92;inf &#92;rho(&#92;Gamma x)' title='&#92;sigma(x) = &#92;inf &#92;rho(&#92;Gamma x)' class='latex' />,</p>
<p>where the infimum is taken over all convex combinations <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' />. This is our bounding sublinear functional, as we shall show.</p>
<p>Note that the <em>convex hull</em> of <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />, the collection of all convex combinations <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' />, closed under composition. For each convex combination <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' />, we have the following inequality:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma+x%29+%3D+%5Crho+%5Cleft%28+%5Csum_n+a_n+%5CLambda_n+x+%5Cright%29+%5Cleq+%5Csum_n+a_n+%5Crho+%5Cleft%28+%5CLambda_n+x+%5Cright%29+%3D+%5Csum_n+a_n+%5Crho%28x%29+%3D+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma x) = &#92;rho &#92;left( &#92;sum_n a_n &#92;Lambda_n x &#92;right) &#92;leq &#92;sum_n a_n &#92;rho &#92;left( &#92;Lambda_n x &#92;right) = &#92;sum_n a_n &#92;rho(x) = &#92;rho(x)' title='&#92;rho(&#92;Gamma x) = &#92;rho &#92;left( &#92;sum_n a_n &#92;Lambda_n x &#92;right) &#92;leq &#92;sum_n a_n &#92;rho &#92;left( &#92;Lambda_n x &#92;right) = &#92;sum_n a_n &#92;rho(x) = &#92;rho(x)' class='latex' />. (Eq. 1)</p>
<p>Therefore, <img src='http://s0.wp.com/latex.php?latex=%5Csigma%28x%29+%5Cleq+%5Crho%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(x) &#92;leq &#92;rho(x)' title='&#92;sigma(x) &#92;leq &#92;rho(x)' class='latex' />.</p>
<p>We claim that <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' /> is a sublinear functional. Indeed,</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Csigma%28a+x%29%3D+%5Cinf+%5Crho%28%5CGamma+a+x%29%3D+%5Cinf+%5Crho%28a+%5CGamma+x%29%3D+a+%5Cinf+%5Crho%28%5CGamma+x%29%3D+a+%5Csigma%28x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(a x)= &#92;inf &#92;rho(&#92;Gamma a x)= &#92;inf &#92;rho(a &#92;Gamma x)= a &#92;inf &#92;rho(&#92;Gamma x)= a &#92;sigma(x)' title='&#92;sigma(a x)= &#92;inf &#92;rho(&#92;Gamma a x)= &#92;inf &#92;rho(a &#92;Gamma x)= a &#92;inf &#92;rho(&#92;Gamma x)= a &#92;sigma(x)' class='latex' />,</p>
<p>and so <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' /> is positive homogeneous. To see that <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' /> is subadditive, we pick arbitrary elements <img src='http://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x' title='x' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y' title='y' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />. By the definition of <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />, each <img src='http://s0.wp.com/latex.php?latex=%5Cvarepsilon%3E0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;varepsilon&gt;0' title='&#92;varepsilon&gt;0' class='latex' /> furnishes a pair of maps <img src='http://s0.wp.com/latex.php?latex=%5CGamma_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_1' title='&#92;Gamma_1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5CGamma_2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_2' title='&#92;Gamma_2' class='latex' /> in the convex hull of <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> such that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma_1+x%29+%5Cleq+%5Csigma%28x%29+%2B+%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma_1 x) &#92;leq &#92;sigma(x) + &#92;varepsilon' title='&#92;rho(&#92;Gamma_1 x) &#92;leq &#92;sigma(x) + &#92;varepsilon' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma_2+x%29+%5Cleq+%5Csigma%28x%29+%2B+%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma_2 x) &#92;leq &#92;sigma(x) + &#92;varepsilon' title='&#92;rho(&#92;Gamma_2 x) &#92;leq &#92;sigma(x) + &#92;varepsilon' class='latex' />. (Eq. 2)</p>
<p>Since <img src='http://s0.wp.com/latex.php?latex=%5CGamma_1&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_1' title='&#92;Gamma_1' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=%5CGamma_2&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_2' title='&#92;Gamma_2' class='latex' /> commute, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Csigma%28x%2By%29+%5Cleq+%5Crho%28%5CGamma_1%5CGamma_2%28x%2By%29%29+%3D+%5Crho%28%5CGamma_2%5CGamma_1+x+%2B+%5CGamma_1+%5CGamma_2+y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(x+y) &#92;leq &#92;rho(&#92;Gamma_1&#92;Gamma_2(x+y)) = &#92;rho(&#92;Gamma_2&#92;Gamma_1 x + &#92;Gamma_1 &#92;Gamma_2 y)' title='&#92;sigma(x+y) &#92;leq &#92;rho(&#92;Gamma_1&#92;Gamma_2(x+y)) = &#92;rho(&#92;Gamma_2&#92;Gamma_1 x + &#92;Gamma_1 &#92;Gamma_2 y)' class='latex' />.</p>
<p>The subadditivity of <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma_2%5CGamma_1+x+%2B+%5CGamma_1+%5CGamma_2+y%29+%5Cleq+%5Crho%28%5CGamma_2%5CGamma_1+x%29+%2B+%5Crho%28%5CGamma_1%5CGamma_2+y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma_2&#92;Gamma_1 x + &#92;Gamma_1 &#92;Gamma_2 y) &#92;leq &#92;rho(&#92;Gamma_2&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_1&#92;Gamma_2 y)' title='&#92;rho(&#92;Gamma_2&#92;Gamma_1 x + &#92;Gamma_1 &#92;Gamma_2 y) &#92;leq &#92;rho(&#92;Gamma_2&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_1&#92;Gamma_2 y)' class='latex' />,</p>
<p>and</p>
<p><img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma_2%5CGamma_1+x%29+%2B+%5Crho%28%5CGamma_1%5CGamma_2+y%29+%5Cleq+%5Crho%28%5CGamma_1+x%29+%2B+%5Crho%28%5CGamma_2+y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma_2&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_1&#92;Gamma_2 y) &#92;leq &#92;rho(&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_2 y)' title='&#92;rho(&#92;Gamma_2&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_1&#92;Gamma_2 y) &#92;leq &#92;rho(&#92;Gamma_1 x) + &#92;rho(&#92;Gamma_2 y)' class='latex' /></p>
<p>by (Eq. 1). It thus follows from the estimate (Eq. 2) that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Csigma%28x%2By%29+%5Cleq+%5Csigma%28x%29+%2B+%5Csigma%28y%29+%2B+2%5Cvarepsilon&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(x+y) &#92;leq &#92;sigma(x) + &#92;sigma(y) + 2&#92;varepsilon' title='&#92;sigma(x+y) &#92;leq &#92;sigma(x) + &#92;sigma(y) + 2&#92;varepsilon' class='latex' />,</p>
<p>whence <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' /> is subadditive as was claimed.</p>
<p>We now show that $\sigma$ dominates <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' />. By the invariance of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> under each operator in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />, we have the following equality for each convex combination <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' /> and each element <img src='http://s0.wp.com/latex.php?latex=y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y' title='y' class='latex' /> of $laetx Y$:</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=f%28%5CGamma+y%29+%3D+f+%5Cleft%28+%5Csum_n+a_n+%5CLambda_n+y+%5Cright%29+%3D+%5Csum_n+a_n+f%28%5CLambda_n+y%29+%3D+%5Csum_n+a_n+f%28y%29+%3D+f%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(&#92;Gamma y) = f &#92;left( &#92;sum_n a_n &#92;Lambda_n y &#92;right) = &#92;sum_n a_n f(&#92;Lambda_n y) = &#92;sum_n a_n f(y) = f(y)' title='f(&#92;Gamma y) = f &#92;left( &#92;sum_n a_n &#92;Lambda_n y &#92;right) = &#92;sum_n a_n f(&#92;Lambda_n y) = &#92;sum_n a_n f(y) = f(y)' class='latex' />;</p>
<p>that is, <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' />. Since <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is invariant under each <img src='http://s0.wp.com/latex.php?latex=%5CGamma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma' title='&#92;Gamma' class='latex' /> as well, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Crho%28%5CGamma+y%29+%5Cgeq+f%28%5CGamma+y%29+%3D+f%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho(&#92;Gamma y) &#92;geq f(&#92;Gamma y) = f(y)' title='&#92;rho(&#92;Gamma y) &#92;geq f(&#92;Gamma y) = f(y)' class='latex' /></p>
<p>for each <img src='http://s0.wp.com/latex.php?latex=y+%5Cin+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y &#92;in Y' title='y &#92;in Y' class='latex' />. It thus follows that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=f%28y%29+%5Cleq+%5Cinf+%5Crho%28%5CGamma+y%29+%3D+%5Csigma%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(y) &#92;leq &#92;inf &#92;rho(&#92;Gamma y) = &#92;sigma(y)' title='f(y) &#92;leq &#92;inf &#92;rho(&#92;Gamma y) = &#92;sigma(y)' class='latex' /></p>
<p>for all <img src='http://s0.wp.com/latex.php?latex=y+%5Cin+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y &#92;in Y' title='y &#92;in Y' class='latex' />, whence by the Hahn-Banach theorem that there is an extension <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=f&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f' title='f' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> still dominated by <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />.</p>
<p>We claim that <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' /> is invariant under all operators <img src='http://s0.wp.com/latex.php?latex=%5CLambda&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda' title='&#92;Lambda' class='latex' /> in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />. To show this, we use an averaging trick. For a fixed <img src='http://s0.wp.com/latex.php?latex=%5CLambda+%5Cin+%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Lambda &#92;in &#92;mathfrak{L}' title='&#92;Lambda &#92;in &#92;mathfrak{L}' class='latex' />, we set</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5CGamma_N+%3D+%5Cfrac%7B1%7D%7BN%7D+%5Csum_%7Bn%3D0%7D%5E%7BN-1%7D+%5CLambda%5En&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;Gamma_N = &#92;frac{1}{N} &#92;sum_{n=0}^{N-1} &#92;Lambda^n' title='&#92;displaystyle &#92;Gamma_N = &#92;frac{1}{N} &#92;sum_{n=0}^{N-1} &#92;Lambda^n' class='latex' /></p>
<p>for each <img src='http://s0.wp.com/latex.php?latex=N+%5Cin+%5Cmathbb%7BN%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N &#92;in &#92;mathbb{N}' title='N &#92;in &#92;mathbb{N}' class='latex' />. Since <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' /> is a semigroup, <img src='http://s0.wp.com/latex.php?latex=%5CGamma_N&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;Gamma_N' title='&#92;Gamma_N' class='latex' /> is in the convex hull of <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />. Therefore, we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csigma%28x-%5CLambda+x%29+%5Cleq+%5Crho%28%5CGamma_N%28x-%5CLambda+x%29%29+%3D%5Crho%28%5CGamma_N%28I-A%29x%29%3D%5Cfrac%7B1%7D%7BN%7D+%5Crho%28x+-+%5CLambda%5EN+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sigma(x-&#92;Lambda x) &#92;leq &#92;rho(&#92;Gamma_N(x-&#92;Lambda x)) =&#92;rho(&#92;Gamma_N(I-A)x)=&#92;frac{1}{N} &#92;rho(x - &#92;Lambda^N x)' title='&#92;displaystyle &#92;sigma(x-&#92;Lambda x) &#92;leq &#92;rho(&#92;Gamma_N(x-&#92;Lambda x)) =&#92;rho(&#92;Gamma_N(I-A)x)=&#92;frac{1}{N} &#92;rho(x - &#92;Lambda^N x)' class='latex' /></p>
<p>for each <img src='http://s0.wp.com/latex.php?latex=x+%5Cin+X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x &#92;in X' title='x &#92;in X' class='latex' />. The last equality follows from</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5CGamma_N%28I-%5CGamma%29+%3D+%5Cfrac%7B1%7D%7BN%7D+%28I-%5CGamma%5EN%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;Gamma_N(I-&#92;Gamma) = &#92;frac{1}{N} (I-&#92;Gamma^N)' title='&#92;displaystyle &#92;Gamma_N(I-&#92;Gamma) = &#92;frac{1}{N} (I-&#92;Gamma^N)' class='latex' />,</p>
<p>which is just the geometric series. The subadditivity of <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Cfrac%7B1%7D%7BN%7D+%5Crho%28x+-+%5CLambda%5EN+x%29+%5Cleq+%5Cfrac%7B1%7D%7BN%7D+%5Cleft%5B+%5Crho%28x%29+%2B%5Crho%28-%5CLambda%5En+x%29+%5Cright%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;frac{1}{N} &#92;rho(x - &#92;Lambda^N x) &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) +&#92;rho(-&#92;Lambda^n x) &#92;right]' title='&#92;displaystyle &#92;frac{1}{N} &#92;rho(x - &#92;Lambda^N x) &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) +&#92;rho(-&#92;Lambda^n x) &#92;right]' class='latex' />,</p>
<p>and we have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cfrac%7B1%7D%7BN%7D+%5Cleft%5B+%5Crho%28x%29+%2B%5Crho%28-%5CLambda%5En+x%29+%5Cright%5D+%5Cleq+%5Cfrac%7B1%7D%7BN%7D+%5Cleft%5B+%5Crho%28x%29+%2B+%5Crho%28-x%29+%5Cright%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;frac{1}{N} &#92;left[ &#92;rho(x) +&#92;rho(-&#92;Lambda^n x) &#92;right] &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) + &#92;rho(-x) &#92;right]' title='&#92;frac{1}{N} &#92;left[ &#92;rho(x) +&#92;rho(-&#92;Lambda^n x) &#92;right] &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) + &#92;rho(-x) &#92;right]' class='latex' /></p>
<p>by the invariance of <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> under all operators in <img src='http://s0.wp.com/latex.php?latex=%5Cmathfrak%7BL%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;mathfrak{L}' title='&#92;mathfrak{L}' class='latex' />. It thus follows that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Cdisplaystyle+%5Csigma%28x-%5CLambda+x%29+%5Cleq+%5Cfrac%7B1%7D%7BN%7D+%5Cleft%5B+%5Crho%28x%29+%2B+%5Crho%28-x%29+%5Cright%5D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;displaystyle &#92;sigma(x-&#92;Lambda x) &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) + &#92;rho(-x) &#92;right]' title='&#92;displaystyle &#92;sigma(x-&#92;Lambda x) &#92;leq &#92;frac{1}{N} &#92;left[ &#92;rho(x) + &#92;rho(-x) &#92;right]' class='latex' />.</p>
<p>Letting <img src='http://s0.wp.com/latex.php?latex=N+%5Cto+%5Cinfty&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='N &#92;to &#92;infty' title='N &#92;to &#92;infty' class='latex' />, we now see that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=%5Csigma%28x-%5CLambda+x%29+%5Cleq+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma(x-&#92;Lambda x) &#92;leq 0' title='&#92;sigma(x-&#92;Lambda x) &#92;leq 0' class='latex' />.</p>
<p>Since <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' /> dominates <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' />, the above inequality implies that</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F%28x-%5CLambda+x%29+%5Cleq+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(x-&#92;Lambda x) &#92;leq 0' title='F(x-&#92;Lambda x) &#92;leq 0' class='latex' />,</p>
<p>whence by linearity</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F%28x%29+%5Cleq+F%28%5CLambda+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(x) &#92;leq F(&#92;Lambda x)' title='F(x) &#92;leq F(&#92;Lambda x)' class='latex' />.</p>
<p>Replacing <img src='http://s0.wp.com/latex.php?latex=x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='x' title='x' class='latex' /> with <img src='http://s0.wp.com/latex.php?latex=-x&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='-x' title='-x' class='latex' />, we also have</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F%28-x%29+%5Cleq+F%28-%5CLambda+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(-x) &#92;leq F(-&#92;Lambda x)' title='F(-x) &#92;leq F(-&#92;Lambda x)' class='latex' />,</p>
<p>and so</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=0+%5Cleq+F%28x+-+%5CLambda+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='0 &#92;leq F(x - &#92;Lambda x)' title='0 &#92;leq F(x - &#92;Lambda x)' class='latex' />.</p>
<p>It thus follows that <img src='http://s0.wp.com/latex.php?latex=F%28x-+%5CLambda+x%29+%3D+0&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(x- &#92;Lambda x) = 0' title='F(x- &#92;Lambda x) = 0' class='latex' />, or</p>
<p style="text-align: center;"><img src='http://s0.wp.com/latex.php?latex=F%28x%29+%3D+F%28%5CLambda+x%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F(x) = F(&#92;Lambda x)' title='F(x) = F(&#92;Lambda x)' class='latex' />,</p>
<p>as was claimed.</p>
<p>It now suffices to observe that <img src='http://s0.wp.com/latex.php?latex=%5Crho&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;rho' title='&#92;rho' class='latex' /> dominates <img src='http://s0.wp.com/latex.php?latex=%5Csigma&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;sigma' title='&#92;sigma' class='latex' />, hence <img src='http://s0.wp.com/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='F' title='F' class='latex' />. <img src='http://s0.wp.com/latex.php?latex=%5Csquare&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;square' title='&#92;square' class='latex' /></p>
<p><a title="The Hahn-Banach Theorem and Symmetry Invariance II" href="http://markhkim.com/2011/10/the-hahn-banach-theorem-and-symmetry-invariance-ii/">Next time</a>, we shall consider a few applications of the Agnew-Morse theorem.</p>
<p><strong>References</strong></p>
<ul>
<li>[AM38] A. G. Agnew and A. P. Morse, &#8220;Extensions of linear functionals, with applications to limits, integrals, measures, and densities,&#8221; Annals of Mathematics <strong>39 </strong>(1938), no. 1, 20-30.</li>
<li>[Lax02] Peter D. Lax, <em>Functional Analysis</em>, John Wiley &amp; Sons. 2002.</li>
<li>[MWW69] E. J. McShane, R. B. Warfield, and V. M. Warfield. &#8220;Invariant extensions of linear functionals, with applications to measures and stochastic processes,&#8221; Pacific Journal of Mathematics <strong>28</strong> (1969), no. 1, 121-142.</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2011/09/the-hahn-banach-theorem-and-symmetry-invariance-i/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Connectedness and Discrete-Valued Maps</title>
		<link>http://markhkim.com/2011/08/connectedness-and-discrete-valued-maps/</link>
		<comments>http://markhkim.com/2011/08/connectedness-and-discrete-valued-maps/#comments</comments>
		<pubDate>Wed, 03 Aug 2011 22:49:36 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[gn.general-topology]]></category>
		<category><![CDATA[general topology]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=2907</guid>
		<description><![CDATA[I found a neat characterization of connectedness in Bredon&#8217;s Topology and Geometry: so nice, in fact, that I am compelled to write up a quick note about it. Let us recall that a topological space is disconnected if there exists a disjoint pair of open subsets and of whose union is , and that is <a href='http://markhkim.com/2011/08/connectedness-and-discrete-valued-maps/'>[...]</a>]]></description>
			<content:encoded><![CDATA[<p>I found a neat characterization of connectedness in Bredon&#8217;s <em>Topology and Geometry</em>: so nice, in fact, that I am compelled to write up a quick note about it.</p>
<p>Let us recall that a topological space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is <em>disconnected</em> if there exists a disjoint pair of open subsets <img src='http://s0.wp.com/latex.php?latex=U&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='U' title='U' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='V' title='V' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> whose union is <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />, and that <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is <em>connected</em> otherwise. A <em>discrete-valued map</em> is a continuous map <img src='http://s0.wp.com/latex.php?latex=d%3AX+%5Cto+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d:X &#92;to D' title='d:X &#92;to D' class='latex' /> from a topological space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> to a <em>discrete space</em> <img src='http://s0.wp.com/latex.php?latex=D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='D' title='D' class='latex' />, which is a topological space in which every subset is open. An alternate characterization of connectedness is as follows:</p>
<blockquote><p><strong>Proposition</strong> <strong>1</strong> (Alternate characterization of connectedness). A topological space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is connected if and only if every discrete-valued map <img src='http://s0.wp.com/latex.php?latex=d%3AX+%5Cto+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d:X &#92;to D' title='d:X &#92;to D' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is constant.</p></blockquote>
<p>The proof is quite simple. If <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is connected, then the preimage <img src='http://s0.wp.com/latex.php?latex=d%5E%7B-1%7D%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d^{-1}(y)' title='d^{-1}(y)' class='latex' /> of an element <img src='http://s0.wp.com/latex.php?latex=y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='y' title='y' class='latex' /> in the image of <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> is nonempty, open, and closed: therefore, <img src='http://s0.wp.com/latex.php?latex=d%5E%7B-1%7D%28y%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d^{-1}(y)' title='d^{-1}(y)' class='latex' /> must be the whole space. Conversely, if <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is not connected, then we can find a disjoint pair of open subsets <img src='http://s0.wp.com/latex.php?latex=U&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='U' title='U' class='latex' /> and <img src='http://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='V' title='V' class='latex' /> of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> whose union is <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />, whence the map <img src='http://s0.wp.com/latex.php?latex=d%3AX+%5Cto+%5C%7B0%2C1%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d:X &#92;to &#92;{0,1&#92;}' title='d:X &#92;to &#92;{0,1&#92;}' class='latex' /> which is 0 on <img src='http://s0.wp.com/latex.php?latex=U&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='U' title='U' class='latex' /> and 1 on <img src='http://s0.wp.com/latex.php?latex=V&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='V' title='V' class='latex' /> is a nonconstant discrete-valued map on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />.</p>
<p>Why would anyone think of such an alternate definition? <a title="Glen Wilson's homepage" href="http://www.math.rutgers.edu/%7Ewilson47/" target="_blank">Glen Wilson</a> offered the following perspective, which I very much like. First off, following the &#8220;categorical&#8221; way of thinking, we submit that describing a collection of object in terms of maps between them&#8212;as opposed to the objects themselves&#8212;is a <em>good thing</em>. But why constant maps? We can consider &#8220;labeling&#8221; each connected component in a topological space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> by quotienting <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> out by its connected components. The resulting space <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is a discrete space, and the quotient map <img src='http://s0.wp.com/latex.php?latex=%5Cpi%3AX+%5Cto+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;pi:X &#92;to Y' title='&#92;pi:X &#92;to Y' class='latex' /> is a surjective continuous map that is constant if and only if <img src='http://s0.wp.com/latex.php?latex=Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='Y' title='Y' class='latex' /> is a singleton. Of course, this happens precisely when <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> has one connected component, i.e., if <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is connected.</p>
<p>This alternate characterization leads us to swift proofs of the key properties of connected space. Let us first consider the following</p>
<blockquote><p><strong>Proposition 2</strong>. The continuous image of a connected space is connected.</p></blockquote>
<p>Here is a one-liner for the proof: If <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is a connected space, <img src='http://s0.wp.com/latex.php?latex=f%3AX+%5Cto+Y&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f:X &#92;to Y' title='f:X &#92;to Y' class='latex' /> a continuous map, and <img src='http://s0.wp.com/latex.php?latex=d%3Af%28X%29+%5Cto+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d:f(X) &#92;to D' title='d:f(X) &#92;to D' class='latex' /> any discrete-valued map, then the composition <img src='http://s0.wp.com/latex.php?latex=d+%5Ccirc+f%3AX+%5Cto+D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d &#92;circ f:X &#92;to D' title='d &#92;circ f:X &#92;to D' class='latex' /> must be constant, and so <img src='http://s0.wp.com/latex.php?latex=f%28X%29&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='f(X)' title='f(X)' class='latex' /> is connected. The following triumph of intuition also admits a devastatingly simple proof:</p>
<blockquote><p><strong>Proposition 3</strong>. If a collection of connected sets share a point, then the union is connected.</p></blockquote>
<p>Here, any discrete-valued map <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> must be constant on each connected set, and the value of <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> must be the same because they all share a point: it follows that <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> is constant on the union. Another illustrative example is as follows:</p>
<blockquote><p><strong>Proposition 4</strong>. If <img src='http://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A' title='A' class='latex' /> is a connected subset of a topological space <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' />, and if <img src='http://s0.wp.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B' title='B' class='latex' /> is a subset of <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> such that <img src='http://s0.wp.com/latex.php?latex=A+%5Csubseteq+B+%5Csubseteq+%5Cbar%7BA%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A &#92;subseteq B &#92;subseteq &#92;bar{A}' title='A &#92;subseteq B &#92;subseteq &#92;bar{A}' class='latex' />, then <img src='http://s0.wp.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B' title='B' class='latex' /> is connected.</p></blockquote>
<p>Again, the proof is very short. Any discrete-valued map <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> on <img src='http://s0.wp.com/latex.php?latex=X&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='X' title='X' class='latex' /> is a continuous, hence <em>sequentially continuous</em>, map that is constant on <img src='http://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A' title='A' class='latex' />, whence we conclude that the value of <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> on any limit point of <img src='http://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A' title='A' class='latex' /> is the same as the value <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> takes on <img src='http://s0.wp.com/latex.php?latex=A&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='A' title='A' class='latex' />. It follows that <img src='http://s0.wp.com/latex.php?latex=d&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='d' title='d' class='latex' /> is constant on <img src='http://s0.wp.com/latex.php?latex=%5Cbar%7BA%7D&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='&#92;bar{A}' title='&#92;bar{A}' class='latex' />, hence on <img src='http://s0.wp.com/latex.php?latex=B&#038;bg=ffffff&#038;fg=000&#038;s=0' alt='B' title='B' class='latex' />.</p>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2011/08/connectedness-and-discrete-valued-maps/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Blog</title>
		<link>http://markhkim.com/2009/11/blog/</link>
		<comments>http://markhkim.com/2009/11/blog/#comments</comments>
		<pubDate>Sun, 01 Nov 2009 22:28:41 +0000</pubDate>
		<dc:creator>Mark Kim</dc:creator>
				<category><![CDATA[MK Blathers]]></category>

		<guid isPermaLink="false">http://markhkim.com/?p=999</guid>
		<description><![CDATA[Revised versions of some of the old blog posts will be posted soon. Otherwise, the old blog is purged. Added 8/25/2011: I have purged the blog once again (I left one post&#8212;Connectedness and Discrete-Valued Maps&#8212;intact). Let&#8217;s see how long this lasts.]]></description>
			<content:encoded><![CDATA[<p>Revised versions of some of the old blog posts will be posted soon. Otherwise, the old blog is purged.</p>
<p>Added 8/25/2011: I have purged the blog once again (I left one post&#8212;<a title="Connectedness and Discrete-Valued Maps" href="http://markhkim.com/2011/08/connectedness-and-discrete-valued-maps/">Connectedness and Discrete-Valued Maps</a>&#8212;intact). Let&#8217;s see how long this lasts.</p>
]]></content:encoded>
			<wfw:commentRss>http://markhkim.com/2009/11/blog/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>

