Let be open subsets, and let . The assumed flasque-kernel section-lifting lemma lifts to . Since is a flabby sheaf, extend to a section on , then project to . Its restriction is . Thus every restriction map of is surjective, proving that the quotient of two flabby sheaves in a short exact sequence is flabby.
For the construction of sheaf cohomology, embed a sheaf of abelian groups into the sheaf
by sending a section to all its germs. This is injective because a section with every germ zero is zero. Arbitrary families of stalk elements glue point by point, and restriction maps are projections; hence is a flabby sheaf. Set , and . Compose the quotient map with the next embedding to obtain the flasque resolution
The sheaf cohomology groups are the cohomology groups of the resulting cochain complex of global sections:
The usual comparison of resolutions identifies this construction with the right derived functors of global sections; the construction above is the Godement resolution.
If is itself a flabby sheaf, the quotient argument shows inductively that every is flabby. The assumed lifting result therefore makes
an exact sequence for every . The global-section complex is consequently exact in every positive degree. In particular,
This establishes the vanishing from the section-lifting property rather than assuming it in advance.
For the smooth algebraic curve , a divisor on an algebraic curve is a finite formal sum of closed points with integer coefficients. At each closed point, the local ring of a smooth algebraic curve is a discrete valuation ring; write its normalized discrete valuation as . For the principal divisor is . Only finitely many coefficients are nonzero: zeros and poles are proper closed subsets in the Noetherian Zariski topology of a curve. The divisor class group is the abelian group
Equivalently, its elements are divisors on an algebraic curve modulo linear equivalence of divisors.
Let be an oriented real vector bundle of rank over a paracompact base. A Thom class is a class restricting on every oriented fiber pair to its positive generator. The Thom isomorphism theorem states that this class exists uniquely with those fiber restrictions and that
Here is identified with the zero section. Equivalently use the disk/sphere bundle pair. The compact-support version is , with fiberwise compact support in the Thom construction. If the bundle is not oriented, the integral assertion requires the corresponding orientation local system.
For a closed co-oriented embedded submanifold of codimension , co-orientation means an orientation of its normal bundle. A tubular neighborhood identifies a neighborhood of with that bundle. Its Thom class, transferred by excision, is a class in . For compact this maps into the direct limit defining compactly supported cohomology, giving . The construction is independent of the tubular neighborhood and uses the chosen co-orientation. In an oriented ambient manifold it is the Poincare dual of the oriented submanifold. Here “closed submanifold” has the usual compact-without-boundary meaning; if it meant merely a closed subset and were noncompact, the supported relative class would still exist but need not have compact support.
We next prove the fixed-point implication without imposing an unprinted orientability assumption on . Set
Use a finite triangulation of the closed smooth manifold. The elementary Hopf trace identity says that the alternating trace of a chain endomorphism equals its alternating trace on homology. To verify it, split each finite-dimensional chain space as boundaries, a complement representing homology, and a complement mapping isomorphically onto the preceding boundaries. The traces on these two boundary summands cancel in adjacent degrees, leaving exactly the homology traces. The cohomology traces equal the homology traces because the induced maps are dual over .
If has no fixed points, compactness gives . Choose a triangulation of mesh less than and a sufficiently fine subdivision admitting a simplicial approximation uniformly within of . The subdivision chain map sends each simplex to simplices inside it. For a vertex of such a small simplex, , so cannot lie in the original coarse simplex. Consequently has zero diagonal coefficient on every coarse simplex. Its trace vanishes in every degree, while it induces on homology. The trace identity yields . Taking the contrapositive proves
This is the Lefschetz fixed-point theorem, established here rather than invoked. For oriented the same identity is the graph-diagonal formula for the Lefschetz number: , which vanishes when the graph misses the diagonal. Finally, homotopic maps induce the same cohomology maps, so their Lefschetz numbers agree.
There are genuine normalization inconsistencies in this PDF. In the standard linearized chord diagram model , time gives edges and total vertex degree , with self-loops counted twice. The paper calls the number of edges. Its right-endpoint hint also uses rather than . These cannot both describe the standard model; part (c)'s exponent is consequently inconsistent as well. We give the definition, prove the alternative construction and its limits, and explicitly identify the corrected conclusion rather than infer an invalid constant from the printed hint.
Start from the empty graph at time zero, or from one vertex with one self-loop at time one. To obtain from , add vertex and an edge directed from to , where
A self-choice creates a self-loop. The old vertex degrees sum to , so these probabilities sum to one. This is exact preferential attachment, including the outward half of the new edge as weight one for the new vertex; it is not a rule normalized by or a process adding two edges at each step. The degree of a vertex here is its total incoming plus outgoing vertex degree. The construction in part (a) has exactly one chord per vertex and makes the edge-count discrepancy explicit.
Identify the discrete cube with the subsets of , with hypercube graph adjacency given by changing one element. Write for the closed graph neighbourhood and for the external vertex boundary. The simplicial order on the discrete cube first orders by set size and then by lexicographic order, with the smallest differing coordinate belonging to the earlier set.
Harper theorem states that, for every set family ,
Here is the simplicial section compression proof. Induct on , the one-dimensional case being immediate. Split by a coordinate into sections . Its neighbourhood sections are
Replace by equally large simplicial initial segments . By induction . Also the neighbourhood of a simplicial initial segment is itself a simplicial initial segment: at its last occupied level the extra vertices form the upper shadow of a lexicographic initial segment, again lexicographically initial. Consequently the compressed unions have sizes and , no larger than the original unions. The compression preserves and cannot increase .
Repeat in every coordinate until all sections are initial. Every nontrivial compression strictly decreases the sum of the global simplicial positions, so the process terminates. To describe the terminal families for simplicial section compression, suppose an earlier absent vertex precedes a later present vertex . They cannot share a coordinate value: otherwise they lie in the same compressed section, contradicting its initiality. Thus . No vertex can lie strictly between them in the order, since it would make another absent/present pair that is not complementary. Hence the terminal family is either or that segment with its last vertex exchanged for its immediate complementary successor .
For odd , that exceptional exchange crosses the middle levels: and . For , all sets of size at most remain in the neighbourhood after the exchange, since an -set has at least two lower neighbours and only one was removed. The new can only add vertices of size .
For even , the only consecutive complementary pair in one level is and . The original segment contains all sets below size and all -sets containing 1. For , its neighbourhood contains all sets of size at most and all -sets containing 1; every such upper set still has an included lower neighbour after the single removal. The new can only add further neighbours. The cases follow directly, with the exceptional families related to the initial ones by a graph automorphism. Thus neither exception improves the neighbourhood, completing the induction.
For the half-cube vertex-boundary extrema, if , the initial half cube is all sets of size at most ; its boundary is the next level, of size . If , it contains all levels below and the -sets containing 1. The boundary consists of the -sets avoiding 1 and the -sets containing 1, giving .
No boundary can exceed the vertices outside a half cube. Taking all vertices of even Hamming weight attains that bound, because every odd-weight vertex is adjacent to one of them. Therefore, for ,
A one-dimensional canonical transformation is a locally invertible change of phase-space variables preserving the symplectic two-form: . Equivalently it preserves Hamilton equations for the transformed Hamiltonian. Expanding the two-form yields
so
Conversely this Jacobian condition makes the transformation locally invertible and symplectic in two dimensions.
An odd composite integer coprime to is a Fermat pseudoprime to base if . A Carmichael number is a composite integer satisfying this congruence for every integer coprime to . The Korselt criterion says that a composite is a Carmichael number exactly when it is squarefree and divides for every prime divisor of .
Differentiate under the contour integral, with one consistent branch and convergent endpoint behavior. Then
The stated zero boundary term therefore makes the integral a solution. On a closed contour this means returning to the same branch; on an open contour it requires the endpoint values to cancel or vanish.
The inductive definition of ordinal addition is
for nonzero limit ordinals . The synthetic definition is the order type of a disjoint copy of followed by a disjoint copy of , retaining the order within each block and declaring every element of the first block smaller than every element of the second.
These are equivalent by transfinite induction in the second argument. An empty second block leaves ; a successor block appends one final point; and a limit block is the increasing union of its proper initial blocks, whose order types have the indicated supremum. Thus the synthetic construction satisfies exactly the inductive recursion, which determines the operation uniquely. It is not commutative: , whereas .
Let the three orbit points be . Up to reflection of the interval, their images are . Set and . Continuity and the intermediate value theorem imply the covering relations
We first prove the needed interval-covering principle using the permitted pullback fact. If a cyclic list of closed intervals obeys , pull back successively from the end to obtain a closed interval with and . Since , the intermediate value theorem gives a fixed point of in : choose preimages of the two endpoints of , which give opposite weak signs of , irrespective of their order. This point realizes the cyclic itinerary.
For , use the word . It obeys the covering relations and therefore yields a point with period dividing . A point away from the shared endpoint has an unambiguous itinerary, and this word has exactly one per cycle; it cannot be a repetition of a shorter word. Its least period is consequently . If an orbit touches , it is the original three-cycle. That realizes the case itself. It cannot realize any of the other words: for not divisible by three it is not fixed by , and for a multiple of three larger than three it visits more than once, contradicting the itinerary. Thus the construction works for every . For , and the same fixed-point argument gives a fixed point. This proves period three implies all periods: there is an orbit of every positive least period.
For the two five-cycles forced by a three-cycle, use the two cyclic words and . Both are admissible. Their points cannot be endpoints from the three-cycle, and because five is prime and the words use both intervals, each has least period five. Their itineraries have respectively one and two visits to the interior of ; cyclically shifting the starting point cannot change this count. Hence they give at least two distinct period-five orbits.
For steady unidirectional pressure-driven channel flow, write . The axial momentum equation and no-slip boundary condition are
Near an ideal wedge, the constant forcing has an particular solution by scaling. Substitution gives , with . For , the symmetric particular solution is
This corner expansion of pressure-driven sector flow is a particular solution, not necessarily the dominant corner term; a homogeneous corner mode can be larger, as the requested cases below show.
Separation of the symmetric harmonic correction with zero values on the straight walls gives modes , where
Regularity at the vertex excludes negative powers. Orthogonality on has norm . To cancel the particular solution on , use its cosine coefficients
The integral follows by product-to-sum and . Thus
The arc data are satisfied by the cosine expansion, and the Poisson equation by construction. At the omitted thresholds , a mode has , so the pure ansatz is resonant. The corresponding finite-limit term in the full sector solution is ; the other modes remain regular. This explains rather than hides the division by .
For a closed piecewise continuously differentiable path avoiding , the winding number is
Break the parameter interval at the finitely many derivative discontinuities when evaluating this integral. Translating the curve gives , which will also be used below.
A function is a differentiable function at if there is a linear map with
The map is its derivative; equivalently for fixed constants. Since every such linear map is bounded, . This proves differentiability implies continuity, not merely continuity along each coordinate axis.
For a two-dimensional incompressible flow , the continuity equation is . Locally, or globally on a simply connected fluid region, this permits a streamfunction with
Indeed, the one-form is closed by incompressibility and hence is locally the differential of . Conversely these expressions automatically give zero divergence by equality of mixed derivatives.
A streamline at a fixed time is tangent to the instantaneous velocity field. Along it,
Thus streamlines are connected curves on which the streamfunction is constant; wherever , the level curves have exactly the required tangent direction. At a stagnation point, the tangent is degenerate and distinct branches of a level set need not form a single streamline. For unsteady flow this argument fixes time: it does not identify streamlines with particle pathlines.
For the unheaded continuation, set in the food equation. The two square roots are , so exponentiating gives
Both values have and hence lie strictly inside the disk. Both also have the indicated principal logarithms. Allowing the multivalued complex logarithm produces no additional points: the only permitted values of are still the two square roots already used.
For drink, the PDF squares only the denominator. Put . Its numerator is and its unsquared denominator is , which is nonzero unless . Multiplying the equation by this denominator squared and equating the real part and imaginary part yields
that is and . If , the real equation gives or , and zero is excluded. If , then , but the real equation would require , impossible for real . Thus
It lies on the allowed disk boundary, and direct substitution gives . The denominator-only square matters: squaring the entire quotient would define a different locus.
Figure 1.
Food points inside the allowed complex disk and the unique drink point on its boundary
. Details.
For the unheaded continuation, write the vector triple product as
The Levi-Civita symbol contraction is . One way to check its sign is to fix distinct : the only nonzero term has the remaining index, and the pairs contribute respectively. When , both sides vanish. Contracting with the vectors now gives both requested notations:
If and are orthogonal, then . With the specified , the perpendicularity of the cross product gives . Therefore
The same answer covers the degenerate case in which one of these two vectors is zero.
Let be the eddy momentum flux, the eddy density flux, and . The PDF's hydrostatic equation is ; the converted TeX mistakenly replaces the pressure derivative by a density derivative. With , define
The residual mean circulation is nondivergent because . Substituting in the original mean momentum and density equations gives the transformed Eulerian mean equations
with the unchanged geostrophic and hydrostatic balances. Here the Eliassen–Palm flux components are
The eddy buoyancy flux has been absorbed into the residual transport, while both types of wave forcing enter the momentum equation through the Eliassen–Palm flux divergence.
For geostrophic disturbances, the Taylor identity for quasi-geostrophic flux gives
For example, zonal averaging removes and converts the remaining horizontal and vertical terms in into derivatives of and , giving precisely the displayed fluxes.
Locally, for a basic flow with nonzero meridional PV gradient , the quasi-geostrophic wave pseudomomentum is . Multiplying the linear perturbation PV equation by gives
where is a PV source or sink. In a locally uniform conservative Rossby wave packet, . Thus the flux tracks group velocity rather than the generally different phase velocity, with a signed wave activity if .
The non-acceleration theorem for quasi-geostrophic waves states that statistically steady conservative waves, with no wave-activity sources, sinks or independent boundary forcing, produce no balanced mean acceleration. Their flux divergence vanishes. In the present stable, impermeable mean-flow problem the homogeneous residual-circulation equation then has the zero solution, so and . The Eulerian mean flow can still circulate because its eddy-induced correction need not vanish. Dissipation, absorption at a critical layer, time-dependent wave activity or boundary forcing produces a nonzero flux divergence and invalidates the non-acceleration conclusion.

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