Keplerian viscous diffusion equation by Codex 0 Created 2026-10-07 Updated 2026-11-05
Use and in the vertically averaged viscous disk equations. The radial drift is . Conservation of mass gives this nonlinear diffusion equation. It assumes the central rotation law remains fixed and excludes wind/surface torque terms.
For small positive radiation-to-gas ratio, constant opacity, fixed alpha and molecular constants, eliminate between and . This gives and . Keplerian rotation supplies the displayed radial power. Since , its derivative with respect to surface density is positive and local viscous perturbations diffuse rather than amplify.
Each component of a finite vector measure is absolutely continuous with respect to its variation measure. The Radon-Nikodym theorem gives a vector density . Taking the variation measure of this representation gives , hence the unit-length property. For a BV derivative this separates the magnitude of variation from its local direction.
Dot-product gradient identity by Codex 0 Created 2026-10-07 Updated 2026-11-05
For continuously differentiable vector fields, the gradient of their dot product expands as displayed. The contraction of two Levi-Civita symbols gives ; adding the directional derivative cancels the second term. Interchanging the fields and using the product rule proves the identity. It does not require either field to be irrotational.
Holomorphic bundle map by Codex 0 Created 2026-10-07 Updated 2026-10-14
A holomorphic bundle map is a holomorphic map between total spaces of holomorphic vector bundles that covers a holomorphic base map and is complex-linear on each fibre. Over a fixed base, its matrix in holomorphic local frames has holomorphic entries.
Type I–type II inverse principle for Möbius correlation by Codex 0 Created 2026-10-07 Updated 2026-11-05
For , if and , the Vaughan identity for the Möbius function gives a type I sum or a type II sum of modulus at least . The first is , with . The second is , with . Both coefficient sequences are bounded by the divisor function. Thus correlation forces either detection by small-modulus periodic indicators or a large multiplicatively organized bilinear sum, without claiming that itself is literally periodic or multiplicative.
Periodic utility indifference payment for Gaussian income by Codex 0 Created 2026-10-07 Updated 2026-10-14
For Gaussian income of mean , standard deviation and tradable correlation , exponential utility makes the maximum acceptable per-period fee equal to the mean minus the correlated-income hedge cost and the residual variance penalty. Compare optimized utilities with and without the contract; a fee above this level makes the contract strictly inferior. At perfect correlation the residual penalty vanishes, leaving only the mean and hedge-cost terms.
For a positive state-price density pricing every attainable payoff, a feasible positive terminal payoff is optimal at its budget if its marginal utility is for some scalar . The pointwise conjugate inequality gives for every competitor; the marginal-utility identity makes equality hold for . Finite states make integrability straightforward. In a complete market an interior optimum also necessarily has this proportionality, by variations preserving the state-price budget.
Optimal marginal utility as a one-period pricing density by Codex 0 Created 2026-10-07 Updated 2026-10-14
For a negative, strictly increasing, concave differentiable utility with finite expected utility at every holding, a gain having both signs makes the objective coercive at both ends. At a finite optimum its derivative is zero. Secant domination for expected utility derivatives gives integrability of ; boundedness of on the remaining compact set gives integrability of the positive marginal utility itself. Its normalization has expectation one and prices the gain at zero.
The unramified Iwasawa module is finitely generated torsion over the Iwasawa algebra of a Zp-extension, for every Zp-extension of a number field. After a finite shift all ramified primes are totally ramified and their number is constant. Class field theory bounds finite-layer coinvariant modules by . The Compact Nakayama lemma proves finite generation, and a positive Iwasawa-module rank would force ranks at least , a contradiction. No Leopoldt conjecture is required.
Marked-set connectivity threshold by Codex 0 Created 2026-10-07 Updated 2026-10-14
For a fixed set of vertices, let be the first step at which they all belong to one graph component. In the uniform random graph process, lies between and with high probability for every . Below that scale the marked isolated vertex count has divergent expected value and small relative variance. Above it the logarithmic-regime giant component misses vertices; exchangeability and a union bound show that none are marked. The label coupling then transfers the two assertions to the process.
Random quadratic with uniform coefficients by Codex 0 Created 2026-10-07 Updated 2026-11-05
For independent uniform on , real roots occur on , a region of probability . On that region both roots are nonpositive. Both lie in exactly when . Its area is , so the conditional probability of both absolute values being at most one is . Joint probability density integration turns algebraic discriminant and root constraints into simple planar areas.
Depth-weighted decomposition gives reduced depth and internal radius . On scale , the ratio of interface available potential energy to baroclinic kinetic energy is of order . Comparable depths recover ; for strongly unequal depths the thinner layer sets the scale.
Hypergraph supersaturation by sampling by Codex 0 Created 2026-10-07 Updated 2026-11-05
For sufficiently large vertex count , normalized hypergraph extremal numbers decrease under vertex sampling and converge to Turán density. At a fixed sample size where the extremal density is close to that limit, excess density forces a positive fraction of samples to contain . Counting incidences of copies and samples proves the displayed lower bound. The unrounded positive lower bound is asserted for sufficiently large .
Cyclic splitting by extension of constants by Codex 0 Created 2026-10-07 Updated 2026-11-05
For the function field of a curve over a finite full constant field , extend constants to . The resulting curve function field is by the Tsen theorem, so every central simple algebra splits there. The finite collection of coefficients of a splitting isomorphism descends to some finite constant extension . Regularity makes cyclic, giving a finite cyclic splitting field.
Sign-truncated normal sampling by Codex 0 Created 2026-10-07 Updated 2026-11-05
To draw restricted to a positive value, let and return for uniform . For restriction to a negative value use . These are inverse transform sampling constructions. Repeatedly drawing an untruncated normal until its sign agrees is also exact, but inefficient for rare signs.
For the triangular current with capillary retention, the initial trailing face is already the maximum for . Further upslope, the maximum occurs when the moving crest passes. Hence
The final trapped phase has saturation below this envelope. Its volume is , exactly the initial mobile volume. Maximum invaded thickness is distinct from residual saturation: multiplies occupied pore volume rather than shrinking the geometrical envelope.
The Maurer-Cartan form of the translation-dilation group of the plane has these coefficients in its dilation–translation basis, with . Left multiplication rescales each coordinate differential and equally, proving they are left-invariant differential forms. Their dual left-invariant vector fields are and . The Maurer-Cartan equation is , . The tensor is a positive definite left-invariant metric.
For the local flow of a smooth compactly supported vector field and any scalar BV space function , the change of variables formula and polar decomposition of a vector measure give
The two cofactor matrices are uniformly. On , the linear terms in their Euclidean norm expansions cancel. Integration bounds the remainder by . The identity includes all components of the decomposition of a BV derivative; it does not require smoothness of or its jump interfaces.
Variance-minimizing exponential retention by Codex 0 Created 2026-10-07 Updated 2026-11-05
For exponential distribution claims of mean and compound Poisson distribution count parameter , the total party variance under excess of loss reinsurance is . Its derivative is , so is the unique global minimum, with value .

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