Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A nilpotent thickening is a closed immersion defined by a nilpotent ideal sheaf of a closed subscheme. Its underlying topological map is a homeomorphism, because every prime ideal contains every nilpotent element. For example, quotienting the dual numbers by changes the structure sheaf without changing the single point of the spectrum.
Interior-point swallowing time for a Loewner chain by
Codex 0 Created 2026-10-05 Updated 2026-10-06
For a continuous Loewner driving function , is the maximal lifetime of in the complex upper half-plane under the Chordal Loewner equation. A finite lifetime has as : otherwise the continuous driver and the ordinary differential equation continue the solution. A swallowed point need not have been visited by the Loewner trace; it may lie in a disconnected pocket of the filled hull.
On the invertible- branch, use and the two-component Grassmann algebra identity . Then , and . These are the components of . Generally is nonzero, so cubic nilpotency must not be replaced by quadratic nilpotency. The allowed analytic holomorphic monomials are .
Translation by a differential one-form is . It changes the canonical one-form on a cotangent bundle by . A closed differential form gives a symplectomorphism; an exact differential form gives a Hamiltonian diffeomorphism when compact support is not required.
A section of the square of the canonical bundle, locally ; its coefficient changes by the square of the coordinate derivative. A holomorphic quadratic differential has holomorphic coefficient, and its flat metric of a quadratic differential is .
A section of the cube of the canonical bundle, locally with holomorphic coefficient. The flat coordinates obtained by integrating cube roots have transitions , ; general real-linear deformations do not preserve these as holomorphic transitions.
For standard Brownian motion started at zero, is finite almost surely for andThe Brownian reflection principle proves finiteness. For , the Exponential martingale for Brownian motion stopped at is bounded by . The dominated convergence theorem gives , and taking gives the transform.
Fixed-level versus simultaneous Brownian passage-time equality by
Codex 0 Created 2026-10-05 Updated 2026-11-05
For standard Brownian motion, set and . The Strong Markov property and immediate positive excursions give almost surely for each fixed . However, these level-indexed processes are not indistinguishable stochastic processes. Almost surely the random level is positive and exceeds . It is first attained before time one but is not exceeded until after time one, so . The simultaneous-equality event therefore has Probability zero. The strict passage process is the right-continuous choice needed for a subordinator.
Adjoint branching to root sl2 subalgebras in rank two by
Codex 0 Created 2026-10-05 Updated 2026-11-05
A root string of length gives an irreducible sl2 Lie algebra module when restricting the Adjoint representation to the sl2 subalgebra associated with a root. Include also the root's own and one commuting Cartan direction . For either simple root gives . For , the long root gives and the short root gives . For , the long root gives and the short root gives .
A first-order formula is ZF-equivalent bounded if ZF proves it equivalent, with the same free variables, to a syntactically bounded formula in set theory. It need not itself have only bounded quantifiers. Between transitive models of ZF, use the bounded equivalent and the axioms in each model to prove set-theoretic absoluteness. The syntactic bounded-formula result requires only transitivity; the provable-equivalence extension additionally requires the theory used for the equivalence.
Second-order pointwise bias bound for kernel density estimation by
Codex 0 Created 2026-10-05 Updated 2026-11-05
Let a nonnegative kernel for density estimation have integral one, zero first moment and finite second moment . If a probability density function has bounded second derivative, its kernel density estimator has pointwise bias at most . Apply the Taylor theorem with Lagrange remainder to and integrate: the first-order term vanishes and the remainder is bounded by . For , .
The law of , for independent fair binary digits , is supported on the Cantor set. It is invariant and ergodic under , as the image of a Bernoulli shift. Each permitted ternary cylinder of length has measure , giving entropy rate . The Host equidistribution theorem makes almost every point a normal number in base , while its ternary digits omit .
For hidden activations and class probabilities , a one-hot label has log-likelihood . Put and . ThenThese follow from the chain rule and give single-observation stochastic gradient descent updates for the negative log-likelihood.
For a finite morphism , the pullback of an ample line bundle is ample. If is also surjective, ampleness is equivalent in both directions. These results hold for proper schemes over a field, including nonreduced schemes. Cohomological ampleness and the exact finite pushforward prove the forward direction; coherent-sheaf devissage gives finite-surjective descent. In particular, a finite map to projective space makes the pulled-back hyperplane bundle ample.
On a projective scheme, a line bundle is ample exactly when its restriction to every reduced irreducible component is ample. The disjoint union of those components maps finitely and surjectively to the scheme, so finite-surjective descent of the finite pullback of an ample line bundle proves this. The same argument applies to restrictions to any closed subscheme. Thus nilpotent structure does not affect ampleness.
An affine open subscheme is an open subset of a scheme with its restricted structure sheaf, which is itself an affine scheme. Every scheme has an open cover by such subschemes. On an affine scheme, the principal open subschemes give an open basis.
For an affine morphism and a quasi-coherent sheaf on , the direct image sheaf has the same sheaf cohomology on as on . To prove this, take a flasque resolution . Its direct images are flasque sheaves. On each affine open , the complex of sections of the direct images is . By vanishing of quasi-coherent cohomology on an affine scheme, this augmented complex is exact. Checking on the affine basis proves that resolves . Its global sections are identical to those of the original resolution.
Parity estimator for a zero-truncated Poisson count by
Codex 0 Created 2026-10-05 Updated 2026-11-05
For the zero-truncated Poisson distribution, is the unique integrable nonrandomized unbiased estimator of . Indeed unbiasedness gives , and power series coefficients force the parity values. Its variance is ; clipping it to gives mean squared error , strictly smaller for .
Normalizing the tableau lines in a compatible real phase convention gives the orthonormal basis formAdmissible swaps have . Nonadmissible swaps act by within a row and within a column. The symmetric matrix is an orthogonal involution and is useful for making the unitary representation and its phases explicit.
Equidistribution of a quadratic polynomial with irrational leading coefficient by
Codex 0 Created 2026-10-05 Updated 2026-10-07
If is irrational and are real, the fractional parts of form an equidistributed sequence. In the Van der Corput lemma, every nonzero-lag correlation of is a geometric series with irrational frequency and tends to zero. The Weyl criterion then applies.
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





