A capacitor consists of two conductors carrying equal and opposite charges. Its capacitance is
where is the magnitude of the charge on either conductor and is their potential difference.
For , a coaxial Gaussian cylinder of length encloses charge . Gauss's law gives
Taking to mean the inner potential minus the outer potential,
Since ,
The field energy is
These are the standard coaxial cylindrical capacitor formulas.
The function is odd, so only sine coefficients occur. For ,
Integration by parts gives
and
The terms of order cancel, leaving
Thus
The Parseval identity gives
Direct integration yields
Therefore
as recorded in the Fourier series of x cubed minus pi squared x.
Suppose first that is connected and is continuous. Its image is connected by the continuous image of a connected space, but is discrete, so its only connected nonempty subsets are singletons. Hence is constant.
Conversely, if is a disconnection into nonempty disjoint open sets, the function equal to zero on and one on is continuous and nonconstant. This proves the integer-valued function criterion for connectedness.
Now let be continuous under the hypotheses on the family . Each restriction is constant because is connected. If , a point of shows that their two constants agree. Since the sets cover , is constant on , and the criterion proves that is connected. This is the pairwise-intersecting connected cover argument.
Finally, fix . For each , the set
is connected: its two connected pieces meet at . The sets cover and any two share . The preceding result proves that is connected, giving the product of connected spaces result.
For
the parity condition is preserved by componentwise addition, negation, and multiplication, and is the identity. Thus is a ring.
It is not an integral domain, since and are nonzero elements of whose product is zero. It is also not a product of two nontrivial rings. Indeed, an idempotent in has each coordinate in , and the parity condition leaves only and . The proved equivalence then excludes a nontrivial product decomposition.

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