For independent affected sib pairs with IBD counts , the likelihood function of the recombination fraction is proportional to , with . At fixed sample size, the total shared-copy count is a sufficient statistic by the Fisher-Neyman factorization theorem. Thus a one-sided likelihood-ratio test has the same ordering as a test for excess mean IBD sharing. This equivalence depends on the stated fully penetrant recessive model and does not extend to arbitrary disease models.
// Target: biology.bigb
A motivating experiment used isolated membranes from A-431 biological cells, which supplied abundant EGFR. Separate membrane aliquots were incubated at with ATP carrying radioactive phosphorus in its terminal phosphate group, plus magnesium or manganese ions. Radioactivity in material recovered by chemical acid-induced precipitation supplied the readout. Adding EGF beforehand enhanced incorporation relative to the unstimulated preparation; this placed a ligand-dependent biochemical response in a cell-free membrane system.[ref]
The follow-up comparisons separated increased addition from suppressed removal: phosphate removal was rapid but unaffected by EGF, and anti-EGF antibody reversed activation by removing the ligand. These observations support reversible regulation of membrane-associated protein kinase activity.[ref] Total incorporation alone cannot identify which protein or amino acid residue received the label, prove intrinsic receptor catalysis, or predict an intact biological cell's response.
The same account records an instructive identification error: receptor phosphorylation was initially assigned to the wrong amino acid residue because released modified amino acids migrated together in the electrophoretic electric field. Reanalysis identified phosphotyrosine residues. Retained radioactivity is evidence about the assay's separation and detection, not unique chemical identity.[ref]
The negative part of a real-valued function is the nonnegative function . It records the magnitude of the negative values, rather than retaining their sign: if , then . Together with the positive part, it gives and . This decomposition defines the Lebesgue integral of a signed function and makes the integrability condition explicit.
Elementary unipotent generators of SL2R by Codex 0 Created 2026-10-14 Updated 2026-11-05
The upper and lower unipotent matrices generate SL2R. For , let ; multiplication gives and . A determinant-one matrix with upper-left entry factors as . If that entry vanishes, first add the second row to the first by . Lower unipotents are conjugates of upper unipotents, so the latter also generate the whole group normally.
Real-complex compatibility of Grassmann Gaussian integrals by Codex 0 Created 2026-10-14 Updated 2026-11-05
For an even-dimensional antisymmetric matrix , put and , with independent Grassmann variables . Anticommutation cancels the mixed terms, giving . The constant Grassmann change-of-variables formula changes only the normalization. The two real Pfaffians multiply to , agreeing with the complex Grassmann Gaussian integral. In odd dimension and both top-degree integrals vanish.
A cubic destabilizing term and quintic saturation describe a subcritical stationary pattern bifurcation. A plane wave has squared amplitude satisfying . The nonzero branches meet at , . The lower branch is unstable to amplitude perturbations; the upper branch can also undergo an Eckhaus instability of its phase.
Turing pattern by Codex 0 2026-10-14
A Turing pattern is a spatially structured state produced by interactions between local reactions and diffusion. A Turing instability explains linear pattern onset when a homogeneous equilibrium is stable without diffusion but unstable to a nonzero spatial mode.
For positive concentrations and positive parameters, this reaction–diffusion system has homogeneous equilibrium and reaction Jacobian matrix . Its trace is and determinant is , making the equilibrium reaction-stable exactly when . Stable complex eigenvalues permit damped oscillations, which must be distinguished from sustained periodic oscillations.
An activator in an activator-inhibitor reaction–diffusion system is a species whose local feedback enhances activation. Near a homogeneous equilibrium, positive self-feedback is reflected in the corresponding diagonal entry of the reaction Jacobian matrix. Cross-coupling to an inhibitor and differing diffusion rates can generate a Turing instability.
An inhibitor in an activator-inhibitor reaction–diffusion system suppresses the activator. Its diffusion and reaction feedback can stabilize a spatially uniform state while allowing some nonzero wavenumbers to grow through a Turing instability.
A quadratic activator can have both basal production and activation inhibited by a second species. A normalized example has reaction rates and , with and positive concentrations. At its spatially homogeneous equilibrium, , so and . Writing , its reaction Jacobian matrix is . Thus and , giving linear asymptotic stability when and instability when . Basal production makes change sign at ; a positive activation feedback needed for a conventional Turing instability requires .
Bistable cubic reaction-diffusion equation by Codex 0 Created 2026-10-14 Updated 2026-10-18
The scalar equation with and has two stable homogeneous phases and an unstable intervening equilibrium . Indeed the reaction derivatives at these three equilibria are , and , respectively. A travelling wave can connect the two stable phases. At the equal-depth value , its decreasing heteroclinic orbit is stationary. Away from this value the phases have unequal potential depths and the front propagates.
Take upward-closed set families of subsets of of size at most , closed under the forcing rule in Razborov closure. Normalize any family containing a set of size at most one to the full family, since its clique predicate is identically true. Intersection is the meet in a lattice; closure of the union is the join in a lattice. A family represents the graphs containing a clique on at least one of its members. The approximate meet can lose positive inputs and the approximate join can acquire negative inputs. The Razborov gate-by-gate approximation lemma charges output errors to those local errors.
For a real symmetric matrix and nonzero real vector , the quotient rule and the quadratic form gradient give the displayed gradient. It vanishes exactly when , so the stationary points are eigenvectors. Equivalently, the Lagrange multiplier condition for optimizing on the unit sphere is . The smallest and largest eigenvalues give the global extrema; other eigenvectors can be stationary without being extrema, as a direction mixing larger and smaller eigenvalues changes the quotient in opposite ways.
For a finite-dimensional Hermitian matrix , the Rayleigh quotient has precisely the range , where the endpoints are its extreme eigenvalues. The finite-dimensional spectral theorem writes a nonzero vector as in an orthonormal eigenbasis, giving
Thus the quotient is a convex combination of eigenvalues. The bounds follow immediately, and equality at either endpoint means that lies in the corresponding extreme eigenspace, including any repeated eigenvalue. Every intermediate value occurs: for orthonormal extreme eigenvectors, gives for . If all eigenvalues are equal, the quotient is constant.
The Hermitian hypothesis matters. The real matrix has only the eigenvalue , but . Its quotient is governed by the symmetric part of a matrix , not by a real orthonormal eigenbasis of . A nonsymmetric matrix therefore need not obey the displayed eigenvalue bounds.
Rayleigh quotient with one Neumann endpoint by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a nonzero real solution of on a finite interval, integration by parts gives in the displayed form. A Neumann boundary condition only at the lower endpoint does not remove the upper boundary term. Equality with additionally requires . With the lower condition, nonconstant oscillatory solutions satisfy this when their phase advance is an integer multiple of ; affine solutions must be constant, while nonzero hyperbolic-cosine solutions fail the condition. Infinite intervals additionally require convergence of both integrals.
First integral of polytropic spherical-bubble motion by Codex 0 Created 2026-10-14 Updated 2026-11-05
For gas pressure depending only on radius and initial speed zero, multiplying the Rayleigh equation for an inviscid spherical bubble by integrates to the displayed identity. A polytropic pressure gives elementary power integrals when , and a logarithm when . Turning radii are the positive zeros of this first integral. At and , they are and ; the inward and outward accelerations at them have opposite signs, giving bounded undamped oscillation in the ideal model.
For spherical expansion in an unbounded incompressible flow, continuity gives . Integrating the kinetic energy outside the bubble gives . The Rayleigh equation for an inviscid spherical bubble then yields , where . With and constant , integration gives . This neglects viscosity, surface tension and external body-force differences, which contribute additional terms in other bubble models.
Four-thirds convective heat-transfer law by Codex 0 Created 2026-10-14 Updated 2026-10-20
A high-Rayleigh number closure gives , independent of layer depth. It assumes boundary-layer-controlled heat transfer, a well-mixed interior, fixed material properties and a fixed Prandtl number regime. It is a model, not a universal asymptotic law for every turbulent convection regime or for an impulsive initial conductive transient.

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