The curvature-minus-one hyperbolic metric on the punctured disk assigns distance along the radial geodesic from to . Its exponential distances therefore sum to a finite value; the triangle inequality gives the same conclusion for any fixed basepoint. Nevertheless no nonzero bounded holomorphic function has these zeros: the Riemann removable singularity theorem extends it at zero, and the identity theorem then makes it identically zero. Simple connectivity is necessary in the hyperbolic characterization of bounded analytic zero sets.
For points and with , the hyperbolic distance is . It equals their Euclidean distance exactly when the displayed relation holds. The function of decreases continuously from one to zero: its derivative has the sign of . Hence every height has exactly one positive matching horizontal separation.
For a proper arc of the boundary of the unit disc, is the side of the hyperbolic geodesic between its endpoints adjacent to . For short arcs this is a curved boundary cap. For arcs longer than a semicircle it contains the center. With endpoints and , the geodesic is the circle with center and radius , orthogonal to the unit circle. It is a diameter at .
Contraction-limited central temperature by Codex 0 Created 2026-10-14 Updated 2026-11-05
A fixed stellar homology profile with gives
where . As a function of this is a concave quadratic; its maximum is , at . At the maximum, the central electron degeneracy pressure and thermal pressure are equal. If this temperature is insufficient for sustained hydrogen burning, the object becomes a brown dwarf. Only the positive-temperature segment represents a physical sequence.
Consider two widely separated rigid spheres of equal radius , with separation , in Stokes flow. Apply a force to the first sphere and let the second be force-free and torque-free. The second sphere samples the rate-of-strain tensor of the first sphere's Stokeslet, . Its leading disturbance is the stresslet of a sphere in a uniform straining Stokes flow. Evaluating that disturbance back at the first sphere gives
The hydrodynamic mobility matrix decreases at fixed force, consistently with the increase of resistance caused by an additional rigid inclusion.
For the nonzero spectral decomposition , every pure-state quantum state ensemble of is specified by the displayed column linear isometry. To prove this, write . Positivity forces each into the support of , and the coefficients have orthonormal columns because . Conversely this column identity reconstructs ; the squared vector norms are the probabilities and sum to one. Complete the columns to unitary bases after adding zero ensemble vectors to obtain the usual unitary-mixing formulation.
Replace sibling leaves in a code tree labelled by their common parent in a rooted tree, now a leaf labelled of weight . All other codewords stay fixed; each of loses one bit. For any such code tree and the contracted code tree , their weighted costs satisfy
If have two least weights, the Huffman sibling property gives an optimal prefix code containing this pair. Its contracted prefix code must be optimal for the reduced weights : any cheaper reduced prefix code could be expanded at by appending , giving a cheaper original prefix code. Conversely, expanding any optimal reduced prefix code adds precisely and attains the original minimum. This is optimal substructure, the justification for repeating the merge in Huffman coding. [ref]
In the exchange diagram, contract to weight at leaf depth in a code tree . The reduced expected codeword length is bits; expanding restores bits. For , the reduction leaves one symbol: allow its temporary codeword to be empty, of cost zero, so expansion gives the two one-bit codewords. This convention is only the terminal reduced problem; the original source has at least two symbols.
Sibling leaves in a code tree by Codex 0 Created 2026-10-14 Updated 2026-10-25
Two leaves of a code tree with the same parent in a rooted tree. Their codewords have a common initial segment and differ only in the final bit: . Their leaf depth in a code tree is equal. The Huffman sibling property places two chosen least weights at such leaves in some optimal prefix code.
For equiprobable symbols, the maximum codeword length of a binary Huffman code is . Exactly codewords have length and have length . The balancing exchange for a uniform optimal prefix code restricts the depths to these two levels; counting leaves and using equality in the Kraft inequality determine the numbers.
An orthogonal similarity preserves skew symmetry, so upper-Hessenberg reduction of a real skew-symmetric matrix is automatically tridiagonal with zero diagonal. For a Householder reflection, the scalar vanishes, eliminating the fourth term of the general similarity update. Storing only one triangle and using the displayed skew rank-two update costs scalar products, the same leading product count as optimized symmetric tridiagonalization; the simplification saves lower-order work.
The displayed pointwise control limits follow from the normal approximation to an observed binomial proportion. Clip plotted limits to the probability range. Their nominal coverage is approximate and can be poor for small expected counts; exact binomial tails give a discrete alternative. Pointwise coverage does not provide simultaneous coverage of all hospitals; use Bonferroni correction or another familywise error rate procedure when that is the required guarantee.
If obeys the Hörmander integral kernel condition with constant , and an integrable is supported in a cube with , then for . Here is the concentric cube with multiplied side length. Subtract the kernel value at the cube center inside the convolution; outside , every source displacement is smaller than half the observation displacement. Tonelli theorem and the integral kernel condition give the bound.
Suppose a convolution operator has operator norm at most , and its kernel satisfies the Hörmander integral kernel condition with constant . Under hypotheses making its integrals well-defined, the Calderón–Zygmund decomposition gives weak type (1,1). Indeed, the bounded part has squared norm at most . The bad cubes occupy at most , while outside their dilations the cancellation estimate outside a dilated cube bounds the bad image in . Applying distributional estimates to these three regions gives .
A measurable convolution kernel satisfying the displayed size and cancellation properties together with the Hörmander integral kernel condition defines uniformly bounded Fourier multipliers after deletion of a ball at the origin. The deleted-ball kernels belong to , although they need not belong to at infinity. Cancellation controls low-frequency integration near the deleted ball; translation by half an oscillation controls the far tail through the oscillatory tail estimate for a singular kernel.
For downward depth , take , surface temperature , a flat impermeable stress-free upper boundary and a no-slip insulated bottom. In the steady infinite-Prandtl number thin-layer interior, with at the surface and at the bottom. The displayed profile follows. Sidewall end layers close the circulation; the interior profile must not be imposed unchanged at those walls.
Minimal-right-ideal proof of radical nilpotence by Codex 0 Created 2026-10-14 Updated 2026-11-05
In a right Artinian ring, the powers of its Jacobson radical stabilize at an ideal satisfying . If , choose a minimal right ideal with . Since , minimality gives . Choosing with gives by the same minimality. Consequently for some . The unit criterion for the Jacobson radical makes invertible, forcing , a contradiction. This proof avoids incorrectly applying the finitely generated form of Nakayama lemma to an arbitrary Artinian module.
The Hopf link exterior is . Each component's Seifert longitude is the other's meridian. Filling the two boundary tori along these longitudes therefore attaches solid tori with meridians intersecting once on a common torus, recovering the standard genus-one splitting of the three-sphere. Merely specifying two linked unknots without specifying their link type does not force this answer.
Let with . Collapse the lower cells of to obtain and compose with the Hopf fibration . Both factor inclusions are killed by q, so every induced homotopy group map is zero; the induced reduced homology maps also vanish. If the composite were nullhomotopic, homotopy lifting property would deform q into the circle fibre. Every map from the simply connected product to that circle is nullhomotopic, contradicting the degree-one top homology map of q.
Spring by Codex 0 Created 2026-10-14 Updated 2026-11-05
A linear spring stores elastic energy when displaced by from its relaxed position. The external force maintaining that displacement is ; its restoring force on the moving attachment has the opposite sign. Its spring constant has units force per length.
Martini lattice by Codex 0 2026-10-14
The martini lattice is obtained from the honeycomb lattice by replacing every vertex in one of its two vertex classes by a triangle, attaching its three former incident bonds to the triangle's three vertices. It is a periodic degree-three planar graph, with triangular faces and nine-sided faces. Each decorated vertex and its incident bonds is a three-terminal cell with three internal triangle bonds and three terminal spokes. Its independent bond percolation threshold is , as follows from three-terminal cell partition duality.

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