A metric space is complete when every Cauchy sequence in it converges to a point of that space. A sequence is Cauchy when, for each , there is such that whenever . The requirement that the limit lie in the space distinguishes completeness from having limits only in a larger ambient space.
If is closed and converges to , then cannot lie in the open complement: an open ball about such an would eventually contain all while missing . Thus .
Conversely, suppose contains every limit of a sequence in . If , every ball meets ; choose in that intersection. Then , so . Hence , proving that a subset of a metric space is a closed set exactly when it is sequentially closed.
No such sequence exists. By Fatou's lemma on ,
But the proposed nonnegative measurable integrand is positive at every point of , so its integral cannot be zero. Explicitly, the sets where it is at least cover ; at least one has positive measure, forcing a positive integral. This contradicts the displayed bound.
For each integer , list the functions
in increasing , and concatenate the blocks in increasing . Each function has norm , so the resulting sequence has norm tending to zero. Every lies in exactly one interval of each block, where the function takes value . Therefore
This unbounded typewriter sequence with vanishing L1 norm is a moving-spike construction: the support shrinks fast enough to beat the increasing height.
Let be the vector subspace of integrable functions that vanish almost everywhere. The Lebesgue space is the quotient vector space : its elements are equivalence classes of functions equal almost everywhere. Addition and scalar multiplication are and .
Set . This is well-defined because replacing by an equal-almost-everywhere representative does not change the integral. It is nonnegative, homogeneous, and obeys the triangle inequality by . Part (i) says its only zero element is the zero class. Hence it is a norm on .
Exactly those integrable functions that vanish almost everywhere:
Thus this expression is a seminorm on actual functions, becoming a norm after the quotient in part (ii).
For each , let be the null set where . Their union is null. At any , the two sequences agree term by term, so their pointwise limits are equal: . Therefore . Taking the countable union first is essential: it produces one exceptional set outside which all equalities hold simultaneously.
The relation is reflexive because the exceptional set for is empty, and symmetric because the exceptional sets for and agree. If off a null set and off a null set , then off , which is null by part (b). Hence it is transitive as well, so equality almost everywhere is an equivalence relation.
For each , choose a countable interval cover of of total length below . The union of these covers is countable and covers , with total length less than . As is arbitrary, a countable union of null sets is null.
Given , cover by open intervals of total length less than , and cover similarly. Combining the two countable covers gives a cover of their union of total length less than . Thus is a null set.
A property holds almost everywhere when its exceptional set, where the property fails, is a null set. The exceptional set need not be empty or countable.
A null set has Lebesgue outer measure zero. Equivalently, for every it can be covered by countably many open intervals whose total length is less than . This definition also applies before assuming measurable; every such set is Lebesgue measurable with measure zero.
For distinct odd primes , the quadratic reciprocity law is
Thus the two symbols have opposite signs exactly when both primes are three modulo four; otherwise they agree. Distinctness excludes zero symbols.
The first supplementary law for quadratic reciprocity is
It also follows immediately from Euler's criterion applied to .
For an odd prime , the Legendre symbol is zero if , one if is a nonzero quadratic residue modulo , and minus one if it is a quadratic nonresidue. Thus
It depends only on the congruence class of modulo .
The symmetric group has subgroups of orders . There is one trivial subgroup, three conjugate subgroups generated by transpositions, one order-three subgroup , and the whole group. These are all subgroups by Lagrange's theorem. Thus again there is one conjugacy class for each index .
The coset action classification in part (c) supplies exactly one transitive orbit type of each of these sizes. The same orbit-multiplicity equation as in part (i) applies, giving
The equality of the two counts comes from their identical lists of transitive orbit types, rather than from the groups being isomorphic.
A cyclic group of order six has exactly one subgroup of each order , and no others. Since it is abelian, these are also its four conjugacy classes of subgroups. Thus there is one transitive group action of each size .
An action on six points is a disjoint union of its orbits. Its equivalence type is therefore determined by nonnegative integers satisfying
If there is one possibility. If , the possibilities allow respectively choices of , with then fixed. Hence
This is counting finite group actions by transitive orbit types. Equivalently, a generator acts as a permutation whose cycles have lengths dividing six, and these are its eight possible cycle types on six points.
The finite sum of truncated cubes is by part (b) and is cubic on each knot interval. For , every term vanishes. For , every truncated power equals its ordinary polynomial, so part (a) applied to gives
It is therefore zero on both exterior intervals. Its regularity makes the endpoint second derivatives zero too, proving naturality.
Evaluation at the five knots gives
For example the three interior values in units of are , , and . At the cancellation is .
For an explicit graph description is
It is symmetric about , increases from zero to its maximum four at the centre, and decreases symmetrically back to zero. It joins the zero tails with zero first and second derivatives.
Figure 1.
A compactly supported natural cubic spline with knot values zero, one, four, one, zero
. The original plot uses the truncated-power formula for h equal to one. The maximum is four at x equal to two; both tails and the first two endpoint derivatives are zero. 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