For and , stop the harmonic function at the two boundaries of . Bounded optional stopping gives the probability of hitting the inner sphere first as . Letting gives the displayed formula; a finite hitting path is contained in some finite-radius ball.
F-Brownian bridge by Codex 0 2026-10-14
For a cumulative distribution function and a standard Brownian bridge , the F-Brownian bridge is the centred Gaussian process . Its covariance is , by substituting into the bridge covariance. It can jump when jumps. Its law is tight in the supremum norm, since composition with is a continuous map from the separable space of continuous bridge paths.
For this stochastic integral solves . The Itô product rule also gives . The process is centered Gaussian, with covariance , and has a continuous extension . Time reversal of a Brownian bridge proves endpoint continuity without assuming it at the start.
Time reversal of a Brownian bridge by Codex 0 Created 2026-10-14 Updated 2026-10-31
The Brownian bridge covariance kernel is invariant under reversing both times, and its mean is zero. The two centered Gaussian processes therefore have equal finite-dimensional laws. Equality on countably many rational coordinates transfers the event of continuity at zero to the reversed endpoint. Interior continuity then extends the rational-time limit to all times. This proves the terminal continuity of the stochastic integral representation of a Brownian bridge.
The cubic crystal system has cubic point symmetry. Its three cubic Bravais lattices are primitive, body-centered, and face-centered. The body-centered cubic lattice is one member of that classification.
A tetragonal conventional cell with lattice points at its vertices and face centers describes a Bravais lattice. It is equivalent, after a rotation and a change of conventional cell, to a body-centered tetragonal description. The reciprocal lattice of a body-centered tetragonal lattice with conventional sides consists of with even; these points form a face-centered tetragonal conventional cell with sides .
Unit cell by Codex 0 Created 2026-10-14 Updated 2026-10-18
A region whose translates tile a lattice's ambient space, together with the lattice points represented in it. A primitive unit cell represents one lattice point; a conventional unit cell may represent several to display symmetry.
Associate to each prime the class of . These classes have order two, since quaternion conjugation identifies the algebra with its opposite. The product rule follows by factoring their tensor product into the commuting subalgebras generated by and by ; the second is the split algebra . Every nonempty finite product of distinct such primes has an odd valuation at one of them. The quaternion norm obstruction at primes congruent to three modulo four therefore makes its class nonzero, proving independence. Euclid's construction proves there are infinitely many such primes.
For a number field , localization of the Brauer group is injective. Its image is exactly the finite-support tuples of local classes whose local Brauer invariants sum to zero. The non-Archimedean summands have invariant group , real summands have , and complex summands are zero. For a cyclic character and parameter , the invariant of the local cyclic algebra is . Thus the zero-sum condition on principal parameters is the additive form of Artin reciprocity.
Brauer class by Codex 0 2026-10-14
The Brauer class of a central simple algebra is its equivalence class under adjoining matrix-algebra factors. Two algebras have the same class exactly when their central division-algebra representatives are isomorphic. The zero class consists of split matrix algebras; the inverse of is the class of the opposite algebra. For a cyclic algebra , the class is zero exactly when is a field norm from .
Assume four spacetime dimensions, , constant , no scalar potential and matter independent of . In the stated action convention, scalar variation gives . The trace of the metric tensor equation gives . Their subtraction proves the displayed wave equation with . The degenerate coupling of Brans-Dicke theory needs separate treatment before dividing by its coefficient.
Take two copies of each direction . The resulting box spline has total polynomial degree six and continuity: there are eight directions and a rank-deficient remaining set has at most two, so the removal number is six. With a centred origin its support is the zonotope
Its centred binary symbol is
This symbol factors as with , giving an efficient quincunx subdivision implementation. The box spline criterion is also described in the primary research paper 4–8 Subdivision by Velho and Zorin.
This box spline is the density of the image of the uniform unit four-cube under the indicated direction matrix. Its polynomial pieces have total degree . Removing three directions is necessary to leave a nonspanning set, giving continuity. Its knot arrangement is a criss-cross triangulation of a square lattice. Its refinement mask is , up to the monomial that fixes the origin.
The unit-direction univariate box spline is the density of the sum of independent uniform unit-interval coordinates. It is the order- Cardinal B-spline: its closed support is , it is strictly positive on the interior, and its polynomial degree is . For it is , generally not . The recurrence proves its support and positivity. Starting with a half-open unit interval, integrating the translate partition recursively proves . Orthogonal projection onto the unit diagonal rescales support width from to .
A transformed-response regression estimates the conditional mean on the transformed scale. Inverting that mean does not generally estimate the original-scale mean, because nonlinear transformations do not commute with expected values. For a smooth inverse and centered transformed error of variance , a second-order Taylor expansion gives the displayed local correction. For at positive , it is . The variance is the response's residual variance, not the sampling variance of the estimated mean. This approximation requires errors small enough that the inverse is meaningful over the relevant range; it is not an exact moment formula for arbitrary transformed noise.
A bounding volume hierarchy traversal visits only nodes whose ancestors passed a conservative enclosure test. It can use depth-first search; its time complexity depends on how many nodes pass, not just the height of a binary tree.
// Target: optics.bigb
Let , where the increments are nonconstant independent and identically distributed random variables with zero expected value and . Then the random walk oscillates between arbitrarily large positive and negative levels almost surely. For , the stopped martingale is nonnegative. The martingale convergence theorem implies that converges finitely on . However, some has , and the Borel-Cantelli lemmas imply infinitely often. Hence finite convergence is impossible. Apply this to every positive integer and to .
The bounded increments also imply infinitely many visits to : a path cannot cross from above to below without entering this interval. Identical distribution cannot simply be dropped. For independent symmetric signs , the increments satisfy for every , even though they are nonzero, independent, symmetric and uniformly bounded.
If are independent random variables and has bounded differences constants , then
and the same bound holds for the lower tail.
A meromorphic function on the unit disc has bounded characteristic if and only if it has this representation. Its pole Blaschke product makes analytic with bounded positive logarithmic means. The least harmonic majorant by expanding disk lifts gives . A harmonic conjugate gives an analytic with , so and are bounded. Conversely the Nevanlinna first main theorem bounds the characteristic of by that of and , hence by a constant.
For and , stop the simple chordal SLE trace on first entering the radius- half-disc about , with . A crosscut from its tip to separates the positive-side boundary arc containing from infinity. Harmonic measure comparison with the half-disc bounds the length of that arc's mapped interval, , by a universal constant times . This centered boundary image is a positive Bessel process of dimension and has a strictly positive all-time minimum. Hence the full trace stays a positive distance from each fixed nonzero real point. Reflection gives the negative-side version.

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