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 2014 iii Paper 10 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
An ordinary line contains exactly two points of the configuration. We give a cubic covering from few ordinary lines by using point-line duality, a defect count and cubic interpolation. Cubics may be reducible: a line with equation is contained in the cubic , and a conic can be multiplied by a linear factor.
Pass to the real projective plane, which preserves collinearities and ordinary-line counts. If all points are collinear, one cubic already suffices. Otherwise dualize each point to the line . The dual lines form an embedded graph : its vertices are their intersections and its edges are the consecutive segments on each projective line. A vertex where dual lines meet has graph degree and corresponds to a primal line containing points.
Let count vertices incident to exactly dual lines, and let count faces with sides. In particular . If are the graph's numbers of vertices, edges and faces, thenThe Euler characteristic of the projective plane is one, so . Substituting the counts gives the Euler defect identity for a projective line arrangementThus both sums measuring departure from a degree-six triangular grid are .
Call an edge a good dual-arrangement edge if both endpoints have degree six and both adjacent faces are triangles; call it bad otherwise. Count all edge incidences at the defective vertices and faces. Since for and for ,This controls actual bad edges, not merely the number of defective vertices.
Strengthen the local condition: an edge is a safe dual-arrangement edge if every edge on every path of length at most two from either endpoint is good. The bounded-radius propagation of edge defects says that only edges fail this test. Indeed, trace from an unsafe edge to the first bad edge. Every intervening edge is good, so the intermediate vertices have degree six. Reversing such paths offers only a bounded number of choices, at most a fixed constant times the bad-edge count. Every edge belongs to exactly one dual line, so the pigeonhole principle gives a dual line containing only unsafe edges.
The algebraic input is cubic propagation along a triangular strip: a consecutive strip of safe edges on has all of its crossing dual lines represented by primal points on a single cubic. Here is the mechanism, rather than an appeal to the desired covering theorem. The triangles on either side extend two cells outward into three indexed line families. After dualizing back, their points satisfy collinearities whenever . Adjacent three-by-three blocks are the eight-point cubic completion for two triples of lines configuration. A nonzero homogeneous cubic can be fitted to nine starting points because its coefficient space has dimension ten; each successive block has eight points already on that cubic and forces its remaining point onto it. Continuing along the strip keeps every crossing point on the same cubic. One concrete seed is . The first overlapping block forces , the next forces , and the next forces ; another block then forces . Alternating these completion steps extends the and families for the full length of the strip.
For clarity, the completion fact has a short algebraic proof. Let and , with the two line triples meeting in nine distinct points, and let a cubic vanish at all but . On , both and have the same three zeros, so is divisible by for a suitable scalar . Its quadratic quotient vanishes at the three intersections on , hence is divisible by . The remaining linear quotient vanishes at the two known intersections on , hence is a multiple of . Thuswhich also vanishes at the ninth point. This is the line-triple case of the Cayley-Bacharach theorem. In the strip construction, degree-six vertices and the two-cell neighbourhood ensure that the local nine points are distinct; the initial nine-point interpolation and repeated completion provide the required cubic.
It remains to account for every point, including defects and degeneracies. If some dual line has at most two distinct intersection vertices, all other dual lines pass through one of them. Dualizing back covers by at most two primal lines, hence by cubics, and we are done. Otherwise every dual line has at least three vertices, and the local strip construction applies.
On the chosen , cut the cyclic edge sequence at its unsafe edges, adding one arbitrary cut if necessary. There are at most safe runs, each covered by a cubic via the strip argument. Intersection vertices incident to cut or unsafe edges number at most . At each such exceptional vertex , all crossing dual lines represent primal points on the single primal line , which is itself contained in a cubic. Include one further cubic through if it has not already been covered. Every other primal point is accounted for by where its dual line intersects . ThereforeThe absolute bound on comes from and does not depend on the number of points. This completes the requested proof sketch.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 10 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
(A) Use the dimension of a bounded-total-degree polynomial space. The monomials with are a basis, and stars and bars givesFor a finite point set, the polynomial evaluation map on a finite point set isIts kernel is and its rank is at most , even when some conditions are dependent. The rank-nullity theorem therefore givesThe original PDF specifies here. With twelve points,No general-position assumption is required.
(B) Let . We seek a polynomial vanishing on a finite set of spatial lines. For each line , choose an affine parametrization with . The polynomial restriction to a line of a degree-at-most- polynomial has formEach coefficient is a linear functional of . Setting all coefficients to zero is precisely the condition that vanish identically on .
All lines together therefore impose at most homogeneous linear conditions on the -dimensional coefficient space. A nonzero solution exists wheneverTake . Then , so this strict inequality holds. MoreoverThus the polynomial method in combinatorics givesEquivalently, one could impose vanishing at distinct points on each line and use the univariate root bound to force the entire restriction to vanish. For an empty line family, the constant polynomial one supplies vacuous vanishing; the strict degree comparison is understood for nonempty families.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 10 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
(A) For a finite point set and a family of distinct unit circles in , the Szemerédi–Trotter theorem for unit circles stateswith an absolute constant . Here counts point-circle incidences. Distinctness matters: repeated copies of the same circle are not separate members of this geometric family. A dilation gives the same bound for circles of any one fixed positive radius, with the same constant.
(B) Write and . The comparison is a bound on the cardinality of the distinct-distance set, rather than on the set itself. For each positive distance , take the circles of radius centred at points of . Their incidences between points and curves count exactly the ordered pairs at distance . After dilation by , part (A) bounds this number byEvery ordered pair of distinct points contributes to exactly one of these counts. Thus the unit-circle method for a distinct-distance lower bound givesFor , , soFor the distance set is and the conclusion holds after adjusting the absolute constant; the empty set causes no difficulty.
(C) A direct incidence bound from two-point multiplicity suffices. Put and . Count unordered pairs of distinct points on each curve. By double counting,Writing , this givesThe Cauchy-Schwarz inequality now yieldsIf with , then . ConsequentlyIn fact the argument proves the stronger bound. The two-point multiplicity hypothesis alone controls these incidences between points and curves; the algebraic degree bound is not needed for the requested estimate.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Set , a multiplicative subset. The localization at a prime ideal is , whose elements are fractions . Equality of two fractions means that for some . Likewise the localization of a module is , withAddition uses a common denominator, and the module action isThe equivalence relations make these operations well-defined, so is an -module.
If , choose . Its annihilator is proper, so it lies in a maximal ideal . The element cannot vanish in : vanishing would mean for some , contrary to . The converse is immediate by localizing the zero module. ThusThis proof of localization detects zero elements actually applies to arbitrary modules, without finite-generation or Noetherian assumptions. We will use that extra generality for an Ext functor module below.
An injective module has the extension property: for each inclusion , every map extends to a map . Equivalently, is exact. A projective module has the lifting property: for each surjection , every map lifts to . Equivalently, is exact, or is a direct summand of a free module.
For the local criterion for injectivity over a Noetherian ring, recall the Baer criterion: is injective precisely when every map from an ideal into extends to . Through the short exact sequence , this is equivalent toWe also need localization of Ext over a Noetherian ring. Because is Noetherian, the module has a free resolution with every term finitely generated: all successive kernels are finitely generated, so this can be built recursively. For a finite free term , the natural mapis an isomorphism, as is clear from a finite basis. Exactness of localization lets us pass to cohomology of the Hom complex. ThereforeThis explains the finiteness hypothesis needed for the localization argument, rather than assuming that localization preserves injectivity automatically.
If is injective, the left-hand side vanishes for every and . Every ideal of is , where is its contraction to : if , then , and conversely localization of a member of the contraction stays in . Hence all ideal tests for vanish, and the Baer criterion over makes injective.
Conversely, suppose every is injective. For each ideal , the displayed Ext functor localization is zero at every prime. The zero-detection argument above gives , without needing this Ext module to be finitely generated. Applying the Baer criterion over provesIn fact, under the Noetherian ring hypothesis this equivalence holds for arbitrary ; the printed finite-generation assumption is more than is needed.
The global dimension iswhere projective dimension is the smallest length of a projective resolution, or infinity if there is no finite one. If , every module is projective. Given an inclusion , the quotient is then projective, so the exact sequence splits. A retraction exists. For any module and any map , the composition extends . Thus every module is also injective. Global dimension zero makes all modules both projective and injective, as recorded by global dimension zero and split exact sequences.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The integral closure of in isIt is a subring: finitely many integral elements generate a finite -module algebra, and the determinant trick shows that each element of that algebra is integral. In particular, sums and products of integral elements remain integral.
A valuation ring is an integral domain such that, for every nonzero in its fraction field, either or . Equivalently, its ideals are totally ordered by inclusion. For principal ideals, comparability is precisely the condition on ; if two arbitrary ideals were incomparable, elements chosen from their differences would contradict principal-ideal comparability. Such a ring is local. Its nonunits form an ideal: if are nonunits and, for example, , then is still a nonunit. The unique maximal ideal consists of those nonunits.
First, valuation rings are integrally closed. If , then is a nonunit and lies in its maximal ideal . A monic relation for over , multiplied by , would givewhich is impossible modulo . Therefore every element integral over belongs to every valuation subring of containing .
For the reverse inclusion, we will construct a valuation overring that excludes any chosen nonintegral element. We need the valuation domination lemma: a local subring of a field is dominated by a valuation subring of , meaning and . Here is a proof, including the crucial maximality step.
Order the local subrings of dominating by domination. For a chain, take the union of the rings and of their maximal ideals. The union is a local ring: an element outside the union ideal is already a unit in a member of the chain, while an element in that ideal cannot become a unit in a later dominating member. The union still dominates . Thus Zorn's lemma supplies a maximal pair .
For any , at least one of and is proper. Suppose otherwise. There would be relationswith chosen minimal. Both are positive. Since and are units, normalize the relations to have zero constant term and left-hand side one. If , the second relation givesRepeatedly substituting this monic reduction in the first relation yields a relation for of degree less than , with every coefficient still in . This contradicts minimality of (or gives if the degree is zero). If , interchange and and use the first relation to reduce the second, contradicting minimality of .
Choose whichever extension has a proper extended ideal, then a maximal ideal containing it. Localizing that extension at the chosen maximal ideal produces a local ring dominating . If both and were outside , this would be a strict enlargement, contradicting maximality. Thus has the valuation property. In particular its fraction field is all of , since each nonzero element of or its inverse belongs to . This proves the valuation domination lemma.
Now let be nonintegral over , so , and set , . The ideal is proper: otherwise , and multiplication by gives a monic equation for over . Choose a maximal ideal of containing , and apply the valuation domination lemma to . Its dominating valuation ring contains and has . Hence is not invertible in , so .
We have excluded every nonintegral element from at least one valuation overring, while every integral element belongs to all of them. Therefore the integral closure as an intersection of valuation rings isNeither Noetherianity nor a discrete valuation is required for this separation argument.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the following finite-length version of the Hilbert-Serre theorem. Let be a graded algebra generated over an Artinian ring by finitely many homogeneous elements of positive degrees . For a finitely generated nonnegatively graded -module , define its Poincare series of a graded module byEvery component has finite length, and the theorem saysFor a module whose grading is merely bounded below, the same statement holds with a Laurent-polynomial numerator. When the generators all have degree one, the denominator is .
Here is an induction proof. An Artinian ring is Noetherian by question 1, so the Hilbert basis theorem makes Noetherian. If there are no positive-degree generators, and a finite homogeneous generating set for occupies only finitely many degrees. Each component is a finite module over the Artinian ring , hence has finite length of a module, and is a polynomial.
For , put , , and . Both are finitely generated graded modules annihilated by , hence modules over , which is generated by the first homogeneous elements. Their multiplication exact sequence isHere . Additivity of length degree by degree givesThis is the Hilbert series multiplication exact sequence. By induction, the right-hand side has denominator . Division by completes the proof of the Hilbert-Serre theorem. The finite-component and finite-generation claims also follow from the finite set of positive-degree algebra and module generators; no analytic convergence of a series is involved.
For the local invariant, use the usual Noetherian local ring hypothesis of Hilbert–Samuel growth dimension. Locality alone does not guarantee finite lengths or polynomial growth; the printed question leaves this finiteness assumption implicit. For instance, in the localization at a prime ideal of the polynomial ring at , the vector space has the infinitely many independent classes of the variables, so its length is not finite. Write and . Its associated graded ringis generated over in degree one, because is finitely generated. Thus its Hilbert series is rational with a denominator that is a power of . After cancelling factors, writeDefine , the pole order at , with when is a polynomial.
Equivalently, the Hilbert–Samuel functionhas generating series and eventually agrees with a polynomial of degree . Indeed, coefficients of are , and multiplication by leaves leading term . Consequently is the degree of the cumulative Hilbert-Samuel polynomial, rather than the degree of the individual graded-component function; the latter has degree when . This pole/growth invariant also equals Krull dimension by the local dimension theorem, although that theorem is not required to define it here.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An integral extension means that every element satisfies a monic polynomial with coefficients in :The Krull dimension is the supremum of the lengths of strict chains of primes:There need not be a finite bound on these lengths.
Here are the prime-ideal facts behind dimension preservation, with their relevant proofs. If a domain is integral over a subdomain and is a field, then is a field: for , a monic equation for , multiplied by a suitable power of , expresses as an element of . Conversely, an integral domain integral over a field is itself a field: a nonzero element has a polynomial equation with nonzero constant term after removing any factor of the indeterminate, and that equation expresses its inverse. Applied to quotients, these observations show that a prime in an integral extension is maximal if and only if its contraction is maximal.
For the Lying-over theorem, localize at . The inclusion remains injective and integral, and is nonzero. Any maximal ideal of contracts to the unique maximal ideal of , by the field criterion just proved. The prime ideal correspondence for localization then gives a prime of contracting to .
For the going-up theorem, suppose lies over and . The quotient inclusion is integral. Apply Lying-over theorem to the prime ; lifting back gives contracting to .
For the incomparability theorem for integral extensions, suppose contract to the same . After localizing at , both are maximal ideals, because they lie over the maximal ideal of . Their inclusion is therefore equality. The bijection between primes under localization gives .
Now contract a strict chain of primes in . Incomparability theorem for integral extensions ensures that every contraction remains strict, so . Conversely, Lying-over theorem lifts the first member of any finite chain in , and repeated going-up theorem lifts the remaining members; different contractions ensure a strict chain in . Taking suprema, including the possibility of infinity, givesThis proves that integral extensions preserve Krull dimension.
For the given quotient, put . The relation is monic in , so monic polynomial division gives a unique representative . Thus is injective and is free of rank two as a -module. In particular, is integral over . The one-variable polynomial ring has dimension one: its zero prime is strictly below , and every nonzero prime is maximal because is a principal ideal domain. HenceThis is an instance of dimension of a monic plane hypersurface. No irreducibility or algebraic-closure assumption on is needed; monicity supplies the integral extension in every characteristic.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A prime ideal is minimal over if and no strictly smaller prime contains . An associated prime of a module is an annihilator of an individual nonzero element which happens to be prime. For the quotient module this readswhere . This is the annihilator of an individual element, rather than necessarily the annihilator of the whole quotient.
Minimal primes exist because is proper. First choose a maximal ideal containing . Within the primes contained in it and containing , an intersection of any decreasing chain is again prime. Indeed, if is in the intersection and is absent from one member, then belongs to that member and to every smaller member; it also belongs to every larger member. The intersection is still proper and contains . Zorn's lemma, applied with reverse inclusion, produces a minimal prime. This proves existence of minimal primes over a proper ideal, even without the Noetherian hypothesis.
Now fix a minimal prime and put . The localization at a prime ideal is nonzero and is a Noetherian local ring. By prime ideal correspondence for localization, its only prime is . Write this maximal ideal as . It is the nilradical; since it is finitely generated and each generator is nilpotent, some power of is zero. Explicitly, if its generators have nilpotence exponents , every product of degree vanishes.
Choose the smallest such that , and choose a nonzero element in ; when , choose . Its annihilator over is exactly . Represent it as with . Multiplication by the unit shows that has the same annihilator and remains nonzero.
Let generate in . For each , the equality supplies such that in . Put and . Its localization is nonzero, so , and every element of kills it. Conversely, an element outside becomes a unit and cannot kill the nonzero element . ThereforeThe key step in minimal primes are associated primes is clearing denominators for a finite generating set of ; that is where Noetherianity is used.
For an embedded associated prime, take and . Its radical is , so is its unique minimal prime. The nonzero class of satisfiesIndeed, is equivalent to by cancellation in the polynomial domain. Thus is associated but is not minimal, since . For comparison, , exhibiting the minimal associated prime as well.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 1 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A ring is Artinian when its ideals satisfy the descending chain condition: every chain eventually becomes constant. It is Noetherian when its ideals satisfy the ascending chain condition, equivalently when every ideal is finitely generated. We first prove finite length of a commutative Artinian ring; this gives the stronger structural reason for its Noetherian property.
If is a prime ideal of an Artinian ring, the quotient is an Artinian integral domain. For a nonzero element of that domain, the chain stabilizes. Thus for some , and cancellation gives . The quotient is a field, so every prime ideal is a maximal ideal.
There are only finitely many maximal ideals. Otherwise, choose distinct ones . The intersections form a strictly descending chain. To see strictness, for each choose ; their product belongs to the first ideals but not to the next one, since is prime. This contradicts the descending chain condition.
Put . This Jacobson radical is also the nilradical, since all primes are maximal. We need the stronger conclusion that is nilpotent, without assuming Noetherianity. Its powers stabilize, say . Suppose . By the descending chain condition, choose an ideal minimal subject to . Some has , so minimality gives . Moreover , and minimality gives . Hence for some . But is a unit: it cannot lie in any maximal ideal, because lies in all of them. Thus , a contradiction. Therefore .
The Chinese remainder theorem gives , a finite product of fields. Each quotient is an Artinian module over this product, and each field component must be a finite-dimensional vector space; an infinite-dimensional vector space admits a strictly descending chain of subspaces. Consequently every layer has finite composition length. The finite filtrationshows that itself has finite composition length. A strict inclusion of submodules strictly increases length, so an ascending chain cannot continue indefinitely. Every commutative Artinian ring is therefore Noetherian. This is the Artinian rings are Noetherian result.
For the formal power series ring, let with Noetherian, and let be any ideal of . For define a coefficient idealThese coefficient ideals of a formal power series ideal satisfy , by multiplication by . The ascending chain condition gives for all . For each , choose finitely many series whose coefficients at generate .
We claim that these finitely many series generate as an ordinary ideal. Given , cancel its coefficient at successively. After coefficients below have vanished, its coefficient at lies in . If , use an -linear combination of the . If , use a combination of , since . The remainder then belongs to .
Collect all the cancellations against each fixed generator. For its multiplier is a polynomial, while the multipliers of the are well-defined formal power series: at any fixed degree, only finitely many cancellation steps contribute. The remainder has every coefficient zero. ThusThis is a finite sum of ideal generators, rather than merely a topological closure assertion. Since was arbitrary,This coefficient-cancellation argument proves Noetherianity of a formal power series ring.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 9 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a finite collection of distinct affine lines in a vector space in , , a joint is a point incident to lines whose direction vectors are linearly independent. The joints theorem assertsIn the customary three-dimensional formulation this is , with three noncoplanar incident lines at every joint. We prove the general form, which includes that formulation.
Let and . The conclusion is immediate when . Otherwise set . Suppose for contradiction that . Repeatedly delete any line incident to at most of the currently retained joints, deleting those joints at the same time. Each deleted line loses at most current joints, so even deleting all lines could lose at most joints. Therefore the process must stop with a nonempty set and a line collection such that each retained line contains more than retained joints. Every retained joint still has its original independent incident lines: if any line through it had been deleted, the joint would have been deleted too.
There is a nonzero multivariate polynomial of total degree at most vanishing on , becauseChoose such a polynomial of smallest possible total degree . This is an application of the polynomial method in combinatorics. Every line of contains more than roots of a polynomial of its polynomial restriction to a line, so vanishes identically on every such line.
At a retained joint , differentiating along each of its independent line directions gives . Their linear independence therefore forces . Each partial derivative of vanishes on all of and has smaller total degree. Minimality of forces every partial derivative to be the zero polynomial. Over the real numbers, a polynomial with all partial derivatives zero is constant; a nonzero constant cannot vanish on the nonempty . This is the required contradiction.
It follows that . Since for ,This proves the joints theorem by the pruning and minimal-degree polynomial argument.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 9 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Set and , so that . The dimension of a bounded-total-degree polynomial space in variables over is . If were smaller than this dimension, evaluation at the points of would impose fewer homogeneous linear conditions than unknown coefficients. The rank-nullity theorem would give a nonzero multivariate polynomial of total degree at most , vanishing on .
For every , select one of the promised rich affine lines in a vector space through , and write it as with . The polynomial restriction to a line has degree at most , and at least distinct roots of a polynomial from . By the root bound for a polynomial, is identically zero, so . Since this works for every , vanishes at all points of .
The Schwartz-Zippel lemma says that a nonzero multivariate polynomial of total degree has at most zeros on this grid. Here , so that count is strictly less than , a contradiction. The distinction between a formal polynomial and its function on a finite field is crucial: our degree bound is what rules out a nonzero polynomial vanishing everywhere.
We have proved the stronger quantitative rich line covering bound over a finite fieldThus , as required. The implied constant may depend on the fixed dimension . The very large numerical lower bound on is more than this proof needs.
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





