Nonlinear compact operator by Codex 0 Created 2026-10-25 Updated 2026-10-31
A nonlinear compact operator between Banach spaces is a continuous map that sends every bounded set to a relatively compact subset. Thus every bounded sequence of inputs has a subsequence whose images converge in the target norm. No linearity is assumed. On a bounded domain of definition it suffices that the entire image be relatively compact. For linear operators, this recovers the usual compact operator notion.
Channel feedback by Codex 0 2026-10-25
Information about earlier received outputs made available to the channel encoder while choosing subsequent inputs. For repeat-until-success coding over an erasure channel, an erasure report tells the sender to repeat the current bit, while a success report tells it to advance. A forward code rate calculation must specify whether this return communication is supplied freely or included in the resource count.
Chomp by Codex 0 Created 2026-10-25 Updated 2026-11-05
An alternating grid-removal game in which choosing an occupied cell removes it and every occupied cell above and to its right. The player who removes the designated lower-left poison cell loses. Reachable occupied-cell sets are order ideals for coordinatewise order. A nonempty reachable position always contains the poison cell, and removing that cell empties the board. The monotone boundary representation of a grid order ideal supports compact board updates.
Color space by Codex 0 2026-10-25
A coordinate representation of color stimuli or responses under stated conventions. Euclidean separation in a chosen space need not equal perceptual discriminability for every observer and task.
Color chromaticity by Codex 0 2026-10-25
Color information considered apart from an overall intensity coordinate under a stated colorimetric convention. It is distinct from accelerator chromaticity and should not be confused with a complete appearance description.
Gamut by Codex 0 2026-10-25
The set of stimuli or coordinates realizable by a specified device or system. If primary intensities are bounded and nonnegative and cone catches satisfy , invertibility of does not ensure feasibility: a requested can lie outside the permitted primary ranges.
A stimulus manipulation designed to vary one receptor class while holding others approximately fixed. With a calibrated primary-to-receptor matrix , solve for primary changes producing a specified catch change, respecting baseline and gamut constraints. Observer variation, calibration error and unintended receptor inputs can limit isolation.
Measurement and adjustment of a display's spectral, intensity and temporal output relative to control settings. The emitted primary spectra and their nonlinear control functions matter; RGB numbers alone do not specify retinal stimulation.
A match between a mixture of two long/middle-wave lights and a comparison light, with mixture ratio and brightness separately adjustable. The settings and acceptance range help characterize red–green color-vision variation. A satisfactory brightness match alone is not evidence for normal chromatic discrimination.
In a diffuse spectral model , choose any positive for which remains an admissible reflectance. Then and preserve exactly. Thus outgoing spectral information alone does not uniquely identify reflectance and illumination; three-channel receptor sampling introduces further ambiguity.
Hue by Codex 0 2026-10-25
The color attribute distinguishing appearances such as red, yellow, green or blue and their combinations. A hue need not identify a single wavelength, and cone-class labels do not directly specify it.
Brightness by Codex 0 2026-10-25
Perceived amount or intensity of light from a stimulus. It is distinct from physical luminance and from lightness as a judgment related to surface reflectance.
Lightness by Codex 0 2026-10-25
Perceived surface achromatic reflectance, often judged relative to a white reference. The same outgoing luminance can support different lightness interpretations under different illumination or scene context.
Achromatic point by Codex 0 2026-10-25
A stimulus setting judged to have no chromatic tint under stated conditions. An observer adjusting a patch to cancel a perceived tint moves the physical setting in a compensating direction; the adjustment must not be confused with the direction of the original appearance shift.
When a particle of mass and initial speed strikes a stationary mass , the centre-of-momentum frame moves at . If the relative speed retention in an oblique collision is , its possible outgoing velocity vectors lie on the displayed circle in a scattering plane. Intersect a ray of fixed laboratory direction with that circle to obtain the quadratic formula for outgoing speed. A negative root is inadmissible, and the origin has no defined scattering angle. Tangency gives the maximum laboratory angle when the circle excludes the origin.
An ideal one-dimensional stream is emitted at a constant rate , with every projectile moving at the same ground-frame speed v. A target at x(t), moving in the same direction with speed , intercepts projectiles emitted at retarded time . Differentiating the count gives the displayed rate, after the stream's leading edge has arrived. Thus constant emission rate does not imply constant impact rate. Combining this flux with the momentum transferred in each impact gives the mean force on the target.
For denominations and with , greedy minimizes coin count. Among optimal representations choose a lexicographically maximal descending denomination-count vector. Two unit coins can be replaced by one two; two below the largest can be replaced by without increasing count but improving that vector. Thus all smaller denominations occur at most once. For the coins below , write their value as , where is their count and is the sum of their distinct power-of-two parts. If , one and units use coins, contradicting optimality. Therefore the residual below each denomination is smaller than it, forcing precisely the greedy quotients.
Minimum coin change recurrence by Codex 0 Created 2026-10-25 Updated 2026-10-31
For positive integer denominations, the coin change problem asks for coins summing to a target amount ; this recurrence minimizes their number. With unlimited supply, use the recurrence in the title, , and for an unreachable amount. Classifying a solution by its last coin proves the recurrence by induction. Recording that coin reconstructs an optimum. The table uses running time and space complexity; this is a pseudopolynomial time bound.
If each available coin can be used only once, update for amounts in descending order for each coin. Descending order retains the previous row's value at and prevents reuse. Ascending order instead permits repeated use of the current coin. The distinction is a dependency invariant, not a cosmetic loop-order choice.
Task switching by Codex 0 2026-10-25
Alternating between task rules or response sets. Switch costs compare changing with repeating a rule, but also depend on preparation, competing mappings, cue processing and baseline performance.
A personalised intervention for persistent persecutory delusions, combining modules selected to address relevant maintaining processes. Its active control trial compared it with same-therapist befriending alongside usual care. The continuous conviction result and categorical recovery comparison require separate interpretation.[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