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 2007 iii Paper 75 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The solenoidal magnetic-field constraint impliesWith and , the right-hand side is . Thus the leading, order- perpendicular field is divergence-free. On a simply connected perpendicular patch, or for the nonzero perpendicular Fourier modes of a periodic domain, it has a stream function. Choose its normalization byConsequently the leading reduced electron magnetohydrodynamics representation isThe error denotes an order- field relative to . The parallel perturbation is an independent scalar and is not removed by leading perpendicular solenoidality.
For clarity, the representation is asymptotic rather than an exact decomposition of an arbitrary three-dimensional solenoidal field. If depends on , exact solenoidality can be restored by adding to , where . Its amplitude is , so it lies beyond the retained field order. A perpendicular harmonic component can be absorbed into the guide field or fixed separately by boundary conditions.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 75 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-20
At fixed number density , the electron current givesThe second equality uses Ampère's law without displacement current and stationary ions. A perturbation with characteristic perpendicular wave number therefore produces . Its nonlinear magnetic-advection rate isFor the anisotropic electron magnetohydrodynamics wave, and . Equating this to the nonlinear rate by critical balance givesThis is small-amplitude but strong turbulence: a small perturbation can have order-one nonlinear distortion over one wave period because its perpendicular gradients are much larger than its parallel gradients.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 75 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The neutral displacement equation gives, for each nonzero-frequency root,The vector displacements are parallel as complex polarization vectors, with this scalar amplitude and phase ratio.
For the rapidly damped root, , and henceThe two fluids move almost equally and oppositely; collisions remove the counterflow at a rate close to .
For either weakly damped Alfvén wave, expand the ratio around unity:Equivalently, the exact slippage relation is . Thus the relative slippage has size and is primarily a small phase difference. The fluids almost share a common displacement, but magnetic tension acts directly on the ions and drag accelerates the neutrals. This imperfect locking causes ambipolar damping.
The sign of the damping is also checked by the perturbation energy balance. With periodic or vanishing-flux boundaries,It follows by dotting each linear momentum equation with its velocity and the induction equation with ; magnetic-tension work cancels magnetic-energy change, pressure contributes only boundary flux, and the two drag terms combine into the negative square. Even though spatial diffusion was neglected, ion-neutral friction still dissipates the wave energy.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 75 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the strong-collision ion-neutral Alfvén modes, put and assume . Rewrite the cubic asThe two slow roots obey , so the first approximation is . Set and retain the next order, of size :ConsequentlyThese are weakly damped Alfvén waves. Their phase speed is , since collisions make the neutral mass participate in the oscillation. Their ambipolar damping rate is , with .
For the remaining root, at the cubic is , so start from . Denote the cubic by . Its value and derivative at this root areThe first correction is therefore , givingThis branch is purely damped. Indeed, the real growth-rate polynomial for is , and its simple real root near stays real for sufficiently small real . It represents rapid decay of ion-neutral relative motion. In the limit, the other two frequencies tend to zero; all three branches are accounted for.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 75 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and . Use normal modes proportional to , so means damping. The linear displacements satisfyFor a nonzero-frequency perturbation, linearizing the ideal magnetohydrodynamic induction equation givesProject both momentum equations with . This removes the pressure gradients. The magnetic tension is already transverse to , and, with , the projected equations areHere uses the ion density, as stipulated. For either of the two independent transverse polarizations, the equal-density ion-neutral Alfvén dispersion relation follows fromIts determinant is . Removing the static neutral-displacement factor givesThe removed factor is a time-independent neutral displacement with no velocity or magnetic perturbation, a relabeling of the homogeneous neutral fluid rather than a fourth physical wave. Direct elimination in the first-order system for gives exactly the same cubic. This also handles the zero-frequency limits without introducing a displacement-label mode.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
By symmetry the normalized covariance matrix has the form . Substituting the matrices from part (c) into the normalized stationary fluctuation-dissipation relation for a reaction network, , givesHence and . Solving these two equations gives the linear noise of two species with joint removal:For the normalized variance is and the covariance is zero, as expected for independent immigration–death processes. For , exceeds this independent value and . The correlation coefficient isThis negative stationary correlation is compatible with positive instantaneous joint-removal noise: the slow difference mode amplifies fluctuations of opposite signs in the two populations.
The symmetric and antisymmetric eigenvectors diagonalize all three matrices. Their normalized covariance eigenvalues areThe corresponding restoring rates are and . Thus the sum mode retains finite fluctuations, with , whereas the difference mode becomes arbitrarily noisy. In particular, at a fixed nonzero mean, or along at fixed so ,The Fano factor of either population is , which diverges as regardless of how the mean is varied. Unnormalized variances are and covariance , so their absolute magnitudes also depend on the parameter path through .
The phase plane in part (b) explains the singularity. At , the mean-field system has a whole hyperbola of equilibria, rather than an isolated restoring state. A perturbation in the species difference selects another point on that curve. In the actual stochastic reaction network, joint complex formation still leaves unchanged, but the two constant-rate births change it by and , each at rate . Therefore exclusive joint removal has a diffusing difference mode:Its continuous-time symmetric simple random walk on the integers has no normalizable stationary distribution, so there is no finite stationary covariance at . The divergence as signals both the loss of difference-mode restoration and eventual failure of the small-fluctuation moment closure; near the limit, the computed normalized variances need not remain small even when the individual mean populations are large.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , symmetry of the unique stationary mean-field state gives and the balance . The fraction of the molecular removal flux using the joint reaction and the mean molecular lifetime are consequentlyIn particular , , and .
The total loss flux of species one is , whereas its production flux is constant. The reaction-rate elasticities are therefore and at the symmetric state. Species two gives , . All chemical jumps in either component have unit absolute size, so their molecular-flux-weighted reaction event sizes satisfy . With , this provesThe same matrix follows from with and the drift Jacobian matrix in part (b); its positive eigenvalues are the restoring rates.
For the chemical diffusion matrix, each component receives noise from one unit birth, its own unit death, and the joint unit loss. The unnormalized diagonal noise intensity isOnly the joint reaction changes both components in one event. Its stoichiometric vector is , so . The positive sign reflects simultaneous decreases, rather than independent death events. Divide by the product of the means to normalize:Thus the chemical diffusion matrix in the normalized stationary fluctuation-dissipation relation for a reaction network isThe unequal roles of and matter: describes restoration of perturbations, while records the covariance of the immediate stochastic reaction increments.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the approximate reaction-rate equations from part (a), with axes and . In every case the positive quadrant is forward invariant, since the drift on either zero-concentration axis points inward. The nullclines specify the arrow signs: right if , left if the inequality is reversed; up if , down otherwise.
For and , the nullclines are the vertical line and the horizontal line . The two components relax independently:Every nonstationary trajectory is a straight ray towards the unique stable equilibrium , whose Jacobian matrix is .
For and , both derivatives equal , so the two nullclines coincide onEvery point of this hyperbola is an equilibrium. The difference is conserved, and trajectories therefore run along straight lines of slope one. Below the hyperbola they point up and right; above it they point down and left. Each such line converges to its own intersection with the hyperbola,At this point the Jacobian matrix is , with eigenvalues and . Thus the equilibrium curve attracts transversely but has no restoring drift along its tangent. Its points are not individually asymptotically stable, because arbitrarily close initial states on different constant-difference lines converge to different equilibria.
For and , the nullclines are the decreasing curves and , reflected in the diagonal. At an intersection, subtracting the two stationary equations gives . Hence there is exactly one intersection, whereThe Jacobian matrix at this point isIts symmetric eigenvector has eigenvalue , and the antisymmetric eigenvector has eigenvalue . Both are negative, so the symmetric equilibrium is a stable node. All trajectories are bounded because each component above decreases. The divergence excludes periodic orbits by the Bendixson-Dulac criterion, and the unique interior equilibrium attracts the positive-quadrant trajectories. As becomes small, the drift restoring the difference becomes slow, so paths first approach the near-hyperbolic nullclines and then drift towards the symmetric intersection. These sketches show the three cases printed in the PDF; the middle case is , not the different cases introduced by the converted TeX.
Mean-field phase planes with independent removal, exclusive joint removal, and both removal mechanisms
. Details. Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . Applying the Markov jump-process generator to either coordinate gives the exact moment equationsIn each equation the joint reaction removes one molecule, at reaction propensity function . Because the two reactants are different chemical species, the propensity uses their product; no same-species factorial correction is needed. The exact identity shows explicitly where the equations fail to close. Neglecting this covariance relative to the product of means is the small-fluctuation moment closure. It gives the mean-field joint removal of two chemical species:The difference equation actually holds exactly as well as after closure, because both the constant production and the joint removal terms cancel. The nonlinear moment closure will be used for the subsequent phase plane and stationary linear noise approximation calculations, as requested.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the Gillespie algorithm, start from and an integer molecular copy number . At each step use the current state, without the mean approximation in parts (a)–(b). The reaction propensity functions are and , and their sum is . Draw two independent uniform random variables on and setThe waiting time has an exponential distribution with rate . Keep the sample path constant on , advance , and choose the reaction byRecord the post-jump state, recompute both reaction propensity functions, and repeat with fresh independent uniforms. At the death propensity is zero, so only a birth is selected and the trajectory remains nonnegative. For a prescribed terminal time , if the next event would occur after , keep the current state to and stop. This produces exact piecewise constant sample paths of the specified continuous-time Markov chain.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The normalized stationary fluctuation-dissipation relation for a reaction network isHere is the negative drift Jacobian matrix expressed in normalized population coordinates, and is the normalized noise matrix. More explicitly, with , drift Jacobian , stoichiometric vectors , and stationary reaction propensity functions , these matrices are and , where . The linear noise approximation gives a covariance evolution ; stationarity is the displayed Continuous Lyapunov equation.
In one dimension, the normalized restoring coefficient is . Squared chemical jumps determine the noise:The factor nine from a birth burst is essential; its three molecules arise in one correlated reaction event. The scalar Continuous Lyapunov equation is , givingEquivalently, the normalized variance is . The Fano factor is approximately four. This calculation uses the prescribed mean closure and the linear noise approximation, so its small-relative-fluctuation regime is ; it is not an exact assertion for arbitrarily small molecular copy numbers.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . The Markov jump-process generator applied to gives the exact moment equation . With the prescribed moment closure, , stationarity givesThe production flux counts molecules, not reaction events: it is , while the removal flux is . The reaction-rate elasticity of removal relative to constant production isThe mean molecular lifetime is population divided by its stationary molecular removal flux. ThereforeThe noise-relevant average chemical event size is the molecular-flux-weighted reaction event size. For the stoichiometric vectors and it isThis weights each absolute jump by the molecular turnover it contributes. Equivalently, the balanced production and removal fluxes give equal weight to their sizes and , yielding . An event-count-weighted average would be , since three quarters of firing events are deaths at stationarity; that different average does not determine the diffusion term in the linear noise approximation.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For this equal-strength power-law mutual repression, the logarithmic gains and their product at equilibrium areThe mutual repression stability criterion immediately excludes multistability if , since at every finite positive equilibrium. The common prefactor gives a stronger exclusion: if either exponent is at most one, multistability is impossible for every , including some cases with .
To prove the additional cases, suppose . At equilibrium the two expressions for implyPut and . Because , the left side is at least , so . It follows thatThe maximum in the second inequality occurs at . Its strict bound follows from , , and . Interchanging the components proves the case ; the case with both exponents at most one was already covered by . Every root of therefore has . Since begins positive and ends negative, there is exactly one root: two downward crossings would require another crossing with nonnegative derivative between them. The unique equilibrium is stable.
For completeness, neither exponent can be relaxed above one in this exclusion. If and , take sufficiently large. On , , so maps that interval into itself. It has a fixed point withIt is a stable equilibrium. By exchanging the components, there is a second stable fixed point with and . These two regions are disjoint for large , proving bistability for some production strength. Hence the full answer isFor example, has but still a unique stable equilibrium for all . Thus the product-only necessary condition for strong feedback is not sufficient when both production prefactors are constrained to be equal.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 74 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Assume the decreasing functions are continuously differentiable so their local gains are defined. In the positive quadrant, the nullclines are and , both decreasing. The phase plane arrows point right when and left when ; they point up when and down when . Both axes point into the quadrant. Since are bounded, sufficiently large or decreases, giving a bounded forward-invariant rectangle containing all equilibria and eventually containing each trajectory. Thus mutual repression can have one attracting intersection or several intersections separating different basins of attraction.
An equilibrium obeys , . Its Jacobian matrix and eigenvalues areThe product is nonnegative. Hence an intersection is a stable equilibrium with two negative real eigenvalues when , a saddle equilibrium when , and nonhyperbolic when . This is the mutual repression stability criterion. To see why an intervening saddle normally accompanies multistability, eliminate and set . Bounded positivity gives and for large , whileTwo downward, stable crossings require an upward crossing between them. For simple roots that middle crossing has and is a saddle equilibrium. Its stable manifold separates the attracting states. Thus robust multistability requires the loop gain to exceed one at an intervening equilibrium, with the stable equilibria themselves having gain below one. A tangency at gain one is the threshold where equilibria can merge; degenerate crossings require higher-order analysis. A gain exceeding one somewhere is necessary for multiple intersections, but by itself does not prove that a particular pair of nullclines has multiple stable intersections.
Define the logarithmic repression sensitivitiesBoth are negative. At equilibrium and , so their product is exactly . The condition can therefore be expressed asEquivalently, the product of the magnitudes of the two negative logarithmic gains must exceed one at that saddle equilibrium. The divergence of the vector field is identically , so the Bendixson-Dulac criterion excludes periodic orbits in the positive quadrant. The relevant stable long-time states in this bounded phase plane are thus equilibria, rather than attracting limit cycles. The following sketches illustrate the single-attractor and two-attractor possibilities; the saddle in the second panel lies on the diagonal, with its stable diagonal separating the two basins.
Mutual repression phase planes: one stable equilibrium and two stable equilibria separated by a saddle equilibrium
. Details. Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 4 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A visual neuron's receptive field specifies the region of visual space and stimulus features whose changes affect its response, with the surrounding and temporal context held appropriately controlled. A linear receptive-field approximation is a signed spatial weighting kernel. A simple cell in primary visual cortex commonly has elongated alternating ON and OFF subregions and orientation selectivity. Brightening an ON region increases its drive; darkening an OFF region does likewise, while opposite contrasts oppose that drive in the linear approximation.
The original sketch below uses a Gaussian-windowed cosine to depict an elongated ON strip with OFF flanks. A bar aligned with these regions can produce strong net drive, whereas an orthogonal bar produces more cancellation. This is an illustrative signed filter, not a claim that every simple cell has exactly this analytical shape.
Illustrative simple-cell receptive field with elongated ON and OFF subregions
. Details. Different unsupervised learning models address different developmental aspects. Oja's rule can select a dominant direction of correlated input and provides normalization that a bare Hebbian update lacks. By itself, one linear principal component need not be localized, nor does it create a cortical map. Additional spatial constraints and competition are needed to explain a collection of spatially organized selective cells.
Competitive Hebbian learning among correlated ON and OFF inputs can separate those input types into adjacent subregions and generate orientation selectivity. Competition among inputs from the two eyes can similarly contribute to eye-specific preference and ocular dominance columns; spatial interactions between cortical units are needed for an organized map rather than merely one cell choosing one input pool. These models connect developmental organization to input correlations and normalization constraints. The ON/OFF competition model gives a concrete orientation-development example.
A different approach is sparse coding: learn features that reconstruct natural images while limiting simultaneous activity. This can yield localized, oriented, band-pass filters resembling simple-cell receptive fields, because it uses structure in natural-image statistics beyond the covariance alone. The original sparse-code model demonstrates this functional account. It does not by itself establish an exact developmental mechanism.
Correlated input, competition and normalization can produce selectivity; the objective and network constraints determine which aspect of cortical organization is explained. Anatomical constraints, spontaneous activity and experience must still be tested experimentally. A final receptive-field resemblance is weaker evidence than accurate predictions about its development and responses to altered input statistics.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Linearize the averaged rule about the genuine positive-eigenvalue equilibrium , where is a unit eigenvector. The question's unit-length hint implicitly uses ; for general the scaling is required. Put and . To first order,Substituting into the mean learning equation and cancelling the equilibrium terms gives stability and normalization of averaged Oja learning:In the eigenbasis, the radial and transverse perturbations satisfyFor , the radial direction contracts. Any nonmaximal eigenvector has a transverse direction with and is unstable. If and , both have strictly negative linearized eigenvalues and are locally asymptotically stable. Thus only the maximal-eigenvalue directions can be stable, with the usual simple-eigenvalue assumptions giving isolated attracting equilibria.
Convergence also needs an initial component along the top direction. For the full averaged equation, the coefficients obeyFor ,With a strict top eigenvalue, all other ratios tend to zero. The norm equation from part a then drives the nonzero weight norm to , so the weight converges to the top eigenvector with the sign of its initial top component. Random nonzero initialization has that component with probability one under a continuous distribution.
Several exceptions qualify the printed conclusion. A repeated largest eigenvalue gives neutral directions within the top eigenspace and convergence to a normalized vector in that space, not a unique eigenvector. An initial vector exactly orthogonal to the top eigenspace remains in that invariant subspace. The zero initialization stays zero. If , every weight is stationary and no distinguished component can be learned. Nonzero nullspace equilibria are unstable when has a positive eigenvalue. Hence unconditional convergence from every initial weight, or uniqueness without a spectral gap, would be false.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be an orthonormal eigenbasis of , with . Expand . At the normalized length imposed on positive-output equilibria,Equality holds exactly when lies in the largest-eigenvalue eigenspace. If is simple,The norm constraint is essential: without it, scaling a direction with positive eigenvalue makes the output second moment arbitrarily large, so the printed maximization statement would have no finite maximum. When , this is the usual unit-length formulation.
For centered inputs, maximizing this quantity maximizes output variance. The unit therefore selects the first principal component analysis direction: a stimulus feature with the greatest variation in the input ensemble. Biologically, learned synaptic weights become selective to that dominant correlated pattern, rather than to a teacher-supplied label. For uncentered inputs it maximizes a second moment including the mean response, which is not the same as maximizing variance. If the top eigenvalue is repeated, any normalized vector in its eigenspace attains the same maximum.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For fixed weights during the input average,Thus is the input second-moment matrix. It is a positive semidefinite matrix because . If the inputs have been mean-centered, it is their covariance matrix; otherwise .
The stationary averaged learning equation isFor this makes an eigenvector of with eigenvalue . If , taking the inner product with givesand thereforeThe zero vector is also stationary but is not an eigenvector in the usual nonzero-vector definition. Likewise any vector in the nullspace of is stationary with zero output second moment and need not have the normalized length. These exceptional equilibria must be distinguished from a nonzero feature-learning solution.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The input vector contains the activities of presynaptic units or sensory features, and contains the corresponding synaptic weights. The linear output is their weighted sum; it may be a centered activity proxy rather than a literal nonnegative spike rate. The learning time scale is , and take for normalization. The term is a Hebbian learning increment that strengthens weights correlated with the postsynaptic output. The term opposes unlimited growth.
For slow learning under stationary input statistics, average over inputs while holding the current weights fixed. Define . The averaged Oja's rule isIts squared norm obeysWhenever the output second moment is positive, this drives the norm toward , preventing the unbounded growth of an unconstrained Hebbian linear neuron. The direction becomes sensitive to dominant input correlations. Such a unit can learn a feature detector without supplied target labels, providing a simple mechanism for unsupervised learning and principal component analysis. This averaged analysis assumes input fluctuations are fast relative to learning; it is not a claim that every individual stochastic update follows the same deterministic trajectory.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 73 3 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
One limitation is finite useful storage capacity and interference. Under simple Hebbian learning, each additional pattern contributes cross-talk to the retrieval fields; correlated or excessive patterns can erase a memory's basin or destabilize the pattern itself. More structured learning can reduce this interference: covariance-based weights account for activity biases, and pseudoinverse-based rules can orthogonalize a set of linearly independent patterns. Sparse representations and suitable thresholds can also change the capacity tradeoff. These extensions require their own retrieval analysis; they do not permit unlimited robust storage in a finite network.
A second limitation is spurious attractors and entrapment in unintended local minima. Mixtures of memories or unrelated configurations can be fixed points, and deterministic energy descent cannot escape an already stable incorrect state. Stochastic updates that sometimes accept energy increases can explore other configurations, and simulated annealing can gradually reduce that randomness to favor lower energies. Better weight learning and basin shaping can reduce the spurious states. Finite-temperature escape is probabilistic, and a practical finite-time annealing schedule does not guarantee the desired memory or a global minimum.
Changing the learning rule addresses interference; changing the retrieval dynamics can address trapping. The objective must still be appropriate: the lowest energy pattern is not necessarily the memory best matching a particular noisy cue.
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








