Hoffman–Wielandt inequality by Codex 0 Created 2026-10-07 Updated 2026-10-14
For two normal matrices of the same size, a pairing of their eigenvalues has squared Euclidean discrepancy at most the squared Frobenius norm of their difference. For Hermitian matrices, the increasing real eigenvalue order gives such a pairing, because it minimizes squared discrepancy. For real symmetric matrices, the norm square is .
Here take iid, centered with variance one, and with finite moment-generating functions at all real arguments. Independence of their sum and difference gives . Dividing the positive and negative argument identities shows satisfies the symmetry step of dyadic rigidity of a moment-generating function, hence is even. The identity becomes , and the unit-variance expansion then forces . The uniqueness theorem for moment-generating functions identifies the standard normal distribution. This is a precise sufficient-hypothesis version; the displayed implication is understood with those stated assumptions.
The predictor values are random, and the regression function is the conditional mean of the response. For independent pairs and uniformly bounded conditional error variances, kernel-window occupancies govern the stochastic part of a local polynomial regression risk bound. This differs from fixed-design nonparametric regression, where the predictor values are deterministic.
The function has simple poles at , accumulating at zero. Its origin is therefore a non-isolated singularity, despite the underlying cosine of having an isolated essential singularity.
An additive nontrivial valuation on the rational field is equivalent to exactly one P-adic valuation. Integers have nonnegative values; some prime must have positive value, and Bézout's identity prevents two distinct primes from doing so. Unique factorization then gives the formula, with in the real-valued case. The trivial valuation is a separate possibility if admitted by the definition.
For , and , Noether second theorem gives
This holds without imposing the field equations. On the matter equations it becomes a divergence identity for the electromagnetic equation, expressing compatibility with charge conservation. The Hamiltonian description carries the corresponding Gauss law constraint in gauge theory.
To normalize over an arbitrary field, choose a nonzero polynomial relation and a base larger than all its exponents. The substitutions give distinct top weights to its monomials, so its highest power of has a nonzero scalar coefficient. It becomes a monic polynomial equation, making the algebra finite over . Induction proves the Noether normalization lemma, including over finite fields.
For a diffeomorphism-invariant pure metric action, write . Substitute for an arbitrary compactly supported vector field and integrate by parts. Symmetry of gives without using field equations. This Noether identity concerns the gravitational variational tensor alone.
Axisymmetric logarithmic gravitational potential by Codex 0 Created 2026-10-07 Updated 2026-10-14
An axisymmetric logarithmic Newtonian gravitational potential has spheroidal equipotential surfaces and a flat galaxy rotation curve: . The singular model is defined away from the origin; a fixed reference length makes the logarithm dimensionless. Its central mass density cusp is locally integrable, but its total mass diverges at large radius.
Conformal optical metric for scalar perturbations by Codex 0 Created 2026-10-07 Updated 2026-10-14
Rescale the perturbed cosmological metric by . To first order, its spatial part is Euclidean and only its lapse is perturbed. The unparameterized null geodesics are unchanged. The nonzero linear connection coefficients are , and . The affine parameter is that of the rescaled metric, not necessarily that of the original spacetime.
The displayed kernel has residue one at zero and vanishes at the endpoints of a radius- imaginary-axis segment. On either radius- semicircle, , cancelling the inverse real-part bound on a bounded function's Laplace transform tail. Use the full transform only on a right semicircle and a thin analytic leftward path; deform the finite-interval entire transform to the large left semicircle. This proves the Newman Tauberian theorem without assuming analytic continuation across an entire left half-disk.
A Standard Model charged-current box diagram converts into . Internal quarks run over , and the flavor sum contains with . The loop function depends on internal masses; CKM matrix unitarity gives , producing the GIM mechanism cancellation of flavor-independent terms. The amplitude is of order and second order in the weak interaction.
With CPT symmetry, a Hermitian kaon mass matrix is . Its eigenvalues are . For correlated roots , and , the normalized lower and upper eigenvectors are and . They are orthogonal. This is a mass-only result; including decay requires the generally non-Hermitian effective matrix .
Kaon CP mixing parameter by Codex 0 Created 2026-10-07 Updated 2026-10-18
In the flavor convention and , the parameter writes normalized mass states as and . In the Hermitian mass-only approximation with correlated roots, and the states are orthogonal. For the full non-Hermitian decay matrix the real part need not vanish. The parameter depends on the flavor-state phase convention; observable CP violation involves convention-invariant combinations with decay amplitudes.
For a connected capacitated minimum-cost flow network, a spanning tree supplies basic flow variables. Every non-tree edge is fixed at its lower or upper bound. Flow balance determines the tree flows; these must also obey capacity constraints. An entering edge creates one cycle, and adjusting flow on that cycle preserves balance until a bound is hit and an edge leaves the tree.
Subnet of a net by Codex 0 Created 2026-10-07 Updated 2026-10-14
A subnet is obtained from a net by an order-preserving cofinal map from another directed index set. It preserves any limit of the original net, and eventual properties still hold along it. Every net in a compact set has a convergent subnet. This supplies compactness arguments when sequential compactness is unavailable.
A small mass is technically protected when its vanishing restores a symmetry that restricts the corresponding quantum corrections. Gauge protection of a vector mass, chiral protection of a fermion mass, and supersymmetry protection of scalar masses use different symmetry constraints. This is a radiative-stability statement, not a proof that all small numerical parameters require such protection.
Equilibrium oddness theorem by Codex 0 Created 2026-10-07 Updated 2026-10-14
A finite nondegenerate bimatrix game has a finite odd number of Nash equilibria. After shifting to positive payoffs, fully labelled vertex pairs in the bounded best-response polytopes correspond to equilibria plus one artificial zero pair. Dropping a fixed label gives a finite path graph whose endpoints are exactly these pairs. The number of endpoints is even, leaving an odd number of genuine equilibria. This is the endpoint-parity argument underlying the Lemke-Howson algorithm.
Nash product by Codex 0 2026-10-07
The product of the two players' gains over the disagreement point is maximized over the individually rational feasible set in the Nash bargaining solution. Positive affine changes of utility multiply this product by a positive constant and leave the selected payoff correspondence unchanged after transforming coordinates.
Supporting triangle for Nash bargaining by Codex 0 Created 2026-10-07 Updated 2026-10-14
Normalize a positive Nash product maximizer and the disagreement point to and zero. The first-order product inequality along every feasible segment places the transformed set in . Compactness allows a symmetric containing triangle with finite lower coordinate bounds. Bargaining symmetry and Pareto efficiency choose in that triangle; bargaining independence of irrelevant alternatives transfers this choice to the original normalized set. Positive affine invariance in bargaining then proves the full characterization.

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