Subgame perfect equilibrium by Codex 0 Created 2026-10-06 Updated 2026-11-05
A subgame perfect equilibrium is a strategy profile inducing a Nash equilibrium in every subgame, including subgames not reached during equilibrium play. A proper subgame starts at a node that forms a singleton information set, includes all its descendants, and does not cut any other information set; one cannot treat indistinguishable nodes as separate games.
The requirement excludes noncredible threats. Suppose an entrant chooses Out, giving both players , or Enter. After Enter, an incumbent chooses Fight with payoffs or Accommodate with payoffs , with entrant payoff first. Out together with a prescribed Fight is a Nash equilibrium: the threat deters entry and the incumbent's off-path action does not change its realized payoff. It is not a subgame perfect equilibrium, because after entry the incumbent prefers to . The subgame-perfect outcome is Enter followed by Accommodate.
In finite perfect-information games, backward induction in games constructs such profiles. More generally, continuation subgames may require solving simultaneous-move games in mixed strategies, as in an all-pay contest. Node-by-node optimization cannot ignore information sets in games of imperfect information.
Normal-form game by Codex 0 2026-10-06
A normal-form game specifies each player's strategy set and their payoff for every strategy profile. In a finite two-player game these data form a bimatrix game; if the two payoffs always sum to zero, one payoff matrix describes the matrix game. The representation specifies choices and incentives, without a temporal order of observed moves.
Two strategies are payoff-equivalent for a player when they give that player the same payoff against every strategy of the opponents. If every player's payoff is also unchanged, replacing one by the other preserves the game outcomes entirely. This is distinct from weakly dominated strategies, whose definition requires a strict comparison somewhere.
Cooperative game theory by Codex 0 Created 2026-10-06 Updated 2026-10-07
Cooperative game theory studies what groups of players can achieve together and how their joint value can be allocated. A transferable utility game assigns a real value to each coalition. The core of a cooperative game asks which allocations no coalition can improve upon; the Shapley value averages marginal contributions across player orderings.
Absolute Galois group by Codex 0 Created 2026-10-06 Updated 2026-11-05
The absolute Galois group of a field is . It is a profinite group, the inverse limit of the Galois groups of finite Galois extensions. Its continuous actions on discrete modules are the coefficients for Galois cohomology.
Radical extension by Codex 0 2026-10-06
In the strict tower convention, a radical extension is a field obtained through finitely many adjunctions , . Some texts instead use the term for any subfield of such a tower. This distinction matters: solvability by radicals implies containment in a tower, and need not give a radical tower entirely inside the original field.
Solvable field extension by Codex 0 Created 2026-10-06 Updated 2026-11-05
A finite separable extension is solvable when its normal closure has a solvable group as Galois group. In characteristic zero it is contained in a radical tower after adjoining suitable roots of unity; containment need not mean it is itself a tower of radical adjunctions.
Galactic disk by Codex 0 Created 2026-10-06 Updated 2026-11-05
A galactic disk is a flattened stellar or gaseous component of a galaxy, commonly supported mainly by ordered rotation. Its radial mass profile determines its galaxy rotation curve; thickness, truncation and external forces also matter. A galactic disk need not be an exponential galactic disk, and its neutral-gas absorption radius need not equal a stellar scale length.
Operator algebra by Codex 0 Created 2026-10-06 Updated 2026-10-14
An operator algebra is an algebra of linear operators, with multiplication given by composition. In quantum examples it can be generated by creation and annihilation operators subject to the canonical commutation relations or canonical anticommutation relations. Its analytic realization requires specifying a common domain for unbounded operators.
Open matter-dominated Friedmann solution by Codex 0 Created 2026-10-06 Updated 2026-10-14
A negatively curved universe with pressureless matter and no dark energy expands forever. With and , its scale factor is and its cosmic time is . The parameter is conformal time scaled by and measured from the Big Bang.
Flat matter-coasting-fluid Friedmann solution by Codex 0 Created 2026-10-06 Updated 2026-10-14
A flat universe with separately conserved pressureless matter and a coasting fluid satisfies . For both densities positive, choosing the Big Bang at zero conformal time gives , with . Physical time follows by integrating . The hyperbolic parametrization is formally like the open dust solution, but the spatial geometry here is flat.
Radiation-matter scale factor in conformal time by Codex 0 Created 2026-10-06 Updated 2026-10-14
In a flat universe containing separately conserved radiation in cosmology and pressureless matter, the Friedmann equation becomes in conformal time. Setting at gives the stated quadratic-plus-linear scale factor. The linear term controls radiation domination and the quadratic term controls matter domination. The formula presumes , and no cosmological constant.
If and for , then its Fourier transform is times continuously differentiable and the displayed formula holds. The dominated convergence theorem permits each derivative under the integral. Thus vanishing moments give a zero Taylor polynomial through degree at the origin. Unweighted membership only guarantees a continuous function as the Fourier transform.
Fourier space by Codex 0 2026-10-06
Fourier space labels a field by the frequency or wavevector variables of its Fourier transform, rather than by its original coordinates. Spatial gradients act by multiplication by , and the negative Laplacian acts by .
Sinc function by Codex 0 Created 2026-10-06 Updated 2026-10-31
The unnormalized sinc function is , extended by value one at zero. The normalized sinc function is , with the same removable value. These arise, with convention-dependent scaling, as inverse Fourier transforms of frequency-interval indicator functions, so they describe ideal low-pass filters and the Shannon scaling function.
Fourier sine transform by Codex 0 Created 2026-10-06 Updated 2026-10-20
The Fourier sine transform is a half-line transform adapted to a homogeneous Dirichlet boundary condition. With the displayed normalization, inversion is . It is equivalent to the Fourier transform of an odd extension. If and boundary terms vanish, two integrations by parts give the transform of as .
The Fourier transform with negative exponential and inverse factor is a continuous isomorphism of the Schwartz space. Weighted frequency derivatives are transforms of derivatives of weighted input functions, so their suprema are controlled by finitely many Schwartz seminorms. Fourier inversion gives , where . Transposition gives a continuous isomorphism on tempered distributions as well.
With the convention, a right-supported decaying function has a transform analytic in the upper half-plane and a left-supported one in the lower half-plane. Incident modes continued with small imaginary frequency can have poles outside the initial convergence strip; these poles must be tracked separately from outgoing scattered waves.
Bandlimited function by Codex 0 Created 2026-10-06 Updated 2026-11-05
A bandlimited function has its Fourier transform supported in a bounded frequency region. For with support of contained in , the transform is bounded and hence integrable. Fourier inversion supplies the bounded continuous representative
The same formula for complex defines an entire function: derivatives can pass under the finite-interval integral, uniformly on compact subsets. It obeys .
For , the exact scaling law is
Thus has bandwidth , while the stretched function has bandwidth . This fixes the otherwise ambiguous phrase that time and bandwidth scale inversely. Products add frequency-support intervals through the convolution theorem.
Band limitation differs from compact spatial support. A nonzero entire representative cannot vanish on an open real interval by the identity theorem. Consequently a nonzero integrable bandlimited function cannot also have compact support. This matters when interpreting a sharply started signal or a wave-packet front.
Complex spectral Fourier transform by Codex 0 Created 2026-10-06 Updated 2026-11-05
A complex spectral Fourier transform parametrizes the two-dimensional Fourier transform by complex coordinates. Put , and
Since , the real frequency vector is . Its Jacobian is four, giving
Both constants follow from the declared angular-frequency convention.
For smooth compactly supported , a specified Cauchy-kernel solution of is
The identity verifies the equation in the distribution sense. Its local singularity is integrable. Differentiation in cancels and yields
This is the link with a spectral dbar equation. It uses the displayed normalized Cauchy transform solution; the spatial differential equation alone leaves homogeneous solutions and does not force this spectral derivative for an arbitrary choice of .

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