In this one-dimensional setting, a commutative formal group law over a commutative ring is a formal power series with
In particular terms of total degree at least two. There is a unique formal inverse ; coefficient recursion solves .
A morphism from formal group law to is satisfying
The invertible morphism criterion for formal group laws is
Necessity follows by differentiating at zero for an inverse . Conversely, write with a unit. In constructing , the coefficient of fixes ; at degree , the equation has the form an already known expression . This determines every over . The same construction gives an inverse on the other side, and uniqueness makes the two inverses agree. Finally apply to the morphism identity with to obtain
Thus the inverse is itself a morphism of formal group laws, not merely an inverse formal power series. Over a general ring, nonzero derivative is insufficient: it must be a unit.
The squares in the finite field are . For , the values of and the numbers of possible are respectively
Adding yields . The Trace of Frobenius is . The trace of the square of an elliptic-curve endomorphism is , so the elliptic-curve point count over a finite field gives
For example, this trace identity follows from and .
One suitable second elliptic curve is
Here , so its elliptic-curve discriminant is nonzero. Its complete list of rational points is , obtained by checking the seven -values. For the tangent slope is in , and the elliptic-curve addition formula gives . Consequently has order four and .
Let denote the Frobenius isogeny of an elliptic curve and write . Its degree of an isogeny is . The isogeny of elliptic curves has differential equal to the identity because , so it is a separable isogeny. Its kernel consists precisely of the rational points fixed by , giving
We use the degree parallelogram law for isogenies of elliptic curves, with degree zero assigned to the zero map:
One explanation of the first identity is the divisor proof of the degree parallelogram law: on , the zero divisor of is the sum of the diagonal and the graph of negation, while its pole divisor is twice each coordinate copy of . Pulling the associated line bundle identity back by and taking degrees gives the identity, including exceptional cases by the line-bundle formulation. This works for a general Weierstrass equation of an elliptic curve, including characteristic two; is the quotient coordinate for negation. Polarization therefore makes degree a quadratic form on the endomorphism ring of an elliptic curve.
Set , the Trace of Frobenius. The cross term is determined by , giving, for all integers ,
If , the real degree-two polynomial is negative on a nonempty open interval. That interval contains a rational , contradicting the displayed nonnegativity after multiplication by . Thus . Hasse's bounds are
The argument proves the Hasse theorem for elliptic curves without assuming its bound in advance.
Let be the projective cubic of a Weierstrass equation of an elliptic curve, allowing its elliptic-curve discriminant to vanish, and let . Use only the smooth locus of a variety : the singular point, if present, is excluded. For , intersect their chord with , using the tangent if and counting intersection multiplicity. If the third intersection is , define , where
in general Weierstrass equation of an elliptic curve coordinates. The line through and gives this reflection. A vertical chord gives , and the tangent at meets three times at , so is the identity. The construction is symmetric in . It stays in the nonsingular locus: a line through a singular point has intersection multiplicity at least two there, and therefore cannot also contain two smooth intersections counted with multiplicity.
For the nonsingular case, prove associativity by transporting a known abelian group law. The Abel-Jacobi map of a genus-one curve
is bijective over an algebraic closure. Indeed, the Riemann-Roch theorem in genus one says that every divisor class of degree one has a unique effective representative consisting of one point: existence follows from , and uniqueness follows because two distinct representatives would produce a degree-one map to the projective line, impossible for a genus one curve. Subtracting gives the claimed bijection.
Any line section represents the same divisor class as , including tangencies. Thus as divisors on an algebraic curve, while the vertical line gives . Hence
Addition in the Picard group is associative, so
The chord-and-tangent group law is defined over , so the group operation restricts to the -rational points.
For completeness, a singular Weierstrass equation of an elliptic curve produces the smooth-locus group of a singular Weierstrass cubic, not an elliptic curve. Over an algebraic closure, its normalization of an algebraic curve is the projective line; deleting the two preimages of a nodal crossing gives the multiplicative algebraic group, while deleting the single preimage of a cusp gives the additive group. For example, on , the coordinate , with , makes the smooth-locus law addition. On in characteristic different from two, put and , with ; the chord relation gives , so the group law is multiplication of . A nonsplit node gives the corresponding form of the multiplicative algebraic group over . These descriptions also establish the singular-case group laws.
Here is an elementary polynomial pencil with four square members argument. Suppose first that are linearly dependent. Their coprimality of polynomials then forces both to be constant. Otherwise write the four distinct members as . They are nonzero and pairwise coprime polynomials: a common nonconstant factor of two members would divide both and .
Put . At most one member of the pencil has degree of a polynomial smaller than , since cancellation of its leading coefficient determines a unique projective pair. Choose a member of minimal degree and any independent member of degree . The polynomial
is nonzero: otherwise the rational function would have zero derivative, hence would be constant in characteristic zero. Its degree is at most ; if both members have degree zero the original assumption has already failed.
Replacing this pair by any other independent pair changes only by a nonzero scalar. Since , each divides . The pairwise coprimality of polynomials therefore gives . But three members have degree , so
a contradiction. Consequently and are constant. The possibility that a member is zero was already covered by linear dependence.
To apply this to an elliptic curve, complete the square in its Weierstrass equation of an elliptic curve and work over . Nonsingularity gives three distinct roots , so the equation becomes . A nonconstant rational parametrization of an algebraic curve would have with coprime polynomials. Clearing denominators gives
The four factors are pairwise coprime polynomials. A rational function whose square is a polynomial is itself a polynomial, by comparing numerator and denominator in lowest terms. Unique factorization, and the fact that every nonzero complex constant has a square root, make each of these four factors a square in . They correspond to four distinct projective pairs. The result just proved forces to be constant, and the equation then forces to be constant as well. This proves the nonparametrizability of an elliptic curve.
For the first algebraic curve, a hyperbola, use the line through . Substitution and cancellation of the known intersection give . Thus a rational parametrization of an algebraic curve is
The identity follows immediately. Away from its inverse is ; the exceptional point is recovered at . The other point with , namely , corresponds to , while gives the points at infinity on the projective closure. This explains the exceptional parameters rather than discarding them.
For the second algebraic curve, the rational parametrization of an algebraic curve
has inverse where , and gives the cusp. Indeed, if and , then and . Both curves admit rational parametrizations, although the second has a singular point.
As printed, yes: the relation is universal. The original PDF puts the existentially quantified element in the same subset as the universally quantified element; this is not an OCR substitution. For each element of that subset, choose the element itself as witness, using reflexivity of the underlying well-quasi-ordering. For an empty subset the condition is vacuous. The truth value therefore never depends on the proposed target subset. On the power set this is a reflexive transitive relation, and every two terms of any infinite sequence are related:
A well-quasi-ordering need not be antisymmetric, so universal comparability is allowed.
If the existential element is instead intended to belong to the target subset, the natural relation is the Hoare domination preorder
For arbitrary subsets the answer to that corrected question is no. Here is a complete counterexample, the Rado order. Take
This is a partial order. Reflexivity is immediate. For transitivity, two same-row comparisons compose ordinarily. If the first comparison crosses rows and the second stays in its row, its target first coordinate is unchanged, so the cross-row inequality persists. If the first stays in its row and the second crosses, use ; if both cross, use . Antisymmetry follows because comparisons across distinct rows in both directions would require .
The Rado order is a well-quasi-ordering. Given an infinite sequence , if a first coordinate repeats infinitely often, its corresponding natural-number second coordinates have a nondecreasing pair, giving a same-row comparison. Otherwise each first coordinate occurs only finitely often, so the first coordinates in every tail are unbounded. In particular some later exceeds , giving .
For each , take the infinite row . For distinct , choose . The element is below no member of , since its first coordinate is different and fails. Thus for every pair of distinct indices. These subsets form an infinite antichain, so the Hoare domination preorder on is not a well-quasi-ordering.
If only finite subsets were intended, the answer changes again: the finite-subset lifting of a well-quasi-order is a well-quasi-ordering. Enumerate each finite subset as a finite word. Higman lemma gives an earlier word embedding into a later one with every letter increased, which witnesses Hoare domination preorder comparison of the underlying subsets. The PDF specifies no finiteness restriction, so this observation supplements rather than replaces the literal answer and the arbitrary-subset counterexample.
A well-quasi-ordering is a reflexive transitive relation for which every infinite sequence has with . A bad sequence has no such pair. The labelled version of Kruskal's tree theorem says that finite rooted trees labelled in any well-quasi-ordering are themselves well-quasi-ordered by label-monotone tree embedding.
More explicitly, an embedding is an injective map of vertices preserving lowest common ancestors, and satisfying at every vertex. The root need not map to the host root. This is a homeomorphic embedding of a rooted tree: an edge can map to a longer path, but distinct branches must separate at the image of their common ancestor. We shall prove the stronger version in which every vertex's children are linearly ordered and embeddings respect that ordering. Forgetting the child order gives the stated result for unordered rooted trees.
We first establish the two well-quasi-ordering facts used in the proof. Every infinite sequence in a well-quasi-ordering has an infinite nondecreasing subsequence. Indeed, color an index pair according to whether . The infinite two-color Ramsey theorem gives a homogeneous infinite set; the negative color would be a bad sequence, so the positive color gives the required subsequence. It follows that the componentwise product of two well-quasi-orderings is a well-quasi-ordering: first extract a nondecreasing subsequence in one coordinate, then find a good pair in the other.
Next prove Higman lemma: finite words over a well-quasi-ordering , ordered by subsequence embedding with coordinatewise increase of letters, are a well-quasi-ordering. Suppose not, and choose a minimal bad sequence by making the length of minimal among all choices admitting an infinite bad continuation of the already fixed prefix. No word is the empty word, since that embeds in every later word. Write with . Extract indices for which . Consider
It cannot be a bad sequence, since its first replacement is shorter than the minimal choice . But a good pair within the original prefix is impossible. A prefix word embedding into would embed into , contradicting the original bad sequence. And embedding into would, after appending the ordered last letters, embed into , also impossible. This contradiction proves Higman lemma, including words of arbitrary finite length.
Now suppose there is a bad sequence of finite ordered labelled rooted trees. Choose a minimal bad sequence by minimizing the number of vertices of , subject to the fixed prefix having an infinite bad continuation. Existence of a least possible size uses ordinary well-ordering of the natural numbers; after selecting such a tree retain a bad continuation to make the next choice.
Let be the collection of all proper rooted subtrees of all , with inherited labels and child ordering. These are the subtrees rooted at vertices other than the root, and each embeds into its containing tree. We claim is a well-quasi-ordering under the same label-monotone tree embedding.
Otherwise choose a bad sequence from , and choose for each a containing tree . The indices are unbounded in every tail: finitely many containing trees have only finitely many rooted subtrees, and an infinite bad sequence cannot repeatedly use one of these, since it embeds into itself. Passing to a subsequence, arrange . The spliced sequence
is bad. A good pair within either piece is already excluded. A comparison , where , would compose with to give , contradicting the original bad sequence. But is smaller than , contradicting the minimal choice at that position. This proves the claim about .
Describe by its root label and its finite ordered list of child subtrees. Every entry of lies in . By Higman lemma, is a well-quasi-ordering; hence so is . There exist with and an increasing injection matching the child subtrees in to child subtrees in , each by an embedding. Map root to root and combine these child embeddings. Different matched children lie in different target branches, so their paths meet exactly at the target root; within each branch the chosen embedding already preserves lowest common ancestors. The resulting map is a label-monotone tree embedding , a contradiction. Therefore
The empty labelled tree, if included by convention, embeds into every tree and causes no exception. A common stronger formulation requires the source root to map to the target root. It also follows: the theorem just proved makes all labelled child subtrees a well-quasi-ordering, and the product then provides a good pair with roots explicitly matched, by the same final assembly. Internal child roots may map further down their matched branches. This must not be confused with edge-to-edge embedding, for which the theorem is false in general.
Write and . The displayed formula is . A proof of logical implication may use its temporary assumption more than once; this is ordinary natural deduction, not a linear proof system.
Assume , then , then , then . The identity weakening rule derives from the hypotheses and . Discharging by the implication introduction rule gives . Applying by the implication elimination rule gives . Discharge to obtain . Applying gives an ; discharge to obtain a ; apply once more to obtain , and finally discharge .
Here is the complete decorated natural deduction derivation, split at its intermediate conclusion to keep the tree readable. Superscript labels mark which assumption occurrences are discharged; both occurrences labelled are discharged together.
To avoid an excessively wide final tree, continue the same derivation as follows, using the right-hand derived premise above:
followed by
Thus the concise lambda term, with bound-variable types determined by the displayed tree, is
Under the Curry-Howard correspondence, implication introduction rules correspond to lambda abstractions, implication elimination rules to applications, and the identity weakening rule retains the first term while allowing an unused second hypothesis. No other inference rule or classical axiom is required.
Yes. There is a computable isomorphism, obtained by an effective back-and-forth construction. Decidability of the two orders makes the usual existence argument into an algorithm.
Maintain a finite order-preserving partial isomorphism of structures from to , starting with the empty map. At a forth step, take the least ordinary natural number outside its domain. Look at the finitely many mapped elements below and above in . Their images impose an open interval in : it lies above all the lower images and below all the upper images, with a missing bound interpreted as an unbounded side.
This interval contains a fresh element. If both bounds exist they are ordered correctly by the induction hypothesis; density supplies an element strictly between them. If there is just one bound, the absence of endpoints supplies an element beyond it; if there are no bounds, choose any element. Density and the absence of endpoints moreover give infinitely many points in every such open interval, so finitely many already used images can always be avoided.
Enumerate in the ordinary presentation order, test whether is unused and satisfies every required inequality, and choose the first successful candidate. All tests are decidable, and the existence argument proves termination. Extend by .
At a back step, take the least natural number outside the range, interchange the roles of and , and carry out exactly the same search for a fresh preimage. Alternate forth and back steps. Every stage is an effective terminating finite computation, and every stage remains an order-preserving partial isomorphism of structures.
Let . The least-unused scheduling puts every element of into the domain and every element of into the range. For example, after forth steps, all ordinary presentation numbers at most have been included, since each step removes the least missing one. Thus is a bijection preserving and reflecting the orders. To compute , simulate the construction until appears in its domain; this terminates. The corresponding range search computes its inverse. Hence
The searches use the decidable presentations, rather than a possibly ineffective choice of points in an abstract dense linear order without endpoints.
Yes: regular languages are closed under the shuffle of formal languages. The construction must allow letters common to both alphabets to be assigned to either input word.
Take complete deterministic finite automata recognizing . Construct a nondeterministic finite automaton on over . Its initial state is and its accepting states form . On a letter , its possible moves from are
Both moves are allowed when belongs to both alphabets. They may coincide; that causes no difficulty.
For every run, record whether each move updated the first or the second coordinate. The letters assigned to each coordinate, in their original order, form two words . The final coordinate states are exactly the states reached by reading in . Thus an accepting run expresses the input as an interleaving of a word of and a word of .
Conversely, given such an interleaving, assign each input position to the word from which it came. The corresponding choices of transitions form a run ending in . This proves equality between the recognized formal language and the shuffle of formal languages, in both directions. No assumption of disjoint alphabets is needed. If one contributing word is the empty word, no move need update that coordinate; the initial pair is accepting exactly when both empty words are accepted.
Apply the powerset construction to this nondeterministic finite automaton to obtain a deterministic finite automaton. In particular,
The minimal deterministic finite automaton is unique up to an isomorphism preserving the initial state, transitions and accepting states. We use complete deterministic finite automata over the fixed alphabet; the PDF's abbreviation FDA has this meaning. State names themselves cannot be unique.
For words , introduce the Myhill-Nerode equivalence
It is an equivalence relation, and appending the same letter to equivalent words preserves it: a suffix after is the suffix after . Since is a regular language, take any recognizing deterministic finite automaton. Words reaching the same state are equivalent, since every further suffix gives the same computation. Thus has finite index.
The canonical residual automaton has one state for each class, initial state , transition , and accepting states those with . These choices are well-defined by Myhill-Nerode equivalence. Induction on the input length shows that reading reaches , so the deterministic finite automaton recognizes , and all its states are accessible states of a deterministic finite automaton. The same state can be described by the left quotient of a formal language
Two states are different precisely when some suffix distinguishes their acceptance behavior.
Every recognizing deterministic finite automaton has at least as many states as there are classes: pick a representative from each class; two different representatives cannot reach the same state. The canonical residual automaton attains this bound, and therefore is a minimal deterministic finite automaton.
For uniqueness, let be any minimal deterministic finite automaton. All its states are accessible, since removing inaccessible states leaves a complete recognizing deterministic finite automaton with fewer states. Map a state reached by to . This is well-defined because two words reaching the same state are equivalent. It is surjective because every class has a representative. Both sets have the minimal number of states, so it is a bijection. It preserves the initial state and transitions by construction, and preserves accepting states by taking the empty word as the suffix. This is the required isomorphism with the canonical residual automaton, proving
The empty word is included throughout, and empty or universal regular languages have the corresponding one-state complete deterministic finite automata.
Work in the domain-classifying site of part (ii), with generic domain . For finitely presented rings , the object is an available stage. Tuples of sections of are locally represented by tuples of actual elements of , because is locally surjective and sheafification preserves finite products. It is therefore enough to prove the requested implication on such representatives.
We first note the empty-cover criterion for the domain-classifying site: is initial if and only if the finitely presented ring is the zero ring. One direction is the generating empty cover. Conversely, any nonzero ring has a maximal ideal and hence a homomorphism to a field. That field is a set-based integral domain and defines a point of the classifying topos. The inverse image of at this point is , which is nonempty for the chosen field . It therefore cannot be the inverse image of an initial object. This uses only the ordinary maximal-ideal existence principle externally, not excluded middle in the internal logic.
Suppose represent a tuple lying in the negation of the all-units subobject. Write and consider the finitely presented localization of a ring
Every is invertible in , since is an inverse. But the pulled-back tuple still lies in the negation of the all-units subobject. Thus the whole stage maps into both that subobject and its negation, forcing this stage to be initial. The empty-cover criterion gives .
The localization is zero precisely when in for some integer , by the equality criterion in localization. Repeated use of the generating zero-product covers now gives a covering family
Indeed, splitting and inducting first forces locally; splitting the product then forces one locally. More formally the two inductions are coherent derivations from the zero-product axiom, so their quotient families belong to the generated topology. The sheaf semantics of disjunction consequently gives
This is the finite-tuple weak-field property of the generic integral domain. The argument is intuitionistically valid inside the topos, although its description of the site uses ordinary external set theory. There is no appeal to preservation of negation by an arbitrary geometric inverse image.
For the converse assertion, let be any internally nontrivial commutative unital ring satisfying the implication. Assume . If and were both units, multiplying by their two inverses would give , contradicting nontriviality. Therefore
The assumed two-variable implication then gives . Together with nontriviality this is exactly the internal integral-domain axiom. Hence a nontrivial ring satisfying the two-variable case is an integral domain.
For example, the ordinary integral domain fails the one-variable implication at . This does not contradict the generic result: the displayed implication uses negation and is non-coherent, so it need not survive the inverse image that classifies an arbitrary set-based domain.
Take to be the category of finitely presented commutative rings with identity, and put . In its presheaf topos, the tautological ring is generic. The additional domain axioms are coherent sequents, so they are imposed by a quotient-theory coverage on .
Concretely, declare the zero ring covered by the empty family. For every finitely presented and elements with , declare the two opposite quotient arrows associated with
to be a covering family at . These quotient rings are finitely presented. Pullback and transitivity generate a Grothendieck topology from these families. The empty cover forbids ; the two quotient covers make every zero product locally have a zero factor. Conversely, any internal integral domain satisfies exactly the continuity conditions prescribed by these generating covers. Thus
and its generic domain is the associated sheaf , with the ring operations transported through the left-exact sheaf reflector.
This coverage is not standard, meaning not all representables are sheaves; in modern terminology it is not subcanonical. For an explicit obstruction, use and . The two quotient arrows are the same map , so their generated sieve is a singleton cover. Consider the representable on corresponding to :
Its distinct sections and become equal after restriction to . Hence this representable is not even separated for . The nilpotent element has to disappear in the generic domain, which explains this failure of standardness.
Let be a small skeleton of the finitely presented models of an algebraic theory. The classifying topos assertion means that for every Grothendieck topos there is an equivalence
natural under inverse image along geometric morphisms. On the left, morphisms are transformations between inverse image functors, and on the right they are model homomorphisms. A model in interprets the sorts by objects, the operations by arrows, and the equations by equality of the resulting arrows. Finite products suffice for these algebraic operations.
The generic model of an algebraic theory is the tautological covariant functor: for each sort its component is
with all operations interpreted pointwise. Pulling back by a geometric morphism gives its classified model. For a single-sorted theory, this is simply the underlying-set functor with its pointwise algebraic structure.
The orientation is important: is the presheaf topos on , and the generic model is covariant on finitely presented algebras. Such an algebra is a finite-generator, finite-relation presentation. In the algebraic syntactic category it corresponds to the formula imposing its relations, with arrows reversed. The finite-presentability/filtered-colimit description of algebraic models gives the above classifying equivalence; a detailed proof is not needed for this part.
The canonical geometric morphism has inverse image the constant-presheaf functor and direct image the global sections functor
If the presheaf topos is a local topos, is also the inverse image of a geometric morphism . This morphism has an extra left adjoint . Apply part (iii) with source category and target category , using its idempotent-splitting hypothesis. Then is induced by a functor , choosing an object , and is naturally evaluation at .
Since evaluation at is , this says . Uniqueness of representing objects gives . Thus is a singleton for every : is terminal.
Conversely, if is terminal, and . Evaluation at that object preserves finite limits and has a right Kan extension as right adjoint, so is an inverse image functor. Therefore, under the permitted idempotent-completeness assumption,
The key fact is that the extra left adjoint sends each representable to an indecomposable projective object. Let be epic. The inverse image preserves epimorphisms and coproducts, because it is a left adjoint between toposes. Apply it and lift the unit through the resulting epimorphism, using projectivity of . A map from to a coproduct selects one component, by evaluation at and the Yoneda lemma. Thus for some we obtain with .
Transpose across to . The displayed equality says that its composite back to is the identity. This proves the required indecomposable-projective property.
Since idempotents split in , part (ii) supplies objects and isomorphisms . Full faithfulness of the Yoneda embedding transports the action of on representable arrows to a functor . For ,
These identifications are natural in both and . Hence
Its right adjoint is consequently the right Kan extension from part (i), uniquely up to natural isomorphism. Thus the entire geometric morphism is induced by .
A representable functor is an indecomposable projective object. Given an epimorphism , evaluate at . Epimorphisms and coproducts in a presheaf category are pointwise, so is the image of some element of a particular . By the Yoneda lemma, that element defines , and its composite into corresponds to , hence is the identity. The selected component is split epic. More generally, evaluation sends any epimorphism to a surjection, so a map from lifts through any epimorphism; this also proves its ordinary projectivity.
Conversely, every presheaf has the canonical epimorphism
whose component is the natural transformation named by . It is pointwise surjective, since an element at is reached from its own summand at . If is indecomposable projective, one component has a section . The endomorphism of is idempotent and therefore corresponds to an idempotent morphism .
If idempotents split in , choose with , . Then : the mutually inverse maps are and . Thus
Without that hypothesis the argument still proves that every such object is a retract of a representable. The initial presheaf is not indecomposable projective, since its identity is the empty-coproduct epimorphism and has no component to select.
Write and similarly for . The geometric morphism induced by a functor has
Precomposition preserves all pointwise limits and colimits, so in particular it preserves finite limits. The Right Kan extension exists because the categories are small and sets have all small limits; its universal property gives . Thus these functors define a geometric morphism .
There is also , a left Kan extension, with . The Yoneda lemma identifies , since for every ,
This is the representable calculation used in the next parts.
Let be the full subcategory of quotients of decidable objects. It is closed under quotients, by composition of epimorphisms, and under small coproducts, by part (ii). It is also closed under subobjects: pull back a decidable cover along . The resulting cover of has domain a subobject of , hence a decidable object.
The terminal object lies in . If and are decidable covers, their product is an epimorphism . Part (ii) makes its domain decidable. Thus products, and then equalizers as subobjects of products, remain in . The inclusion preserves finite limits.
We construct a coreflective subcategory rather than claim that every object has a decidable cover. For , let be the union of all subobjects of which lie in . The Grothendieck topos is well-powered, so these subobjects form a set. Choose a decidable cover of each and take their coproduct. Its map to has image , so is itself a quotient of a decidable object. Any map from an object of to has image in , and therefore factors uniquely through . This gives
The induced idempotent comonad on preserves finite limits: is a right adjoint and preserves those limits. Its counit is the inclusion , and .
The coalgebras of this comonad are exactly the objects of . A coalgebra structure is a section of the monic counit, forcing the counit to be an isomorphism; conversely an object already in has the unique such structure. Thus . Part (i) now gives
This argument proves the required elementary-topos conclusion without presuming a small family of decidable generators for .

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