The rank is and the nullity is . Extending a basis of the kernel to a basis of , the images of the added vectors form a basis of the image, proving the rank-nullity theorem
Since , the upper sum bound follows. Applying it to and interchanging gives the lower bound. For products, the image lies in and is the image under of , giving the upper bound; rank-nullity on that restriction gives
All four bounds are sharp. In a fixed basis, nested diagonal projections attain the product upper bound; placing with the smallest possible intersection with attains its lower bound. Taking on a subspace of dimension attains the sum lower bound, while choosing the two images in general position and avoiding cancellation attains the sum upper bound.
Both upper bounds need not be attainable simultaneously over every field. Over with and both ranks one, necessarily . Then but , below its upper bound one.
If such an existed, boundedness would make its isolated singularity at zero removable. Let be the holomorphic extension to the disc. Continuity gives . Equality at either endpoint contradicts the minimum-modulus principle applied to or the maximum modulus principle, since is nonconstant. Hence . Surjectivity of supplies some nonzero with , contradicting injectivity of the extension. Therefore
The closure is the intersection of all closed subsets containing ; equivalently, every neighbourhood of a point of meets . The subspace is dense when . A space is Hausdorff when distinct points have disjoint neighbourhoods.
For Hausdorff , the diagonal is closed in . Thus
is closed. Since it contains the dense set , it equals .
The conclusion fails without Hausdorffness. Let have the Sierpinski space topology and let , which is dense. The identity map and the constant map with value are continuous and agree on , but differ at .

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