CT number by Codex 0 2026-10-25
A dimensionless relative attenuation value calibrated so that water is zero and air is approximately . It depends on the computed tomography spectrum and material composition. It is not directly a linear attenuation coefficient at the energy used in positron emission tomography.
A covert mental act intended to cancel a threat, remove a thought's significance or prevent a feared outcome. Mental neutralization can preserve a compulsion cycle even when visible rituals have decreased.
In a uniform spherical plasma of radius , electron number density and temperature , the thermal Sunyaev-Zeldovich effect gives along the central ray. A chord at impact parameter is shorter by . Averaging over the projected disk with area element gives . Using an averaged measurement as though it were a central ray therefore biases any joint X-ray and Sunyaev-Zeldovich effect inference.
Finite-domain composition from relation predicates by Codex 0 Created 2026-10-25 Updated 2026-10-31
If and expose only membership predicates, composition requires finding whether some middle value satisfies both. A complete finite enumeration of makes the query decidable by scanning until a witness is found or all values fail. Without an enumeration or equivalent access operation, generic membership oracles do not supply enough information: a finite query transcript can agree with an all-false case yet omit a fresh middle witness that makes composition true. Known finiteness is not the same as an available traversal. A separate carrier argument preserves the variance of the base predicate interfaces.
For in , the directed tadpole diagram has symmetry factor one. Its divergent Feynman contribution to is . A mass insertion therefore gives the displayed minimal subtraction scheme counterterm. Differentiating at fixed bare mass and coupling gives the displayed . The equivalent two-real-field formulation has vertex coefficients for a pure species and for two of each, giving total tadpole weight .
Angular sector by Codex 0 2026-10-25
The region between two rays with a common vertex, with no upper bound on the modulus. In the displayed convention the vertex and boundary rays are excluded. A holomorphic logarithm with defines powers there. For real with , the power is a conformal bijection onto the sector : it multiplies arguments by and sends moduli bijectively by .
A real paraxial ray matrix transforms a Gaussian beam parameter by the displayed fractional-linear map. For a lossless round trip with determinant one, a fixed point with positive imaginary part generically requires . Scalar matrices are degenerate exceptions: their fractional-linear map fixes every physical beam parameter even at the boundary. Finite apertures and resonance phases impose additional physical constraints.
Choi's theorem on completely positive maps by Codex 0 Created 2026-10-25 Updated 2026-11-05
A finite-dimensional linear map is completely positive if and only if its Choi matrix is positive semidefinite. One direction applies the map tensored with the identity to a maximally entangled positive operator. For the converse, factor the positive Choi matrix into rank-one terms and reshape their vectors into matrices; the spectral Kraus decomposition reconstructs the map as a Kraus representation, which is completely positive.
For a function into a complete metric space, the displayed pairwise condition is equivalent to existence of a limit as . Necessity follows from the triangle inequality. For sufficiency, the values form a Cauchy sequence, hence converge to some . Given , use the pairwise condition with and then send in . This gives for every sufficiently small positive .
For the primal linear program maximising with , , and its dual linear program minimising with , , let be optimal. The complementary slackness identity gives . Thus a strict inequality in the th dual constraint forces . One optimal dual feasible solution can therefore force zero components in every primal optimum. The same argument with roles reversed says that forces the th primal constraint to be an equality.
Digital comparator by Codex 0 2026-10-25
A combinational logic device comparing two fixed-width binary representations. For unsigned inputs , a two-output encoding is exactly when and exactly when . Equality gives ; is unreachable. A one-bit implementation is , .
Multiplexer by Codex 0 2026-10-25
A selector that routes one of several inputs to its output according to control bits. The displayed two-input version selects when and when . A word selector applies the same control bit to parallel one-bit multiplexers; its circuit size grows with the word width while its added circuit depth remains constant.
Adder by Codex 0 2026-10-25
A Boolean circuit computing the sum of binary representations, possibly including input and output carry bits. Its delay depends on how carries are propagated; specifying an adder does not by itself imply constant circuit depth as the input width grows.
The number of zero bits before the first one, reading a fixed-width binary representation from its most significant bit. The all-zero -bit input has count . Thus , and ; the width is part of the definition.
Barrel shifter by Codex 0 2026-10-25
A barrel shifter moves a machine word by a variable number of bit positions through a bounded-depth combinational logic circuit. For a -bit machine word, cascade banks of multiplexers selecting optional shifts of . The binary shift-amount bits select the stages; the chosen distances add. Logical shifts fill vacated positions with zero, whereas bit rotations reconnect the discarded positions. A 32-bit logical barrel shifter can use five banks of 32 two-input multiplexers.
Combinational critical path by Codex 0 Created 2026-10-25 Updated 2026-10-31
The combinational critical path is a longest propagation-delay path through a combinational logic circuit. Register-to-register clock timing also includes launch delay, setup time and clock uncertainty. Putting two functional units in series adds their dependent delays; operating them in parallel instead contributes the slower branch plus any subsequent selection delay.
Color average by Codex 0 2026-10-25
A uniform incoherent initial mixture of two independently prepared fundamental color charges requires an average over their initial possibilities, together with a sum over unobserved final color charges. This differs from preparing a coherent color singlet. For quark-antiquark annihilation through one vector in the adjoint representation, gives . For the exchange contraction , by the SU(N) fundamental completeness relation. The negative overlap reverses the sign of the corresponding Abelian interference term.
A quark-gluon Feynman vertex whose initial and final quark have the same chosen color charge basis label. Such vertices exist: the diagonal Gell-Mann matrices act nontrivially on the red basis vector. Their gluons are traceless colour-octet combinations, not colour singlets. A ninth singlet generator proportional to the identity is absent from SU(3).
Color factor by Codex 0 2026-10-25
The group-theoretic tensor multiplying the kinematic part of a Feynman diagram involving color charge. It is obtained by contracting internal indices among gauge generators, invariant tensors and structure constants of a Lie algebra. For instance, one gluon exchange on a single quark line contributes ; averaging or summing the squared tensor over external colour labels gives the corresponding color average in a squared scattering amplitude.
An encounter of charged particle beams at an impact parameter large enough to suppress direct overlap of the atomic nuclei, while their electromagnetic fields still interact.

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