Equip the continuous dual space with the operator norm
Continuity of a linear functional makes this finite; homogeneity, definiteness and the triangle inequality follow directly from the supremum formula.
For completeness of the dual space, let be Cauchy in this norm. For each , , so is Cauchy in . Define . Passing to the limit in the linearity identities makes linear. Since a Cauchy sequence is bounded, and , so .
Given , choose with for . Let pointwise; then and therefore . Thus is a Banach space. This proof in fact works even if itself is not complete.
For the first linear map, take . Its input norm is one, while has norm . Thus is unbounded.
For the second map, since ,
Equality holds at , so
Both formulas map into itself because adding two finitely supported sequences preserves finite support.
Let be the set of finitely supported sequences with rational coordinates. It is countable: it is the union over of copies of . Given and , choose with . Choose rational numbers for so that , and put thereafter. Then and . Thus is countable and dense, so the space is separable.
Define by . This is a linear bijection, with inverse , and
Thus is an isometric isomorphism of normed spaces onto the absolutely summable sequence space, which is a Banach space. Explicitly, a Cauchy sequence maps to a Cauchy sequence ; setting gives convergence in the weighted norm. Hence is a Banach space, an instance of weighted summable sequence space isometry.
For and real scalars , the scalar triangle inequality gives
The zero sequence belongs to the space, so it is a real vector space. The weighted sum is nonnegative and homogeneous, and the same inequality with proves its triangle inequality. Since every weight is strictly positive, zero weighted sum forces every coordinate to vanish. Therefore is a norm.
Since , the fundamental theorem of calculus gives , with the same oriented integral on the negative half-interval. Set . The adjoint calculation gives the real-valued function
Choose any value at zero. This function is bounded and hence belongs to . Since it is real, the adjoint operator identity yields
One can also check this by integration by parts separately on each half-interval: , , and the two possible jump terms at zero vanish because .
For the adjoint of an integration operator anchored at zero, use the inner product . On the positive half-interval, reversing the triangular integration order gives
On the negative half-interval the corresponding calculation gives
These exchanges are justified by the Fubini theorem, since on a finite interval functions belong to and the absolute double integral is at most . Therefore
Adding gives on the positive half and on the negative half, exactly the prescribed . Values at zero do not matter in . Consequently
The Hilbert projection theorem states that every vector has a unique decomposition relative to a closed linear subspace , with and . The vector is the unique nearest point in .
The Riesz representation theorem states that every bounded complex-linear functional on a Hilbert space has a unique representation , with , using the convention of linearity in the first argument. If , use . Otherwise is closed. Project a vector outside to obtain with , and rescale it so . Then , so
This gives the representation. Uniqueness follows because a vector orthogonal to every is zero. The Cauchy-Schwarz inequality gives , and evaluation at gives equality when .
For the adjoint, fix . The functional is bounded with norm at most . By the Riesz representation theorem, there is a unique vector satisfying
For scalars , conjugate-linearity in the second argument shows that , by uniqueness of the representing vector. The same norm estimate gives . Thus is a unique bounded linear operator, the adjoint operator.
Expand both generating functions and use orthogonality of the Legendre polynomials, with . The allowed exchanges give
Hence it depends only on . Explicitly,
The series form alone already proves the required dependence.
The generating function gives , so the odd function is orthogonal to every even-degree Legendre polynomial. For , integrate the self-adjoint form of the Legendre differential equation from zero to one:
Thus . Differentiating the generating function in and then setting gives
Combining these identities with the normalization of yields
For the Legendre expansion of the sign function, , so the Parseval identity gives
Therefore the requested sum equals
A complete orthonormal sequence has and dense linear span; equivalently, the only vector orthogonal to every is zero. The Parseval identity says , with expansion in the Hilbert norm.
Put and . Direct differentiation gives
Substitution yields . Extracting the coefficient of in the generating function gives
the Legendre differential equation.
The weighted right shift is injective, so zero is not an eigenvalue. If with , the first coordinate forces and subsequent coordinates force every . Thus its point spectrum is empty.
For ,
since the largest column sum is attained at . Therefore the spectral radius formula gives . The limit follows, for example, from for large . Zero is in the spectrum because the output first coordinate is always zero, so is not onto. Hence
This is a nonzero quasinilpotent element, specifically the factorial weighted right shift.
For the diagonal operator , the equation gives for every . Thus a nonzero eigenvector exists exactly for , with eigenvector ; zero is not an eigenvalue because all diagonal entries are nonzero.
If lies outside , its distance from this closed set is positive. Dividing each coordinate by gives a bounded inverse of . Zero lies in the spectrum: , excluding a bounded inverse. Therefore
First give the general definitions and radius facts. The spectrum of a bounded operator is , and the point spectrum is . If , the Neumann series inverts , hence also . Thus is contained in the closed disc of radius and is bounded.
The spectral radius is . The spectral radius formula is
For the left shift , an eigenvector satisfies , so . A nonzero such sequence is in exactly when . Since , its spectrum is contained in the closed unit disc. It contains the open unit disc as point spectrum and therefore its closure by closedness of the spectrum. Hence
For , truncation makes the tail arbitrarily small, since converges. Approximate the finite remaining coordinates by numbers in . The resulting countable set of finitely supported sequences is dense. Therefore
The same construction also works for , though that endpoint is not needed here.
Map each bounded sequence to the continuous function that takes value at the integer and is affine on every interval . Convexity of absolute value gives , and evaluation at integers gives equality of suprema. Thus is an isometric embedding of the l-infinity sequence space into .
The former is not separable by the allowed fact. If the latter were separable, the subspace result just proved would make its isometric copy of separable, a contradiction. Hence
A normed vector space is a real or complex vector space with a norm satisfying positivity, definiteness, absolute homogeneity and the triangle inequality. It is separable if it has a countable dense subset for the norm distance.
First prove the unlabelled general assertions. If is dense in , choose whenever that intersection is nonempty. These choices form a countable subset of . For any and , choose with and with . The corresponding intersection is nonempty and . Thus every subspace of a separable normed vector space is separable.
If a countable has dense linear span, take all finite linear combinations of its elements with rational coefficients in the real case, or coefficients in in the complex case. This set is countable and dense in the linear span, by approximating the finitely many coefficients of each combination. Its closure is therefore , proving separability. Conversely, a countable dense set already has dense linear span.
For , use all finitely supported sequences with coordinates in . Truncate a sequence tending to zero to control its supremum tail, then approximate the finite initial coordinates. This produces a countable dense subset, so
Define . Interchanging the integrals and substituting variables gives
Moreover Cauchy-Schwarz in the inner integral gives
Taking the supremum over unit proves , so is bounded with norm at most , and the adjoint identity is justified.
It remains to ensure necessity is a condition on the kernel itself. If for some , convolve with a smooth compactly supported approximate identity . Since , all these convolutions vanish. But in , by continuity of translations in , so almost everywhere. Thus the map from kernels to convolution operators is injective. Applying this to yields the exact criterion
For real-valued kernels this reduces to evenness; real-valuedness by itself is insufficient.
Write with . Since is self-adjoint, is real. The cross term in the squared norm therefore vanishes:
This proves the equality and lower bound, and makes both and injective.
If converges, the lower bound shows is Cauchy. Completeness gives and boundedness gives , so the range is closed. Also , so the range is dense. Being both closed and dense, it equals . Hence is bijective, and its lower bound gives
Complete the square to obtain, initially for real ,
Compare coefficients of on the two sides. The left coefficient is , and the right is zero unless , in which case it is . The polynomials are real on the real line, so these are the complex inner products of the . Thus
Polynomial times Gaussian decay also directly shows each lies in .
Figure 1.
Normalized Hermite functions for orders zero through three
. Details.

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