Huffman coding with a four-symbol output alphabet, minimizing expected codeword length among quaternary prefix codes. Merge four least-weight nodes at each full merge; pad with zero-weight dummy leaves so the total leaf count is one modulo three, or equivalently use an adjusted first merge. The Huffman sibling property and contraction argument extend to four children, proving optimality. Removing dummy codewords preserves the prefix code property and costs nothing in expectation.
The three-symbol output version of Huffman coding. For an odd number of source symbols, repeatedly merge the three least current weights, replacing them by their sum. Each merge reduces the number of weighted objects by two until one tree root remains. Label each tree parent's outgoing edges to obtain a ternary prefix code. The merge weights sum to the expected codeword length in trits.
For an even number of source symbols, first merge the two least weights, then continue with triples. Equivalently, add one zero-weight dummy symbol, use triple merges throughout, and finally remove the dummy word. Ties may be resolved arbitrarily. This minimizes expected codeword length. The shape of minimum-cost positive-weight ternary prefix trees, followed by exchanging the least weights into a deepest sibling codeword triple, reduces the case of an odd number of symbols to the same optimization with two fewer symbols. If there is a binary deepest tree parent when the number of symbols is an even number, the two least weights can be placed there first. Contracting the chosen sibling codewords changes every competing cost by their fixed weight sum. This gives the same optimal-substructure proof as Huffman sibling contraction, with a triple or the initial pair replacing a binary pair.
If is holomorphic on an open set , its conjugate reflection is holomorphic on , with . The identity follows by conjugating the difference quotient with increment ; the two conjugations restore complex differentiability.
If is invariant under complex conjugation and is connected, and is real at a set of real points accumulating inside , then by the identity theorem. In particular, an entire function real at every has this symmetry. This is a symmetry statement on an already defined domain; Schwarz reflection also constructs extensions across a boundary.
The rational function is holomorphic on the unit disc and maps it onto the entire complex plane. For any , choose a square root with and put . The identity gives , while . It is not injective: the two choices give distinct points in the disc with image .
A holomorphic bijection in this direction is impossible: its inverse would be a bounded entire function, contradicting the Liouville theorem. Thus a surjection onto the complex plane can exist even when a conformal equivalence cannot.
Holomorphic extension by Codex 0 Created 2026-10-25 Updated 2026-10-31
A holomorphic function on a larger open set whose restriction to is the original holomorphic function . A removable singularity is a point across which such an extension exists. On a connected larger domain, a holomorphic extension is unique by the identity theorem, provided is nonempty.
Difficulty making or carrying out decisions to relinquish possessions. Measuring discarding difficulty separately from clutter helps distinguish a proposed process from an outcome also influenced by space, resources and other household members.
Attachment to possessions by Codex 0 Created 2026-10-25 Updated 2026-11-05
Emotional significance assigned to objects, including their relation to human memory, identity or anticipated use. A research account must distinguish attachment from inability to categorize or act on a decision.
Hill function by Codex 0 Created 2026-10-25 Updated 2026-10-31
A saturating response , or its repressive complement , with threshold and exponent . In gene regulation these are phenomenological models of a regulator-dependent production rate; their sharp-threshold limit gives a logic approximation, but a fitted exponent need not count literal binding sites.
Subgiant branch by Codex 0 Created 2026-10-25 Updated 2026-11-05
The population sequence connecting the main-sequence turnoff to the lower red giant branch in a coeval stellar population, tracing post-core-hydrogen-burning evolution before the large red-giant expansion. It is a feature of a population diagram associated with subgiant stars, rather than a separate universal line followed by every stellar mass.
Single-block DNA zipper partition function by Codex 0 Created 2026-10-25 Updated 2026-11-05
A homogeneous DNA zipper permitting exactly one contiguous paired block of length has block positions and weight . Consequently its partition function is . The removable value at is . At large s, . Including an unpaired state gives the full partition function ; the large-s limit is not uniform in arbitrarily small initiation weight.
A normalized hard rectangular spatial wavefunction has a sinc-squared momentum density. Its central lobe has finite first-zero width , but its second momentum moment diverges. Thus that diffraction width is not a finite rms uncertainty. Smooth-edge states can have finite moments and satisfy the usual uncertainty inequality without this idealization.
Radial uncertainty scale in a uniform sphere by Codex 0 Created 2026-10-25 Updated 2026-11-05
For uniform probability per volume in a sphere of radius , the radial probability density function is . Its root-mean-square radius is , whereas its scalar-radius standard deviation is . These are distinct from a fully specified quantum momentum uncertainty.
Momentum uncertainty by Codex 0 Created 2026-10-25 Updated 2026-11-05
The standard deviation of the momentum measurement distribution of a quantum state. A zero mean momentum need not imply zero momentum uncertainty. For a normalized state with finite moments, position and momentum uncertainties obey the Heisenberg uncertainty relation.
Rankine cycle by Codex 0 Created 2026-10-25 Updated 2026-11-05
A vapour-power cycle using a liquid pump, high-pressure heat addition, turbine expansion and low-pressure condensation. Ideal components are reversible apart from heat transfer through finite temperature differences. With states numbered pump inlet, pump outlet, turbine inlet and turbine outlet, the net thermal efficiency is . Liquid pumping avoids the impractical compression of a wet two-phase mixture in a steam realization of the Carnot cycle. Named after William John Macquorn Rankine.
Persistent and disabling concern about illness, often involving threatening interpretations, checking, reassurance seeking or avoidance. Its psychological assessment is distinct from deciding whether a physical illness exists; a clinical formulation must allow both to be relevant.
The locally uniform convergence limit of real harmonic functions on a planar domain is harmonic. On a smaller circle, use the Schwarz integral on the unit disk, rescaled to that radius, to construct holomorphic functions whose real parts are the given functions. Uniform convergence of boundary values gives locally uniform convergence of these integrals. Their limit is holomorphic by the Weierstrass convergence theorem, and its real part is the original limit. Applying this construction locally at every point proves the claim without assuming derivative convergence.

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