Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
For a two-periodic function with an absolutely convergent Fourier series, use samples , . WriteDiscrete averaging of each Fourier mode givesThis grid works for both odd and even positive ; no half-integer summation endpoints are needed. If , , a geometric series bounds . The sign convention here is exact integral minus quadrature, whereas the normalized-average convention in periodic trapezoidal Fourier aliasing uses approximation minus exact average.
The Peano kernel of a linear error functional that annihilates all polynomials of degree at most isIt represents the error by integrating against the st derivative.
A cycle is a closed path: its final vertex is joined back to its initial vertex, and no other vertex is repeated.
A closed walk can revisit other vertices and need not contain a simple cycle with every property of the whole closed walk, such as using both of two edge colours.
The second uncountable ordinal is the least ordinal whose cardinal number is strictly larger than that of the first uncountable ordinal . Equivalently, it is the initial ordinal of the successor cardinal .
Let be a bounded linear operator on a Banach space, and let be the open unit ball. If , then . Scale the density statement and correct a target by a geometrically decreasing sequence of approximate preimages. Completeness makes their sum converge inside , and continuity of makes its image equal the target.
Every finite-dimensional vector space subspace of a normed vector space is closed. Coordinates in a finite basis identify it homeomorphically with a finite-dimensional scalar space; it is therefore complete, and every complete subspace of a metric space is closed.
For in a finite abelian group and normalized Fourier transform , the normalized number of sextuples satisfyingisThis follows by inserting orthogonality of complex exponentials for the displayed equation: the three variables on one side contribute and those on the other side contribute its complex conjugate.
If has finite index in a finitely generated group , then Schreier's lemma givesEquality holds when is a free group of finite rank.
If has finite index in the free group , thenIndeed, the -sheeted covering graph of the rose with petals has vertices and edges, so its fundamental group has rank .
If parity is conserved when a particle of intrinsic parity decays into two particles of intrinsic parities , then their relative partial wave obeys
An orientation of a finite-dimensional real vector space distinguishes its ordered bases into two classes according to the sign of their change-of-basis determinant.
Consider the uniform solid of revolution about the -axis whose boundary isFor total mass , the center of mass lies a distance from the pointed origin, and the principal moments about that origin are
For a subset of a left module over a ring , its left annihilator isIt is a left ideal. If is a submodule, it is a two-sided ideal, because for every and . In particular the annihilator of a module measures which scalars are invisible to the entire action; a faithful module has zero annihilator.
For the integer module , its annihilator is . For a single vector in a noncommutative module, its annihilator need only be a left ideal. The right annihilator instead records elements killed by multiplication from the other side.
The radical of a module is the intersection of its maximal submodules. For a finite-dimensional module over a finite-dimensional algebra ,and it is the smallest submodule for which is a semisimple module.
A module is uniserial when its submodules are totally ordered by inclusion. A finite-length uniserial module has a unique composition series.
The Krull–Schmidt theorem says that a finite-length module decomposes as a finite direct sum of indecomposable modules, uniquely up to permutation and isomorphism of the summands.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





