A holomorphic atlas on a real smooth manifold of dimension consists of compatible smooth charts whose transition maps are biholomorphic on their domains. An almost complex structure is a smooth real vector bundle endomorphism with . In each chart define
The differential of a holomorphic map is a complex-linear map, so the transition differentials commute with multiplication by . Consequently the local definitions agree on overlaps. They are smooth and square to , yielding the natural almost complex structure induced by a complex atlas. This construction uses the atlas, rather than an arbitrary choice of coordinates on the underlying real smooth manifold.
Let be the affine variety with coordinate ring . Its principal opens cover because . On , the localization of global sections on a principal open identifies its coordinate ring with , giving an isomorphism
On an overlap the two maps are induced by the same elements of , or equivalently by the same identification with , so they agree. Glue them to . The inverses agree on the overlaps as well and glue to its inverse. At a closed point , this is the map corresponding to the evaluation ring homomorphism , . This proves the cohomological criterion for affineness by an explicit global isomorphism.
The localization of global sections on a principal open gives . Each of these rings is a finitely generated algebra because is an affine variety. Choose finite generators of every and write them as with . Let be the -subalgebra of generated by all . It is a finitely generated algebra, and since these localizations contain the chosen generators and .
For any integer , raise to the power . Every resulting monomial contains some , so it gives a unit-ideal identity for powers
For an arbitrary , equality implies for some : multiply by an additional power if equality of localized fractions requires it. Choose a common and the identity above. Then . Consequently , so is a finitely generated algebra. It is a reduced ring, since a nilpotent element global regular function has zero germ everywhere on the reduced variety . This is finite generation from finitely many principal localizations.
The quasi-compactness of gives a finite cover by the affine principal neighbourhoods constructed above. Because at every point some is a unit in the local ring, the map of coherent sheaves
is surjective. Its kernel is a coherent submodule of the trivial bundle, so by part (a). The long exact sequence in sheaf cohomology makes the map on global sections surjective. Lifting supplies
This is the unit-ideal certificate from a principal affine cover.
Let be the coherent ideal sheaf of , and let be the ideal sheaf of a closed point. Because , the stalk is . Evaluation at therefore gives a surjective morphism of sheaves to the skyscraper sheaf at . Its kernel is again a coherent ideal sheaf. From
and , the long exact sequence in sheaf cohomology shows that is onto. Choose mapping to . It vanishes on and satisfies . Hence , and inside the affine variety it is the principal open subset defined by . A principal open of an affine variety is affine. This gives affine principal neighbourhoods from ideal-sheaf vanishing.
For , the assertion is the assumed vanishing for coherent ideal sheaves. For , project onto the last component. Its image is a coherent ideal sheaf, and its kernel is a coherent sheaf contained in . Here images and kernels are coherent because a variety is Noetherian. The short exact sequence
gives an exact segment in the long exact sequence in sheaf cohomology. The outer terms vanish by mathematical induction and the hypothesis, so the middle term vanishes. This is ideal-sheaf vanishing for a coherent submodule of a trivial bundle.
First form the inverse image sheaf by applying sheafification to
It is a sheaf of modules over . The morphism of ringed spaces gives a ring map , so the pullback of a sheaf of modules is
At , writing , its stalk is . The tensor construction makes the action of the structure sheaf explicit; taking the inverse image alone would not give the requested -module.
The direct image sheaf is defined on an open set by
Restrictions are those of , and the sheaf gluing axiom follows by taking inverse images of an open cover. The morphism of ringed spaces supplies . Thus acts on by , making a sheaf of modules over . This definition uses no quasi-coherence.
Construct the tensor product of sheaves by first forming the presheaf , with restriction maps induced by those of the two sheaves of modules, and then applying sheafification. The local module actions are compatible with restrictions and therefore give the sheaf an -module structure. Its stalks are
Indeed, a finite collection of germs of sheaf sections can be represented on a common neighbourhood, and every finite tensor relation holds on a sufficiently small neighbourhood. Equivalently, this construction represents bilinear maps of sheaves of modules that are balanced over the structure sheaf. Sections of the resulting sheaf need not themselves be tensors of global sections: that is why the sheafification step matters.
We need independent sets in every sufficiently large remaining induced subgraph, rather than just one in the initial random graph. The useful concentration variable is the maximum edge-disjoint clique packing in the complement graph; changing one edge changes that variable by at most one. This avoids the much larger sensitivity of the ordinary clique count in a binomial random graph.
First work in a binomial random graph , take , and let count its -cliques. Put and let be its maximum edge-disjoint clique packing size. Form the clique conflict graph whose vertices are these cliques, adjacent when they share an edge. If counts unordered conflicting pairs, the Caro-Wei bound gives, for each realization,
To verify the bound, randomly order the vertices of a finite graph and retain each vertex preceding all its graph neighbours. These retained vertices are an independent set, with expected size by the Cauchy-Schwarz inequality. Interpret the ratio as zero when . A second application of the Cauchy-Schwarz inequality, now to expectations, gives
Counting ordered pairs of -sets with common vertices, including identical sets when , yields
The shared edges account for the factor . We claim
Here are the estimates, including the large overlaps. For , the probability that a random -set contains any specified elements is at most . Summing over their choices inside the first -set gives
The logarithm of is a convex function, a quadratic in , so the maximum on this interval is at an endpoint. We have . As , the other endpoint satisfies
and is smaller than for sufficiently large . Summing at most terms gives .
For the other half of the overlaps, write , where . The exact identity and an upper bound are
The quantity in parentheses is , which tends to zero. The geometric series is thus at most for sufficiently large . This proves the claim. In fact and , so eventually
Now expose the independent edge indicators one at a time. The edge-exposure martingale starts at and ends at . Deleting one edge destroys at most one member of any edge-disjoint clique packing. Hence changing one indicator changes by at most one; coupling the remaining indicators shows .
Precisely, the Azuma-Hoeffding inequality says that if is a martingale and almost surely for deterministic , then, for ,
If all , the martingale is constant. Applying the lower-tail inequality with and gives
for sufficiently large . This is the only martingale concentration inequality needed.
Return to the original binomial random graph and set . For each fixed -element vertex set , the complement graph of has distribution . The union bound therefore gives
since . Thus with high probability every vertex set of size at least contains an independent set of size
Apply greedy colouring by removing independent sets: remove such an independent set, give it a fresh colour, and repeat while at least vertices remain. Give each of the fewer than final vertices its own colour. This uses at most
colours, since . Together with the lower bound, this gives the chromatic number of the half-density binomial random graph:
For the clique count in a binomial random graph, write
Fix . At , the estimates and give
This eventually exceeds . At , the upper bound instead gives
so . Moreover
so no later clique size can regain the threshold. The maximum defining exists for sufficiently large , since then. We have . Letting decrease to zero proves the asymptotic size:
Throughout this question the binomial random graph has , as fixed in the introduction. Let and . Count the -vertex independent sets by a random variable . Linearity of expectation gives
For the second inequality, implies . For the limit, grows faster than . By the first moment method, with high probability there is no such independent set; any larger independent set would contain one. Thus the independence number satisfies with high probability.
Every class of a proper graph coloring is an independent set, giving the claimed chromatic lower bound:
The empty family satisfies the bound, so assume is nonempty and choose a graph according to the uniform distribution on a finite set . Let be its random vector of edge indicators, indexed by . Then its information entropy is .
For each vertex , put , so records the graph neighbourhood of . The possible graph neighbourhoods form an intersecting family of subsets of : the graph intersection of any two members of has no isolated vertex at . A subset and its complement cannot both occur. Pairing the subsets into complementary pairs gives at most possible graph neighbourhoods. The maximum entropy on a finite alphabet therefore gives
This argument applies for . For the assumed nonempty family cannot exist, since its only possible graph has an isolated vertex.
Each edge belongs to exactly two of the sets . To obtain the needed instance of Shearer inequality directly from the preceding compression argument, repeatedly apply a union-intersection compression to incomparable members of the multiset . Each such step strictly increases , by
The potential is bounded and integer-valued, so the process terminates in a chain under inclusion. Coordinate multiplicities stay equal to two, so, for , the terminal chain consists of two copies of and empty sets. The compression of an entropy sum now gives
Exponentiating proves the entropy bound for graphs with isolated-vertex-free intersections:
An elementary union-intersection compression replaces two occurrences in a multiset by . By entropy submodularity, this changes the sum of information entropies by
A compression of an entropy sum is obtained by iterating these elementary union-intersection compressions. Summing the inequalities over the sequence, with repetitions counted according to their multiset multiplicities, proves the required monotonicity:
Neither the number of occurrences of an individual coordinate nor the total number of sets changes under union-intersection compression.
Take information entropy in bits and put . Write , , and . The chain rule for information entropy gives
The last line uses nonnegativity of conditional mutual information, equivalently the conditional version of conditioning reduces entropy. All random variables are finite-valued, so every conditional entropy here is finite. Therefore the entropy set function is a submodular set function:
This is entropy submodularity, with equality precisely when and satisfy conditional independence given .
Use the identification of two-element subsets of with the edges of the complete graph . A colour class in the Kneser graph is an intersecting two-element set family, so its edges must pairwise meet.
Such a class is contained either in a star graph or in a triangle in a graph. Indeed, if not all edges have a common vertex, take two meeting edges . An edge not containing must then be . Any further edge meeting all three of is one of these three. Classes with at most two edges already lie in a star graph.
Assume that a graph colouring used colours. Classify classes as stars and the remaining classes as triangles. Delete a chosen centre of each star class, leaving vertices. Every edge between those remaining vertices must belong to a triangle class, of which each covers at most three edges. Hence
But
a contradiction. Thus . For the matching upper bound, assign a two-set the colour of its smaller element if that element is at most , and otherwise give it colour . The last class comprises the three pairs on the last three elements, an intersecting family. Consequently an entirely combinatorial argument gives
The Kneser graph has the -element subsets of as its vertices; two vertices are adjacent exactly when the corresponding subsets are disjoint. The Lovász theorem on Kneser graphs determines its chromatic number. A graph colouring is therefore a partition of the -sets into intersecting families.
First construct a graph colouring with colours. If a -set meets , give it the colour of its least element. Give every remaining -set colour . Two sets with one of the first colours share that colour's element. The last colour consists of -sets in a -element ground set, so it too is an intersecting family. Thus .
For the converse we establish the Gale hemisphere lemma explicitly, using a signed moment curve. Choose and put
Every open hemisphere contains at least labelled points . To see this, put . It is a nonzero polynomial of polynomial degree at most . First suppose none of the vanishes. Write . If only of the were positive, the negative signs would occupy at most consecutive blocks. There would be at least
adjacent pairs with both negative. Each such pair forces and to have opposite signs. The intermediate value theorem would give distinct roots of a polynomial, a contradiction.
If vanishes at of the sample points, then . A Lagrange interpolation polynomial of polynomial degree at most can be chosen with at all those points. For sufficiently small , the polynomial keeps every previously nonzero sign, has no zero sample values, and makes every previously zero value negative after multiplication by . Its positive count is exactly the positive count of , so the preceding argument proves the open hemisphere assertion also in this case. For , the labelled points alternate between the two points of ; distinct labels, rather than distinct positions, are what is needed.
Suppose now that had a graph colouring with at most colours, padding the palette with unused colours if necessary. For each colour , let
These are open sets, and the Gale hemisphere lemma says that they cover . If both and belonged to , two -sets of colour would lie in opposite open hemispheres. They would be disjoint, hence adjacent in the Kneser graph, contradicting the graph colouring. The Lusternik-Schnirelmann-Borsuk theorem excludes this cover. Therefore the lower bound matches the explicit colouring:
The Lusternik-Schnirelmann-Borsuk theorem has the following two equivalent covering formulations. For every integer , a cover of the sphere by closed sets has a member containing an antipodal pair. The same assertion holds with open sets in place of closed sets. Thus antipodal-pair-free open sets, or antipodal-pair-free closed sets, cannot cover . The dimension-zero case simply says that one set covering the two-point sphere contains both points.
Here is why the two versions agree. A finite open cover of a compact metric space admits a closed shrinking that still covers: sufficiently small closed balls subordinate to the open cover can be grouped according to their containing open member. Applying the closed version to that shrinking proves the open version. Conversely, if a nonempty closed subset of avoids antipodal pairs, compactness gives positive distance between and . A sufficiently small open neighbourhood of still avoids antipodal pairs. Enlarge each member of a hypothetical closed counterexample in this way; the open version rules it out. Empty members cause no difficulty.
Another common equivalent formulation is the Borsuk-Ulam theorem: every continuous has for some , or, equivalently, every continuous odd function has a zero. For example, if antipodal-pair-free open sets covered , a subordinate partition of unity would give the odd function
It cannot vanish, since some , whereas antipodal-pair-freeness forces . In the other direction, if an odd function never vanishes, choose vectors forming a regular simplex centred at the origin in . For , the open sets cover and none contains an antipodal pair, contradicting the covering theorem.
For the physical-space L2 norm use . By part (i) and the Parseval identity on a finite group,
Split this sum into the large spectrum and its complement. Because belongs to the Bohr set in the question, for ,
Consequently the contribution from is at most by part (ii). Outside , , and . Thus that contribution is at most
Adding the estimates proves
The argument also covers empty or empty . As usual the radius and threshold are nonnegative; a negative radius makes the premise empty whenever is nonempty. The estimate expresses Bohr-set almost periodicity of a convolution: a translation of a function by an element of the Bohr set barely changes the large Fourier coefficients on a finite abelian group, while the small ones have little total energy.
Since is an indicator function of density of a finite subset , the triangle inequality gives for every frequency. Also, character orthogonality and the Parseval identity on a finite group give
For completeness, the character orthogonality used here is
which follows by summing a finite geometric series. Expanding the squared Fourier coefficients on a finite abelian group and using this identity proves the displayed Parseval identity on a finite group directly.
Combining the uniform bound with that identity gives the fourth-moment bound
In particular, the Lp norm on the frequency side here is a sum, not a normalized average. This is the fourth Fourier moment bound for an indicator function.

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