Complete multiplicativity and give, for ,
The product is nonzero there; its absolutely convergent logarithm has terms . Thus
Each numerator is one of , so it is nonnegative. Exponentiation gives the required lower bound one.
If with , its assumed holomorphy makes , or smaller for a higher-order zero. The zeta factor at real grows at most as , while the zeta factor near stays bounded. The product tends to zero, a contradiction. Hence
The double-angle formula gives
For , the logarithm of the absolutely convergent Euler product gives
Exponentiation proves
Suppose for , of order . As , its middle factor is , the first is because the pole at one is simple, and the final factor is bounded because . The product is , contradicting the lower bound one. Therefore
This is the three-four-one zero-free-region argument specialized to the line with real part one.
The Möbius function satisfies for and is zero for . Therefore
The inverse local factor is . Consequently the inverse under Dirichlet convolution is the Liouville function
where counts prime factors with multiplicity. Both functions are multiplicative functions. At with , their convolution is , while its value at one is one. Multiplicativity then proves on every positive integer. Its Dirichlet series is for .
For a finite set of primes , multiply the absolutely convergent local series. Unique prime factorization and multiplicativity, with , give
The omitted integers all exceed , so the absolute difference from is at most , which tends to zero. Hence the finite products converge to :
This proves the Euler product directly from absolute convergence, rather than treating an infinite formal multiplication as automatically valid.
The Dirichlet convolution is . Fix with . Absolute convergence of the two Dirichlet series gives
Thus the double series may be regrouped by , proving
The same estimate proves absolute convergence of the resulting Dirichlet series.
The lower bound in (ii) makes the image of closed: if converges, the bound makes Cauchy; completeness gives its limit and hence a image preimage. The same bound applies to by (iii), so its kernel is zero. The orthogonal complement identity
shows that the image is dense, using the orthogonal decomposition by a closed subspace for its closure. Being both closed and dense, it equals . Thus is onto and bounded below, and by part 3(a)(iii) it has a bounded inverse. Moreover
A separate expansion gives
Hence . In particular is injective and bounded below by one.
Expanding both squared norms gives
Both norms are nonnegative, so taking square roots proves .
Put . For any and any real , minimality gives
The derivative at zero must vanish, so . In a complex Hilbert space, apply the same argument to to get the imaginary part zero as well. In the real case the first conclusion is already enough. Hence
Let and choose with . The parallelogram law gives
The right side tends to zero. Thus is Cauchy. The closed subspace of a Hilbert space is complete, so . Continuity of the norm gives , proving the distance is attained.
Evaluation at zero is a bounded linear functional for the uniform norm. Define
It is linear and satisfies . Since ,
The factor is required by the source's basis normalization.
Since every is nonzero, boundedness gives
Cancel its norm to obtain . Thus the multiplier sequence is bounded.
The normalization gives
Thus has exactly the coefficients prescribed for . Uniqueness yields
These are eigenvectors, including the zero-eigenvalue cases.
For each fixed , the coefficient functional is bounded since
Suppose and uniformly. Taking coefficients and passing to the limit gives
for every fixed . No uniform bound on is needed for this passage. Uniqueness gives , so has a closed graph. The space is Banach, being the closed subspace defined by inside the continuous functions with the uniform norm. The closed graph theorem therefore proves is bounded.
For scalars and , linearity of the Fourier coefficients gives
The assumed uniqueness of the function with these coefficients implies . Thus is linear.
The factorization
has commuting factors because both are polynomials in . If , their product is invertible. The preceding part would then make invertible, contradicting . Therefore
This proves the required inclusion without assuming the full spectral mapping theorem.
If has a bounded inverse, it is onto and , giving the claimed lower bound. Conversely a positive lower bound makes injective. Together with surjectivity it gives an everywhere-defined linear inverse with norm at most . Hence it is bounded, proving the equivalence.
If are individually invertible, their product has inverse . Conversely assume and put , with invertible. Both factors commute with and therefore with . Direct multiplication gives
These are bounded two-sided inverses, so an invertible commuting product has both factors invertible. The commutation assumption is used when verifying the second side of each inverse.
The bounded operators on a Banach space form a Banach algebra in the operator norm. If , the Neumann series converges absolutely in that norm. Its partial sums satisfy
Taking limits proves .
If , factor and apply the same argument. Thus such are in the resolvent set and
For a bounded linear operator on a complex Banach space, its spectrum is
The complement is the resolvent set. For a real space, one may use its complexification when speaking of the complex spectrum; the algebraic arguments below apply over the underlying scalar field as well.

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