Orientation-map self-organization by Codex 0 Created 2026-10-14 Updated 2026-11-05
Correlation-based learning among spatially arranged ON and OFF inputs, with synaptic competition and lateral interactions, can select elongated simple cell receptive fields. Neighbor interactions coordinate preferred orientations across cortex, while competition allows different orientations to persist. Selectivity within one cell and a spatial map across many cells are separate predictions, and neither follows from unbounded Hebbian learning alone.
An orientation tuning curve plots a specified response against the stimulus-axis angle , with the other stimulus variables controlled. A practical count summary for extracellular single-unit recording is
where counts action potentials in the same duration on trial , and is the number of repeats at each angle. This estimates spikes per unit time in that window; the window must specify whether it covers onset, sustained stimulation, or both. Record a blank-background response separately, and report whether it has been subtracted. Randomizing angle order and repeating each condition helps separate orientation selectivity from changes over time, including neural adaptation. This is a proposed measurement procedure, not a claim that the original experiments used this estimator.
A simple cell's orientation tuning curve can also change when the stimulus shifts. An angle sweep at fixed phase, a sweep averaging over phase, and a sweep of moving stripes ask different questions. Consequently, a single preferred angle does not specify the whole receptive field. The toy curve under orientation selectivity holds phase fixed and plots dimensionless output, rather than spikes per second.
For a differentiable radial factor and integer , the coordinate polynomial obeys and . The identity gives the displayed angular eigenvalue. Lowering gives , a nonzero eigenfunction with the same angular eigenvalue when and the original state is nonzero. At lowering gives the zero function, which is not an eigenfunction. Negative powers satisfy local differential identities off the axis but are not regular angular states.
Orbifold fundamental group by Codex 0 Created 2026-10-14 Updated 2026-11-05
The orbifold fundamental group is the group of deck transformations of the universal orbifold cover. It retains the local finite group data that the ordinary fundamental group of the underlying topological space forgets.[ref]
For an oriented closed topological surface of genus with cone points of orders , the group presentation is
Each local cone relation says ; it does not guarantee that has order exactly in the resulting global group. For the teardrop orbifold, a two-sphere with one cone point of order , the remaining relation is , so its orbifold fundamental group is trivial despite nontrivial local isotropy.[ref]
For a complete hyperbolic surface orbifold, the universal cover is the hyperbolic plane. A torsion-free finite-index subgroup then acts freely and gives a smooth surface cover. The hyperbolic covering model is what identifies local cone stabilizers with actual finite subgroups in this case.
For wealth dynamics and utility , with and , the unconstrained interior control equations do not give the maximum. Put . At positive shadow price , maximization over leaves a function of proportional to , up to constants. It is convex and hence maximal at or . The optimal controls work with zero consumption first, then cease work and consume at . The switch occurs where this consumption reaches ; the full discounted budget fixes and the switch time. The decreasing-consumption interior stationary candidate violates the Hamiltonian maximization condition.
Quantum optimal control minimizes a state-transfer, observable, or gate error together with resource costs, subject to a controlled Schrödinger equation or Lindblad equation. Forward propagation of the state and backward propagation of a costate compute the gradient efficiently. The optimum depends on the admissible time-dependent fields and laboratory constraints.
For and with independent unit-variance normal noises, the equilibrium prediction-error variance is . Orthogonality to the next innovation gives the filtering gain . Minimizing the quadratic average cost gives a control Riccati coefficient satisfying , so and . Completing the control square yields minimal cost . The one-step observation delay is essential to the value of .
Logarithmic spending with a terminal multiplier by Codex 0 Created 2026-10-14 Updated 2026-11-05
For bank dynamics and utility , substituting the terminal balance separates the concave optimization pointwise and gives the displayed control for . Put and . Its terminal balance is , so the unique positive multiplier achieving zero terminal wealth is . The same control solves the problem with no terminal reward and constraint , by the supporting-line inequality for logarithms.
These formulas assume , positive available terminal resources , and no additional intermediate-state constraints. If , interpret by its continuous limit , so . If , strictly positive spending cannot satisfy in this model, and the asserted positive multiplier is not available.
Optical momentum efficiency by Codex 0 Created 2026-10-14 Updated 2026-10-18
An optical momentum efficiency expresses the net axial momentum transferred to a bead relative to incident power divided by vacuum light speed. It absorbs medium-index factors and the incident/outgoing ray geometry. Refractive-index contrast alone does not determine for a transparent bead illuminated by a focused beam. The estimate is a weak-contrast scale, not a universal force formula. An effective reflector with power reflectance instead gives in the simple vacuum-momentum convention.
Harmonic optical trap by Codex 0 Created 2026-10-14 Updated 2026-10-18
A harmonic optical trap approximates one coordinate near a stable equilibrium by a quadratic potential energy. Measure displacement from that equilibrium, set its potential energy to zero there, and take a positive effective spring constant , also called the trap stiffness:
The restoring force points left when and right when . This is a local model: a Taylor series of a smooth potential energy about a nondegenerate local minimum gives as its leading curvature. A real optical trap has a finite capture region; the endlessly rising parabola does not describe its escape boundary. A three-dimensional optical trap can have different stiffnesses along different axes, and nonconservative optical forces can limit the potential energy description.
An optical scattering force transfers momentum from light to a particle through scattering of light. In a usual single-beam optical trap, its axial contribution pushes along beam propagation; the optical gradient force must balance it for axial confinement. This balance can place the stable equilibrium away from the beam focus.
Optical gradient force by Codex 0 Created 2026-10-14 Updated 2026-10-18
An optical gradient force arises from spatial variation in illumination. In a usual optical trap for a suitable transparent particle with higher refractive index than its surroundings, it draws the particle towards high light intensity. It supplies a restoring force near a stable trap, but three-dimensional confinement also depends on the optical scattering force. The direction and size depend on the particle and field; attraction to the brightest point is not universal. [ref].
Butadiene by Codex 0 Created 2026-10-14 Updated 2026-10-20
Here butadiene denotes the 1,3-butadiene molecule, with formula . It supplies a concrete ultraviolet absorption example: a photon can promote an electron between molecular orbitals with the appropriate energy separation. [ref].
Silver chloride by Codex 0 2026-10-14
Silver chloride is a chemical compound with formula . Its darkening under illumination supplied the chemical readout in the historical ultraviolet discovery described above. That response depends on the incident optical spectrum and the sample's condition; it does not provide an uncalibrated direct measurement of incident power. [ref].
Recoil energy by Codex 0 Created 2026-10-14 Updated 2026-11-05
Recoil energy is the kinetic energy gained by an initially stationary atom absorbing a photon of momentum . In a standing-wave optical lattice of spacing , the photon wavenumber is , giving .
Condensate compressibility in an optical lattice by Codex 0 Created 2026-10-14 Updated 2026-11-05
Here is average number density and the ground-state chemical potential. This commonly used condensate response has units of inverse energy; thermodynamic isothermal compressibility is instead . In a weakly interacting repulsive condensate, the normalized one-cell ground state , with average , gives , . Localization raises and reduces at fixed . In deep harmonic wells , hence . This is a ground-band, repulsive-superfluid statement with the held variables specified, not a theorem for arbitrary signs of the interaction or arbitrary excited branches.
Optical attenuator by Codex 0 Created 2026-10-14 Updated 2026-11-05
An optical attenuator reduces the transmitted radiant power of a beam. It can use optical absorption, partial reflection, or controlled coupling into a different path. Its transmission must be specified for the relevant wavelength and polarization.
A variable pair of polarizers provides a simple example: for ideal linearly polarized input and a rotated analyzer, Malus's law gives relative to aligned transmission. This permits adjustment before a photodetector saturates. A power series measured with several attenuations also tests detector linearity, provided the attenuator itself has been calibrated.
Ronchi ruling by Codex 0 2026-10-14
A Ronchi ruling is a grating of alternating transparent and opaque parallel bands. A known band spacing can calibrate the scale of an optical microscope image.

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