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 2009 iii Paper 72 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , and . For the exact solution of the advection equation, the three left-hand samples are translations by , and relative to ; the right-hand samples are translations by zero and .
Denote their coefficients by , , , and . Taylor expansion compares momentswhere in the zeroth moment. Direct calculation givesThus the unscaled exact-solution residual isFor fixed nonzero , dividing by the time step yieldsThe scheme is therefore third order under fixed-Courant refinement, with an unscaled one-step defect of order four. Stability then gives third-order accumulated error for smooth data with periodic boundary conditions. Calling the unscaled defect fourth order is a different convention, not fourth-order approximation of the differential equation.
At , the amplification factor in (b) becomes exactly : the numerical step translates the grid data by that integer number of cells and is exact for this constant-speed advection equation. At it is the identity, a zero-time-step limit. These are exact special shifts, rather than merely a cancellation of one term of the Taylor expansion. This is the implicit advection scheme with exact integer shifts.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 72 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For this two-step family with a third-order member, use the exponential-symbol order criterion for a multistep method. Expanding the exact-solution residual symbol givesThe constant, linear and quadratic coefficients vanish for every parameter. ThusAt the exceptional value the fourth-degree coefficient is , so there is no further increase. This means an unscaled exact-solution residual of order , or a residual divided by the step of order .
The first characteristic polynomial factors as . The root condition for a multistep method requires every root to have modulus at most one and each unit-modulus root to be simple. The root is allowed because it is distinct from the simple root one; is not, since it makes one a double root. Hence zero-stability holds exactly forOn this interval, and establish consistency of a numerical method. The Dahlquist equivalence theorem, for a fixed-step consistent linear multistep method applied to an ordinary differential equation with a Lipschitz continuous right-hand side with convergent starting values and well-defined small-step updates, says that convergence of a numerical method is equivalent to zero-stability. Therefore the same interval is exactly the convergence of a numerical method range. With sufficiently accurate starting values the convergent members have the orders just computed.
At the Taylor expansion still gives a formal order-two residual, but and the double root prevents a convergent method. Canceling the common factor produces the common-factor cancellation defect in a multistep recurrence and changes the starting relations and cannot repair convergence of a numerical method of the original recurrence. At , cancellation of a zero root instead reveals the ordinary trapezoidal rule; it is consistent with the order-two result.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 72 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take a uniform finite element mesh , , , and interior piecewise-linear hat functions . Write . The Ritz method gives withThe derivative part has diagonal , neighboring entries and zero other entries. For the affine-weighted hat mass matrix, symmetry around givesOn , the product of the two hats is symmetric about the midpoint, integrates to , and therefore has weighted integralConsequently the explicit tridiagonal equations arefor , with . The reaction coefficient has been integrated exactly; replacing it by an unweighted constant mass matrix would give a different system. For a nonzero coefficient vector, the represented function is nonzero and , so the matrix is symmetric positive-definite and the algebraic solution is unique.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 72 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Multiply by a test function vanishing at the endpoints and apply integration by parts. The positive operator is , so the forcing changes sign. The weak formulation of this forced Airy boundary-value problem is: find such thatHere is the zero-boundary Sobolev space and can be equipped with . The interval Poincaré inequality states , so this norm makes a Hilbert space and is equivalent to its usual Sobolev norm. The form is symmetric and satisfiesThe Lax-Milgram theorem says that a bounded coercive bilinear form on a Hilbert space and a bounded linear functional determine exactly one weak solution. All its hypotheses have just been verified. Moreover, gives on the interval; the right-hand side is then continuous, so this weak solution is the classical solution with the prescribed endpoint values.
Since the form is symmetric, the equivalent Ritz method minimizesIndeed, stationarity gives the weak equation andwith equality only at . This proves the minimization equivalence, including the sign of the linear term.
Restricting to a conforming finite element space gives a unique discrete solution and Galerkin orthogonality, for every . The Céa lemma states that if the continuity and coercivity constants are and , then . For this symmetric problem the exact best-approximation constant in the energy norm is one. The piecewise-linear finite element interpolation estimate on regular finite element meshes therefore gives convergence of a numerical method of the Ritz method, with first-order error in the energy norm.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 71 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix . In the representation from (c), the finite-horizon extension of a boundary transform allows to be replaced by . To see this directly, their difference contributesIt has an holomorphic integrand inside ; there , and the factors and allow the contour to be closed. Its integral is zero for . This replacement puts the observation-time dependence entirely in .
Every such exponential satisfies the linear dispersive Stokes equation, becauseConsequently the representation satisfies the partial differential equation. The stipulated smoothness and decay justify the differentiated oscillatory integrals, or equivalently their regularized limits. The fixed horizon is useful here: no artificial source term arises from differentiating the endpoint of a time transform.
At , use the original version. The integral vanishes after closing inside , since is holomorphic there and . Fourier inversion of the initial half-line transform therefore givesFor the boundary trace use the fixed-horizon version, with . First consider the initial-data terms at . Differentiating givesThus changing variables separately in the two pieces of the integral giveswhere goes from lower-left infinity to , across to , and then to lower-right infinity along . For completeness, on the upper-right curved edge one root maps onto the real ray and the other onto the lower-right curved edge. On the upper-left edge the corresponding images are and the lower-left edge. The middle segment maps to the remaining real intervals and . These real images cancel the outer pieces of the original real-axis integral, leaving exactly with the stated orientation.
This contour bounds the lower-central region , . The spatial transform is holomorphic there and decays on its closing arcs for . Its integral is therefore zero by the Cauchy integral theorem. The initial-data part of the boundary trace vanishes.
In the remaining boundary integral, use . Along the oriented , traverses the imaginary axis once from to . On its real segment, the imaginary part runs from to ; the two curved edges supply the complementary intervals. It follows thatThe last equality is ordinary temporal Fourier inversion, after . Because is strictly inside it gives the full value, not a truncated-transform endpoint half-value. ThusCompatibility makes the two traces agree at the corner. Spatial decay follows from the upper-contour exponential and nonstationary oscillatory estimates on the real integral as , under the assumed data decay.
The decaying smooth solution is also unique. For a zero-data difference , integration by parts in the linear dispersive Stokes equation givesusing and decay at infinity. The initial norm is zero, so . This completes verification of the initial value, boundary value and governing equation.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 71 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The dispersion relation has two additional arguments with the same value. Indeed,Thus use the cubic Stokes dispersion symmetryBoth roots are in the lower half-plane for . At , , their imaginary parts are . A root cannot cross the real axis in , since a real root would make . Continuity therefore proves the claim throughout this connected domain. The branch points are outside ; interchanging the two root labels does not change the formula below.
Evaluate the global relation at each , where its analyticity requirement holds:The left side is linear in . Interpolate it to the argument with weightsThey satisfy and . HenceFor the last coefficient, useadding and subtracting the interpolated gives .
The remaining solution-transform contribution is . Its integrand is holomorphic in : the transformed arguments remain in the lower half-plane. The weights are bounded at infinity, and supplies decay on the upper closing arc for . The Cauchy integral theorem therefore makes this integral zero. PutThe Dirichlet spectral representation for the linear dispersive Stokes equation is nowAll quantities in this expression are transforms of the prescribed initial and boundary values. Neither derivative trace remains.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 71 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Define the negative-exponential Half-range Fourier transformswhich are holomorphic for . Write and define the finite-time spectral boundary transformsIntegrate the local relation over , . The spatial boundary term at infinity vanishes by decay, and the term at is subtracted. Consequently the half-line linear dispersive Stokes global relation isFourier inversion on the real axis gives an initial-data integral plus an integral of . To put the boundary term on a complex contour, setFor , , so is the connected upper domain , . Orient with this domain on the left: from upper-left infinity down to , along the real segment to , and then to upper-right infinity.
The finite-time spectral boundary transforms are entire functions. In the upper regions outside , where , their time-integrated factors satisfy for . Together with , this permits contour deformation of the two remaining real-axis pieces to the curved boundary of . The resulting representation isThe contour orientation accounts for the plus sign in this convention. This formula still contains the two unknown derivative traces through .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 71 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the linear dispersive Stokes equation with time variable . Put . Expanding the required local relation givesChoose . Direct differentiation then yieldsThe unwanted coefficient of cancels precisely when . HenceWith these choices, the local relation is exactly for every complex spectral parameter for a linear boundary value problem.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and . Each is an entire function: on any compact set of , differentiation under this finite-interval integral is justified by a bounded integrable majorant. We prove , which gives ordinary convergence of the improper integral, not just an Abel limit.
Fix . Since contains the imaginary segment from to and is open, choose so small that its closed left strip of width belongs to . Let be the right semicircle oriented from to , and let be the left half-ellipse , , oriented back to . The enclosed right half-disk and thin left region lie in . The residue theorem, applied to the analytic difference with its simple pole at zero, givesFor ,On the right circle, and . The exponential cancels the displayed damping, so the absolute integrand per unit arc length is at most . The right-arc contribution is therefore at most after the factor .
For the term on , deform that left path to the left semicircle of radius . The Cauchy integral theorem allows this because is an entire function and the region between the paths excludes the pole at zero. On , andThe same factor bounds this contribution by . The arc endpoints can be omitted from the estimates, since they have zero arc length and the integrands are continuous there.
Finally, the term on the original tends to zero as . This compact path stays away from zero, so is bounded there. Its interior has , hence , and . Dominated convergence on the finite-length path gives the claim. Combining the three pieces yieldsSince is arbitrary, the difference tends to zero. This proves the Newman Tauberian theorem in the required setting; the proof crucially uses analytic continuation across every finite segment of the imaginary axis.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The improper integral is assumed to have a finite limit. Fix and put . Convergence implies and as . By monotonicity,andThusBoth outer bounds tend to one as , giving . This monotone integral Tauberian lemma uses monotonicity to control the value at a point from integral averages on adjacent multiplicative intervals; convergence of the integral alone would not control arbitrary local spikes.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In this part identify with the complex unit circle by . Write the finite abelian group additively and let , with pointwise multiplication, be the character group of a finite abelian group of . A linear character has modulus one, since its values have finite order. We first prove the extension and counting facts needed for Fourier analysis on a finite abelian group.
If , , and , let be the least positive integer with . Choose with and defineThis is well-defined: two representations differ by and , whose contributions cancel. It is a group homomorphism and extends . Conversely every extension has this form, and the equation for has exactly distinct roots. Since , successive adjunctions prove that each linear character of has exactly extensions. Taking gives . This is the extension of a character across a cyclic quotient, proved here without a structure theorem. Extending the linear character sending a nonzero element of order to also proves that linear characters separate points of .
Use the normalized inner product . For a nontrivial linear character , choose with . Translation of the sum gives , so that sum is zero. Applying this to givesThere are such orthonormal vectors in the -dimensional space , so they form an orthonormal basis. Define the Fourier coefficients by . Expanding in that basis proves Fourier inversion on a finite group and the Parseval identity on a finite group:For normalized convolution , changing the finite summation variables yields . Translation multiplies its Fourier coefficient by . These formulas fix all normalization and conjugation conventions.
The PDF's double-hat identification is canonical Pontryagin duality: define by . This is a group homomorphism and is injective because linear characters separate points. Applying the already proved character-counting result to shows that both groups have size , soThe TeX loses one hat. For completeness, the single-dual isomorphism also holds, but is generally noncanonical. Here is a proof including the needed finite cyclic decomposition. Choose an element of maximal order . Every element order divides : for two elements, extract their prime-power components by integer multiples: if an element has order and is the exact power of in , multiplying it by gives order . Then combine the components with the larger order for each prime. Components of coprime orders have a sum of product order, because their cyclic subgroups have trivial intersection. This constructs an element of order the least common multiple of the two original orders, which cannot exceed maximal ; hence each order divides .
Extend the primitive linear character of to . All its values are th roots because all element orders divide . Define when . This is a group homomorphism fixing , and shows . Induction on group size decomposes into finite cyclic groups. A cyclic group of order has precisely the linear characters and hence a character group of a finite abelian group isomorphic to itself. The dual of a finite direct product of groups is the product of its factor duals, since a linear character is determined by its restrictions. This proves after choices of cyclic factors and generators, without using an unproved finite-abelian-group structure theorem.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Minkowski convex body theorem states that a centrally symmetric convex measurable set in of volume greater than contains a nonzero point of the full lattice . For a compact convex body, the weak inequality also suffices: apply the strict version to , let , and choose a constant subsequence of the resulting lattice points in the bounded set . Its nonzero value belongs to by closedness.
For , apply this borderline version with toThe linear transformation has determinant of absolute value one, so this parallelogram has area four. A nonzero lattice point satisfies and . If , then , giving the forbidden zero point; hence . It follows thatIf is irrational, these pairs cannot remain in a finite set as : the positive errors of any such finite set have a positive minimum, contradicting their bound . If is rational in lowest terms with , the pairs for have zero error and are infinitely many distinct pairs. This proves the assertion for every real .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The necessary and sufficient condition isEquivalently, are linearly independent over . This is the equidistribution criterion for a torus translation.
For sufficiency, set . For a nonconstant character of the torus the condition gives , and the geometric series formula yieldsThe constant torus character has average one. Thus orbit averages converge to integrals against normalized Haar measure for every trigonometric polynomial. Part (i) and a uniform approximation bound extend this to every continuous function : the difference between the orbit average and the integral for differs from that for an approximating polynomial by at most twice their uniform distance.
For a nonempty half-open rectangle , choose continuous functions with values in and arbitrarily small. One can take distance cutoffs: vanishes at the boundary and rises to one inside, while is one on the closure and falls to zero outside a thin neighborhood. Their difference is supported in shrinking neighborhoods of the rectangle's finitely many boundary segments, which have Haar measure zero. Squeezing the orbit averages between the two continuous averages gives the normalized area . Empty rectangles are immediate, and full-circle coordinate intervals can be treated with the constant cutoff in that coordinate.
For necessity, if a nonzero pair is resonant, every orbit point lies in the closed set . This is a proper subset because the torus character is nonconstant. Its open complement contains a rectangle of positive area in a coordinate chart, which can be chosen inside the standard coordinate square. That rectangle is never visited, contradicting the required positive limiting frequency. Hence the boxed condition is necessary as well as sufficient.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 7 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use and normalized Haar measure on the torus. Here means distance to zero modulo , represented in ; an ordinary coordinate in would not express concentration at the origin correctly.
Put , , and . Since and , , the kernel is nonnegative, and exactly. Fix . On the set where either or , . Choose with . continuity provides a neighborhood of the origin of positive measure where . ConsequentlyFor , take and then large enough that this bound is at most . For the exterior conditions are empty. This proves all the requested kernel properties, with .
Now let and define . The powered-cosine approximate identity on a torus is a trigonometric polynomial, since its base is a finite sum of complex exponentials and its exponent is an integer. Expanding and integrating its finitely many Fourier terms shows that is also a trigonometric polynomial; it is real-valued because both factors are real. Translation invariance and normalization giveGiven , uniform continuity of supplies making the difference in brackets smaller than on the square , uniformly in . The contribution from that square is at most . On its complement it is at most , which tends to zero by the preceding estimate. Therefore , proving uniform approximation without assuming any Fourier-series convergence of .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take and . Since , every cosine term vanishes at , andSet and . For , the sine argument lies in , where . The initial part therefore has a common sign and magnitude at least . The remaining tail has absolute value at mostThe reverse triangle inequality now givesfor sufficiently large , because . This establishes the sharp logarithmic lower boundThe constant can be reduced to include the finitely many small indices: for the displayed lower bound is positive; for the first sine exceeds the tail bound , and for the first two sines contribute , exceeding the remaining tail bound . At the logarithmic right side is zero.
Here but is not Lipschitz continuous, so a first modulus of continuity bound is sufficient by the first Jackson theorem for periodic approximation but is not necessary. Nor is the weaker necessary bound sufficient: an explicit comparison is the logarithmic cusp with slow trigonometric approximationextended periodically. On it is increasing and concave, so its largest increment over distance is from zero, giving for .
For a concrete approximation lower bound, its cosine Fourier coefficients satisfyIndeed, integration by parts once replaces by ; integrating that against sine with primitive yields the stated positive integral. Its logarithmic growth follows because stays bounded by the Dirichlet test. All are negative and absolutely summable.
Let , a de la Vallée Poussin sum. Its multiplier is one for , for , and zero for ; the Fejér summation is a uniform-norm contraction property gives . Thus the functional has norm at most four and vanishes on every degree-at-most- trigonometric polynomial. Because the remaining multiplier weights are nonnegative and all ,The first Jackson theorem for periodic approximation gives the corresponding upper bound. The same first-modulus order occurs with both and . Therefore first-modulus rates alone do not characterize the endpoint approximation class, unlike the matched direct and inverse rates for .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Weierstrass M-test gives a continuous periodic Weierstrass function, since . For , the given best approximant leaves the tailIts supremum norm is at most the sum of its coefficients, and at all cosine terms equal one, attaining that bound. ConsequentlyPut . Then and , giving , with constants depending only on .
For , part (a) gives . The first Jackson theorem for periodic approximation, , supplies the matching lower bound. Hence the modulus of continuity has the precise orderAt , the inverse theorem for trigonometric approximation gives the upper bound , and part (c) proves the matching lower bound. Thus the critical Weierstrass modulus isTo pass from scales to all small , use monotonicity of the modulus of continuity and adjacent reciprocals, which are comparable to .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 6 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , define , where is the space of degree-at-most- trigonometric polynomials. The first inverse theorem for trigonometric approximation states that a universal constant satisfiesFor perspective, take best approximants at dyadic degrees and telescope their differences. Each difference between consecutive approximants has supremum norm at most twice the earlier error, and the Bernstein inequality for trigonometric polynomials multiplies that bound by its degree when differentiating. The resulting dyadic sum is bounded by the displayed sum because decreases with ; the remaining approximation error is also bounded by an average of earlier errors.
Now suppose for large , absorbing finitely many earlier terms into a constant. If , comparison with an integral gives . If , the same comparison gives . Substitution proves the requested two rates:The logarithm is the endpoint contribution of the harmonic sum and cannot generally be removed, as the following Weierstrass function shows.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a real continuous function , the Chebyshev alternation theorem asserts that a polynomial is a best uniform approximation exactly when either it is exact or its residual has ordered alternating extrema:Here means degree at most , as required for a linear subspace.
For sufficiency, if a polynomial perturbation violated the Kolmogorov criterion for uniform approximation, then at every displayed point. Thus would alternate signs, forcing a distinct zero in each of the intervals by the intermediate value theorem. A nonzero polynomial of degree at most cannot have that many zeros; the zero polynomial does not violate the criterion either.
For necessity, assume and no such alternating sequence exists. The two compact sets and are disjoint and, when both are nonempty, have positive separation. Hence the extremal set has finitely many successive sign runs: infinitely many alternations would contradict that separation on the bounded interval. If there are changes of sign between those runs, then selecting one point from each run gives an alternating sequence of length , so . Choose a point in the gap between each pair of consecutive opposite-sign runs, and setChoose the sign of so that agrees with on the first run. The roots lie outside the extremal set and each changes the sign, so at every extremal point. Since , this contradicts the Kolmogorov criterion for uniform approximation. Therefore a best polynomial must have the required alternation.
Existence also holds: a minimizing sequence has bounded supremum norms, hence bounded coefficients by evaluating at fixed distinct points and inverting the resulting Vandermonde matrix. A convergent subsequence of coefficients yields a minimizer. Finally, if and are both best, their average is best; at its alternating extrema both individual residuals must equal the same extremal value. Consequently has at least zeros and is identically zero. The best polynomial exists, is unique, and is characterized by alternation.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 69 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let , , , and . The Kolmogorov criterion for uniform approximation saysEquivalently, no available perturbation has strictly the same sign as the nonzero residual at every extremal point. This statement concerns a candidate in the linear subspace; it does not assume every subspace has an attained best approximation. If , is already exact and the criterion is automatic.
To see sufficiency, for any competitor , the criterion supplies an with . Then , so the competitor cannot have smaller supremum norm error.
For necessity, suppose and some has on . Since is compact, this product has a positive minimum there. By continuity, a neighborhood of has . For sufficiently small ,On the compact complement of , has a strict gap below , and taking smaller than this gap preserves it. Hence improves the uniform error everywhere, contradicting best uniform approximation.
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





