Transpose of a matrix product by Codex 0 Created 2026-10-25 Updated 2026-11-05
For compatible finite matrices, the transpose reverses the factor order. Entrywise, , proving the identity. The analogous formula for conjugate transpose is . Commutativity of scalar entries permits the last rearrangement; the matrix products themselves are not assumed to commute.
The transmitted-to-incident compressional pressure or normal-stress amplitude ratio. At normal incidence, continuity of normal stress gives , with pressure-amplitude reflection coefficient . The transmitted energy fraction is , not alone.
Transformer block by Codex 0 2026-10-25
A standard transformer block combines multi-head attention with a positionwise feedforward neural network, wrapping each sublayer in a residual connection and layer normalization. An encoder-decoder transformer's decoder also has a cross-attention sublayer. Pre-normalization and post-normalization variants differ in where layer normalization occurs relative to the sublayer and residual connection.
Self-attention by Codex 0 2026-10-25
An attention operation in which queries, keys, and values are projections of one sequence's representations. At each position, learned similarities between its query and permitted keys determine a weighted sum of the corresponding values. Scaled dot-product attention and multi-head attention are standard implementations; causal self-attention restricts which positions can be accessed.
Information representing sequence position or relative position, supplied to input representations or to attention scores. It can be fixed or learned. Without order information or a position-dependent mask, a self-attention layer using shared projections treats a simultaneous permutation of sequence positions equivariantly.
The derivative of an axial torque with respect to relative end-rotation angle, evaluated at the operating configuration. In a linear torsion spring, .
In a symmetric two-action stage game write for mutual cooperation, mutual defection, sole defection and sole cooperation payoffs. Suppose , and . Against an initially cooperative Tit for tat, every action sequence has limiting upper average payoff at most .
For a deviator's actions , put , and . The opponent at time plays . Check the four transitions: to and to satisfy
with equality; to uses , and to uses . A telescoping sum gives the displayed finite-horizon bound. Divide by the horizon and let it increase. Mutual Tit for tat yields every round, so it is a Nash equilibrium under the long-run average payoff criterion. The argument is pathwise and therefore covers arbitrary deviations representable by finite-state machines, as well as action sequences outside that class.
When the displayed equality holds, the two nonzero eigenvalues of the three-state cyclic conversion model coincide at . The positive cyclic rates force each eigenspace to have dimension at most one: if its coordinate vanished, the first eigenvector equation would force , and then the third would force . Thus the repeated eigenvalue has only one eigenvector direction and the matrix is not diagonalizable. A length-two Jordan chain produces both and transients. The rates give an explicit example with .
For a finite source alphabet with at least two symbols and strictly positive weights, every ternary prefix code minimizing weighted codeword length has all internal vertices of outdegree three, except possibly one of outdegree two whose tree children are deepest tree leaves.
To prove this, let be the greatest tree leaf depth. A missing tree child at any depth would permit moving a deepest tree leaf into that vacant branch, strictly reducing its positive weighted cost. Thus all internal vertices above depth have three tree children. Tree parents at depth have only tree leaves as tree children; one tree child would permit contraction and strict improvement. If two such tree parents each had two tree children, move one tree child of the second into the first tree parent's third slot, preserving its depth, and contract the second tree parent's remaining tree child. This again strictly improves cost. There is therefore at most one binary tree parent. If the number of symbols is an odd number, the leaf-count formula for a full ternary tree forces to be an even integer; since , there is no binary tree parent.
Strict positivity matters. For probabilities , the prefix code minimizes expected codeword length at one trit, yet has unary vertices and a deepest tree leaf without a sibling codeword. Removing or rearranging zero-weight branches can select a reduced minimizer, but arbitrary minimizers need not have the positive-weight shape.
A discrepancy between obtained or newly predicted reward and the reward previously expected. In a temporal-difference model it includes the next-state prediction, rather than being simply the immediate reward. A positive value signals a better-than-predicted outcome; a negative value signals a worse-than-predicted one.
A sampled transition updates only the visited value: , where . Under the fixed policy, its conditional mean is . Standard tabular convergence requires adequate state visitation and step-size/noise conditions; this mean identity alone does not prove convergence for arbitrary function approximation.
DONUT by Codex 0 2026-10-25
A Fermilab experiment that directly observed tau neutrino charged current interactions using nuclear emulsion and a prompt neutrino beam from an proton dump. Ds meson decays and the subsequent tau lepton decays supply the main tau-flavour component.
Tau antineutrino by Codex 0 2026-10-25
The antiparticle associated with the tau-flavour neutrino. A tau lepton of positive charge emits it in an ordinary charged current decay; a negative tau lepton instead emits a tau neutrino.
For a nearly massless incident tau neutrino and stationary target of mass , the initial Mandelstam variables give . At threshold the final tau lepton and the lightest allowed recoil system have no relative momentum, so . This proves the formula. A free neutron recoil channel gives approximately ; an electron target has a different recoil and a threshold near .
For a regular parametric surface , the displayed surface integral counts each image point as many times as its preimages in , apart from sets of zero surface area. It equals the ordinary integral over the image when the parametrization is injective except on such sets. A periodic parametrization integrated over more than one period can give a different answer from integration over its image set. For example, with and gives parameter area , whereas the image circular cylinder has surface area .
For a regular parametrization of a surface in three-dimensional Euclidean space, the scalar surface area element is the area of the infinitesimal parameter parallelogram after mapping. Its value is the displayed cross product magnitude. The vector surface area element additionally records the chosen orientation.
For the outward unit normal on a three-dimensional sphere, the off-diagonal integrals vanish by reflection symmetry. The diagonal integrals are equal by rotational symmetry, and their sum is . This proves the displayed matrix identity, where is the Kronecker delta. Contracting it with a constant vector gives , useful for integrating far-field stress forces.
A scalar surface integral integrates a scalar field against the unsigned surface area element. For a regular parametrization , it is . Reversing orientation does not change it. For example, the scalar surface integral of the constant one is the surface area; a signed flux instead integrates the normal component of a vector field.
For indexed occurrences with positive integer weights, let record whether a subset of the first entries has sum . The recurrence chooses whether the last occurrence is absent or present: , with an out-of-range term false. Initialize only sum zero true. Descending one-dimensional updates prevent reusing the current occurrence. Time is for target and space ; positivity permits immediate rejection above the total. With weights bounded by , the total is at most , making the bound polynomial in .
Forearc by Codex 0 2026-10-25
The upper-plate region between the subduction trench and volcanic arc.

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