A left-invariant vector field on a Lie group satisfies
or equivalently for every . For , define
This is smooth because multiplication is smooth and its differential depends smoothly on the base points. The identity gives , so is a left-invariant vector field. Conversely, left invariance forces any such field to have this form with . Evaluation at and the construction above are inverse linear maps. Hence
The Lie bracket of vector fields is their commutator as derivations on smooth functions: . It is another vector field because the cross terms cancel in the Leibniz rule for its action on a product. The bracket is preserved by a diffeomorphism: conjugating the derivation operators by pullback of a smooth function preserves their commutator. Therefore
for left-invariant . These fields are consequently closed under the bracket.
Transport the bracket to the tangent space by
Bilinearity and antisymmetry come from the commutator. The Jacobi identity follows by expanding the three nested commutators of derivation operators: their six terms cancel in pairs. Thus is a Lie algebra, and the displayed correspondence is a Lie algebra isomorphism onto the algebra of left-invariant vector fields.
The direct-sum assertion fails in both degrees when the pieces overlap. Take genuine open covers, so the failure does not depend on any subtle choice of smooth structures on subsets.
For degree zero, let , and . By degree-zero de Rham cohomology, consists of locally constant functions. Each of is connected and nonempty, so
They are not isomorphic as real vector spaces. The restriction map is ; the overlap forces equality instead of allowing two independent constants.
For degree one, let , and remove distinct points to form and . Each is diffeomorphic to an open interval. Every one-form on an interval has the smooth primitive , so both pieces have zero first de Rham cohomology. On the circle, the form is closed because all two-forms on a one-dimensional manifold vanish. The parameterization gives
An exact form has zero integral around this loop: the integral of is the difference of the endpoint values of the periodic function . Thus , while the proposed right side is zero, disproving the isomorphism.
In fact . For a periodic one-form , subtract where . The remainder has the periodic primitive , and hence is exact. This also explicitly identifies the nonzero class used above.
The two components of a disjoint union are open and closed. Restriction therefore gives an isomorphism
Its inverse assigns the first form on and the second on ; it is smooth because there are no overlaps on which compatibility must be imposed. The exterior derivative is local, so this is an isomorphism of cochain complexes.
A form on is a closed differential form exactly when both restrictions are closed. It is an exact differential form exactly when both restrictions are exact: primitives on and join into a global primitive. Taking the quotient therefore yields the de Rham cohomology of a finite disjoint union:
The same argument covers degree zero, with the space of degree-minus-one forms taken to be zero.
A smooth differential form of degree is a smooth section of , so
It is equivalently a smooth alternating covariant -tensor field. In a coordinate chart it has a unique expression
with smooth coefficients. At these are the smooth functions, and for the space is zero.
Define the exterior derivative in a chart by
To check that it is well-defined, let be other smooth coordinates. The expression satisfies
because the coefficients are symmetric and the wedge products antisymmetric. The coordinate formula also satisfies the graded Leibniz rule, and for a function the chain rule gives . Applying these two facts to yields . Thus the local operators agree on overlaps and define a global linear map .
A second application in any chart gives
again by symmetry of mixed derivatives and antisymmetry of the wedge product of differential forms. Consequently every exact differential form is closed. Put and define the de Rham cohomology by
The identity is exactly what puts the denominator inside the numerator, making this quotient meaningful. Since for , in those degrees.
Choose the smooth fiber metric supplied by part (a), and let be orthogonal projection. These projections vary smoothly. Indeed, in a local frame of write its metric as a positive-definite matrix , and let the columns of be a frame of . Then
The matrix is positive definite, so its inverse is smooth. This formula proves smoothness of the intrinsic projections in every chart. It also gives and .
The orthogonal complement is a smooth vector subbundle: applying to a complement frame gives a frame of its fibers, of constant rank , after shrinking the chart. Fiberwise,
and the restriction is a smooth fiberwise bijective vector bundle morphism. In local frames its matrix is invertible, with smooth inverse, so it is a vector bundle isomorphism.
More explicitly, the desired orthogonal splitting of a vector subbundle is
Its inverse is . Replacing by with leaves unchanged, so the inverse is well-defined. Both maps are smooth and linear on fibers, and their compositions are identities. The splitting exists globally but depends on the chosen fiber metric.
Let and . Around any , choose a local frame of the vector subbundle . Choose additional smooth sections of which complement these vectors at . They can be obtained by constant-coordinate sections in a vector bundle trivialization. The determinant of the resulting frame is nonzero at , hence on a sufficiently small neighborhood. Thus
is an adapted local frame of near .
On the fiberwise quotient, the classes form a basis. Give the quotient vector bundle its local coordinates by
An overlap between adapted frames has a smooth transition function of a vector bundle represented by an invertible block upper triangular matrix,
The zero lower-left block expresses that both sets of first frame vectors span . Its lower-right block is smooth and invertible. Passing to quotient coordinates removes the upper block, leaving precisely the transition . These lower-right blocks satisfy the cocycle identity because the original transition matrices do. Consequently they define a compatible smooth bundle atlas of rank . This proves is a smooth vector bundle, and its fiberwise quotient map is a smooth vector bundle morphism. The construction is independent of the adapted frames: any two choices have the same type of compatible transition. The usual quotient topology agrees with this atlas, since in adapted coordinates is an open linear projection on each fiber.
Work with real vector bundles; for complex bundles replace the inner products below by positive-definite Hermitian forms. A smooth rank- vector bundle is a smooth total space with a smooth projection , a real vector space structure on each fiber , and an open cover with vector bundle trivializations
Each is a diffeomorphism over and is linear on fibers. The overlap maps have the form , where is smooth. The rank of a vector bundle may be specified separately on each connected component.
A smooth fiber metric is a positive-definite symmetric bilinear form on each fiber, with smoothly varying coefficients in every local frame. Equivalently it is a smooth section of which is positive definite at every point. Each trivialization supplies a local fiber metric by pulling back the Euclidean inner product.
A smooth manifold is Hausdorff and second-countable, hence paracompact. Choose a smooth, locally finite partition of unity subordinate to a trivializing cover, with , , and . Define
Extend each weighted term by zero outside its trivializing set; its support lies inside that set, so the extension is smooth. Local finiteness makes the sum smooth. At a point and for , every nonzero term is positive and at least one such term occurs. Thus . This proves that every smooth vector bundle admits a smooth fiber metric.
True: every integer occurs. The simple-connectivity assumptions in parts 1 and 2 are local to those statements and are not imposed here. For a connected closed oriented four-manifold, Poincare duality gives
since . This expression has no fixed sign or parity.
Use , from its three even-dimensional cells, and , by Euler characteristic of a product. The Euler characteristic of a connected sum in dimension four is
It follows either by Mayer–Vietoris sequence after deleting balls, or by the intermediate-degree cohomology splitting and the single top and bottom generators. Therefore a connected sum of projective planes and copies of has
Given an integer , choose an integer and put . This produces a connected closed oriented four-manifold of Euler characteristic . When , use . Thus
If simple connectivity were added, the possible values would instead satisfy . This distinction is recorded in Euler characteristics of closed oriented four-manifolds.
True for two positive-dimensional factors. In fact degree three can be replaced by any nonzero mapping degree. Suppose with . The factors are closed and connected. They are also orientable: an orientation-reversing loop in either factor would reverse the product orientation while the other factor stays fixed, contradicting the orientation of .
Let be their integral top orientation classes, and let be the corresponding projection pullbacks to . The Künneth theorem and the product fundamental class give
For , both and vanish, since a sphere has no cohomology in those intermediate positive degrees. Naturality of the cup product therefore gives
On the other hand, the definition of degree three gives . This contradiction proves the nonzero degree from a sphere obstructs manifold products assertion. The product with a zero-dimensional point factor is the excluded trivial case.
False. Take and . Both are closed oriented simply connected manifolds and . A cohomological obstruction rules out even a topological fiber bundle.
Suppose a fiber bundle existed. The long exact sequence of homotopy groups of a fibration, including its component terms, makes path-connected. A local trivialization over a small open ball in identifies its preimage, an open subset of , with . Projection onto gives a retraction. An open smooth four-manifold has the homotopy type of a CW complex of dimension at most four, so its rational cohomology vanishes in degrees above four. A retract's cohomology injects into that of the ambient space. Therefore
Use the multiplicative cohomological Serre spectral sequence with rational coefficients. Since is simply connected, there is no nontrivial coefficient action, and only columns zero and three occur on . Thus , and the only possibly nonzero differential is . Let be the degree-three base generator. It cannot survive, because the sequence converges to and that ring has zero degree-three part. It has no outgoing differential and its only possible incoming differential is from . Hence there is with
The class is nonzero and, by the degree bound above, has a first vanishing power for some . Multiplicativity says that is a graded derivation. Since is even,
But , in which by minimality of ; also is nonzero over . This is a contradiction. Thus no such fiber bundle exists. This is the special case of a sphere cannot fibre over a lower-dimensional odd sphere required here.
False. Take and , with their standard product and connected-sum orientations. They are closed simply connected four-manifolds. For the connected sum, removing a four-ball leaves the fundamental group unchanged, and the Seifert-van Kampen theorem across the separating three-sphere preserves simple connectivity. The Mayer–Vietoris sequence computes integral cohomology in degrees zero, two and four, and zero in other degrees. The Künneth theorem gives the same groups for . Thus their Betti numbers agree and all their integral cohomology is torsion-free.
Their cohomology rings nevertheless differ. In , let come from the two projective summands and let generate degree four. The cohomology ring of the connected sum of two complex projective planes has
These relations follow by using cycles in the separate summands and the degree-one pinch projections onto them. In , the sphere-factor generators satisfy
Consequently every degree-two class of has square
an even multiple of the top generator, whereas in is a primitive generator. An integral graded-ring isomorphism cannot change this property, since it sends a generator of to its positive or negative. A homotopy equivalence induces a graded-ring isomorphism, so none exists. Equivalently, their intersection forms are and , an odd form and an even form respectively.
Take the Hopf map , given by . The domain has positive-dimensional homology only in degree three, while . In degree two the source group is zero, and all remaining positive-degree source groups are zero too. Hence the induced map on homology is zero in every positive degree.
For nontriviality, use the Hopf fibration . It is a fiber bundle: phase multiplication gives each fibre, and choosing a normalized representative on either standard projective chart gives a local trivialization. The theorem invoked is the long exact sequence of homotopy groups of a fibration. Since the universal cover of is contractible, . Its exact sequence consequently gives an isomorphism
The identity class of is nonzero, since an identity map cannot be null-homotopic while inducing the identity on . Its image under is the class of , so that class is nonzero. The Hopf map is not homotopic to a constant despite inducing zero on all positive-degree homology.
Take the Möbius line bundle over ,
A continuous section of a vector bundle corresponds to a continuous real-valued function with . If , it already vanishes. Otherwise its endpoint values have opposite signs, so the intermediate value theorem gives for some . Thus this vector bundle has no nowhere-zero section. Every continuous section must vanish.
Under the intended convention that the finite group is nontrivial, take . It is simply connected by its CW complex structure. The Lefschetz fixed-point theorem says that a continuous self-map of a compact triangulable space with nonzero rational Lefschetz number has a fixed point.
For any continuous , write for the integral degree-two generator, with . Preservation of the cup product gives . Only degrees zero, two and four contribute to the rational Lefschetz number, so
Consequently every such map has a fixed point. In a free group action, each nonidentity group element must act by a fixed-point-free homeomorphism. This is impossible here, so no nontrivial finite group can act freely. This is the fixed-point property of even-dimensional complex projective space for complex dimension two. If the trivial group is included, the literal request has no example, since the trivial group acts freely on every space.
Take . It is a closed smooth manifold and is simply connected: its CW complex structure has no one-cells, and attaching cells of dimension at least two to a point cannot create a fundamental group. Its cohomology ring is with , so .
The theorem used is the Lusternik–Schnirelmann critical point theorem: every smooth real-valued function on a closed connected smooth manifold has at least its unnormalized Lusternik–Schnirelmann category many distinct critical points, without a nondegeneracy assumption. Here category is the minimum number of open subsets covering the manifold whose inclusions are null-homotopic. The cup length bound gives category at least four. To justify that bound, a cover by three categorical sets would make each positive-degree class vanish on its assigned set. The long exact sequence of each pair lifts three copies of to relative classes, and their relative cup product would lie in , contradicting . Thus every smooth function has at least four critical points, including functions with degenerate critical points. The critical-point theorem in this formulation is described in Conley pairs in geometry—Lusternik–Schnirelmann theory and more.
Use integral cellular homology. All three vertices become a single vertex, and all three oriented edges become one oriented circle, with generator . The face goes round that circle three times in the same direction. Thus the quotient has a CW complex structure with one cell in each of dimensions zero, one and two, and cellular chain complex
The degree-two boundary is injective and its cokernel is . Therefore
The attaching word is , so the Seifert-van Kampen theorem also gives . This is the degree-three circle-attachment model of a Moore space.
Group the martini lattice into independent three-terminal cells. A cell has terminals , an inner triangle with vertices , and the three spokes . All six bonds are independently open with parameter . The cells arise from the vertices in the decorated class of the honeycomb lattice; they have disjoint bond sets and meet only at terminals. The terminal positions form a triangular lattice, with cells occupying one orientation of its triangular faces.
Figure 1.
The six-bond martini cell: three terminal spokes and an inner triangle
. Details.
A cell induces one of five connection partitions of its terminals. Let be the probability that all three terminals are connected, and the probability that no pair is connected. Each of the three remaining pair partitions has equal probability by symmetry. The three-terminal cell partition duality gives a particularly useful exact criterion. Draw dual terminals on the three intervening boundary arcs. The dual cell has a triangle of these three terminals and a central vertex joined to all three: its outer bonds cross the primal spokes, and its inner spokes cross the primal triangle bonds. A primal connection separates the corresponding dual boundary arcs, and conversely a dual connection separates primal terminals. Consequently duality swaps the all-connected and all-separate partitions, and permutes the three pair partitions. For example, if connect and is isolated, the dual terminal between is isolated while the other two dual terminals connect. It follows that makes the entire symmetric cell partition law invariant under this duality.
The triangular arrangement of cells is itself self-dual: the dual terminals lie in the complementary triangular gaps, and reflection and translation identify their cell arrangement with the original one. The induced partitions of distinct cells are independent in both models. At a parameter satisfying , the primal model at and the complementary dual bond percolation model at therefore have the same coarse connection law. Replacing a cell by its terminal partition preserves infinite connectivity, since the cells have uniformly bounded size. This gives a rigorous link between the finite calculation and the infinite model, rather than assuming that a symmetric-looking cell is critical.
For all three terminals to connect, all three spokes must be open and the inner triangle must be connected. The latter event requires two or three of its edges. Therefore
To compute , condition on the number of open spokes. Zero or one open spoke cannot connect a pair of terminals. If exactly two spokes are open, the two attached inner vertices must not connect: their direct triangle bond is closed, and the two-edge route through the third inner vertex is not fully open. These independent requirements have probability . If all three spokes are open, all three triangle bonds must be closed. Hence
Subtracting and factoring gives
The second factor equals and is at least on . Thus the unique equality parameter is .
Finally part (i) proves . If , the primal model percolates while makes the dual model subcritical, contradicting their identical coarse connection laws. If , the same contradiction arises with the roles reversed. Therefore the critical probability is
The local partition transformation is the mechanism underlying this exact value; see Ziff's original cell–dual-cell paper.
Let be the martini lattice and its planar dual graph. Write and . Both are periodic, connected, bounded-degree plane graphs with bounded face sizes. Dual bond percolation declares a dual bond open exactly when its crossing primal bond is closed, giving independent dual parameter .
First, . Suppose instead that the sum exceeds , and choose . Both the primal model at and the dual model at are strictly subcritical. Sharpness of the percolation transition gives exponential connection-radius decay on each periodic graph, uniformly over its finitely many vertex types. A crossing of a rectangle of side lengths proportional to starts at one of boundary vertices and travels distance of order . A union bound therefore shows that each crossing probability tends to zero. But planar duality for rectangle crossings says that exactly one of an open primal left-to-right crossing and an open dual top-to-bottom crossing occurs, using the complementary boundary convention. Their probabilities sum to . This contradiction proves the first inequality.
For the opposite inequality, we need noncoexistence of primal and dual infinite percolation clusters. The four-fold version in Q3(iii) cannot be assumed without change: this decorated honeycomb lattice has three-fold rotation symmetry. Here is the necessary three-fold symmetric primal-dual noncoexistence argument.
Assume both models percolate at complementary parameters . For a large disc, the probability of having no exterior infinite arm is at most in each model. Divide its boundary into six arcs by splitting each -degree sector at the same relative angle. In the primal model let be the failure probabilities for the two alternating arc types. Rotation symmetry and the FKG inequality give
Slide the splitting point across one sector. Initially the first arc is empty; finally the second is empty. A jump occurs only when an arc gains or loses an edge-crossing point. An arm using that point requires its crossing bond to be open. The FKG inequality therefore ensures that a failure probability changes by at most a factor at a single jump: for a newly added arm event , and . At the first reversal of the order of , their ratio is consequently at most . At that splitting point,
Thus every one of the six primal arcs has an exterior arm with probability tending to . On the same six arcs the dual failure probabilities satisfy , so at least one dual arc type has failure at most ; its three rotations have the same bound. Take two of those dual arcs separated by one arc, and the two intervening primal arcs. A union bound gives four alternating primal/dual infinite exterior arms with positive probability when is sufficiently small. The separation and finite-closure argument of Q3(iii), together with percolation uniqueness on an amenable quasi-transitive graph, gives a contradiction. This proves noncoexistence. The arc balancing is the extra step needed for three-fold symmetry; it is also developed in Bollobás and Riordan's original paper on dual lattices.
If , choose . Both complementary models would then percolate, contradicting noncoexistence. Hence . Combining the two inequalities proves the dual threshold relation:
We use Zhang's argument, obtaining the critical nonpercolation conclusion from uniqueness rather than assuming it as part of the Harris-Kesten theorem. For independent bond percolation on , apply part (ii) to independent site percolation on its line graph; open sites correspond to open bonds. The line graph is amenable and of finite type. Therefore an infinite bond cluster, if it exists, is almost surely unique. The same holds for the dual bond percolation model.
Assume for contradiction that . The planar dual graph is another square lattice, and its open bonds correspond to closed primal bonds, also with parameter . Both models then have an infinite percolation cluster almost surely, by part (i). As a disc expands, the probability that it meets an infinite cluster tends to one, for each model. Choose avoiding all primal and dual vertices and all intersections of either graph with the four endpoints of the following arcs. Divide the boundary circle into four equal arcs in cyclic order. Let be the event of an infinite primal open ray whose last exit from is in ; define similarly for an infinite dual open ray. After that exit the entire ray stays outside the disc. The existence of a ray follows by finite branching in an infinite locally finite graph.
Each is increasing in the primal bond states, and their union has probability tending to one. Four-fold rotation symmetry makes their probabilities equal. The FKG inequality for their decreasing complements gives the square-root trick for positively associated events
The left side tends to zero, so . Apply the same argument to the dual states to get . A union bound, requiring no independence between the models, now shows that for sufficiently large the alternating event
has positive probability.
The alternating exterior-arm separation lemma says that the two primal rays on this event cannot be joined by a primal open path lying outside . Indeed, such a joining path contains a simple crosscut of the exterior between the two primal exit points. Join that crosscut to a chord inside the disc. The Jordan curve theorem puts one of the alternating dual exit points on the bounded side. Its dual ray, which is restricted to the exterior of the disc and runs to infinity, would have to cross the open primal crosscut. A dual open bond cannot cross a primal open bond. This is impossible.
Let be the finite set of primal bonds whose drawn edges meet , and let be the projection of the alternating-arm event onto the states outside . Because is finite, this projection is a finite union of measurable events; . Every configuration in admits an assignment on witnessing the original four arms. Now close all bonds of . The infinite tails of the two primal rays beyond their first exterior vertices survive; any path joining the surviving tails would now avoid the disc. Appending their original exterior segments back to their exit points would give the forbidden exterior connection. Thus the modified configuration contains at least two infinite percolation clusters. By independence, or the finite-energy property of Bernoulli percolation, . This contradicts the uniqueness obtained from part (ii). Therefore
We first specify the standard hypotheses of percolation uniqueness on an amenable quasi-transitive graph. A locally finite graph has finite degree at every vertex; a quasi-transitive graph, or graph of finite type, has finitely many vertex orbits under the acting group of graph automorphisms. Here the site percolation law is invariant under and independent, with one parameter for each orbit. Initially suppose . This gives the finite-energy property of Bernoulli percolation: conditional on all states outside any finite set, every assignment inside that set has positive probability. An amenable graph has finite sets with , where denotes the external vertex boundary. Finite type bounds the degrees uniformly, so internal and external boundary conventions are equivalent here.
Let be the number of infinite percolation clusters, taking values in . Each event is invariant. Part (i), together with countability of these possibilities, shows that is an almost-sure constant.
Suppose first that this constant is a finite integer . Some finite connected set meets all infinite percolation clusters with positive probability, since increasing finite sets exhaust the graph. Make every vertex of open. This joins all the infinite clusters. Opening a finite set cannot produce a new infinite cluster from finite clusters: only finitely many clusters meet its finite boundary, and their finite union is finite. By the finite-energy property the modified event has positive probability, contradicting the almost-sure value . Thus a finite must be or .
Suppose instead that almost surely. Some finite connected set meets three distinct infinite percolation clusters with positive probability. Open all of . Its vertices belong to one open cluster, and deleting from that cluster leaves at least three infinite components. This is an encounter box in percolation. We use boxes rather than assume that the local geometry permits a single trifurcation vertex in percolation.
Here is the boundary-counting contradiction in detail. Translates of have the same positive encounter probability. Finite type and bounded degree allow a deterministic packing of mutually disjoint such translates whose centers have positive lower density in the interiors of the Følner sets : every vertex is within a fixed distance of one chosen orbit, and a bounded-radius greedy packing discards only a bounded number of possible centers per chosen center. Boundary layers of any fixed thickness have size . The expected number of encounter boxes wholly inside is consequently at least for a fixed and all large .
On the other hand, contract the open encounter boxes in each cluster to vertices and retain the part inside . Each contracted encounter box separates at least three branches that run to infinity, and each branch must leave . Choose a minimal forest connecting all these boundary exits. Every encounter junction has degree at least three in that forest: its three infinite branches remain in different components after deleting the junction, so none can be omitted. The leaves are boundary exits. For each nontrivial tree, the degree-sum identity gives at most the number of leaves minus two vertices of degree at least three. Thus the number of encounter boxes is at most a constant times , where the constant accounts for the bounded boundary degrees. Taking expected values contradicts amenability. This excludes and proves
There is a genuine endpoint qualification if different orbit parameters are allowed to be or . Subdivide each horizontal edge of the square lattice once. Open every original vertex deterministically and close every new midpoint deterministically. This is an invariant independent law on an amenable graph that is also a quasi-transitive graph, but its infinite open clusters are the distinct vertical columns. Thus the finite-energy property must be included when interpreting a general vector . The homogeneous endpoint laws themselves cause no problem: they give zero or one infinite cluster.
The conclusion is false for -independent laws, even with all site marginals equal to . Here is a fully specified monochromatic line-graph percolation counterexample. Form a graph by replacing each vertex of by a complete graph on ten vertices and putting every possible edge between the blocks of two neighboring lattice vertices. Every vertex of has degree . The graph is connected, periodic and amenable: a square of blocks has volume of order and boundary of order . Assign independent fair red/blue colors to the vertices of .
Call a block good when it contains both colors. Good-block indicators are independent, with
They percolate. To verify this without presupposing a site threshold, put . A finite nearest-neighbor good-block cluster around a good origin is surrounded by a circuit of bad blocks in the matching square graph, where horizontal, vertical and diagonal neighbors are allowed. A surrounding circuit of length has an anchor within . Overcounting its choices by gives the Peierls argument
The sum bound follows directly from , with . An infinite good-block cluster therefore exists with positive probability, and by part (i) it exists almost surely. Inside each of its blocks the red vertices are connected to one another, as are the blue vertices; between adjacent good blocks the complete bipartite joining edges connect each color. Hence has both an infinite red component and an infinite blue component almost surely.
Now use site percolation on , the line graph of : its vertices are the edges of , two adjacent when they share an endpoint. Declare such a site open exactly when have the same color. Each site has open probability . Sets of sites at graph distance greater than one involve disjoint sets of underlying color variables, so this is a translation-invariant -independent law. The line graph is again connected, locally finite, amenable and of finite type. The infinite red and blue components of yield infinite open clusters in . An open path in cannot change color at a shared endpoint, so those two clusters are distinct. Thus almost surely. Local color constraints destroy the finite-energy property, precisely the ingredient missing from the uniqueness proof.

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