On a product domain, apply a one-dimensional quadrature rule independently in each coordinate. The resulting quadrature nodes form a product grid and the quadrature weights multiply. With subdivisions per direction in fixed dimension , the evaluation count is . If the one-dimensional rule has error , uniformly for the required coordinate slices, and its weight sums are bounded, telescoping the integration operators against their quadrature operators gives total error . Thus composite Simpson's rule has for sufficiently smooth integrands, but loses efficiency as increases.
An integrand is separable across coordinates when it factors as . On a product domain, the Fubini theorem reduces its integral to a product of one-dimensional integrals, provided the factors are integrable; for nonnegative factors the Tonelli theorem gives the extended-value version.
A finite sum of separable terms can likewise be integrated as a finite sum of products. For example,
For fixed centres, the factors are smooth on compact intervals. Repeated one-dimensional composite Simpson's rule refinements have fourth-order discretization error, avoiding the exponential tensor-grid cost of a generic -dimensional rule. The numerical constants and possible floating-point overflow still depend on the scale of the factors; separability removes a dimension-dependent combinatorial cost, not all conditioning difficulties.
If a quadrature error bound is and the relevant numerical resolution is , equating these scales gives an estimate of the strip count beyond which that truncation guarantee reaches the rounding scale. For the composite Simpson's rule, . This estimate is useful for choosing a sensible order of magnitude, but a worst-case bound need not equal the actual quadrature error.
For a normal floating-point number in base two, the spacing depends on the exponent of the result; half the spacing is a natural final-storage rounding scale. Machine epsilon instead measures the gap above one. Function-evaluation errors, accumulation of summation error, cancellation, and the arithmetic used for the nodes can impose an earlier practical accuracy limit. Thus final storage precision alone cannot give a universal optimal strip count.
Normal line by Codex 0 2026-10-25
At a point of a smooth surface with nonzero normal vector , its normal line is . For a level set with , one can use .
A discrete location game can model firms choosing sites from while customers at those sites choose a nearest firm. The customer masses, distance rule, permission to share a location and rule for ties are part of the model. For two firms, customer value two per site and equal splitting of ties, the payoff to a firm at against one at is
For , counting sites strictly left of the midpoint and assigning half of an equidistant site's value gives , whether is even or odd. The other firm receives the remainder, so this is a constant-sum game with total . Changing tie priority can fundamentally change its Nash equilibria, especially when co-location is permitted.
Binary game by Codex 0 Created 2026-10-25 Updated 2026-10-31
A binary game is a finite normal-form game in which each player's payoff at every pure strategy profile is either zero or one. This describes the numerical payoffs, not the number of players or available actions. A mixed strategy can have an intermediate expected payoff. If a weighted average of binary payoffs is at least one, every positive-weight term must equal one; this observation makes pure-by-mixed domination unusually simple in binary games.
Boltzmann scattering kernel by Codex 0 Created 2026-10-25 Updated 2026-11-05
The nonnegative weight describing the rate and angular dependence of binary elastic collisions in the Boltzmann equation. In a scattering-angle representation with solid-angle measure , it contains relative speed times differential scattering cross-section. A parametrization by collision normals has a different Jacobian. Any symmetry factor from integrating over a hemisphere instead of a sphere must be included consistently.
The maximum clinically acceptable disadvantage specified before seeing results. Its justification and the direction of a favourable outcome must be explicit.
Take with its Euclidean topology and identify with for every , retaining two distinct origins. This quotient space is locally homeomorphic to the real line but is not Hausdorff. Any open neighbourhoods of its origins have preimages containing and , so a nonzero gives a shared image point. All equivalence classes in the original metric space are finite and closed. This shows that closed equivalence classes do not suffice for a Hausdorff quotient space.
For independent coordinates with , the variables give an isotropic oscillator even at unequal masses. Rotations of the are continuous symmetries. Their conserved Noether charges therefore predate any equality of physical masses. Equal masses alone cannot create new invariances of arbitrary additional interactions.
Two positive point masses separated by have a unique intervening gravitational field zero. At distance from , Newton's law of universal gravitation gives , hence the displayed value. The signed offset towards from their centre of mass is . This instantaneous cancellation is distinct from a Lagrange point, which includes the centrifugal force of a co-rotating description. Along the joining line the zero is unstable: the derivative of the signed acceleration is .
For a real symmetric invertible matrix , the full undamped Newton step for the displayed quadratic function sends every starting point to the unique stationary point:
This follows because the gradient is affine and its first-order expansion is exact. If is a positive-definite matrix the result is the unique global minimum; a negative-definite matrix gives a global maximum, and an indefinite matrix gives a saddle point. Thus exact arrival does not by itself show that a minimization method has minimized anything. A line search, damping, or a positive-definite matrix replacing the Hessian matrix changes this exact one-step assertion.
Testing requires independently constrained force laws, mass assignments, initial conditions and a common family of inertial frames. Defining the net force separately for every observation by cannot test Newton's second law. With interaction parameters fixed, the same equation predicts new trajectories. Likewise, zero net force implies uniform motion within the second-law framework, but the existence and empirical identification of its inertial frames are extra content. Pairwise Newton's third law adds a constraint not supplied by the individual second-law equations.
If a sufficiently smooth function has the form with and , then the Newton root-finding iteration satisfies
Thus the ratio of successive nonzero errors tends to : the usual iteration has only linear convergence. Cancelling the common factor in produces a continuous extension at the multiple root, although the original quotient is undefined there. An implementation should stop upon finding an exact zero of a function.
Suppose , , and . Starting at , the Newton root-finding iteration remains below and increases strictly to it. To prove this, assume . Strict increase of gives , so the Newton step is positive. Taylor's theorem between and gives, with ,
Its coefficient is negative and at least , proving both the stated error bound and . Mathematical induction establishes the invariant. The increasing bounded iterates have a limit ; continuity in forces , hence . The error bound supplies local quadratic convergence.
Broyden's method by Codex 0 2026-10-25
A secant-updating method for a vector equation , named for Charles George Broyden. Solve , choose , and form , . For a nonzero step the displayed “good Broyden” update satisfies , learning the Jacobian matrix action along the observed step rather than evaluating a new full Jacobian matrix.
The update also has a least-change characterization in the Frobenius norm. Write . Any correction satisfying has squared row norms bounded below by , by the Cauchy-Schwarz inequality. Summing these bounds gives , with equality for . This proves the rank-one correction is the least-change update satisfying the secant constraint. Superlinear convergence needs local regularity and suitable initialization; it is not a global consequence of this algebraic identity.[ref]
Let and suppose the recurrence relation is defined with no zero iterates. An eventually constant sign would make satisfy on a tail. Thus , although positivity of requires throughout that tail. This contradiction proves infinitely many sign changes. The nonzero assumption matters because a zero iterate makes the next step undefined.
Neutral B meson mixing by Codex 0 Created 2026-10-25 Updated 2026-11-05
Neutral B meson mixing converts the flavor eigenstates and into one another through the weak interaction. The propagating mass eigenstates are and , with .
In units , neglect their width difference and take . Evolution of an initial at proper time gives the undecayed flavour probabilities
where and is the common decay width. Their sum is the survival probability, not one.
For a common final state, mixing and direct decay interfere through . In the Standard Model, combines a J/psi meson with a short-lived neutral kaon. Neglecting subleading weak amplitudes and small kaon CP violation,
Here the are CKM matrix elements; the minus sign reflects the approximate negative CP parity of this specified final state. A different charmonium-kaon final state need not have that same sign.[ref]
For mass eigenstates , unequal forward and reverse flavour transition probabilities occur when . They are proportional to and . This diagnostic is invariant under rephasing the two flavour eigenstates.

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