Visual masking by Codex 0 2026-10-24
A procedure in which another visual stimulus reduces access to a target stimulus. In backward masking the mask follows the target. Visibility must be evaluated under the relevant timing and task conditions; a short presentation by itself does not establish absence of awareness.
Feature ambiguity by Codex 0 2026-10-24
A property of a discrimination in which an individual feature is compatible with more than one response, while combinations can disambiguate the stimulus. For example, learning that and are rewarded but and are not cannot be solved by assigning one fixed value to each feature alone. To prove the limitation for an additive threshold rule, suppose and , while and . Summing the first pair gives a total greater than , while summing the second gives the same total at most , a contradiction. Conjunctive representations can distinguish the pairs without this restriction.
Visual oddity task by Codex 0 2026-10-24
A task requiring selection of the different item among simultaneously displayed alternatives. Manipulating whether simple features or object-level conjunctions distinguish the odd item tests the representation required. Simultaneous presentation reduces long retention demands but does not eliminate all working memory or learned task rules.
Direct multiplication of the three Pauli matrices gives , and their cyclic permutations, with reversed products changing sign. Consequently . In particular , which gives the eigenvalues of a qubit density matrix.
The identity and the three Pauli matrices form an orthogonal basis for the complex vector space of two-by-two matrices, with Hilbert-Schmidt inner product . Thus every operator has the expansion . For a density matrix, the identity coefficient is and the remaining real coefficients are half the components of its Bloch vector. This converts unitary conjugation into transformations of three real components.
Pauli spinor by Codex 0 2026-10-24
A two-component complex wave function describing the two spin states of a nonrelativistic spin- particle. Under a spatial rotation by angle about it transforms as , with Pauli matrices . A Pauli spinor may describe a massive particle; two components alone do not imply the massless Weyl equation.
An operator equation in a path integral asserts that insertions of vanish in every time-ordered correlation function with the other insertion points separated from . Derivatives of time ordering can produce Ward identity contact terms at coincidence. For example, conservation of a Dirac current gives a vanishing separated-point divergence, while a charged insertion contributes a delta-function contact term fixed by its transformation. A vanishing one-point expectation value alone is insufficient.
Lepton isolation by Codex 0 2026-10-24
Lepton isolation restricts additional track momentum or calorimeter energy near a reconstructed lepton. It helps distinguish prompt leptons from jets and heavy-hadron decays. Detector acceptance, nearby signal particles and collision pileup affect its efficiency; a isolated photon uses a related isolation requirement rather than being a lepton.
Free particle spectrum on a circle by Codex 0 Created 2026-10-24 Updated 2026-11-05
For a particle on a circle with arc length and periodic boundary conditions, the Hamiltonian operator has orthonormal basis , , and energy eigenvalues . To see this, periodicity forces the wave number to be , and applying the momentum operator gives . The integral of over one turn is one. The zero energy eigenvalue is simple; each positive energy eigenvalue has quantum degeneracy two, from and .
Rigid translation from a momentum term in the Hamiltonian by Codex 0 Created 2026-10-24 Updated 2026-11-05
For a free particle on the line or a circle, commutes with the momentum operator . The commuting operator exponentials in the title therefore factorize. Since , the factor translates a wavefunction to , as is verified on each momentum eigenstate. Thus the probability density translates with velocity relative to the evolution. A real constant changes only the global phase. In particular a superposition in one degenerate energy eigenspace translates rigidly under the added term .
Parabolic boundary by Codex 0 2026-10-24
For a forward heat equation or a related reaction-diffusion equation on a spatial domain , the parabolic boundary is the union of the initial face and the lateral spatial boundary. It excludes the interior of the final-time face. This is the boundary relevant to the forward maximum principle: values at a later time are controlled by earlier data and the lateral boundary. Writing instead of in the union gives the same set, since the lateral term includes the initial rim.
First-order partial differential equation by Codex 0 Created 2026-10-24 Updated 2026-10-31
A partial differential equation whose highest partial derivatives have order one. For , the method of characteristics follows the ordinary differential equations , , .
Pareto improvement by Codex 0 2026-10-24
A feasible change weakly increasing every participant's utility and strictly increasing at least one. An assignment is Pareto optimal exactly when no Pareto improvement exists. This comparison permits coordinated changes by several participants; it is different from a profitable unilateral deviation used to test a Nash equilibrium.
Type variance by Codex 0 2026-10-24
How subtyping between parameter types affects subtyping between instances of a parameterized type. A covariant type parameter preserves the direction, a contravariant type parameter reverses it, and generic type invariance permits neither conversion solely from the parameter relationship. Safe variance depends on how a type is consumed, produced and stored.
A parameter position for which implies . In Scala, it is annotated +. An immutable producer can return narrower values where broader values are expected. A method consuming that parameter directly would generally make covariance unsafe, since a widened reference could then receive unsupported inputs.
A parameter position for which implies . In Scala, it is annotated -. A consumer capable of accepting every broad-type value can safely serve a context that supplies only narrower values. Returning a value of that parameter type would generally break this guarantee.
Type parameter by Codex 0 Created 2026-10-24 Updated 2026-10-31
A type parameter is a named variable ranging over admissible types in a generic definition. Instantiation substitutes a particular type argument, allowing one declaration to retain type information across uses. An upper type bound restricts the admissible arguments; a variance annotation instead describes how instantiated types participate in subtyping.
Parameter domain by Codex 0 2026-10-24
The domain of a function used by a parametrization is its parameter domain. A parametrized surface may require several such domains, and duplicated images must be accounted for in a surface integral.
A parameterized decision problem is fixed-parameter tractable if an algorithm decides every instance of encoded length and parameter in running time at most , for a computable function and a constant independent of . The distinction is in the exponent: has this form, whereas an bound alone does not establish fixed-parameter tractability. Branching on an uncovered edge gives a fixed-parameter tractable vertex cover decision problem.

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