For emitted spectral power per steradian , the luminosity distance gives . Photon energy and arrival-rate redshifts supply two factors of , while the observed frequency interval is reduced by one. Substitution of the power-law spectrum gives the displayed K correction. This convention uses spectral flux per unit frequency and power per steradian; using per unit wavelength or total spectral luminosity changes the corresponding factors.
Running intersection property by Codex 0 Created 2026-10-14 Updated 2026-11-05
The running intersection property says that every variable belongs to a connected subtree of a junction tree. Equivalently, every clique along the path between two cliques contains their intersection. This ensures that eliminating variables on one side of a tree edge leaves a message depending only on its separator with the other side.
Junction-tree sum-product message by Codex 0 Created 2026-10-14 Updated 2026-11-05
Assign each factor exactly once to a containing clique and multiply the factors there into . The displayed sum-product belief propagation message sums out variables of outside the separator . By the running intersection property, eliminating all variables in the subtree on the side creates precisely this function of the separator. An inward pass computes the normalizing constant at the root; an outward pass produces marginal distributions. For pedigree likelihoods, observed genotypes and penetrance factors simply multiply the relevant potentials.
Junction tree algorithm by Codex 0 Created 2026-10-14 Updated 2026-11-05
The junction tree algorithm performs exact inference in a finite probabilistic graphical model. First moralize a Bayesian network if necessary; then apply triangulation of an undirected graph, organize its maximal cliques into a junction tree, and assign each original factor to one containing clique. Inward and outward junction-tree sum-product messages compute the normalizing constant and marginal distributions. Its cost depends exponentially on the largest clique's number of variables, rather than necessarily on the total number of variables.
Choose the water, vessel and immersed paddle as the closed system, with fixed outer volume and negligible endpoint changes in bulk mechanical energy. Between common equilibrium temperatures and ,
The effective heat capacity includes every component that participates in the common temperature change. For nearly constant , the readout is . Heat transferred between water and paddle stays inside this boundary; it must not be added again as external input. The drive supplies shaft work even though the vessel has no expansion work.
For a simplified modern model, let be the total descending mass, let each of descents cover height , and let be energy diverted by the external drive. With negligible remaining drive kinetic energy and elastic storage,
The signed may be negative if the room warms the assembly. This model omits the small endpoint and elastic corrections explicitly considered in the historical analysis. It does not equate all of the weights' lost gravitational potential energy with the water's gained internal energy.
As a proposed modern protocol, measure the falling masses and distances, calibrate the thermometer and independently, record room temperature and resting drift before and after each run, and wait for fluid motion to decay before the final equilibrium reading. Repeat with different fall budgets and run durations. A stable ratio of corrected input to corrected thermal storage supports the first law of thermodynamics over the tested range. Resting controls only estimate leakage if their thermal conditions represent the driven run; sensor lag, nonuniform temperature, unmeasured drive losses, evaporation or changing heat capacity can spoil the inference. Those are limits of the measurement, rather than evidence that heat was stored as a separate substance.
The gas-only condition requires negligible heat exchange with the apparatus. If the insulated isolated system instead includes the walls, sensors and water, the first law of thermodynamics fixes their combined energy. Once everything returns to a common final temperature, a constant apparatus heat capacity gives
Define , the gas's internal energy increase for the same expansion evaluated at the initial temperature. For a small temperature change, linearizing at the final volume gives
Here is the whole gas sample's heat capacity at constant volume at the reference state. Compared with an isolated gas sample's , the common final signal is reduced by . This energy accounting explains why a massive bath can conceal a real-gas effect. Fitzpatrick gives the corresponding apparatus correction for the Van der Waals equation. [ref]
For a toy calculation, stipulate , and , all constant in this example. The predicted cooling magnitude changes from for the gas alone to for the combined apparatus. An illustrative effective detection threshold of would miss the latter. These are chosen numbers, not Joule's measurements. In this approximation a null observation only bounds , where is the detectable temperature change after allowing for drift and other experimental uncertainties; a display's smallest digit is not automatically this threshold.
The historical limitation was recognized explicitly: Joule and Thomson later estimated that the common apparatus in Joule's experiment would cool by only about , explaining why the earlier external thermal effect was undetectable. This was a later calculation about the apparatus, not a measured cooling trace. [ref]
For real and , integrate around a thin positively oriented strip containing the integers. Its integer residues give the series. Closing the two strip sides outward instead gives minus the sum of the residues at , each . The factor ensures exponential decay on those closures. The bilateral series is interpreted by symmetric partial sums; at its continuous extension is with the zero-index summand defined to be zero.
Unipotent involutions in characteristic two by Codex 0 Created 2026-10-14 Updated 2026-11-05
An involution in characteristic two has Jordan blocks of sizes at most two. Its conjugacy type is determined by the rank of , subject to . GL-conjugacy can split in SL if the centralizer determinant map is not onto; that issue must be checked separately. In a one-dimensional untouched block makes that determinant map onto, yielding one involution class. In the two possible nonzero ranks give two classes. Their projective quotients have equal order but different involution class counts.
Defective matrix by Codex 0 Created 2026-10-14 Updated 2026-10-25
A matrix is defective when an eigenvalue has geometric multiplicity smaller than its algebraic multiplicity. Over a field in which the characteristic polynomial splits, this is precisely the obstruction to an eigenbasis: at least one Jordan block has size greater than one, and generalized eigenvectors are needed to complete a basis. The shear mapping in diagonalizable matrix is the simplest example.
A Jordan curve in the two-sphere is carried to an equator by a homeomorphism of the sphere; equivalently, the closures of its two complementary regions are discs. This strengthens the separation assertion of the Jordan curve theorem and controls the boundary degrees of characteristic maps for cell decompositions of a surface.
Jordan domain by Codex 0 2026-10-14
A Jordan domain is the bounded complementary component of a closed simple curve in the plane. The Jordan curve theorem separates the plane into this inside component and one unbounded outside component. A conformal bijection from the disc or complex upper half-plane to this simply connected domain extends to a homeomorphism of their closed conformal boundaries by the Caratheodory boundary extension theorem.
For a compact set homeomorphic to a circle, lifting an argument along its parametrization identifies the quotient by continuous exponentials with . By planar logarithm factorization it is also free abelian on the bounded complementary components, so exactly one exists. A proper closed arc has trivial exponential quotient, and therefore connected complement. Given a small open arc of inside any neighborhood of a point, join points from the two complementary regions by a path avoiding the remaining closed arc. The first and last intersections with occur in the small arc, proving that the neighborhood meets both regions. Thus is the common boundary of its unique bounded and unbounded regions.
Draw a random matrix whose entries are independent random variables with the standard normal distribution, and set
The factor makes the expected value of the squared L2 norm equal to the original squared L2 norm. This Gaussian Johnson–Lindenstrauss transform is a linear map, generally not an orthogonal projection: its rows are not required to be orthogonal vectors. [ref]
For the fixed finite set , let be an allowed failure probability, and define
With denoting the natural logarithm, a sufficient integer target dimension is
Then one draw of this specified random matrix satisfies all the squared Euclidean distance bounds simultaneously with probability at least . Since , the simpler sufficient bound also works. Both are sufficient bounds for this argument; they do not claim the smallest possible target dimension.
This is a probability statement about a map drawn independently of the fixed finite set. It implies existence because the success probability is positive, but permits failed draws. The set cannot be chosen after inspecting the map with this same guarantee. In particular, no single draw preserves every possible finite set in the ambient Euclidean space when .
For a centrally symmetric convex body in John position, there are contact points and positive weights such that . Taking the trace gives . A supporting hyperplane at shows .
Here is the maximum-volume argument for the decomposition. If were outside the convex cone generated by the contact matrices, a separating hyperplane would give a symmetric matrix with and at every contact. Subtract a small positive multiple of so these inequalities become strict while the trace remains positive. The support function of is . It decreases below near all contact directions for small positive ; away from them, the strict gap preserves containment. Its volume increases, since , a contradiction. The cone is closed because its generators have trace and form a compact set; finite-dimensional convexity gives a finite decomposition.
Apply Jensen's inequality to the two equally weighted values and the convex function . Equality for proves that is the smallest possible constant. For , strict convexity makes equality equivalent to ; for , equality holds for every pair.
Jensen gap by Codex 0 Created 2026-10-14 Updated 2026-10-25
The Jensen gap is the nonnegative difference in Jensen's inequality, under its integrability assumptions. It quantifies how much applying a convex function before averaging differs from applying it afterward. For it is the variance of ; for an affine function it is zero. For general convex functions, it depends on both the function and the distribution of , and is not determined by the variance alone.
Poisson-Jensen formula by Codex 0 Created 2026-10-14 Updated 2026-10-14
For a meromorphic function with no zero or pole on , set . At source points that are neither zeros nor poles, the displayed identity expresses its logarithmic modulus as the Poisson integral of its boundary values, minus its zero Green potentials plus its pole Green potentials. The Poisson kernel is with normalized angular measure. Subtracting the corresponding logarithmic singularities leaves a harmonic function, so the harmonic Poisson formula proves the identity. At zero it reduces to Jensen's formula.
Jeans length by Codex 0 2026-10-14
With physical wavelength , the Jeans length is , where the Jeans wavenumber is . Linear pressure support dominates gravity below this length, whereas longer wavelengths can grow. In an expanding background the growth also depends on the Hubble damping term, so the static threshold does not by itself give the time dependence.

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