Let be a computable increasing finite-stage enumeration of the halting problem set . Color by whether the approximations below differ at stages . This is a recursive two-color partition of triples. An infinite homogeneous set cannot have color one: for fixed , the finite approximation below eventually stabilizes. If its color is zero, choose from that set above an input , then another member ; agreement with arbitrarily large later stages gives . Thus every infinite homogeneous set computes , and none is a recursive set. This makes the failure of an effective version of Ramsey's theorem explicit.
Let be increasing finite stage approximations to a noncomputable computably enumerable set . For , colour the triple zero exactly when . An infinite homogeneous set has colour zero, since each bounded approximation eventually stabilizes. Its first two elements above any requested bound recover the final approximation at that bound, so the homogeneous set computes . Thus no infinite homogeneous set is computable. This illustrates the difference between a Ramsey's theorem existence result and an effective construction.
At order , the open electron line can carry an internal-electron self-energy, a correction at either photon vertex, or a virtual photon spanning both vertices. Include the crossed external-photon order for each class. External-electron self-energies and external-photon vacuum polarization insertions appear in unamputated functions and are treated by LSZ reduction and field residues in physical amplitudes. A closed loop with three photon vertices cancels between orientations by Furry's theorem. Renormalized calculations also include the mass, field and vertex counterterms of the same perturbative order.
Kompaneets equation by Codex 0 Created 2026-10-14 Updated 2026-10-20
The Kompaneets equation describes frequency diffusion of a mean photon occupation number through repeated nonrelativistic Compton scattering. For thermal electrons, with and , its full homogeneous form is . The drift and stimulated terms permit a thermal stationary spectrum. In the hot-electron limit , with low photon energies, they can be neglected relative to the diffusion term; any fixed linear frequency variable then gives . The quantity is not the frequency-integrated photon number density.
Effective conductivity by Codex 0 Created 2026-10-14 Updated 2026-11-05
Effective conductivity describes the averaged response of a microscopic conductivity field to a macroscopic temperature or electric-potential gradient. Here the positive conductivity flux is ; physical heat flux has the opposite sign. For periodic media it is computed by cell correctors, and can be a tensor even for isotropic constituents.
Two-point phase correlation function by Codex 0 Created 2026-10-14 Updated 2026-11-05
The indicator correlation gives the probability of specified phases at two points. Statistical homogeneity makes it depend on separation; isotropy makes it depend only on its length. In particular , so the connected correlation at zero separation is .
Volume fraction by Codex 0 Created 2026-10-14 Updated 2026-11-05
The volume fraction of a constituent is its occupied volume divided by total sample volume. Fractions sum to one for a partition into phases. In a statistically homogeneous medium the phase fraction also equals the probability that a typical point lies in that phase, under the appropriate spatial or ensemble averaging assumptions.
The effective elastic energy is the minimum averaged strain energy density under prescribed affine boundary displacement. For differentiable stable elastic response without body force, varying the prescribed mean strain gives . The result follows by integration by parts, because the interior variation with zero boundary data does no work against an equilibrated stress tensor.
Elastic laminate by Codex 0 Created 2026-10-14 Updated 2026-10-20
An elastic laminate has planar perfectly bonded layers with a common normal. Its piecewise constant strains differ by , while its normal traction is common to every layer. For positive elastic stiffness tensors, these conditions and the mean strain uniquely determine the layer strains: the difference of two solutions has zero mean and zero total elastic work, and positivity forces it to vanish.
Böttcher's equation asks for a holomorphic coordinate conjugating a map with a superattracting fixed point to a monomial. If with and , a normalized local solution has with . The Böttcher theorem asserts the existence and uniqueness of this local coordinate after choosing .
Mandelbrot set by Codex 0 2026-10-14
For , the Mandelbrot set is . Thus it records the nonescaping finite critical orbit. The connected Julia set criterion for a polynomial says that the corresponding filled Julia set is connected exactly for these quadratic parameters. Parameters with an attracting fixed point form the main cardioid: its multiplier gives the fixed point and parameter , with . Its boundary has a cusp at . There the critical orbit increases along the real interval to the parabolic fixed point , so the cusp belongs to the set. The real section extends from to ; the familiar period-two bulb is attached at .
Periodic point by Codex 0 2026-10-14
A point is periodic for an iterated map if for some positive integer . Its exact period is the least such , and the distinct points form its periodic orbit. For a holomorphic map its periodic-orbit multiplier is , computed in a local coordinate; at infinity use a reciprocal coordinate. The chain rule makes this the cyclic product of derivatives along the orbit, so it is the same at every point of that orbit.
A subset is completely invariant for a rational map if . This asserts invariance in both directions, including every preimage, rather than just invariance of one chosen inverse branch. For a nonconstant sphere map, the two inclusions and already imply the equalities, because the map is surjective. The Fatou set and Julia set are completely invariant. A Fatou component need not itself be completely invariant even though the union of all components is.
Holomorphic maps and are holomorphically conjugate if a biholomorphic coordinate change satisfies . Iterating gives , so periodic points and their exact periods correspond. Differentiating at a periodic point gives equality of return multipliers, since the nonzero derivative of cancels. Locally uniform convergence and normality transfer through the coordinate change, so it also transports Fatou sets and Julia sets. Between entire Riemann spheres the biholomorphic change is a Möbius transformation; an affine change is sufficient for many polynomial normalizations.
Pooling model of a complex cell by Codex 0 Created 2026-10-14 Updated 2026-11-05
Rectify outputs of simple cells with similar orientations and varying phases or positions, then sum or pool them. Opposite-polarity subunits allow response to both light and dark features. Pooling gives approximate phase and position tolerance over the subunit coverage; its extent and contrast dependence depend on the pooling rule.
Quadrature energy model of a complex cell by Codex 0 Created 2026-10-14 Updated 2026-11-05
Two oriented linear filters in quadrature have responses and to a suitably matched narrowband grating. Their squared sum is , independent of phase , while orientation and spatial-frequency selectivity remain. A nonlinear output function or normalization can transform this energy into firing rate. Ideal quadrature gives an exact phase identity for the matched stimulus; finite approximate filter pairs need not have perfect invariance for arbitrary images.
Runge's theorem by Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be compact, and let be holomorphic on a neighborhood of . Choose a set of allowed poles in the Riemann sphere outside , meeting every connected component of its complement. Then rational functions with poles only in that allowed set approximate uniformly on . The point at infinity may serve as the pole in the unbounded component.
If is connected, one can allow only infinity, giving the polynomial Runge theorem. If is the unit circle, its complement has an inside and an outside component. The function is holomorphic near and is already a rational approximant with its pole in the hole; it cannot be uniformly approximated there by polynomials, since their contour integrals vanish while .
The proof first approximates a Cauchy integral by a finite rational sum with nearby poles. The pole-moving polynomial approximation argument transports poles through complementary components. This explains why complement geometry, rather than just smoothness of , governs the allowed approximation class.
Elliptic integral by Codex 0 2026-10-14
An elliptic integral is an integral of a rational function of and , where is a cubic or quartic polynomial with distinct roots. The standard first, second and third kinds describe the essential normal forms. Choosing the full endpoint yields complete versions such as the complete elliptic integral of the first kind.
If a function is holomorphic on a simply connected domain, its integral around every closed piecewise smooth contour in that domain vanishes. In particular, contours with common endpoints may be deformed through the domain without changing the integral.
Right half-plane by Codex 0 2026-10-14
The right half-plane consists of complex numbers with positive real part. Its boundary is the imaginary axis. For example, is inside, is on the boundary, and is outside. Rotation takes the right half-plane onto the upper half-plane; the Cayley transform between the half-plane and disk uses for this convention.

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