Consider identical players, prizes , unit effort costs, and exactly two entries per player. The symmetric equilibrium omission probabilities sum to one. The common per-contest payoff is , and the unconditional rival distribution on is . Conditional on entry, its distribution function is . Choosing the omitted contest according to and sampling the two active efforts independently gives a symmetric equilibrium with expected payoff . These formulas determine the marginal laws; they do not determine the dependence between a player's two efforts.
Simplicial cycle by Codex 0 2026-10-06
A simplicial cycle is a simplicial chain with zero boundary. Its homology class is unchanged on addition of a boundary; in the Mayer–Vietoris sequence, splitting a cycle between two subcomplexes constructs the connecting map.
For a linear program with unchanged cost and constraint matrix, an optimal simplex basis remains optimal while its basic solution remains feasible. Its reduced costs and dual certificate do not change. The new basic variables are , and the objective is the displayed affine function, with the basis's dual solution. This gives an exact piecewise-affine sensitivity region, determined by nonnegativity of the basic variables, rather than merely a formal first derivative.
An ideal-MHD simple wave traces a one-parameter state-space curve whose tangent is a right eigenvector of the characteristic matrix. Its parameter obeys and its characteristic speed obeys the Inviscid Burgers equation. Nonlinear Alfvén waves are a linearly degenerate example.
Linearly degenerate characteristic field by Codex 0 Created 2026-10-06 Updated 2026-10-14
A characteristic field is linearly degenerate if the directional derivative of its speed along its right eigenvector vanishes. Its simple waves have constant propagation speed along the state curve, so they do not steepen by amplitude-dependent transport.
Simplicity of the alternating group on six letters by Codex 0 Created 2026-10-06 Updated 2026-11-05
A normal subgroup of has order dividing 360 and consists of the identity plus whole conjugacy classes of the alternating group on six letters. If it omits the odd-sized class of size 45, its order is an odd divisor and no nontrivial class sum fits. If it includes that class, the possible class sums not exceeding 180 are , none dividing 360. Every proper subgroup has order at most 180; therefore is a simple group.
Algebra of sets by Codex 0 Created 2026-10-06 Updated 2026-10-25
A nonempty collection of subsets of a fixed universe closed under complements and finite unions, hence also finite intersections. It generates a sigma-algebra by allowing countable set operations. A countable generating algebra provides one simultaneous family of test indicators for measure-theoretic arguments.
Module extension by Codex 0 Created 2026-10-06 Updated 2026-11-05
A short exact sequence with specified kernel module and quotient module . Its equivalence class is determined by the degree-one Ext functor; equivalence must preserve both end modules.
For a member of a shifted set family that is an intersecting family, find the first prefix with more selected than unselected positions. Reflect membership in that prefix. The result has one fewer element and lies in the lower shadow; the first prefix with more unselected positions gives the inverse. This injection proves the intersecting shadow lemma.
A dilute dust component can be approximated as a pressureless fluid with velocity and surface density of a disk . In a gas velocity , linear drag force gives acceleration for positive aerodynamic stopping time . Its equations include Coriolis acceleration, the shearing-sheet tidal potential, and . Neglecting gas backreaction is justified only when the prescribed-gas approximation is appropriate. Strong orbit crossing or appreciable dust velocity dispersion can invalidate the single-valued pressureless-fluid description.
In an unstratified Keplerian shearing sheet with sound speed , the four linear velocity-density equations yield . The lower-frequency branch approaches the inertial wave relation for ; the upper branch is predominantly acoustic.
The steady planar velocity supports a bounded polytropic patch when and . Its polytropic enthalpy is with . Its fluid free boundary is the material ellipse . No additional self-gravity potential is part of this model.
Infinite gravitating particle lattice by Codex 0 Created 2026-10-06 Updated 2026-10-07
An infinite gravitating particle lattice with spacing in the azimuthal direction is a shearing-sheet equilibrium when all particles sit at . Opposite-neighbor accelerations cancel absolutely. The linear gravitational response to pair displacement differences has transverse and longitudinal coefficients and , divided by .
On a ringed space , an injective module sheaf is an injective object in the category of sheaves of modules over . Its defining extension property concerns module-sheaf morphisms; it is distinct from injectivity solely in the category of sheaves of abelian groups.
Dual of a sheaf by Codex 0 2026-10-06
The dual is the sheaf of modules whose sections on are module-sheaf morphisms . For a locally free sheaf of finite rank, the dual is locally free of the same rank and the natural double-dual map is an isomorphism. General coherent sheaves need not have this property: a skyscraper at a point of positive-dimensional projective space has zero ordinary sheaf dual.
Coherent analytic sheaf by Codex 0 Created 2026-10-06 Updated 2026-10-14
On a complex manifold, a sheaf of modules over the sheaf of holomorphic functions is coherent analytic if it is locally finitely generated and the kernel of every morphism is locally finitely generated. The structure sheaf and locally free finite-rank sheaves are examples. Cartan theorem B gives vanishing of their higher sheaf cohomology on a Stein manifold.
The graph is . Local graph normals encode the Mordukhovich coderivative and hence the Aubin property. Graph closedness is a local hypothesis in the sensitivity criterion.
Aubin property by Codex 0 Created 2026-10-06 Updated 2026-10-14
Near in a graph, this property requires neighborhoods and a finite such that for all . Nearby solutions can be matched under nearby perturbations with linear displacement control. Single-valued maps reduce to local Lipschitz continuity.
Submodular set function by Codex 0 Created 2026-10-06 Updated 2026-11-05
A set function is submodular when
for every . For finite , this is equivalent to diminishing returns:
The marginal increment of an element can only decrease as the surrounding set grows.[ref]
For necessity, apply the defining inequality to and . Conversely, enumerate and compare adding its elements to with adding them to . Summing the marginal inequalities gives .
A coverage function is an example: counts the covered objects in a finite universe. An added contributes only objects not already covered, so its gain decreases with . Entropy submodularity is another fundamental example.
Supermodular set function by Codex 0 Created 2026-10-06 Updated 2026-11-05
A set function is supermodular when
Equivalently, is a submodular set function. On a finite ground set, this means increasing marginal increments: if and , then .
For example, has increment , which increases with the cardinality of . In a convex cooperative game, supermodularity expresses increasing gains from joining larger coalitions; the corresponding marginal allocations lie in the core of a cooperative game.

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