The Brownian first-passage time is finite almost surely. Indeed the Brownian reflection principle gives as . Continuity of the paths means the first passage to occurs after the first passage to . By the Strong Markov property, the process is an independent fresh Brownian motion. Thus has the same probability distribution as and is independent of . Taking the Laplace transforms of nonnegative random variables gives
For fixed , these transforms lie in . Put . It is additive on positive arguments and nondecreasing, because the hitting times increase with the level. Writing , additivity gives for positive rational , and rational upper and lower approximations then give for every . Hence , with .
The Brownian scaling identity gives
For , take in this relation with the transform parameter one. It follows that , where . At zero, finiteness of the hitting time gives . Thus , with the constant determined in part (b).
Again put . For any fixed real , the random variable
is nonnegative and integrable. The sign function of is bounded and -measurable, so conditioning and equality of the probability distributions give
Thus almost surely. On this forces ; on it forces ; on it forces . In particular up to a null set. These two events have equal probability, again by equality of the probability distributions, so they agree up to a null set. Consequently
Taking establishes the suggested sign assertion, but this alone would not exclude unequal positive values. Apply the same argument simultaneously to the countable set of rational . Outside the union of their null sets, unequal and would have a rational strictly between them, giving opposite signs. This proves the conditional expectation preserving a distribution result:
Only integrability was used; no finite second moment or hidden square-integrability assumption is needed.
Equality of the probability distributions implies equality of all integrals for which they are finite, in particular . Part (a), applied to this conditional expectation, therefore gives The second-moment assumption justifies the squared-norm argument; the next part removes it.
Write . The conditional expectation is an contraction by the conditional Jensen inequality, so are square-integrable. The defining integral identity for conditional expectation, first with bounded measurable truncations of and then with their limit, gives
For clarity, if , then , and the Cauchy-Schwarz inequality permits the limit . Expanding the square now proves the equality case for conditional second moments:
A nonnegative random variable of zero expected value vanishes almost surely. Therefore
Identify the ambient Euclidean space with and let be multiplication by . Equivalently, in real coordinates,
This linear map preserves the norm and satisfies . On the unit sphere define
It is continuous, tangent because it lies in , and has norm one everywhere. It is therefore a nowhere-zero section of the tangent bundle, including when and the sphere is . This supplies a nonvanishing tangent field on an odd-dimensional sphere explicitly.
A vector field on the sphere means a tangent vector field. For with , suppose were continuous and nowhere zero. Normalize it to . Tangency means , and both vectors have norm one. Therefore
has squared norm . It defines a homotopy through self-maps of the sphere from the identity to the antipodal map.
The identity has mapping degree . The antipodal map on has degree : it is the boundary restriction of on the oriented -ball, and this linear map changes orientation by . For its degree is . Homotopy invariance of mapping degree would force , a contradiction. Thus every continuous tangent field on an even-dimensional sphere vanishes somewhere. For the tangent spaces are zero, so the conclusion holds directly. This proves the Hairy ball theorem using degree, rather than assuming it.
For a continuous map , use the classes from part (a). Since , there is an integer with . Naturality of the cup product and yield
With the product orientation on the source and the complex orientation on the target, the mapping degree is defined by . Evaluation on the fundamental class gives
Thus the induced group homomorphism on is zero. This is a cup-power obstruction to nonzero degree, rather than a consequence of the additive homology groups alone.
The standard CW complex structure on Complex projective space has one cell in each dimension and no other cells. Its cellular chain complex therefore has zero differentials: each boundary has an odd-dimensional target group, which is zero. The product of the usual two-cell structures on and likewise has exactly one cell in dimensions . Thus cellular homology gives, for both spaces,
The cohomology rings detect more than these additive groups. Let be the hyperplane class. The cohomology ring of complex projective space is
For the normalization, a hyperplane is Poincare dual to ; intersecting three generic hyperplanes gives one point with positive complex orientation, so . Together with the computed additive groups this makes generators in their respective degrees.
Let and be the pullbacks of the orientation classes of and . The Künneth theorem and naturality of the cup product give
where generates degree six. In particular, every degree-two class on the product has square zero, whereas . Any graded ring isomorphism would send to , contradicting this product relation. A homotopy equivalence induces an isomorphism of cohomology rings, so the spaces have isomorphic integral homology but are not homotopy equivalent.
The proof of Szemerédi theorem for four-term progressions follows a uniformity-versus-density-increment iteration. Fix a positive starting density; the quantitative parameters below depend only on that density.
First apply the counting argument in part (i). A sufficiently long set with no nonconstant four-term arithmetic progression cannot have small balanced Gowers U3 norm. Thus its balanced function has a quantitatively large cube average. The Derivative identity for the Gowers U3 norm expresses this as an average of fourth Fourier moments of the multiplicative derivatives . Many shifts therefore have a derivative with a large Fourier coefficient.
The next step is the inverse argument. Choose these frequencies as a function of the shifts. The relations between repeated derivatives force a large part of the resulting frequency graph to have many additive quadruples. A Balog-Szemerédi-Gowers theorem extraction followed by Freiman theorem for integer sets organizes this graph on a bounded-complexity additive model. Integrating the organized derivative frequencies yields correlation of with a locally quadratic phase on a structured region. On integer intervals this is generally a local quadratic phase on a Bohr-type region, or equivalent two-step structure; it need not be one global quadratic polynomial on the entire interval.
The quantitative density-increment lemma obtained from that inverse argument says that either the interval is bounded in size by a function of its density, or there is a nonempty integer progression of length at least on which the density increases by at least . The passage from correlation to this increment partitions the structured region into progressions on which the phase varies very little, controls discarded boundaries, and uses the balanced function's zero mean to find a positive-density gain. Both the gain and the size exponent are bounded away from zero for densities above the fixed starting density.
Reidentify the new progression with an interval and repeat. The property of having no nonconstant four-term progression is preserved under this affine identification. Density can increase only finitely many times before it exceeds one. Starting with sufficiently large ensures that the successive power-type length losses never reach the exceptional bounded-size case during those finitely many steps. This contradiction proves that every fixed positive density has a threshold beyond which a four-term progression must occur. The counting lemma, inverse structural argument, density increment and final iteration are the main steps; the deep inverse step is only outlined here, as permitted by this part of the question.
We specify the convention for quadratic uniformity of a set. Write and on , extended by zero elsewhere. Let be the integer cubes with all eight vertices in , and let . In the eighth-power convention, is -quadratically uniform when
where means complex conjugation. This quantity is nonnegative and is the eighth power of the normalized Gowers U3 norm on an interval. If uniformity instead means that the norm itself is at most , replace the present parameter by . Removing the balance would not define density-relative uniformity.
Embed the interval in with , and keep the zero extension of . This group has invertible and . Every cube with all vertices in the interval is an integer cube: its face relations have magnitude at most , so their modular equalities are ordinary equalities. Conversely every such integer cube gives one modular cube. Thus
since . The cube quantity is nonnegative, for it can be written as an average of squares of two-fold multiplicative-derivative correlations, by expanding the third increment.
We prove the counting estimate needed below. For functions , put
Three applications of Cauchy-Schwarz give
Here are the elimination steps, to make the generalized von Neumann inequality for four-term progressions explicit. Set . Reparametrize by the position , and apply Cauchy-Schwarz in that position to eliminate . Pairing the two remaining difference variables produces increments in . Reparametrize by the position of , apply Cauchy-Schwarz to eliminate it, and average over using Cauchy-Schwarz again. The remaining increments in are . Finally reparametrize by the position of and eliminate it in the same way. The resulting bound is
In the last equality and range freely since their multipliers are units. Each elimination drops only a factor bounded by one; expansion of the squared average gives exactly the stated multiplicative derivative. To target instead, subtract its slope from all four slopes and eliminate the other three factors. The increments are the three nonzero slope differences times independent variables, all among and hence invertible. This proves the minimum bound.
Now let and on . Telescoping the four factors, the difference is a sum of four terms with one balanced factor and three factors bounded by one. Therefore
For , restricting to and gives at least progressions inside the interval. Since , . Choose, for example,
Then . Constant progressions contribute only . For , this is strictly below the displayed lower bound. A nonconstant progression consequently exists. Its four points are actual integer progression points: the two adjacent three-term relations have magnitude less than , so they do not wrap. Hence
This proves the four-term progressions in a quadratically uniform interval set criterion, with the parameter normalization and the interval boundary both accounted for.
The empty-set case is immediate; take finite and nonempty. Part (ii) gives a nonempty such that
We include the Ruzsa triangle inequality argument to justify passing from sums to differences. For each , fix one representation with and . The map
is injective. Its output difference recovers ; the fixed representation then recovers . Hence
Since , this proves
Only the abelian group operations were used, so no torsion-free hypothesis is required.
The graph form of Plünnecke inequality states
Equivalently these roots are nonincreasing along the layers. If the conclusion is immediate. Otherwise put and use the weighted cut lemma for commutative graphs proved in part (i). For a minimum endpoint cut ,
The bottom layer is a cut of this weight. Comparing with gives , as required. In an addition graph, when , so : some nonempty bottom subset has growth at most at height .
The useful simultaneous sumset form says that a nonempty can be chosen with for every . To verify the common-subset assertion directly, choose minimizing among subsets of . For a finite set , let consist of those for which is a new point of . The translated partition . Points contributed by are already present in earlier translates of , so the new contribution at stage has size at most
The inequality also holds when the complementary set is empty. Summing gives . Taking and iterating proves . This is the Petridis minimal-growth lemma calculation and supplies a single subset for all needed heights.
A Plünnecke graph is a finite directed layered graph , with edges only from to , satisfying two commutation conditions. For each edge , the successors of can be matched injectively into the successors of , so that the matched predecessor has an edge to the original successor. Dually, the predecessors of can be matched injectively into the predecessors of , so that each original predecessor has an edge to its match. These are upward and downward commutation. For nonempty bottom subsets define the graph magnification ratio
Addition graphs have layer and edges : exchanging the order of two additions gives exactly these matchings.
We prove a slightly stronger weighted cut lemma for commutative graphs, which also explains part (ii). Give vertices in weight , for any . A separating set meets every bottom-to-top path. There is a minimum-weight separating set contained in . We first establish its local three-layer step.
Consider a three-layer channel , every vertex of which lies on a full path, and suppose the middle layer is a minimum-weight cut. Replacing a subset by all its successors or all its predecessors still gives a cut. Minimality implies
Let be the vertices of incoming degree . Partition into according to the largest incoming degree of one of their predecessors. Then
Downward commutation makes incoming degree nondecreasing along an edge. Thus every vertex of has at least predecessors, and summing the last inequalities over gives
Reverse all edges and interchange the endpoint layers. The graph still satisfies both commutation conditions, and the expansion factor becomes . The same argument now gives the opposite inequality . Equality must therefore hold at every step. In particular the suffix inequality at is an equality, and the reversed argument gives
Consequently the bottom layer has exactly the middle layer's weight. This proves the local replacement lemma.
For a general minimum cut , write , and take its highest nonempty intermediate portion , . Form the three-layer channel whose bottom vertices are reachable from while avoiding the earlier cut portions, and whose top vertices can reach . Its middle layer is exactly : any other middle vertex would produce an uncut full path, while every member of is essential in a positive-weight minimum cut and hence lies on such a path when that vertex alone is allowed. Channels inherit the commutation matchings: the replacement intermediate vertices still join the same prefix and suffix paths.
The middle layer is a minimum cut within this channel, since a cheaper local separator would replace and make the global cut cheaper. Apply the local lemma, with weights scaled by the common factor , to replace by the channel's bottom layer. This does not increase weight and removes the highest intermediate cut layer. Repetition leaves a minimum cut in the endpoint layers, proving the weighted cut lemma. Vertices lying on no full path can first be deleted; when all bottom vertices survive, and deleting such branches can only decrease intermediate images, so proving the lower bounds in the channel suffices.
Now take and assume . If a minimum endpoint cut is , then , so
The bottom layer itself is a cut, so the minimum cut size is . For every nonempty , the set is also a cut. Its size must be at least , proving
One may also apply the permitted Menger theorem to obtain vertex-disjoint full paths, giving the same conclusion. The proof above establishes the needed cut statement directly.
Write and . For , each divisor of also divides the lower-left entry . Thus
The full transformation of the Eisenstein series of weight two consequently gives
Summing with the prescribed coefficients proves
If , this is exactly the desired weight-two law. Conversely, test it at . Its anomaly factor is nonzero throughout the upper half-plane; if is modular it forces . This proves cancellation of weight-two Eisenstein anomalies:
Equivalently the inverse-height terms cancel in , leaving precisely the holomorphic function . Eliminating shows that all such combinations are spanned by for dividing .
Logarithmically differentiate the convergent product of the modular discriminant. On compact subsets of , absolute convergence permits termwise differentiation and rearrangement of the resulting divisor sums:
The division is valid because has no interior zeros. Its weight-twelve inversion law is . Taking a logarithmic derivative, including the derivative of , yields
Thus the Eisenstein series of weight two has the anomalous transformation
Let . Under inversion, becomes . Using , the anomalous term cancels:
The Fourier expansion gives , and translation leaves unchanged. Since translation and inversion generate the projective modular group and weight two is unchanged by , the almost holomorphic weight-two Eisenstein series satisfies
It is modular in the transformation sense, but is not a holomorphic modular form. Substituting into this law also gives the useful full-group anomaly
Here being modular of weight means obeying the weight transformation law, or equivalently being invariant under the slash operator for modular forms:
This transformation property alone does not impose holomorphy; a holomorphic modular form additionally satisfies interior and cusp holomorphy. That distinction is needed for the nonholomorphic completion in the next part.
Put . For , conjugation by gives the integral determinant-one matrix
Since the denominator in the latter action is , the full-group modularity of gives
Thus argument dilation lowers the group to the Gamma 0 congruence subgroup while retaining the weight. If is a holomorphic modular form, cusp holomorphy is preserved too: an integral matrix of determinant factors as an integral determinant-one matrix times an upper triangular positive-determinant matrix. The corresponding slash translate is a constant times with positive , whose expansion at infinity has no negative exponents. This checks every rational cusp; for a cusp form its constant term remains zero. It is the level-one instance of the degeneracy map for cusp forms.
Fix and let . We use the binary convention for the theta function with characteristics in the PDF. Its nonzero exponential prefactor does not change the zeros of the translated . The four characteristic functions are entire in , by normal convergence of their Gaussian series.
We first prove their zero information, rather than assume that the quotient has no poles. Pair the terms with indices and to get
The logarithmic derivative is periodic under and satisfies , by the spatial transformation formulas. Choose a fundamental parallelogram with zero-free boundary. Its vertical-side integrals cancel, and subtracting the top horizontal integral from the bottom one gives . The argument principle therefore counts exactly one zero inside, with multiplicity. Thus the displayed zero is simple and is the unique one modulo . The zeros of theta functions with characteristics are consequently
All are simple. In particular the three even theta constants are nonzero and .
Let be the product of these four functions divided by . The denominator's simple zeros occur exactly at the four half-periods modulo , and each is cancelled by the corresponding simple numerator zero. Hence extends to an entire function. Under , the four numerator signs multiply to one, as do the two successive shifts of the denominator. Under , the numerator has multiplier , where ; the denominator, whose argument shifts by , has the same multiplier. Thus is an entire elliptic function with periods . It is bounded on a fundamental parallelogram and hence on the plane, so Liouville's theorem makes it constant.
At , the simple odd zero gives . Therefore the Jacobi theta duplication identity is
At a zero of the displayed denominator, this is interpreted by removable continuation. Equivalently, multiply through by the denominator to obtain an entire product identity valid for every .
Use the Fourier transform convention . For a Schwartz function , the Poisson summation formula is
To prove it, periodize as . Rapid decay of all derivatives makes this a smooth periodic function, with uniform termwise differentiability. Its th Fourier coefficient is
where absolute convergence justifies splitting the real-line integral into unit intervals. Integration by parts gives rapid decay of the coefficients of , so its Fourier series converges absolutely and uniformly to . Evaluate it at zero to obtain the formula.
For and , take the complex Gaussian function . It is a Schwartz function of the real variable . Its Fourier transform is
The real Gaussian integral proves this first for , , and real . Normal convergence of the defining integrals makes both sides entire in and holomorphic in , so the identity theorem extends it to the stated domain. Choose the square-root branch holomorphic for in the right half-plane and positive when .
Applying Poisson summation gives the transformation of the Jacobi theta function:
The series on the right is . Rearranging therefore gives
The branch choice is part of the formula; at its square-root factor equals one.
Fix an even weight and write . Extend the slash operator for modular forms to positive-determinant rational matrices by the determinant-normalized slash operator
The automorphy factor identity makes this a right action. Let be the integral matrices of determinant . Their left -cosets have unique determinant-n matrix representatives for Hecke operators
An integral row operation obtained from Bézout's identity makes the first column , and a row shear reduces the other top entry modulo , proving this description. The usual Hecke operator is
This normalization has . Right multiplication by permutes the left cosets in , so has the same modular transformation law as . Each summand is holomorphic in . Holomorphy at the cusp and preservation of cusp forms follow directly from the coefficient formula below; the full modular group has only one cusp orbit. Thus the operators act on both and .
If , summing over kills terms unless . Writing gives output exponent , so a term of exponent requires and has original index . Its multiplier is . The Fourier coefficients of a composite-index Hecke operator are consequently
For , this means . In particular . For a prime number ,
with a nonexistent fractional-index coefficient interpreted as zero.
The Hecke multiplication relations follow from these coefficients. For coprime indices, the two divisor choices combine uniquely and give . For prime powers put , and, on formal Fourier series, let and . These individual maps need not preserve level one, but , and the coefficient formula gives
Multiplying on the left by and cancelling yields
Induction gives ; combining distinct prime factors proves
The modular Hecke algebra is therefore commutative and generated by its prime-index operators. The identity , rather than the generally false reversed identity, is what proves the prime-power recurrence.
On use the positive definite Petersson inner product
Exponential cusp decay makes this integral finite. The Hecke operators are self-adjoint for the Petersson inner product. Here is the correspondence argument. For a positive-determinant matrix , set . The finite sum over the double coset unfolds its pairing into
Changing variables preserves hyperbolic area, and shows that the determinant-normalized slash factors transfer from to on . The new quotient is by ; folding it back gives the operator for the reversed double coset. For , its adjugate again lies in . Positive scalar matrices act trivially in the determinant normalization, so and its adjugate give the same action. The adjugate involution preserves the entire determinant- correspondence, and the external normalization is real. Thus
Finite-dimensional spectral theory now gives a simultaneous orthonormal eigenbasis on , since the operators commute and are self-adjoint. For a common Hecke eigenform with eigenvalues , the first-coefficient formula gives . If , every coefficient vanishes and , a contradiction. Rescale each eigenform to have . The resulting basis is orthogonal, and
All these eigenvalues and coefficients are real. A fixed simultaneous eigenspace is one-dimensional, because its normalized Fourier coefficients are uniquely determined by the eigenvalues.
Applying the multiplication relations to an eigenform gives
The recurrence yields . Multiplicativity then gives the Euler product of a Hecke eigenform
initially in a right half-plane, for example using the Fourier coefficient bound for a cusp form. Modular inversion and the Mellin transform of a cusp-form L-function continue to an entire function and give .
There is also an integral structure. If , choose , , with a monomial in of weight and constant term one. These forms have integral Fourier coefficients and start with ; their first coefficients form a unitriangular matrix. They are a basis, and every cusp form with integral coefficients is an integral combination of them, by successive elimination of its first coefficients. The coefficient formula shows that preserves this lattice. Its characteristic polynomial is consequently monic with integer coefficients, proving that the Hecke eigenvalues are algebraic integers. Together with self-adjointness, this gives real algebraic integers without requiring any unproved bound for their sizes.
For even , the full space decomposes as . The normalized Eisenstein series is a simultaneous eigenform with
Its coefficients are , and the elementary divisor identity verifies the eigenvalue formula, including the constant coefficient. Thus the cusp eigenbasis plus diagonalizes the operators on . Weight two and odd weights have no forms; in weight zero the constant function has eigenvalue . As a concrete cuspidal example, , so for its Fourier coefficients, and the recurrence gives .
A modulus of a number field is , with a nonzero integral ideal and a subset of the real places. Let be the group of fractional ideals prime to , and let consist of principal ideals with at each prime power in and at each selected real place. The ray class group is
The ray class field is the finite abelian extension for which the Artin map has kernel and induces an isomorphism . Equivalently it is the maximal abelian extension whose conductor divides .
To compute its order use the ray class exact sequence, including signatures:
The middle map lifts a residue and sign tuple to an element of by weak approximation theorem, then takes its principal ideal as a ray class. Different lifts differ by a principal ray factor. Its kernel consists exactly of tuples represented by global units. Every ordinary ideal class has a representative prime to the finite modulus, again by weak approximation theorem; this gives surjectivity of the last map. If denotes the ray units, the kernel of the unit map is . The Chinese remainder theorem and counting units in each prime-power quotient give the ray class number formula
First take . Its ring of integers is , where and . The Minkowski bound for ideal classes is , so every ideal class has a representative of norm one and . Its units are the six roots of unity. Modulo seven, the polynomial has distinct roots , and therefore
The unit group of this quotient has order . The unit maps to , which has order six; consequently unit reduction is injective and . The ray class number formula gives .
We also identify the quotient explicitly. Conjugation interchanges the two factors, so the residue norm is . Its kernel has order six and equals the image of the six units, since . Hence
The field has degree six over , since the degrees over are twelve and two. It is unramified outside seven by the cyclotomic computation and the base-change argument above. At primes over seven, has completion , and is the tame degree-six cyclotomic extension; its conductor exponent is one. Its relative arithmetic Artin symbol at an ideal prime to seven acts by
If with , then . Thus the Artin map kills the principal ray subgroup. It factors through the order-six ray class group; the residue norm quotient computed above shows that it is onto the degree-six Galois group, so the fields coincide. This proves the explicit ray class field of Q of square root minus three modulo seven:
Now take , and write . Its ring of integers is , its discriminant is , and its units are . The quotient by is
whose two units are both images of . The ray class exact sequence therefore gives .
For its class number, the Minkowski bound for ideal classes is , so each ideal class contains an integral ideal of norm at most three. The primes of norms two and three are
These are the only nontrivial possibilities within the bound, and their ideal classes coincide and have order at most two. The ideal is not principal: its being principal would give an integer solution to , which is impossible. Thus , the ideal class group is , and the ray field is the Hilbert class field.
We verify its actual identity rather than stopping at the degree. Put
The two quadratic fields and are distinct, so and . The integral elements are a rational basis. Their trace matrix is the Kronecker product of the two quadratic trace matrices, with discriminants and . Its determinant is therefore . The discriminant-index formula for an integral lattice shows that the field discriminant divides . On the other hand the relative discriminant ideal formula gives
The norm on the right is a positive integer, so equality is forced. Thus the relative discriminant ideal is the unit ideal, and is unramified at every finite prime. There are no real places of . The extension is quadratic and therefore Abelian; its degree equals , identifying it with the Hilbert class field of Q of square root minus six. Hence the ray class field of Q of square root minus six modulo square root minus six is

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact