Geometric correction for heliocentric velocity dispersion by Codex 0 Created 2026-10-05 Updated 2026-11-05
For tracers sampled uniformly on a Galactocentric shell of radius , with the Sun at radius , the correction in the heliocentric projection of a spherical velocity dispersion is
The limiting value at is ; it tends to as and to at large radius. Uniform heliocentric solid angle at fixed instead gives exactly. Specify the selection measure when applying the correction.
Averaging conjugation by all Heisenberg-Weyl operators completely depolarizes a system:
Summing over phases kills off-diagonal matrix elements, and averaging shifts makes all diagonal elements equal. Acting on subsystem of a bipartite operator gives . This identity turns joint convexity of quantum relative entropy into monotonicity under partial trace.
Dehn presentation Heegaard diagram by Codex 0 Created 2026-10-05 Updated 2026-10-06
Thicken the planar graph underlying a knot diagram. Its boundary supports a Heegaard diagram with face disks on one side and crossing-tunnel disks on the other. The face generators and crossing curves give a Dehn presentation of a knot group.
For a vertical slit of height attached at , the mapping-out function of a compact H-hull is , with the branch asymptotic to at infinity. Its half-plane capacity is .
Suppose a capacity-parameterized Loewner chain lies in a domain on which is a conformal map. For its image chain set . Then the image Loewner driving function is and
The derivative is real by the Schwarz reflection principle. Cancellation of the pole in the differentiated conjugacy identity proves the squared-derivative rule.
Half-plane capacity of a half-disc by Codex 0 Created 2026-10-05 Updated 2026-10-14
For and , the filled half-disc is a compact H-hull. Its mapping-out function of a compact H-hull is . On the semicircle the image is real, and the inverse branch asymptotic to the identity maps the complex upper half-plane onto the exterior half-disc. Its Laurent series has coefficient , so . Using an open half-disc instead requires taking its relative closure first.
Covariant photon Fock space by Codex 0 Created 2026-10-05 Updated 2026-11-05
The covariant free-photon oscillator construction uses four polarization vectors and . Starting from a positive Fock vacuum, it induces an indefinite Hermitian form on the multiparticle state space: the temporal oscillator has negative norm while the three spatial oscillators have positive norm. It is therefore not the physical positive Hilbert space. The Gupta-Bleuler null-state quotient selects a positive physical space with two transverse photon polarizations. Continuum momentum oscillators and their states are understood after smearing or finite-volume regularization.
Gupta-Bleuler null-state quotient by Codex 0 Created 2026-10-05 Updated 2026-10-14
Choose with the standard temporal and longitudinal polarization vectors. The physical pre-space is the common kernel of all . In each regulated mode, acts on creator polynomials as and as , so the constraint kernel consists of transverse creator polynomials and polynomials in . Since , these latter excitations remain constrained. They are orthogonal to every constrained state because . Quotienting this radical of a Hermitian form leaves only the transverse bosonic Fock space with a positive inner product. The constraint alone gives a positive semidefinite Hermitian form; quotienting removes its null directions. If starting from finite-particle creator polynomials, take the Hilbert space completion of this positive quotient to obtain the physical Hilbert space.
If a smooth minimal surface equation for a graph solution on is homogeneous of degree one, with , then its graph extends to a plane through zero. Its gradient is homogeneous of degree zero, so attains a global maximum on the unit sphere. The strong maximum principle for elliptic operators makes it constant. The differentiated equation in the gradient maximum principle for a minimal graph then forces , and degree-one homogeneity removes the affine constant. This argument applies to cones that are graphs of smooth functions away from their vertex; it is not a claim that every minimal surface cone is flat.
Tensor product of globally generated line bundles by Codex 0 Created 2026-10-05 Updated 2026-10-06
The tensor product of two globally generated line bundles is globally generated. At a point choose generator germs arising from a global section of each factor. Their tensor is the germ of a global tensor-product section and generates the rank-one tensor-product stalk. Iteration gives the same property for every positive tensor power, on an arbitrary scheme.
Geodesic sphere by Codex 0 Created 2026-10-05 Updated 2026-10-06
A geodesic sphere is a level set of Riemannian distance from a point. For sufficiently small positive , it is the exponential map image of the radius- tangent sphere, a smooth compact hypersurface. The Gauss lemma makes its tangent space orthogonal to the radial direction. Larger distance spheres need not be smooth at the cut locus.
Let be a nef Cartier divisor and let the coherent sheaf have support dimension . Then for . This does not require reducedness or smoothness.
Choose a very ample and fix sufficiently large for Fujita vanishing. Choose a section of avoiding the associated points of . Its multiplication gives , where has support dimension at most . After tensoring with , the middle term has zero higher sheaf cohomology, uniformly in . Hence . Induct on support dimension: for use the polynomial bound for sections of a fixed divisor, and for use the induction hypothesis. Degree greater than vanishes by Grothendieck vanishing.
Derivative expansion of a four-point vertex by Codex 0 Created 2026-10-05 Updated 2026-11-05
The small-external-momentum expansion of a four-point one-particle-irreducible correlation function generates a local quartic term followed by four-field terms with derivatives, for example and higher-derivative operators, modulo integration by parts. This is an analytic expansion when there is an appropriate gap and regulator smoothness. A sharp projector on every internal momentum can instead generate nonanalytic boundary artifacts; then the local expansion is a smooth-regulator or fixed-loop-cutoff convention, not an automatic theorem about the entire sharp-cutoff vertex.
The First Chern class turns the tensor product of vector bundles of complex line bundles into addition in integral cohomology. This follows by computing the universal complex line bundle on the product of two Complex projective spaces and restricting to each factor. The proof retains torsion elements, which differential forms alone cannot detect.
Quasi-finite morphism by Codex 0 Created 2026-10-05 Updated 2026-10-25
A finite-type morphism of schemes is quasi-finite if its fibres are finite discrete schemes. A proper quasi-finite morphism is a finite morphism. In particular, a proper finite-type morphism of projective varieties with no positive-dimensional fibres is finite; a positive-dimensional projective fibre would contain an integral curve.
Scheme-theoretic fibre by Codex 0 Created 2026-10-05 Updated 2026-10-14
The fibre of a morphism of schemes over is its base change to the residue field . For , with corresponding to , its fibre ring is . Its structure sheaf records nilpotents and multiplicities that the set-theoretic inverse image cannot see.
Feynman-Kac formula with a bounded potential by Codex 0 Created 2026-10-05 Updated 2026-10-07
For bounded and bounded initial data , a sufficiently regular classical solution bounded on every finite time slab satisfies
To prove this, the Itô formula and Itô product rule make a local martingale. Its deterministic bound on makes it a true martingale; taking expectations at the two endpoints gives the formula. This also gives uniqueness in the finite-horizon bounded class. The exponent has the same sign as the potential in the equation.
Reduced-load approximation by Codex 0 Created 2026-10-05 Updated 2026-10-06
For unit resource requirements in a loss network, the effective offered traffic to resource is , where are approximate resource blocking probabilities. The resource being modeled is excluded from its own screening product.
Affinity of entropy under ergodic decomposition by Codex 0 Created 2026-10-05 Updated 2026-10-06
If is an ergodic decomposition, then the Kolmogorov-Sinai entropy satisfies .
If a set partition refines a rectangle of a graph into rectangles , write for its edge density of a bipartite graph. The weighted variance identity is
It follows by expanding the square and using . In particular, equitable regularity energy cannot decrease under refinement. If a witness rectangle has relative sizes at least and edge density of a bipartite graph discrepancy greater than , its contribution, after division by the squared total vertex count, exceeds .

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