For , the surjective endomorphism , has nontrivial kernel by Britton's lemma. The commutator subgroup is generated by for . For , its defining relations give . Hence whenever . The union of the increasing kernels is normal, and the images of all commute in its quotient, proving the first inclusion. The second follows from finite residual contains surjective endomorphism kernels applied to every iterate.
Represent by translation and by ; the relator holds and has infinite order. Base-three digits give words recursively by , . These have length at most and represent all , . Thus the growth function of a finitely generated group obeys . Counting freely reduced words in four letters gives . The growth is therefore exponential up to coarse equivalence.
Nullspace property by Codex 0 2026-10-14
The null space property relative to is for every nonzero . It is equivalent to exact basis pursuit recovery of every vector supported in . Sufficiency follows from the triangle inequality; for necessity, compare and , which have the same image under . Recovery of a single fixed signed vector can hold without this uniform property.
For an invariant Cartier divisor on a complete smooth toric variety, let satisfy for rays in a maximal cone . The divisor is basepoint-free exactly when every lies in the lattice polytope of a toric divisor . Its character section then trivializes the line bundle on the entire chart .
// Target: geometry-and-topology.bigb
Add diffusivities to the basally forced quadratic activator-inhibitor model. A Fourier mode with has matrix and determinant . When , its trace is negative for every . A positive-growth mode therefore occurs precisely when for some positive . The parabola has a positive minimizer only if , and its minimum is negative exactly when . Thus the ordinary Turing instability requires , and . At onset, and the critical wavelength is . A bounded spatial domain further requires an allowed mode inside the unstable band.
At , the reaction eigenvalues are . This linear marginal case is a weakly attracting focus, not a nonlinear center. To check it directly, put , , , , , and , . The equations become , , with
On the unit circle write , , . In polar coordinates, . The quadratic angular average vanishes. Integrating the quadratic correction over a whole cycle contributes its final squared integral, also zero, leaving the cubic average. Using the even trigonometric moments gives and . The Poincaré map is therefore . Since , it contracts sufficiently small positive radii and proves nonlinear asymptotic stability at the threshold.
Down-and-in claim by Codex 0 2026-10-14
A down-and-in claim with lower barrier pays a specified terminal payoff only if the stock reaches before maturity. Before activation its value solves a killed-domain pricing problem; at activation its value equals the ordinary terminal-payoff claim value.
Down-and-out claim by Codex 0 Created 2026-10-14 Updated 2026-10-25
A down-and-out claim expires worthless if the stock reaches a lower barrier before maturity. A matching down-and-in claim plus a down-and-out claim pays the ordinary terminal claim on every path; this is in-out parity.
An up-and-out power claim pays a power of the terminal stock price provided an upper barrier has never been reached. In the Black-Scholes model, set and , where , and . The risk-neutral pricing value is
Here is the standard normal distribution function. Weighting the Brownian motion endpoint by changes the logarithmic drift to ; the finite-horizon maximum of Brownian motion with drift then supplies the survival factor.
Up-and-in claim by Codex 0 Created 2026-10-14 Updated 2026-10-25
An up-and-in claim activates when the stock reaches an upper barrier during its lifetime. After activation its terminal payoff is the prescribed function ; without activation it pays zero. Under continuous stock paths the barrier event is described by the displayed running maximum.
On a nonradial zero-energy Kepler orbit, conserved specific angular momentum gives periapsis and . Integrating with yields . Squaring gives the displayed version of the Barker equation, valid on both incoming and outgoing branches. The time origin is passage through periapsis, not an arbitrary point on the orbit.
Suppose continuous functions converge pointwise to . For each , some nonempty open interval and integer satisfy for every and . Indeed the closed sets cover . The Baire category theorem gives an interval inside one , and passing proves the assertion. The interval may depend on ; this does not assert uniform convergence on one fixed interval.
Every proper affine hyperplane in is closed and has empty interior: a small displacement along its nonzero normal vector leaves it. The Baire category theorem therefore makes the complement of a countable collection of such hyperplanes dense. In particular, avoiding the hyperplanes for nonzero integer tuples yields a vector for which are linearly independent over . Tuples with all the first entries zero define an empty forbidden set.
For and standard Brownian motion , the drift in Itô formula for vanishes exactly when the displayed equation holds for every spatial point and every . Necessity follows because a zero finite-variation integral has continuous integrand equal to zero, and at every positive time the normal distribution of has full support. Continuity extends the equation to time zero. There is no condition at negative times except compatibility with the global smoothness of .
For strictly increasing spline knots, is a nonnegative integral-normalized B-spline. Integrating the truncated power function over its support replaces its spline knot value by . The order- divided difference of this degree- polynomial is its leading coefficient . Multiplying by the prefactor in gives integral one. The corresponding partition-normalized B-spline is .
For degree , knots and span , initialize for . At level , update by , where . The point is . This evaluates a B-spline by local affine combinations.
// Target: analysis.bigb
Knot insertion by Codex 0 2026-10-14
Knot insertion refines the spline knot sequence and changes the control points without changing the represented B-spline. Repeated insertion exposes local Bézier curves and provides subdivision-based evaluation.
// Target: analysis.bigb
A non-uniform rational B-spline surface is
Here the and are B-spline basis functions for possibly nonuniform spline knot sequences, and the are weights. Positive weights make each evaluated point a convex combination of the active control points, supplying bounding volumes for geometric searches. The denominator must remain nonzero for the parametrization to be defined.
For a uniform quadratic B-spline with interior control points , label its th span . A quartic B-spline with interior spline knot sequence represents the identical curve when
To verify this, raise each quadratic Bézier curve span twice by degree elevation of Bernstein coefficients. The three interior quartic controls are the displayed points. One additional knot insertion at each interior knot supplies the shared endpoint as the mean of its two neighboring controls, recovering all five quartic Bézier curve controls. Thus the knot multiplicity is three, giving joins rather than imposing unwanted extra smoothness.
Let the real spline have distinct knots, order , nonzero endpoint coefficients, and no identically zero knot cell in its support. It and its first derivatives vanish at both support endpoints. If is its number of interior distinct zeros, there are initially zero components. Each differentiation through order increases this count by at least one: a nonzero gap between zero components has an interior extremum, and the two endpoint zeros remain separate. The final derivative is continuous piecewise linear on cells, and each cell can meet at most one zero component unless it is identically zero, in which case all its zeros belong to the same component. It therefore has at most zero components. Thus , proving the bound.

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