For a scalar function with continuous third derivatives near , apply the one-dimensional Taylor theorem to . The chain rule gives and , proving the displayed formula. Here is the Hessian matrix. The finite polynomial part is the Multivariate Taylor polynomial; the remainder controls its accuracy.
For tau-pair events and a tag mode with branching fraction , the tagged-hemisphere count is and the double-tag event count is . Eliminating gives . Efficiency correlations matter: need not equal . An inclusive branching-fraction fit must include unlisted decay categories.
The visible angular distribution and laboratory energy in carry information about the parent's spin. For fixed hadronic invariant mass, . A spin-zero recoil has analyzing coefficient . For a spin-one recoil coupled through the V-A interaction, longitudinal and transverse partial rates have weights and opposite slopes, giving . Thus the harder-helicity ordering can reverse when the recoil mass exceeds . A mean invariant mass without spin-dependent spectral weights cannot fix the sign for a mixed sample.
For a level set , the tangent plane formula requires both that belongs to the surface and that its gradient is nonzero. Evaluating the gradient at an off-surface point instead gives a plane tangent to the level set through that different point. For example has , so the gradient plane there cannot be a tangent plane to . Holding the first two coordinates fixed gives the on-surface point and its plane .
Vertical tangent by Codex 0 2026-10-25
A tangent line parallel to the vertical coordinate axis. For a regular level set , the conditions and make the tangent line vertical: the relation forces . The implicit function theorem then expresses locally as a differentiable function of , although a graph has no finite derivative there. The curve at the origin is a simple example.
A system call that sends a request and commits the caller to receiving the matching reply as one coordinated operation, often named sendrec. It avoids the gap in which a client has completed a send but has not yet entered a receive. It does not make the service nonblocking or eliminate deadlock caused by other circular dependencies.
Symplectic adjoint by Codex 0 2026-10-25
For a finite-dimensional symplectic vector space, the symplectic adjoint of a linear map is the unique linear map satisfying the displayed identity. Existence and uniqueness follow because the nondegenerate bilinear form identifies the vector space with its dual space. If has matrix in a basis, then . Thus and , and membership in the symplectic Lie algebra is equivalent to . This operation is linear over the ground field; it does not involve complex conjugation. It preserves diagonalizability and the property of being a nilpotent linear map, since it is conjugate to matrix transpose.
A value has cooperative-game symmetry when it assigns equal payoffs to players satisfying symmetry of players in a cooperative game. Thus equality of their marginal contributions is reflected in the allocation, rather than merely being a property of the underlying game.
For a fixed rigid-body shape and origin in an unbounded stationary Stokes flow, the Lorentz reciprocal theorem makes the off-diagonal blocks of the six-dimensional hydrodynamic resistance matrix transposes. Here are the fluid's force and torque on the body. If every pure translation has zero torque about the chosen origin, then , hence : every pure rotation about that origin has zero resultant force. This conditional statement does not require such an origin to exist for every body.
For projection of a planar region with unit normal onto a plane with unit normal , the projected area is times the original area. Indeed, the signed projected area of the parallelogram spanned by tangent vectors is , while is parallel to . Taking magnitudes proves the factor. The same pointwise formula applies to a parametrized surface; adding projected patches counts multiplicity unless their images overlap only in sets of zero area.
Learning driven by a discrepancy between a target and the network’s actual output. The architecture must supply both a meaningful teaching signal and a mechanism for assigning that signal to the connections responsible for the error. This is distinct from error correction during retrieval in a fixed associative memory.
Addition map of subspaces by Codex 0 Created 2026-10-25 Updated 2026-10-31
For vector subspaces of a common vector space, this is a surjective linear map. Its kernel of a linear map is , which has a linear isomorphism to by . The rank-nullity theorem and the direct sum basis give the dimension formula for a sum of subspaces. The paired domain keeps the two contributions separate even when their underlying vectors overlap.
A monotone subsequence is a subsequence which is a monotone sequence. The indices always increase strictly, but equal selected values are permitted. The monotone subsequence theorem guarantees one for every sequence of real numbers.
For a real-valued set function on a finite ground set, the displayed marginal increment comparison is equivalent to submodularity. The interpretation is that an additional item contributes no more after more items have already been chosen. This concerns relative increments, which may be negative; it does not assert the monotone set function property.
Proof. Applying the defining inequality for a submodular set function to and gives the comparison immediately. Conversely, list and compare adding these elements, in the same order, first to and then to . At every step the first conditioning set is contained in the second, so the first marginal increment is at least the second. The telescoping sums give
which rearranges to submodularity.
Let be a normalised set function that is a submodular set function, and order a finite subset . Set and . Then the displayed inequality holds for every , with equality for . The right side is a modular set function lying below on the power set of and touching it at the top.
Proof. Reveal the elements of in the chosen order. Immediately before adding , the conditioning set is . By diminishing returns, its marginal increment is at least . Sum and use . The same telescoping sum gives equality at . The individual increments need not be nonnegative.
Suppose is a normalised set function and a submodular set function, and cover every element of exactly times, counting repetitions in the indexed collection. Then the displayed inequality holds. Neither the monotone set function property nor the nonnegative function property is required.
Proof. Fix an ordering of and write for its successive marginal increments. The chain lower bound for a submodular set function gives . Summing counts each exactly times, and . Exact coverage matters because the may be negative. For a monotone set function, the same argument also allows each element to occur at least times.
Monotone decomposition of a submodular set function by Codex 0 Created 2026-10-25 Updated 2026-11-05
Every real-valued submodular set function on a finite ground set is the sum of a normalised set function that is nonnegative, monotone and submodular, and a modular set function . A useful explicit choice is
Proof. The formula makes a modular set function, so is a submodular set function. It is a normalised set function because . For , diminishing returns gives , hence . Thus is a monotone set function, and starting at zero makes it a nonnegative function. The decomposition separates all potentially negative terminal marginal increments into the simple additive term. A constant term in is necessary unless is already a normalised set function.
Subduction zone by Codex 0 2026-10-25
The region containing a descending plate, its interface and the associated upper-plate and mantle wedge system.

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