<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Partial_fraction_decomposition</id>
	<title>Partial fraction decomposition - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Partial_fraction_decomposition"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;action=history"/>
	<updated>2026-05-22T17:53:53Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=287375&amp;oldid=prev</id>
		<title>en&gt;D.Lazard: /* Basic principles */ better wikilinks + ce</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=287375&amp;oldid=prev"/>
		<updated>2014-12-02T17:04:47Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Basic principles: &lt;/span&gt; better wikilinks + ce&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 19:04, 2 December 2014&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l1&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;−&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;My name&lt;/del&gt;&#039;s &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Sibyl Partin &lt;/del&gt;but &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;everybody calls me Sibyl. I&lt;/del&gt;&#039;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;m from Netherlands. I&lt;/del&gt;&#039;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;m studying &lt;/del&gt;at the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;high school (&lt;/del&gt;final &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;year) &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I play &lt;/del&gt;the &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Tuba for 3 years&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Usually I choose music from my famous films ;)&lt;/del&gt;. &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;br&amp;gt;I have two brothers&lt;/del&gt;. I &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;like Association football&lt;/del&gt;, &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;watching TV (Doctor Who) &lt;/del&gt;and &lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Volleyball&lt;/del&gt;.&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Here is my weblog: &lt;/del&gt;[http://&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;musclestats&lt;/del&gt;.com/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;drupal2&lt;/del&gt;/&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;dedicated&lt;/del&gt;-server&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;-hostgator Hostgator 1 cent coupon]&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Wordpress has replaced nearly all of my &#039;normal&#039; html websites. Just obtain the [http://musclestats.com/drupal2/dedicated-server-hostgator HostGator 1 cent coupon] and avail all of the services of a regular package at free of price for a month. Indeed they may be one of the best serves you can ever find and they are inside my &#039;A list&#039; and listed below are the keypoints of Hostgator&#039;s success. Great for finding the perfect site look. Among the list of worlds most significant and most preferred Internet hosting enterprise is the HostGator. All in all, it&lt;/ins&gt;&#039;s &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;not that difficult to make the right choice for hosting when you&#039;re reading good web hosting reviews - &lt;/ins&gt;but &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;don&#039;t rush it unless it&lt;/ins&gt;&#039;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;s absolutely necessary, and ensure you&lt;/ins&gt;&#039;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;re looking &lt;/ins&gt;at the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;full picture before making a &lt;/ins&gt;final &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;decision. You&#039;ll need to be good at describing things, packaging them up, &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;maintaining customer satisfaction, but it isn&#039;t that hard. After inception of HostGator, clients started selecting their host, based on &lt;/ins&gt;the &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;reliability and [http://search&lt;/ins&gt;.&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;about&lt;/ins&gt;.&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;com/?q=technical+support technical support] in case of technical glitches&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Although &lt;/ins&gt;I &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;am not using Hostgator Website hosting for this blog&lt;/ins&gt;, &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I am using it for 2 associated with my personal interferance websites &lt;/ins&gt;and &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;I am truly happy with their providers as well as client facilitates&lt;/ins&gt;. &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;It has been in existence for more than a decade which ensures shoppers with the most effective web hosting &lt;/ins&gt;[http://&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Www.Answers&lt;/ins&gt;.com/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;topic&lt;/ins&gt;/&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;service service] possible.&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;&amp;lt;br&amp;gt;Likewise, many beginner bloggers want to make a little side income with their blog. Even if every week or so, every other month, are supported, I believe that the process will check it works properly. Hostgator has optimized their servers to run wordpress like a charm. Or plan to pay your programmer a lot of money performing repair work. But after the years I have put into looking, I managed to come up with a list of places. No never&lt;/ins&gt;-&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;ending loops and all have been verified that they pay. The pricing is all reasonable in my opinion, especially considering what you receive. This implies that there is a very minimal likelihood of &lt;/ins&gt;server &lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;crashing thus, making sure that the shoppers websites will likely be up and running all of the time.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>en&gt;D.Lazard</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=287374&amp;oldid=prev</id>
		<title>en&gt;D.Lazard: /* Example 2 */ copyedit</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=287374&amp;oldid=prev"/>
		<updated>2014-02-26T09:38:46Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Example 2: &lt;/span&gt; copyedit&lt;/p&gt;
&lt;a href=&quot;https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;amp;diff=287374&amp;amp;oldid=3368&quot;&gt;Show changes&lt;/a&gt;</summary>
		<author><name>en&gt;D.Lazard</name></author>
	</entry>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=3368&amp;oldid=prev</id>
		<title>en&gt;D.Lazard: /* References */ sorting by date</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Partial_fraction_decomposition&amp;diff=3368&amp;oldid=prev"/>
		<updated>2013-12-08T15:55:08Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;References: &lt;/span&gt; sorting by date&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;In [[mathematics]], the &amp;#039;&amp;#039;&amp;#039;uniform boundedness principle&amp;#039;&amp;#039;&amp;#039; or &amp;#039;&amp;#039;&amp;#039;Banach–Steinhaus theorem&amp;#039;&amp;#039;&amp;#039; is one of the fundamental results in [[functional analysis]]. Together with the [[Hahn–Banach theorem]] and the [[open mapping theorem (functional analysis)|open mapping theorem]], it is considered one of the cornerstones of the field.  In its basic form, it asserts that for a family of [[continuous  linear operator]]s (and thus bounded operators) whose domain is a [[Banach space]], pointwise boundedness is equivalent to uniform boundedness in operator norm.&lt;br /&gt;
&lt;br /&gt;
The theorem was first published in 1927 by [[Stefan Banach]] and [[Hugo Steinhaus]] but it was also proven independently by [[Hans Hahn (mathematician)|Hans Hahn]]. &lt;br /&gt;
&lt;br /&gt;
== Uniform boundedness principle ==&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Theorem (Uniform Boundedness Principle).&amp;#039;&amp;#039;&amp;#039; Let &amp;#039;&amp;#039;X&amp;#039;&amp;#039; be a [[Banach space]] and &amp;#039;&amp;#039;Y&amp;#039;&amp;#039; be a [[normed vector space]]. Suppose that &amp;#039;&amp;#039;F&amp;#039;&amp;#039; is a collection of continuous linear operators from &amp;#039;&amp;#039;X&amp;#039;&amp;#039; to &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;. If for all &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;X&amp;#039;&amp;#039; one has&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\sup\nolimits_{T \in F} \|T(x)\|_Y  &amp;lt; \infty, &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
then &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\sup\nolimits_{T \in F} \|T\|_{B(X,Y)}  &amp;lt; \infty.&amp;lt;/math&amp;gt;&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The completeness of &amp;#039;&amp;#039;X&amp;#039;&amp;#039; enables the following short proof, using the [[Baire category theorem]].&amp;lt;br &amp;gt;&amp;lt;br &amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Proof.&amp;#039;&amp;#039;&amp;#039; Suppose that for every &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in the Banach space &amp;#039;&amp;#039;X&amp;#039;&amp;#039;, one has: &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\sup\nolimits_{T \in F} \|T (x)\|_Y  &amp;lt; \infty.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
For every integer &amp;#039;&amp;#039;n&amp;#039;&amp;#039; in &amp;#039;&amp;#039;&amp;#039;N&amp;#039;&amp;#039;&amp;#039;, let &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; X_n = \left  \{x \in X \ : \ \sup\nolimits_{T \in F} \|T (x)\|_Y \le n \right \}. &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
The set &amp;lt;math&amp;gt;X_n&amp;lt;/math&amp;gt; is a [[closed set]] and by the assumption, &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\bigcup\nolimits_{n \in \mathbf{N}} X_n = X \neq \varnothing.&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
By the [[Baire category theorem]] for the non-empty [[complete metric space]]&amp;amp;nbsp;&amp;#039;&amp;#039;X&amp;#039;&amp;#039;, there exists &amp;#039;&amp;#039;m&amp;#039;&amp;#039; such that &lt;br /&gt;
&amp;lt;math&amp;gt; X_m&amp;lt;/math&amp;gt; has non-empty [[Interior (topology)|interior]], &amp;#039;&amp;#039;i.e.&amp;#039;&amp;#039;, there exist &amp;lt;math&amp;gt;x_0 \in X_m&amp;lt;/math&amp;gt; and {{nowrap|ε &amp;amp;gt; 0}} such that &lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \overline{B_\varepsilon (x_0)} := \{x \in X \,:\, \|x - x_0\| \le \varepsilon \} \subseteq  X_m.&amp;lt;/math&amp;gt; &lt;br /&gt;
&lt;br /&gt;
Let &amp;#039;&amp;#039;u&amp;#039;&amp;#039; ∈ &amp;#039;&amp;#039;X&amp;#039;&amp;#039; with {{nowrap|ǁ&amp;#039;&amp;#039;u&amp;#039;&amp;#039;ǁ &amp;amp;le; 1}} and {{nowrap|&amp;#039;&amp;#039;T&amp;#039;&amp;#039; ∈ &amp;#039;&amp;#039;F&amp;#039;&amp;#039;}}.  One has that:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\begin{align}&lt;br /&gt;
\|T(u) \|_Y &amp;amp;= \varepsilon^{-1} \left \|T \left( x_0 + \varepsilon u \right) - T(x_0) \right \|_Y    &amp;amp; [\text{by linearity of } T ] \\&lt;br /&gt;
&amp;amp;\leq \varepsilon^{-1} \left ( \left\| T (x_0 + \varepsilon u) \right\|_Y + \left\| T (x_0) \right\|_Y \right ) \\&lt;br /&gt;
&amp;amp;\leq \varepsilon^{-1} (m + m).   &amp;amp; [ \text{since} \ x_0 + \varepsilon u, \ x_0 \in X_m ] \\&lt;br /&gt;
\end{align}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Taking the supremum over &amp;#039;&amp;#039;u&amp;#039;&amp;#039; in the unit ball of&amp;amp;nbsp;&amp;#039;&amp;#039;X&amp;#039;&amp;#039;, it follows that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \sup\nolimits_{T \in F} \|T\|_{B(X,Y)}  \leq 2 \varepsilon^{-1} m &amp;lt; \infty.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Corollaries==&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Corollary.&amp;#039;&amp;#039;&amp;#039; If a sequence of bounded operators (&amp;#039;&amp;#039;T&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;) converges pointwise, that is, the limit of {&amp;#039;&amp;#039;T&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;)} exists for all &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;X&amp;#039;&amp;#039;, then these pointwise limits define a bounded operator &amp;#039;&amp;#039;T&amp;#039;&amp;#039;.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Note it is not claimed above that &amp;#039;&amp;#039;T&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; converges to &amp;#039;&amp;#039;T&amp;#039;&amp;#039; in operator norm, i.e. uniformly on bounded sets. (However, since {&amp;#039;&amp;#039;T&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;} is bounded in operator norm, and the limit operator &amp;#039;&amp;#039;T&amp;#039;&amp;#039; is continuous, a standard [[3-epsilon estimate|&amp;quot;3-ε&amp;quot; estimate]] shows that &amp;#039;&amp;#039;T&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; converges to &amp;#039;&amp;#039;T&amp;#039;&amp;#039; uniformly on &amp;#039;&amp;#039;compact&amp;#039;&amp;#039; sets.)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Corollary.&amp;#039;&amp;#039;&amp;#039; Any weakly bounded subset S in a normed space Y is bounded&amp;#039;&amp;#039;&amp;lt;/blockquote&amp;gt; &lt;br /&gt;
&lt;br /&gt;
Indeed, the elements of &amp;#039;&amp;#039;S&amp;#039;&amp;#039; define a pointwise bounded family of continuous linear forms on the Banach space &amp;#039;&amp;#039;X&amp;#039;&amp;#039;&amp;amp;nbsp;=&amp;amp;nbsp;&amp;#039;&amp;#039;Y*&amp;#039;&amp;#039;, continuous dual of &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;.  By the uniform boundedness principle, the norms of elements of &amp;#039;&amp;#039;S&amp;#039;&amp;#039;, as functionals on &amp;#039;&amp;#039;X&amp;#039;&amp;#039;, that is, norms in the second dual &amp;#039;&amp;#039;Y**&amp;#039;&amp;#039;, are bounded.  But for every &amp;#039;&amp;#039;s&amp;#039;&amp;#039; in &amp;#039;&amp;#039;S&amp;#039;&amp;#039;, the norm in the second dual coincides with the norm in &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;, by a consequence of the [[Hahn–Banach theorem]].&lt;br /&gt;
&lt;br /&gt;
Let &amp;#039;&amp;#039;L&amp;#039;&amp;#039;(&amp;#039;&amp;#039;X&amp;#039;&amp;#039;,&amp;amp;nbsp;&amp;#039;&amp;#039;Y&amp;#039;&amp;#039;) denote the continuous operators from &amp;#039;&amp;#039;X&amp;#039;&amp;#039; to &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;, with the operator norm. If the collection &amp;#039;&amp;#039;F&amp;#039;&amp;#039; is unbounded in &amp;#039;&amp;#039;L&amp;#039;&amp;#039;(&amp;#039;&amp;#039;X&amp;#039;&amp;#039;,&amp;amp;nbsp;&amp;#039;&amp;#039;Y&amp;#039;&amp;#039;), then by the uniform boundedness principle, we have:&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; R = \left \{ x \in X  \ : \ \sup\nolimits_{T \in F} \|Tx\|_Y = \infty \right \} \neq \varnothing&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In fact, &amp;#039;&amp;#039;R&amp;#039;&amp;#039; is dense in &amp;#039;&amp;#039;X&amp;#039;&amp;#039;. The complement of &amp;#039;&amp;#039;R&amp;#039;&amp;#039; in &amp;#039;&amp;#039;X&amp;#039;&amp;#039; is the countable union of closed sets &amp;amp;cup;&amp;#039;&amp;#039;X&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;. By the argument used in proving the theorem, each &amp;#039;&amp;#039;X&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; is [[nowhere dense]], i.e. the subset &amp;amp;cup;&amp;#039;&amp;#039;X&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; is &amp;#039;&amp;#039;of first category&amp;#039;&amp;#039;. Therefore &amp;#039;&amp;#039;R&amp;#039;&amp;#039; is the complement of a subset of first category in a  Baire space. By definition of a Baire space, such sets (called &amp;#039;&amp;#039;residual sets&amp;#039;&amp;#039;) are dense. Such reasoning leads to the &amp;#039;&amp;#039;&amp;#039;principle of condensation of singularities&amp;#039;&amp;#039;&amp;#039;, which can be formulated as follows:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Theorem.&amp;#039;&amp;#039;&amp;#039; Let &amp;#039;&amp;#039;X&amp;#039;&amp;#039; be a Banach space, {&amp;#039;&amp;#039;Y&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;} a sequence of normed vector spaces, and &amp;#039;&amp;#039;F&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; a unbounded family in &amp;#039;&amp;#039;L&amp;#039;&amp;#039;(&amp;#039;&amp;#039;X&amp;#039;&amp;#039;, &amp;#039;&amp;#039;Y&amp;lt;sub&amp;gt;n&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;). Then the set&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; R = \left \{ x \in X \ : \ \forall n \in \mathbf{N} : \sup\nolimits_{T \in F_n} \|Tx\|_Y = \infty \right \}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is dense in &amp;#039;&amp;#039;X&amp;#039;&amp;#039;.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Proof.&amp;#039;&amp;#039;&amp;#039; The complement of &amp;#039;&amp;#039;R&amp;#039;&amp;#039; is the countable union&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\bigcup\nolimits_{n,m} \left \{ x \in X \ : \ \sup\nolimits_{T \in F_n} \|Tx\|_Y \le m \right \}&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
of sets of first category. Therefore its residual set &amp;#039;&amp;#039;R&amp;#039;&amp;#039; is dense.&lt;br /&gt;
&lt;br /&gt;
==Example: pointwise convergence of Fourier series==&lt;br /&gt;
Let &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; be the [[circle group|circle]], and let &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;) be the Banach space of continuous functions on &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;, with the [[uniform norm]]. Using the uniform boundedness principle, one can show that the Fourier series, &amp;quot;typically&amp;quot;, does not converge pointwise for elements in &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;). &lt;br /&gt;
&lt;br /&gt;
For &amp;#039;&amp;#039;f&amp;#039;&amp;#039; in &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;), its [[Fourier series]] is defined by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\sum_{k \in \mathbf{Z}} \hat{f}(k) e^{ikx} = \sum_{k \in \mathbf{Z}}\frac{1}{2\pi} \left (\int_0 ^{2 \pi} f(t) e^{-ikt} dt \right) e^{ikx},&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
and the &amp;#039;&amp;#039;N&amp;#039;&amp;#039;-th symmetric partial sum is&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; S_N(f)(x) = \sum_{k=-N}^N \hat{f}(k) e^{ikx} =  \frac{1}{2 \pi} \int_0 ^{2 \pi} f(t) D_N(x - t) \, dt,&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
where &amp;#039;&amp;#039;D&amp;lt;sub&amp;gt;N&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; is the &amp;#039;&amp;#039;N&amp;#039;&amp;#039;-th [[Dirichlet kernel]]. Fix &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; and consider the convergence of {&amp;#039;&amp;#039;S&amp;lt;sub&amp;gt;N&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;(&amp;#039;&amp;#039;f&amp;#039;&amp;#039;)(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;)}.  The functional φ&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;N,x&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; : &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;)&amp;amp;nbsp;→ &amp;#039;&amp;#039;&amp;#039;C&amp;#039;&amp;#039;&amp;#039; defined by&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\varphi_{N, x} (f) =  S_N(f)(x), \qquad f \in C(\mathbf{T}),&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
is bounded.  The norm of φ&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;N,x&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;, in the dual of &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;), is the norm of the signed measure (2π)&amp;lt;sup&amp;gt;−1&amp;lt;/sup&amp;gt;&amp;#039;&amp;#039;D&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;N&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;−&amp;#039;&amp;#039;t&amp;#039;&amp;#039;)&amp;amp;nbsp;d&amp;#039;&amp;#039;t&amp;#039;&amp;#039;, namely&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt; \left \| \varphi_{N,x} \right \| =  \frac{1}{2 \pi} \int_0 ^{2 \pi} \left | D_N(x-t) \right  | \, dt =  \frac{1}{2 \pi} \int_0 ^{2 \pi} \left | D_N(s) \right  | \, ds = \left \|  D_N \right \|_{L^1(\mathbf{T})}.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
One can verify that&lt;br /&gt;
&lt;br /&gt;
:&amp;lt;math&amp;gt;\frac{1}{2 \pi} \int_0 ^{2 \pi} | D_N(t) | \, dt \ge \int_0^\pi \frac{\left |\sin\left ( (N+\tfrac{1}{2})t \right )\right|} t \, dt \to \infty.&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
So the collection {φ&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;N,x&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt;} is unbounded in &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;)*, the dual of &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;). Therefore by the uniform boundedness principle, for any &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;, the set of continuous functions whose Fourier series diverges at &amp;#039;&amp;#039;x&amp;#039;&amp;#039; is dense in &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;).&lt;br /&gt;
&lt;br /&gt;
More can be concluded by applying the principle of condensation of singularities. Let {&amp;#039;&amp;#039;x&amp;lt;sub&amp;gt;m&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;} be a dense sequence in &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;. Define φ&amp;lt;sub&amp;gt;&amp;#039;&amp;#039;N,x&amp;lt;sub&amp;gt;m&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;&amp;lt;/sub&amp;gt; in the similar way as above. The principle of condensation of singularities then says that the set of continuous functions whose Fourier series diverges at each &amp;#039;&amp;#039;x&amp;lt;sub&amp;gt;m&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039; is dense in &amp;#039;&amp;#039;C&amp;#039;&amp;#039;(&amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;) (however, the Fourier series of a continuous function &amp;#039;&amp;#039;f&amp;#039;&amp;#039; converges to &amp;#039;&amp;#039;f&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;) for almost every &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;, by [[Carleson&amp;#039;s theorem]]).&lt;br /&gt;
&lt;br /&gt;
== Generalizations ==&lt;br /&gt;
The least restrictive setting for the uniform boundedness principle is a [[barrelled space]] where the following generalized version of the theorem holds {{harv|Bourbaki|1987|loc=Theorem III.2.1}}:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Theorem.&amp;#039;&amp;#039;&amp;#039; Given a barrelled space &amp;#039;&amp;#039;X&amp;#039;&amp;#039; and a [[locally convex space]] &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;, then any family of pointwise bounded [[continuous linear mapping]]s from &amp;#039;&amp;#039;X&amp;#039;&amp;#039; to &amp;#039;&amp;#039;Y&amp;#039;&amp;#039; is [[equicontinuous]] (even [[uniformly equicontinuous]]).&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Alternatively, the statement also holds whenever &amp;#039;&amp;#039;X&amp;#039;&amp;#039; is a [[Baire space]] and &amp;#039;&amp;#039;Y&amp;#039;&amp;#039; is a locally convex space {{harv|Shtern|2001}}.&lt;br /&gt;
&lt;br /&gt;
{{harvtxt|Dieudonné|1970}} proves a weaker form of this theorem with [[Fréchet space]]s rather than the usual Banach spaces.  Specifically,&lt;br /&gt;
&lt;br /&gt;
&amp;lt;blockquote&amp;gt;&amp;#039;&amp;#039;&amp;#039;Theorem.&amp;#039;&amp;#039;&amp;#039; Let &amp;#039;&amp;#039;X&amp;#039;&amp;#039; be a Fréchet space, &amp;#039;&amp;#039;Y&amp;#039;&amp;#039; a normed space, and &amp;#039;&amp;#039;H&amp;#039;&amp;#039; a set of continuous linear mappings of &amp;#039;&amp;#039;X&amp;#039;&amp;#039; into &amp;#039;&amp;#039;Y&amp;#039;&amp;#039;.  If for every &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;X&amp;#039;&amp;#039;&lt;br /&gt;
:&amp;lt;math&amp;gt;\sup\nolimits_{u\in H}\|u(x)\|&amp;lt;\infty,&amp;lt;/math&amp;gt; &lt;br /&gt;
then the family &amp;#039;&amp;#039;H&amp;#039;&amp;#039; is equicontinuous.&amp;lt;/blockquote&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Barrelled space]], a [[topological vector space]] with minimum requirements for the Banach Steinhaus theorem to hold&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
*{{citation|first1=Stefan|last1=Banach|authorlink1=Stefan Banach|first2=Hugo|last2=Steinhaus|authorlink2=Hugo Steinhaus| url=http://matwbn.icm.edu.pl/ksiazki/fm/fm9/fm918.pdf |title=Sur le principe de la condensation de singularités|journal=[[Fundamenta Mathematicae]]| volume=9| pages=50–61|year=1927}}. {{fr}}&lt;br /&gt;
*{{citation|first=Nicolas|last=Bourbaki|authorlink=Nicolas Bourbaki|series=Elements of mathematics|title=Topological vector spaces|publisher=Springer|year=1987|isbn=978-3-540-42338-6}}&lt;br /&gt;
*{{citation|first=Jean|last=Dieudonné|authorlink=Jean Dieudonné|title=Treatise on analysis, Volume 2|year=1970|publisher=Academic Press}}.&lt;br /&gt;
*{{citation|first=Walter|last=Rudin|authorlink=Walter Rudin|title=Real and complex analysis|publisher=McGraw-Hill|year=1966}}.&lt;br /&gt;
*{{springer|Banach–Steinhaus theorem|first=A.I.|last=Shtern|year=2001|id=b/b015200}}.&lt;br /&gt;
&lt;br /&gt;
[[Category:Functional analysis]]&lt;br /&gt;
[[Category:Articles containing proofs]]&lt;br /&gt;
[[Category:Mathematical principles]]&lt;br /&gt;
[[Category:Theorems in functional analysis]]&lt;/div&gt;</summary>
		<author><name>en&gt;D.Lazard</name></author>
	</entry>
</feed>