The graph is closed if it is a closed subset of . Equivalently, and imply .
The closed graph theorem states that an everywhere-defined linear map between Banach spaces is bounded if and only if its graph is closed. Completeness of both spaces is part of the theorem. A bounded map has a closed graph by continuity.
Conversely, if the graph is closed, it is a Banach space in the product norm . The coordinate projection , , is a bounded linear bijection. The open mapping theorem makes bounded. The other coordinate projection is bounded, and is therefore bounded. This proves the theorem from the permitted result.
Linearity and show that the integral defines a bounded linear operator. Inductively,
For this is immediate. If it holds for , then gives , which proves the next case. Thus .
For every , the series converges in operator norm, dominated by . Multiplying its partial sums by on either side gives the identity minus a remainder , which tends to zero by the factorial estimate. Therefore is the bounded inverse of .
Finally every function in the image of vanishes at zero, so is not onto the continuous functions. Hence belongs to its spectrum and
Let . If , part (a) provides a nonzero bounded functional annihilating ; normalize it to have norm one. Density of the sequence in the dual unit ball gives an index with . Since and ,
But the hypothesis and reverse triangle inequality give
a contradiction. Therefore the span is dense.
If is separable, its unit ball has a countable dense set. For each nonzero , the definition of its norm permits choosing in the unit ball with ; choose zero for a zero functional. The preceding result gives a dense countable span over , or over in the complex case. Thus is separable.
The converse fails: is separable, since finite rational-coordinate sequences are dense, but is not separable. The dual identification sends a bounded sequence to , isometrically; conversely a bounded functional is determined by its values on the coordinate vectors and hence has this form by truncation. The uncountable family of zero-one sequences in has pairwise distance one, which no countable dense set can approximate within a radius smaller than .
For the centered ball, the Hahn-Banach theorem supplies a norm-one real functional with . Hence on the ball, and any separates it strictly from .
For the general center, apply the same construction to : choose and . Then
For example,
gives for every . The strict gap uses exactly the assumption that lies outside the closed ball.
Put . If , the zero functional works. If , then , and on define
The representation is unique, so this is linear. For ,
and the bound also holds for . Thus . The Hahn-Banach theorem extends it to with the same bound, proving
No closedness assumption on was required; distance is unchanged on taking its closure.
The series converges in when its partial sums converge in norm to an element of . It is absolutely convergent when .
If is complete, then
for an absolutely convergent series. Its partial sums are Cauchy and therefore converge.
Conversely suppose every absolutely convergent series converges. Given a Cauchy sequence , choose a subsequence with . The series
is absolutely convergent. Its partial sums are precisely the subsequence, which therefore converges to some . A Cauchy sequence with a convergent subsequence converges to that same limit: estimate by . Hence

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact