Use integral singular homology. The singular chain group is the free abelian group on continuous maps , and its boundary operator is
For , deleting vertex and then vertex has sign , while deleting and then the shifted vertex has sign . Both yield the same codimension-two face. Pairing these terms proves . The inclusion identifies with the subgroup spanned by those simplices having image in , so it is injective and preserved by .
The relative chain complex is with induced boundary . Thus there is a degreewise short exact sequence of chain complexes
Inclusion and quotient take homological cycles to homological cycles and boundaries to boundaries, hence define the group homomorphisms and on homology. We construct and prove exactness of the resulting sequence directly, rather than invoke an unproved algebraic lemma:
ending in .
For the relative homology connecting homomorphism, lift a relative cycle to . Since , the chain belongs to ; it is a homological cycle because . Define
Changing the lift by changes the boundary by , hence does not change its homology class. More generally, if a different relative cycle represents the same relative homology class, lifts satisfy for some and . Then . This proves independence both of the lift and of the homology representative. Lifting a sum by the sum of lifts proves additivity, so is a well-defined group homomorphism.
At , an element in the image of is represented by for some , so its image in is zero. Conversely, if a homological cycle in has , then for a -chain . Its quotient is a relative cycle and . Thus
For completeness, the other terms are exact by the same elementary chain argument. At , clearly . If a homological cycle in has zero relative class, then for a quotient chain . Lifting gives , and . Hence , proving . At , absolute homological cycles have zero connecting image. Conversely, if , then for some ; the chain is an absolute homological cycle and maps to . Therefore . In degree zero every quotient chain lifts to an absolute homological cycle, because the differential to degree is zero, so is surjective. These proofs establish the whole long exact sequence in relative homology and all the algebraic facts used in its construction.
A simply connected manifold is connected and orientable: its orientation character is a group homomorphism , and this group is trivial. Choose an orientation. The Hurewicz theorem in degree one gives . The universal coefficient theorem for cohomology then gives and
because the possible term is zero.
The homology groups are finitely generated for a closed manifold. The displayed dual group is therefore free abelian. Poincare duality identifies with , so itself has no torsion. Since the second Betti number is one, both groups are isomorphic to . This torsion argument is essential: rank one by itself would not rule out finite summands.
Again by Poincare duality, , and . Thus the only nonzero cohomology groups are in degrees .
Let generate . The integral intersection form
is unimodular. Indeed, cap product with is the Poincare duality isomorphism to , and the preceding universal-coefficient identification makes evaluation the full integral dual. Composing these isomorphisms identifies the pairing with an isomorphism . In rank one its matrix must therefore be or . Consequently , so generates .
All products in degrees above four vanish. Hence the assignment of the degree-two generator gives
which is the cohomology ring of complex projective space for . If the intersection form is negative, this ring isomorphism reverses the chosen top orientation generator; preserving that additional orientation is not part of the requested ring isomorphism.
We state the integer form of Freiman theorem for integer sets: for every there are finite constants such that every finite nonempty with doubling at most lies in a proper generalized arithmetic progression of rank at most and cardinality at most . An arbitrary abelian group requires the coset-progression version, allowing a subgroup factor. We prove the integer statement, with no claim of optimized constants.
We use the allowed Plünnecke inequality and basic Freiman isomorphism facts, and explicitly prove the modelling, Fourier and covering steps. Two geometry-of-numbers consequences are used as permitted: a cyclic rank- phase-radius- Bohr set contains a proper symmetric progression of rank at most and size at least times the cyclic group order; and a rank- integer progression with parameter-box volume can be contained in a proper progression of rank at most and size at most . These follow from successive minima and lattice basis reduction. All these constants depend only on the displayed rank and radius, not on the ambient order or step sizes.
First construct a dense cyclic model of a large subset. Put and . Plünnecke gives . Choose an auxiliary prime so large that every nonzero integer in stays nonzero modulo , and . Arbitrarily large primes exist: a purported finite list would miss a prime divisor of one plus their product. For a uniform nonzero multiplier , each nonzero has uniformly distributed among the nonzero residues. The forbidden residues are those represented by nonzero multiples of with absolute value less than ; there are at most of them. The union bound gives failure probability at most
Thus choose avoiding them for every nonzero .
Represent the dilated elements of in , divide this interval into nine consecutive subintervals, and retain a most-populated one. It defines with . If is the chosen representative of , eight-term sums of representatives from this subinterval have a range shorter than : eight times its width is less than . Consequently every original eight-term relation lifts from equality modulo to equality of the representative sums as integers.
Now reduce these representatives modulo . If their two eight-term sums agree modulo , their integer difference is a multiple of of absolute value below . A nonzero such difference would give a forbidden residue for some nonzero . If , its representative difference is already zero. Hence there are no new relations either. The map is therefore a Freiman s-isomorphism of order eight onto . It is injective, by padding shorter relations to eight terms with a fixed retained point. Its density satisfies
This proves the cyclic Freiman model of a small-doubling integer set needed below.
Next we prove the cyclic Bogolyubov lemma. Use normalized finite-group Fourier analysis on . The convolution
has Fourier expansion . Let consist of those characters whose Fourier coefficient has modulus at least . Parseval gives , and the fourth-power tail outside is at most . The zero character belongs to and contributes .
For the phase-distance Bohr set , every retained character has real part at least . Therefore
The support of this convolution is , so . Apply the stated progression in a Bohr set from successive minima consequence. It supplies a symmetric proper progression of rank bounded by a function of and size at least , hence at least after adjusting the constant.
Lift this progression back to the integers. The inverse Freiman map induces
Equality of two representations uses a four-term relation on each side, so is well defined and injective. If all lie in this difference set, the relation between their representations involves at most six original terms on either side. The order-eight model therefore gives and . Along every coordinate path within the symmetric progression box, all partial sums remain in . It follows that
Thus is a symmetric proper integer progression of the same rank and cardinality, and . This proves the Freiman lifting of a progression step, including why a sufficiently high-order model was selected.
It remains to cover all of , not merely its large modeled subset. Since , Plünnecke gives
Choose maximal such that the translates are pairwise disjoint. Their union lies in , so . For every , maximality makes meet some , giving . Consequently
This proves the needed Ruzsa covering lemma directly.
Write and . The set
contains and hence . Its rank is at most , bounded only by , and its parameter-box volume is at most . Also , so this volume is at most . The allowed integer properification consequence now contains in a proper progression of bounded rank and size at most . Therefore
This proves Freiman's theorem, using geometry of numbers only in the two explicitly stated places.
Write and . A convenient form of the quadratic Weyl inequality is the following: if , and , then
The implied constant is absolute. In particular the familiar square-root saving is . We prove all estimates used in this statement.
First, the finite geometric series identity gives
where denotes distance to the nearest integer and the second bound is interpreted as infinite when that distance is zero. Indeed the sum is , and . This proves the exponential geometric sum bound.
Expand the squared quadratic exponential sum by the difference between its indices. Since , the diagonal and the paired off-diagonals give
For , partition the into consecutive blocks of length at most . Within one block, two distinct indices have difference . Since the denominator of after reduction is at least , . Therefore
Thus the points in a block are separated on the circle by at least .
For any such separated set, at most an absolute number of points lie in each pair of arcs whose distances from zero are between and . The closest few contribute to the capped reciprocal sum; the remaining arcs contribute for . Summing the harmonic series, using , proves a block bound . This is the required separated reciprocal-distance sum estimate, with its proof supplied here. There are blocks, so
For , the trivial bound already implies this estimate after increasing the absolute constant. This completes the proof, including the small denominators and the possible common factor of and .
We prove the three-term Roth theorem by a density increment, keeping the interval boundary rather than replacing the interval by a cyclic group with a different density. The case is vacuous; assume .
We first prove the following alternative with absolute constants : if has density and no nonconstant three-term arithmetic progression, and , then some integer progression has
For this purpose take , so for large and are invertible modulo . On , put , , and . In particular , and vanishes outside the interval. Use normalized Fourier coefficients on a finite abelian group, . Character orthogonality, obtained by summing a finite geometric series, gives Fourier inversion on a finite group and Parseval identity on a finite group.
For these identities give
There is no wrapping ambiguity when all three entries lie in : the integer has absolute value below , so a modular relation is an integer relation. If no nonconstant progression exists, . Meanwhile the choices and give for sufficiently large .
Expand the difference by telescoping,
If , each term on the right has modulus at most . Indeed multiplication of frequencies by permutes them, and Cauchy-Schwarz with Parseval identity bounds the two other Fourier factors by their norms; each squared norm is at most . For , the diagonal count is less than half the main density term. Therefore
In particular there is a nonzero frequency with
The frequency is nonzero because .
Here is the conversion of this coefficient into a density increment. Put . Of the numbers modulo one, two lie in the same one of equal arcs. Their difference gives with , where . This is the needed Dirichlet approximation theorem, proved by the pigeonhole principle.
Partition each residue class modulo in into consecutive progressions of length , leaving its final short tail. Their total tail size is at most . On each full progression the character differs from its value at the first point by at most . Hence removing tails and replacing the character by its initial value shows
The sum of over all full progressions is the negative of its sum over the tails, so its absolute value is at most . Consequently the sum of the positive block sums is at least . Since these blocks contain at most points in total, at least one has average at least . It gives a density increment at least . For with a sufficiently large absolute , . This proves the alternative, with one small common absolute .
Reidentify with by its affine parametrization. Absence of a nonconstant progression is preserved, while density increases. At every step the density is at least the original , so the increment is at least and the new interval length is at least . After at most steps, the density would exceed one. Choose the original so large that the length stays above throughout these finitely many steps. Such a choice exists explicitly by working backwards: a required next length is ensured by previous length at least . The alternative could then be applied at every step, giving a contradiction. Thus
This is the Roth density increment on an integer progression proof.
For the pattern with offsets , replace the counting functional by . Its Fourier expression is
coming from the relation . Both multipliers are invertible modulo the chosen , so exactly the same Parseval estimates apply. This relation has no wrap in , since its magnitude is at most , and the earlier restricted choices of still give a fixed positive density main term. The same increment and iteration find a nonconstant triple . Negative is allowed, as requested, and the affine reparametrization used in the iteration preserves this pattern as well.
We give a spectral proof of square-difference recurrence for finite colourings, proving the auxiliary results it uses. Extend the colouring arbitrarily to nonpositive integers, and let be the indicator of colour . By successively taking subsequences of the interval lengths, followed by a diagonal subsequence, we may arrange that all the limits
exist, for every integer . This uses only sequential compactness of bounded real sequences: list the countably many quantities, choose a convergent subsequence for each in turn, and take the diagonal. All limits below are along this common subsequence. We have , , and . Translating a fixed interval endpoint changes a normalized average by .
The sequence is a positive-definite function on . Indeed, for finitely many complex numbers ,
We next prove the required Bochner–Herglotz theorem for this sequence. The trigonometric polynomial
is nonnegative by positive definiteness, and its integral on the circle is . Thus is a probability measure. Such measures on a compact interval have a weakly convergent subsequence. For completeness, take a diagonal subsequence on all rational points of their nondecreasing distribution functions. The right-continuous extension of the limiting rational values is a distribution function and defines a probability measure by its interval increments. At its continuity points the original distribution functions converge, by sandwiching between rational endpoints. Approximating continuous functions by step functions with such endpoints proves convergence of their integrals. Identify the interval endpoints to obtain a measure on the circle. This proves the compactness of probability measures on a compact metric space in the case needed here.
For a fixed , the Fourier coefficient of is once . Taking the weak limit therefore supplies a positive probability measure such that
No spectral representation has been assumed without proof.
Its atom at zero has positive mass. For each ,
The last inequality is Cauchy-Schwarz on each colour's interval average. The integrand is at most one and tends to zero for every nonzero point of the circle, by the geometric-series formula, while it is one at zero. Bounded convergence gives
We also prove that quadratic phases with an irrational coefficient average to zero. For bounded by one, extended by zero, Cauchy-Schwarz applied to yields
This identity follows by expanding the square of the inner shifted sum and grouping pairs by their difference; it is the needed finite Van der Corput inequality for finite scalar sequences. If and is irrational, each fixed nonzero lag correlation is a geometric sum with frequency , hence is bounded independently of . The geometric bound follows from with . Dividing by and letting tend to infinity gives . Letting tend to infinity proves the asserted cancellation. Rational coefficients instead give periodic sequences and therefore have convergent averages.
Choose a finite set of rational points of the circle, including zero, such that the total mass of the remaining rational atoms is below . This is possible because the rational points are countable and is finite. Let be a common multiple of their denominators. For , for every integer . For irrational the preceding cancellation applies to ; at every other rational point the average exists by periodicity and has modulus at most one. Bounded convergence consequently gives
Here the inequality takes real parts; itself is real. Thus some has . By its definition as a limit of nonnegative averages, at least one actual positive has . The same colour occurs at both points, proving
The arbitrary extension to nonpositive integers played no role in this final pair.
The analytic input for these Mellin transforms is elementary cusp decay. For a level-one weight- cusp form, the invariant norm of a modular form is invariant under the modular group. It is bounded on the standard fundamental region, because the cusp expansion decays exponentially, and hence bounded on all of . Fourier inversion gives
Taking proves the Fourier coefficient bound for a cusp form . In particular rational translates have polynomially bounded coefficients and exponential decay as , uniformly in their real parts. These facts justify the initial Mellin integrations and the later entire continuation.

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