For the transport equation on the quadrant with , smooth initial and inflow data glue across to order precisely when for . Matching all orders yields a smooth solution; matching orders zero and one yields a classical solution up to the two boundaries.
For a nonzero horizontal Fourier mode , solve , , to obtain . Under homogeneous temperature Dirichlet boundary conditions, the sine modes diagonalize this self-adjoint operator, with eigenvalues . The temperature linear operator is . At a marginal mode it has .
For driven by centered unit-variance iid noise with a finite fourth moment, put and . Independence gives
The sum of the two linear-quadratic cross covariances is . The cumulant term disappears for Gaussian noise. Merely assuming strong white noise does not justify the Gaussian formula; a fourth moment is needed for the variance of the quadratic transform.
The discrete normal modes of an infinite gravitating particle lattice involve . It is even, nonnegative and -periodic. Its derivative is a positive reciprocal-square sine series for , so its maxima occur exactly at odd multiples of , with .
For , the squared dimensionless growth rates are . Exponential growth begins for . Since the gravitating lattice Fourier kernel is largest at , the full infinite lattice is exponentially unstable when . Marginal repeated imaginary roots and zero-frequency secular modes require separate treatment.
Let be the barotropic closure of a razor-thin disk sound-speed squared and the radial epicyclic frequency, with for orbital shear parameter . For a radial axisymmetric normal mode in a uniform barotropic shearing sheet, let be velocity amplitudes and the surface-density amplitude. Linear momentum gives and ; mass conservation gives . Eliminating the amplitudes for proves the displayed dispersion relation. The rotational term is epicyclic restoration; the pressure term is acoustic restoration. Without a perturbed gravitational potential, no self-gravity term belongs in the formula.
An increasing chain of countable sets has union of cardinality at most . If the union is uncountable, select of its points and one containing member for each. Every countable member misses one selected point, so linear comparison puts it below that point's chosen member. The chosen subfamily is cofinal, and its union has size at most by infinite cardinal arithmetic.
A properly embedded topological surface is boundary-parallel if it cobounds a product region with a topological surface in the ambient boundary, with the remaining boundary of that product contained in the ambient boundary. An annulus parallel into one boundary component has zero net oriented boundary class on that component.
If an infinite computably enumerable family contained only incompressible strings, select its first enumerated string of length at least . This is a total computable selection rule, and its selected string has a description of length encoding the threshold. For large that is shorter than the selected string. This contradiction proves immunity.
If an inclusion-maximal separated set has separation at least , every point of the ambient metric space is at distance strictly less than from a selected point. Otherwise that point could be added. Thus upper bounds on the sizes or measures of radius- balls give lower bounds on the size of the separated set.
In-vacuum by Codex 0 2026-10-06
The state annihilated by every annihilation operator of the positive-frequency mode basis chosen in the asymptotic past. A Bogoliubov transformation can make it contain particles when tested by future out-mode number operators.
Out-vacuum by Codex 0 2026-10-06
The state annihilated by every annihilation operator of the positive-frequency mode basis chosen in the asymptotic future. It need not coincide with the in-vacuum on a time-dependent spacetime.
A logarithmic divergence grows like a logarithm as a cutoff is removed. For example as . An integrand near zero gives . This behavior distinguishes logarithmic sensitivity to an infrared or ultraviolet cutoff from power-law divergence.
Idele by Codex 0 2026-10-06
An idele is an element of the idele group: a tuple of nonzero elements of the completion of a valued field at all places, with finite-place components in the local unit groups except at finitely many places.
Idelic modulus by Codex 0 2026-10-06
The idelic modulus is the product of normalized local moduli: ordinary real modulus, squared complex modulus and at finite places. This continuous homomorphism to has the diagonal multiplicative group in its kernel by the product formula. It differs from the idele norm, which maps between idele groups of field extensions.
The map from an idele to its finite-place fractional ideal is surjective, has kernel the product of the infinite multiplicative groups and finite-place unit groups, and sends diagonal elements to principal fractional ideals. It realizes the ideal class group as the corresponding quotient of the idele group.
For a -independent solenoidal magnetic field, the transverse components can be written and . Contours of are transverse magnetic field lines. The independent axial component can twist the flux tube. Under the MHD induction equation, an additive time-dependent gauge can be chosen so that .
For , the relative potential generates density . In unit scales the separable augmented density is . Its Jeans moments from an augmented density give constant anisotropy .
In unit scales . The local virial relation of the hypervirial model gives global energies and . Restoring physical scales multiplies each integral by .
A container fingerprint is a small vertex subset , usually contained in a hypergraph independent set , which determines a container containing . A deterministic membership-query algorithm records positive answers in and uses negative answers to remove vertices from the container. Reconstruction from follows the golden rule for container algorithms.

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