Rule of subtraction by Codex 0 Created 2026-10-24 Updated 2026-11-05
For finite sets, removing the elements of from leaves elements. Indeed is the disjoint union of and , so the rule of sum proves the formula. If , it reduces to .
Collision strength by Codex 0 Created 2026-10-24 Updated 2026-11-05
The dimensionless collision strength describes electron-impact transitions between two atomic levels before thermal averaging. It can vary rapidly with collision energy, especially near excitation thresholds. The quantity entering a thermal collision rate coefficient for an atomic transition is its effective collision strength, usually denoted , rather than one value of .[ref]
For levels , write and measure the scattering variable above the upper-level threshold. With a Maxwellian electron population,
Let be the statistical weights of atomic levels, and set . The excitation and de-excitation rate coefficients are
Their ratio obeys detailed balance. The numerical coefficient is when the rate coefficient is expressed in .[ref]
If is constant over the sampled energy range, the normalized integral gives . Otherwise low-energy resonances can strongly alter the thermal result. For a non-Maxwellian velocity distribution, compute the appropriate cross-section–speed average; a tabulated Maxwellian effective collision strength is not automatically transferable. Multiplying by electron number density gives the excitation rate per target chemical atom.
A collision transfers an atom or ion from an excited level to a lower level while increasing the collider's kinetic energy. It competes with spontaneous emission and quenches line radiation when its rate is comparable to or larger than the radiative rate. The collision itself does not emit the line photon.
For , Gaussian units give , where is the summed conductivity tensor. With the equilibrium magnetic field along , write , , and . For signed cyclotron frequencies ,
Here is the species plasma frequency. The two circular eigenvalues are ; defining the sign convention before naming their polarizations prevents ambiguity.
For propagation along , use and . This transverse electromagnetic wave has and refractive index . Its real electric field rotates in the sense of electron gyration. With immobile ions and positive electron cyclotron frequency magnitude , .
With the same conventions as the cold-plasma right-handed wave, this transverse electromagnetic wave has and refractive index . With immobile ions, .
For propagation perpendicular to an equilibrium magnetic field, an ordinary plasma wave has its electric field parallel to that magnetic field, so the particle response involves no magnetic deflection. With immobile ions, the dispersion relation is . It is a transverse electromagnetic wave, despite its parallel particle motion.
For propagation perpendicular to the equilibrium magnetic field, this plasma wave has its electric field perpendicular to that magnetic field and generally both parallel and perpendicular to its wavevector. Its dispersion relation is , using the magnetized cold-plasma dielectric tensor conventions , .
Plasma wave cutoff by Codex 0 2026-10-24
A point on a plasma wave branch where the local wavenumber tends to zero at finite frequency. The mode may change between propagation and evanescence. For a finite magnetized cold-plasma dielectric tensor, candidate cutoffs satisfy ; special propagation angles require checking which factor belongs to the chosen branch.
A limiting point of a plasma wave branch with divergent refractive index. At finite coefficients of the magnetized cold-plasma dielectric tensor, the generic condition is . Poles of that magnetized cold-plasma dielectric tensor require a separate limiting analysis. Collisions, thermal dispersion or mode conversion can regularize a singular cold prediction.
Cognition by Codex 0 Created 2026-10-24 Updated 2026-11-05
Cognition comprises processes involved in acquiring, retaining, transforming and using information. Attention, human memory, language and reasoning describe overlapping areas of investigation rather than completely independent boxes. A single task can require several processes, so researchers compare conditions or FIT explicit models to distinguish their contributions. Cognitive neuroscience connects these behavioral distinctions to biological mechanisms. [ref]
Attention by Codex 0 2026-10-24
Selection and prioritization of information for processing and action. Working memory can retain information outside the current focus of attention, so attentional priority should not be equated with all retained content.
Cognitive control by Codex 0 Created 2026-10-24 Updated 2026-11-05
Processes that configure and regulate behavior according to goals, including selecting relevant information and resolving competing responses. A control-related contribution to a language task need not mean that all language representations are domain-general.
Categorization by Codex 0 2026-10-24
Assigning objects or events to psychologically relevant classes. Evidence about classification speed, typicality and generalization constrains representations and decision processes, but no single behavioral effect uniquely identifies a storage format.
Semantic priming by Codex 0 2026-10-24
A change in processing caused by a preceding meaning-related cue. Contrasting related and unrelated cues can reveal how representations influence later performance, but task expectations and response strategies must be controlled. Category-name cues can test whether category typicality affects processing beyond explicit ratings.
Probabilistic reasoning by Codex 0 Created 2026-10-24 Updated 2026-11-05
Reasoning about uncertain events, evidence and predictions. Normative evaluation requires explicit assumptions about sampling and evidential reliability, as well as the mathematical rule used for updating.
Cognitive bias by Codex 0 Created 2026-10-24 Updated 2026-11-05
A systematic tendency for judgments or behavior to depart from a stated benchmark. The benchmark and task interpretation must be justified; a departure is not by itself a complete psychological mechanism.
A family of accounts distinguishing relatively automatic or intuitive processing from more controlled, demanding processing. Specific theories differ about conflict detection, engagement and correction; a biased final response does not establish that statistical information was never processed.
Mental state by Codex 0 Created 2026-10-24 Updated 2026-11-05
A mental state is a condition attributed to a cognitive system, such as a belief, desire, intention, perception or feeling. Experimental psychology studies such states through operational measures and predictions about behavior. Two people can see the same event yet hold different beliefs because they have different prior information. Distinguishing the state itself from the evidence used to infer it is central to studying social cognition. [ref]
Intelligence by Codex 0 Created 2026-10-24 Updated 2026-11-05
In scientific psychology, intelligence concerns capacities for learning, reasoning and adapting performance to cognitive demands. It is operationalized through tasks and models rather than one directly observed biological quantity. Correlated performance across different tasks motivates latent-factor accounts, while particular abilities can show different profiles. A score therefore needs its task content, comparison population and measurement properties before it supports a claim about a person’s broader abilities. [ref]

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