A hierarchy is a finite sequence of cuts along properly embedded two-sided incompressible surfaces, without spherical components, ending in disjoint three-balls. Disks are allowed. For an ambient manifold which is not orientable the two-sided cutting surfaces need not themselves be orientable. The existence of a hierarchy does not imply that every choice of incompressible cuts terminates.
Write the Cauchy stress tensor in the local fibre frame as . The compatible geometry has , and . With zero body force, force balance becomes and . For specified shear stress , the first equation determines along fibres, then the second determines along transverse curves. Pressure and fibre tension supply these two normal constraint reactions. This is a local stress construction; boundary tractions must be chosen consistently with its integration data.
Impulsive disruption by stellar mass loss by Codex 0 Created 2026-10-14 Updated 2026-11-05
Take an initially isolated virialized self-gravitating stellar population with kinetic energy and Newtonian gravitational potential energy . Instantaneous spatially uniform removal of mass, without kicks to surviving material, leaves fraction with and . Hence : the homologous whole-system energy is negative only for . Positive whole-system energy does not forbid a bound core after selective escape, and slow mass loss follows the adiabatic mass-loss expansion law instead.
Haldane prior by Codex 0 2026-10-14
The Haldane prior has formal beta distribution parameters . It is an improper prior, with infinite mass at both endpoints of . For a binomial distribution likelihood with successes and failures, its posterior is only when . A density flat in the log odds induces this kernel by the Jacobian determinant .
For , nonzero equilibrium points satisfy and are stable exactly when . The origin is stable for . The quadratic term removes the odd symmetry and changes the local branch crossing into a transcritical bifurcation, with . The negative quintic term bounds trajectories. There is one negative-amplitude fold, supplying a stable finite-amplitude branch and hysteresis with the stable origin. Positive-amplitude folds occur precisely when : has two positive roots then, a double positive root at , and none below it. All branches and stability assignments therefore depend on ; a single symmetric pitchfork sketch cannot describe this family.
Line-vortex trajectory in a quarter-plane by Codex 0 Created 2026-10-14 Updated 2026-11-05
In the quadrant , a line vortex of circulation at has three images: circulations at and , and at . Their induced velocity is
In polar coordinates, these equations give and . Direct differentiation yields , so the trajectory obeys .
Idempotent refinement theorem by Codex 0 Created 2026-10-14 Updated 2026-11-05
In a finite-dimensional algebra, or a complete finite coefficient-ring algebra, primitive idempotents lift modulo a nilpotent ideal or the coefficient maximal ideal. Orthogonal decompositions of the identity lift, and equivalent primitive idempotents have isomorphic associated projective modules. Two lifts of the same idempotent modulo such an ideal are conjugate by a unit congruent to one. This is an idempotent lifting and refinement result; it does not assert that every central idempotent lifts centrally through an arbitrary nilpotent quotient.
Ideal magnetic response to a cylindrical cyclonic event by Codex 0 Created 2026-10-14 Updated 2026-11-05
For an axisymmetric velocity independent of , write . Ideal induction becomes
The first equation expresses magnetic flux freezing of the transverse flux function, while the second is axial stretching . Starting from a uniform field gives and . In complex azimuthal-mode notation, and , obtained by elementary integrating factors. The transverse field has and , preserving zero divergence.
For an ice layer between freshwater and cold brine, set and use solutal similarity positions , . A linear ice temperature, two Stefan conditions and interfacial salt conservation determine both negative interface constants. As with fixed latent-to-sensible heat ratio , but . Freezing above occurs over the thermal diffusion scale, while dilution-driven melting below has the much shorter solutal scale.
Conditional split of two exponential times by Codex 0 Created 2026-10-14 Updated 2026-11-05
For independent exponential distributions with rates , let . Dividing the joint density of by the hypoexponential distribution density of gives a truncated exponential distribution on with rate . Its displayed conditional expectation supplies an E-step when only pair totals are observed. At equal rates the conditional split is uniform, with mean .
If the independent exponential random variables have rates , then
where the are independent exponential random variables of rate . To see this, the first of independent exponential clocks rings at rate ; after it rings, the memoryless property leaves independent rate- clocks. The successive order statistic gaps are therefore independent with rates . Their sum has the same distribution as . In particular, for , the tail at has logarithm , since . The sum divided by has a large deviation principle with speed and rate function on , infinity otherwise.
Bertini's theorem by Codex 0 2026-10-14
For a smooth integral projective variety over , a general hyperplane section in a projective embedding is smooth; if its dimension is at least two, the section is also irreducible. More general statements concern linear systems and their base loci. The smoothness statement is developed in the Stacks Project's Bertini section.
The universal countable uniform hypergraph is the unique, up to hypergraph isomorphism, countably infinite -uniform hypergraph with the hypergraph extension property. To prove uniqueness, enumerate two such structures and construct finite partial hypergraph isomorphisms. Alternately add the least unused vertex of the first enumeration to the domain and the least unused vertex of the second to the range. Prescribe its incidences with every -subset of the already matched vertices and apply the extension property in the other structure. The resulting union is a bijection preserving every hyperedge and nonedge. Existence follows from the countable random uniform hypergraph construction. A construction with only the forward steps embeds every countable -uniform hypergraph as an induced subhypergraph, explaining the word universal. Its isomorphism type is independent of .
Given an -uniform hypergraph and colours, construct an -uniform auxiliary hypergraph with one task vertex for every and one resource vertex for every original vertex and colour. The assignment edge for contains the task and all resources with . A matching in a hypergraph of assignments is exactly a proper partial edge colouring. Task degrees are ; resource degrees are . Pairwise auxiliary hypergraph codegrees are at most . Thus nearly equal original degrees and small original hypergraph codegrees transfer to the setting of a Rödl nibble. A locally balanced Rödl nibble must control the unmatched task count in every original star, not merely the total uncovered proportion.
Suppose a finite population is split into categories with fixed sizes summing to . A uniform size- sample drawn by sampling without replacement has category counts with the displayed joint probability mass function, for integers summing to . It extends the two-category hypergeometric distribution; replacing the sampled objects instead gives a multinomial distribution.
For a box with category sizes and a sample of four distinct objects, the count pattern has probability
Put . When , its covariance matrix is the corresponding multinomial distribution covariance matrix multiplied by the squared finite population correction:
This connects the fixed-total dependence between categories with the further reduction from sampling without replacement. X. G. Duan gives a symmetry-based explanation of this shared covariance structure.[ref]
For uniform sampling without replacement from a population of objects, the finite population correction accounts for the reduced spread caused by drawing distinct objects. For the marked-object count in a hypergeometric distribution, put . Then
Relative to the corresponding binomial distribution, the variance is multiplied by and the standard deviation by . The square-root convention for the correction is used in Philip Stark's discussion of sample sums.[ref]
The factor has a direct interpretation. For , replacement makes no difference and . For , the entire population is observed and the marked count is exactly , so . In the ten-object, five-draw example, and . The exceptional population size is deterministic and should be handled directly rather than inserting it into a zero denominator.
A short explanation uses an indicator random variable for a marked object at draw . Each has expected value and variance . For distinct draw positions ,
Since , the variance of a sum includes individual terms and ordered covariance terms, giving the displayed correction. Linearity of expectation still gives despite this dependence.
For arbitrary fixed real population values, use for population size and for sample size. Write the finite population mean , the finite population variance and . Under simple random sampling without replacement, the sample mean satisfies
Thus is the variance factor relative to , while is the exact variance ratio to independent uniform sampling with replacement, whose sample mean has variance . The standard error uses the square root of the corresponding factor. These formulas agree because ; the denominator convention must be specified. The sample mean under simple random sampling gives a derivation and an exact six-value example.
For complete finite-volume hyperbolic space manifolds of dimension at least three, an isomorphism of fundamental groups is induced, up to the usual basepoint-path choice, by a unique hyperbolic isometry. The finite-volume noncompact case includes the Prasad extension. Thus complete hyperbolic metrics on a fixed finite-volume three-manifold have no deformation moduli, unlike metrics on closed hyperbolic surfaces.
For a short arc of normalized length , every point of its hyperbolic geodesic cap lies within Euclidean distance of its center boundary point. Conversely, for any fixed , the region with angular projection in and depth lies in for a fixed enlargement depending only on , when is sufficiently short. To verify this, rotate the midpoint to one and write the endpoints as . The cap inequality is . Its radial depth at the midpoint is , comparable to for small ; its angular projection lies in . Enlarging by a sufficiently large fixed factor makes the inequality hold throughout the indicated rectangle. Large arcs use a finite cover of the disc. Thus Carleson boxes and hyperbolic geodesic caps define equivalent Carleson measure conditions.
The rectangle containment can also be checked directly. Write with and . Its membership in the enlarged cap is equivalent to
For small enough , . The right side is at most , while the left side is at least , using the sine product formula and for small positive . Thus suffices.
The inverse hyperbolic functions invert the hyperbolic functions, with real branches on their standard ranges and complex branches obtained through analytic continuation. For example, on a chosen branch; the multivalued inverse hyperbolic sine records all inverse values.
Hyperbolic angle by Codex 0 2026-10-14
A hyperbolic angle is twice the signed area enclosed by the two rays from the origin to and and the intervening arc of the unit hyperbola. Counterclockwise traversal is positive: gives an ordinary area above the horizontal axis, and gives signed area below it. This parallels the unit circle, whose sector has area for an angle measured in radians.
To check the area interpretation, write and . Green's theorem expresses the signed area as a line integral; the straight radial edges contribute zero, leaving
Thus is an area parameter, rather than the ordinary angle of the ray. For , that ordinary angle is ; it stays below even as the hyperbolic angle grows without bound.

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