Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 23 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , with its degree grading, and let be the polynomial invariant ring. For a compact group average polynomials over ; for a complex reductive group average over its Zariski-dense compact form from part (i). Each degree piece is finite dimensional, so this defines a polynomial and gives the Reynolds operator on a polynomial invariant ringIt preserves degree. For the reductive case compact invariance is full group invariance by Zariski density.
Let be the positive-degree invariants and form the ideal . The Hilbert basis theorem makes a Noetherian ring, so finitely many homogeneous invariants generate as an -ideal. Indeed start with a finite ideal-generating set and collect the finitely many invariants occurring in expressions for those generators; then replace them by homogeneous pieces.
We claim that these same generate as an algebra. For a homogeneous invariant of degree , write with homogeneous coefficients of degree ; terms of negative degree are absent. Apply the Reynolds operator on a polynomial invariant ring to get . The averaged coefficients are invariant and have smaller degree than . Starting from the constants, induction on degree puts them and then in . Taking homogeneous pieces covers every invariant. This proves Hilbert finite generation for reductive invariants:Noetherianity alone would not suffice for a subring; the Reynolds module property is the step that makes the induction work.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 23 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a compact Lie group, take any positive-definite Hermitian inner product on and average using probability Haar measure:It remains positive definite, because the integrand is positive for a nonzero vector, and translation invariance makes it -invariant. If is an invariant subspace, then is invariant too: when . Thus . Induction on dimension proves complete reducibility. This uses the usual continuous finite-dimensional representations of the compact group.
For a connected complex reductive algebraic group, representations are understood to be rational representations. Use a compact real form with . The structural construction takes a compact real form of the semisimple derived factor and the unit circles in the central torus, then passes through their finite central quotient. This is the compact-form structure of a complex reductive group, rather than an assumption that its given representation is already unitary.
The group is Zariski dense: the Lie algebra of its Zariski closure contains the complex span of , hence all of ; connectedness then makes that closure . Average over as above. The orthogonal complement of a -submodule is -invariant. Its stabilizer is a Zariski-closed subgroup, since preserving a fixed subspace is a system of algebraic matrix conditions. The stabilizer contains dense , so it is all of . This again gives an invariant complement to every submodule and provesIf reductivity is defined to allow finitely many components, first obtain a -equivariant projection . Average its conjugates over the finite component group. Since commutes with , the average is independent of coset representatives; it is -equivariant and remains the identity on . Its kernel supplies the required complement. Thus the result holds in that convention too.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 5 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the geometric genus of . Choose an integer . For each prescribed point , both and have degree greater than , so their complementary canonical divisors have negative degree and their complementary Riemann-Roch spaces vanish. The Riemann-Roch theorem therefore givesChoose . This is possible because the two dimensions differ by one. Such a rational function has its only pole at , and its pole order there is exactly . Set .
At all terms except are regular. In a local parameter, the term of order in has a nonzero coefficient, and none of the other terms has a negative-power term. Hence that coefficient cannot cancel. Away from the prescribed points every summand is regular. We obtain the stronger conclusionThus is regular on and has a pole at every . This rational functions with prescribed poles construction works in every characteristic and does not require a generic-coefficient choice. If the prescribed list is empty, a constant function meets the vacuous requirements.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 5 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose and put . The Riemann-Roch theorem givesAs constants supply only a one-dimensional subspace, the Riemann-Roch space contains a nonconstant rational function . It has no poles except possibly at . It must have a pole, since a global regular function on an irreducible projective variety is constant. Let its pole order at be ; then .
On the open set where is regular, define . At its pole use the other affine chart, . The local ring of a smooth algebraic curve is a discrete valuation ring, and the positive valuation of at makes the latter expression regular there. The two expressions agree on their overlap, so they give a regular map .
This map is nonconstant. It is proper because its source is projective and its target is separated, so its image is closed; a nonconstant image in the projective line must be the whole line. Each finite-value fibre consists of zeros of a nonzero rational function , and the infinity fibre is the finite pole set. Hence every fibre is finite, giving a quasi-finite morphism. The proper quasi-finite criterion therefore makes a finite morphism.
Finally its pullback of the infinity divisor is exactly the pole divisor . The degree of a morphism of curves equals the degree of this pullback, or equivalently the function-field extension degree . ThusThe argument includes inseparable maps: the degree here is the full field-extension degree, not just the separable degree. This proves the gonality bound from Riemann-Roch with an explicitly constructed finite regular map.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the elliptic curve, and choose a point to serve as identity. Its geometric genus is one and its canonical divisor has degree zero. For any divisor of degree one, the Riemann-Roch theorem givesSince has degree , its Riemann-Roch space is zero: a nonzero section would produce an effective divisor of negative degree. Hence . Choose a nonzero . The divisor is effective of degree one, so over the algebraically closed field it is a single point . Thus every degree-one divisor class has a point representative.
This representative is unique. If and are linearly equivalent, choose with . Then . That space has dimension one and already contains the constants, so is constant and . Consequentlyis injective. It is also surjective: if represents a degree-zero divisor class, apply the preceding result to to obtain its unique point representative , giving .
The degree-zero Picard group of a curve is a group because divisors add commutatively, principal divisors form a subgroup, and degree passes to the quotient. DefineEquivalently, is the unique point satisfying the linear equivalence of divisors , where the plus signs in this equivalence denote divisor addition. The zero class corresponds to , so is the identity. The inverse of is the unique point with . Associativity follows because both and map to , and is injective; commutativity follows in the same way. Thus this is an abelian group structure on , obtained directly by the elliptic curve group law from Riemann-Roch. The identity choice is part of the construction.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose affine neighborhoods of and of , and orient the given local ring isomorphism asBoth algebras are finitely presented over . Choose finitely many generators of . Their images under are fractions in whose denominators do not vanish at . After inverting the product of those denominators, they define regular functions on an affine open neighborhood of . The finitely many defining relations of vanish as germs at ; each vanishes on a further open neighborhood. Shrinking finitely many times therefore turns those fractions into an actual algebra homomorphism , and hence a morphism of algebraic varieties inducing on the local rings.
A local-ring isomorphism preserves the maximal ideal. Its induced residue-field map is the identity of , because it is a -algebra map. Evaluating every coordinate generator consequently shows . Apply the identical finite-generator and finite-relation construction to to obtain with .
On the composition is defined, and on the composition is defined. Their maps on local rings are the identities. Thus the coordinate differences between and the identity vanish as germs at ; finitely many coordinate generators allow us to shrink to on which actually is the identity. Likewise shrink to on which is the identity. Finally takeThese are open neighborhoods of the specified points. If , then and , so . Conversely, if , then and , so . Therefore the restrictions are mutual inverse regular maps, provingThis proves isomorphic local rings determine isomorphic neighborhoods using actual regular functions and finite presentations. The conclusion concerns neighborhood isomorphisms, rather than just isomorphisms of formal completions.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put , and . Smoothness makes a regular local ring, with residue field . A list of local parameters is a regular system of parameters: its images form a basis of the cotangent space of a local ring . Set . The basis condition says , so the finitely generated module equals . The Nakayama lemma gives
We now construct the requested formal power series, rather than assert that a local function has a convergent expansion. The associated graded ring of a regular local ring isIndeed these initial forms generate the graded ring, since the generate . The Dimension theorem for Noetherian local rings gives . A nonzero kernel in the surjection from the polynomial ring would make its quotient have dimension at most , so that kernel is zero.
For , choose to be its residue at . Inductively suppose homogeneous polynomials have been chosen such thatThe graded-ring isomorphism gives a unique homogeneous polynomial of degree representing the class of in . Subtracting makes the next remainder lie in . HenceThis equality is interpreted in the adic completion of a module . The same induction applies to every compatible sequence of residues in this inverse limit, so evaluation defines an isomorphism . It is injective because the lowest nonzero homogeneous term of a series has nonzero initial form. The Krull intersection theorem gives , so embeds in its completion and the series determines . This is the formal expansion at a smooth point; it depends on the chosen regular system of parameters, and does not claim that the infinite sum converges inside . If , the local ring is just , and only the constant term is needed.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First suppose . The quadratic form has rank , so it is irreducible: a reducible homogeneous quadratic would be a product of two linear forms, whose associated symmetric matrix has rank at most two. Thusis a domain of dimension . Its gradient is , so the Jacobian criterion shows that the only singular point is the origin. Its codimension is , giving regularity at all codimension-one points, the condition.
At every localization the polynomial ambient ring is regular and hence a Cohen-Macaulay ring. The nonzero quadratic equation is a nonzero divisor; quotienting by it decreases both depth and dimension by one. Hence the hypersurface local rings remain Cohen-Macaulay, so their depth is their dimension and in particular at least . This verifies . The Serre criterion for normality now yields , establishing normality of a quadratic cone with all its hypotheses checked.
In characteristic two, . The reduced zero variety is therefore the hyperplane , isomorphic to affine -space, and its polynomial coordinate ring is integrally closed. Thus the reduced variety is normal in this case too. If one instead keeps the nonreduced hypersurface scheme defined by the squared equation, its coordinate ring has a nonzero square-zero class and is not normal. The variety interpretation in the question requires the reduced zero set.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We first prove the local algebra fact behind regularity in codimension one. Let be a one-dimensional normal Noetherian local domain. Choose . Its radical is , so some lies in ; take minimal . If , then . Otherwise choose and put in the fraction field. We have but .
If , express multiplication by on a finite generating set of . The determinant trick gives a monic polynomial in annihilating ; as this ideal is nonzero in a domain, the polynomial itself vanishes. Normality would then give , a contradiction. Hence there is with a unit of . Every satisfies , proving . The maximal ideal therefore has one generator in dimension one, so is a regular local ring, indeed a discrete valuation ring. This proves one-dimensional normal local rings are discrete valuation rings directly.
Now a codimension-one point of the normal variety has such a local ring, and a codimension-zero local ring is a field. Both are regular. Since the algebraically closed ground field is perfect, regularity and smoothness agree for this finite-type variety, and the Jacobian criterion makes the singular locus closed. It contains no codimension-zero or codimension-one point. Therefore every irreducible component of the singular locus has codimension at least two, givingFor this means the singular locus is empty. In particular the singular set itself is the required closed subset, not merely a set contained in some larger one.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose the map were nonconstant. Since projective space is proper, its image is a closed projective subvariety of , of positive dimension . Fix . Regard the map as surjective onto ; the fiber dimension theorem just proved givesChoose a target hyperplane not containing . It meets : the affine cone over has dimension , and the hyperplane equation vanishes at its vertex but not identically. By the principal hypersurface dimension lemma its zero set on the cone has dimension , so it contains a nonzero cone point and hence a point of .
The inverse image is therefore nonempty and proper. Locally the hyperplane equation is a single regular equation, after trivializing the pulled-back line bundle. On the irreducible smooth source it is not identically zero, so the same hypersurface dimension lemma shows that each component of has dimension . Choose one component . Its cone is a codimension-one irreducible closed subset of affine -space, whose prime ideal is principal because the polynomial ring is a unique factorization domain. Thus is a projective hypersurface defined by a homogeneous polynomial of positive degree.
Choose a positive-dimensional irreducible component of . Since , is disjoint from . On the cone over , the equation is consequently nonzero everywhere except at the vertex. This contradicts the hypersurface dimension lemma: the cone has dimension at least two, so its nonempty proper zero set for has dimension at least one and cannot consist just of the vertex. Therefore . The argument proves morphisms from projective space to smaller projective space are constant by combining the fibre bound with the forced intersection of a positive-dimensional projective variety and a hypersurface.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 21 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the usual irreducible algebraic variety convention here, and write , . Fix a closed point and an affine neighborhood of it. Noether normalization gives a finite surjective map . Put . Its fibre is a finite set , one of whose members is , because a finite morphism has finite fibres over closed points.
Choose an affine open meeting . Since is irreducible, still has dimension . In , the fibre of over is cut out by the regular functions . Apply the supplied principal hypersurface dimension lemma successively on each irreducible component: if a function vanishes identically the dimension does not drop, if its zero set is empty the component disappears, and otherwise each new component loses exactly one dimension. Hence every surviving component after the cuts has dimension at least .
But that composite fibre is the disjoint union of . Each member is closed, and since there are finitely many members it is also open in the composite fibre. Thus is a nonempty union of its irreducible components, givingThe same argument around a point on any fibre component gives the componentwise bound. This is the closed-fibre lower bound by finite normalization; it avoids assuming that is smooth or that its point ideal has only generators.
Irreducibility matters if “variety” is generalized to arbitrary reduced reducible spaces. For example can map the first component constantly to zero and the second by the identity. It is surjective, but nonzero fibres have dimension zero while . For reducible sources one uses the individual component dimensions instead; the preceding proof establishes the stated theorem under its standard irreducible-variety convention.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and let be the quotient group homomorphism. The subgroup in the question is exactly the fiber product of groupsEvery specified generator belongs to the right-hand side, so one inclusion is immediate. For the reverse inclusion, diagonal generator pairs produce for every . Alsoso their products and inverses produce for every . If , then and , proving equality.
In particular . Constructing the input pair is effective, so a solution of the membership problem for a subgroup would solve the insoluble word problem for a group in . The subgroup membership problem is therefore undecidable. This is the Mihailova subgroup construction; its finite generating set follows from the finiteness of .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take a recursively enumerable set that is not recursive, for example the diagonal halting set from Question 2 shifted by one. To obtain a finitely generated group with recursive presentation but undecidable word problem for a group, first define the countable Right-angled Artin groupTranslation of the indices gives an automorphism . The semidirect product with its infinite cyclic shift is generated by and has presentationTo verify this presentation, the semidirect product satisfies its relators, while the reverse map sends to ; all translated commutation relations follow by conjugation. These maps are inverse on their generators. Thus embeds in .
For , the word is trivial. For , map to the free generators of and every other to one. Every defining commutator of maps to one, since the only possible relation involving both surviving generators would have separation , which is absent. The resulting group homomorphism sends to the nontrivial reduced word . HenceThis proves the shift-invariant graph groups encode arbitrary sets construction rather than supposing that a missing relator automatically means a nontrivial word. A word algorithm for would decide , so none exists. Since is enumerable, the displayed two-generator presentation is a recursive presentation of a group. By the Higman embedding theorem, embeds in a finitely presented group . A word algorithm for , composed with substitution of the two fixed generator-image words, would solve the word problem for . Therefore .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Messuage lemma for groups is the following effective collapse-versus-embedding statement: from a finite group presentation for and a word , one can algorithmically write a finite presentation such that in makes trivial, whereas makes the specified copy of embed in . It can also be arranged that the image of normally generates . We use this lemma as an assumed construction, as requested; the construction of its presentation does not require deciding which case applies.
Let be a finitely presented group with insoluble word problem for a group, whose existence is allowed. Set , with of infinite order. It is finitely presented, and the normal form theorem for a free product embeds both and the infinite cyclic factor. Thus an input word from is trivial in exactly when it is trivial in , while is certainly infinite.
Apply the Messuage lemma for groups to this . If in , the constructed group is trivial and hence finite. If , it contains and is infinite. ConsequentlyA hypothetical algorithm deciding infinitude from arbitrary finite group presentations would therefore decide every input word in , a contradiction. There is no such algorithm. The infinite cyclic free factor ensures the reduction does not need an additional assumption about the size of .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose has a finite group presentation. Work in the free product and putThe freely generate a subgroup of . Indeed, in a reduced word in these conjugates, combine adjacent powers with the same index. Expanding the remaining word leaves nonzero powers of separated by nonzero powers of , so the normal form theorem for a free product makes it nonidentity. This proves the free conjugate bases in a rank-two free group fact we need.
The group homomorphism killing sends to , including . These are a free conjugate basis by the same argument with interchanged. A nonempty reduced word in the therefore has nontrivial image and cannot be trivial in . Thus extends to an isomorphism between the two rank- free groups embedded in .
Adjoin one stable letter implementing this isomorphism:We assume Britton's lemma, including its assertion that the base embeds in this HNN extension, and the factor-embedding assertion of the normal form theorem for a free product. Hence . The presentation is finite, and its relations express every generator in :Eliminating by Tietze transformations therefore gives a two-generator finite presentation with . This explicitly constructs the two-generator HNN embedding; it does not rely on an arbitrary two-generator embedding preserving finite presentability.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The halting problem asks whether program halts on input , given effective codes for both. Suppose a total decision algorithm returned one exactly when that computation halts. Construct a program which, on input , computes and then loops forever if the answer is one, but halts if it is zero. Let be the code of . If , the specification of makes it diverge, while if the same specification makes it halt. Both alternatives contradict correctness. Therefore the halting problem is . This is a diagonal argument, not merely the observation that individual simulations can run forever.
Let . Simulating the specified program semidecides membership, or dovetailing all simulations enumerates , so is a recursively enumerable set. The same diagonal program rules out a total decision algorithm for . Thus . Encoding a pair also gives an enumerable nonrecursive set of all halting program-input pairs.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A recursive function is a total computable function: an algorithm halts on every input and returns the specified value. Equivalently it is an everywhere-defined member of the partial recursive functions, obtained from the initial zero, successor and projection functions by composition, primitive recursion and unbounded minimization. In minimization , the sequential search must find a zero after all earlier tests have been defined; otherwise the result is undefined. The Church–Turing thesis allows the algorithmic formulation here.
A recursively enumerable set is the domain of a partial computable function. Thus an algorithm halts and accepts exactly on members of , and may run forever on nonmembers. Equivalently an algorithm lists exactly its elements, allowing repetition and allowing an empty output for the empty set. To pass from a listing to a membership semidecision, wait for the input to appear. To pass back, use dovetailing on all inputs and list each whose recognizing computation halts. This differs from a recursive set, whose zero-one characteristic function is total recursive and decides both membership and nonmembership.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The primitive recursive functions are the smallest collection containing zero functions, successor , and coordinate projections, and closed under composition and primitive recursion. The recursion scheme forms from already constructed functions byConstants follow by composing successor with zero. Define addition, multiplication and exponentiation successively byAt each stage the initial and step functions are compositions of primitive recursive functions already available. Induction on gives , , and , with the recursive convention . Composition with the second projection now gives
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use . The two defining relators say that commutes with , hence is central. The given group commutator identities giveConsequently a word collection in a two-step nilpotent group algorithm maintains an integer triple , initially . Reading , with , changes it to ; reading changes it to . Each step uses the displayed multiplication rule and reads one letter, so it terminates and produces the requested expression.
By the stipulated uniqueness, the word is trivial exactly when , which solves its word problem for a group. Moreover the commutator subgroup is : the quotient by is abelian, and itself is a commutator. It is central, so the nilpotency class is at most two. Uniqueness also implies , since and are distinct triples. Hence the exact nilpotency class is .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 2 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The identified involution is . It is central: it commutes with because it is a power of , and with because it is a power of . We use the normal form theorem for an amalgamated free product: the two factors embed, an alternating product of elements outside the amalgamated subgroup is nonidentity, and fixed coset representatives give a unique reduced expression. Here choose representatives in the first cyclic group and in the second.
An effective expression from the normal form theorem for an amalgamated free product iswhere each is a nonidentity representative and successive representatives come from different factors. Reduce powers by and , using these identities for negative integers too. Move the central factors left and reduce their total exponent modulo two. Whenever adjacent representatives come from one factor, multiply them, split off their contribution, and delete a resulting identity. Each such combination reduces the number of representatives, so the procedure terminates. By the normal form theorem for an amalgamated free product, the input is trivial exactly when . In particular because each factor embeds. This gives the soluble word problem in finite cyclic amalgams algorithm without merely asserting that a normal form exists.
In the specified quotient, the extra relator makes commute. Put . Its abelian group presentation givesConversely , satisfy every quotient relator in , and send to . Thus the quotient is exactly , rather than just a cyclic group of order dividing twenty. If are the exponent sums of in the input, its quotient word problem is
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





