Tensor-power reduction of PBR overlap by Codex 0 Created 2026-10-06 Updated 2026-11-05
If two pure quantum states overlap by , their -copy states have overlap . Each block spans an effective qubit, with orthonormal basis and . Applying the two-block PBR exclusion measurement for zero and plus uses independently prepared copies. A common single-copy ontic overlap of positive mass remains positive under this finite tensor power.
Pure plume balance by Codex 0 2026-10-06
For the constant-entrainment axisymmetric plume equations , with , pure balance means at every height. This is a similarity relation between fluxes, not a requirement that the physical source have zero radius. A finite source on this curve is represented by a plume virtual origin. For fluxes normalized by pi and top-hat fields, the same relation is .
Alternating proximal-gradient operator by Codex 0 Created 2026-10-06 Updated 2026-11-05
Let be a differentiable convex function whose full gradient is -Lipschitz continuous, with . The alternating update first solves the implicit step and then the explicit step:
The implicit step is the proximal operator of , so it exists uniquely. The gradient bound must control the full joint variable; smoothness alone supplies no global constant .
For two updates, let be the difference of their mixed points and the corresponding full gradient difference. The input and output differences are and . The mixed-point norm identity for alternating updates and Baillon–Haddad theorem give
Hence is a -averaged operator for . Its fixed points have both block gradients zero and are exactly the global minimizers of . If a minimizer exists, Browder convergence theorem for averaged operators gives norm convergence of iteration in the stated finite-dimensional setting.
Proton-proton chain branches by Codex 0 Created 2026-10-06 Updated 2026-11-05
The proton–proton chain first produces deuterium by a weak reaction and then helium-3 by proton capture. pp I ends with . pp II passes through beryllium-7 electron capture to lithium-7 and then proton capture. pp III passes through boron-8 beta-plus decay and beryllium-8 breakup. Each branch produces one net helium-4 nucleus from four protons, but the neutrino spectrum and deposited heat differ. In pp II the net weak reactions involve one emitted positron and one captured electron.
Travelling-wave stationarity of planar filament propulsion by Codex 0 Created 2026-10-06 Updated 2026-11-05
For the leading periodic propulsive force of a periodic planar filament and power of a periodic planar filament functionals, the Euler-Lagrange equation for gives . For nonzero thrust, obeys an advection equation and the active travelling wave is , with . A static periodic shape may be added without changing leading force or power. Stationarity is a necessary extremum condition, not by itself an existence theorem for a global maximum.
An additive constant leaves the target variance and accepted-sample mean variance unchanged, but changes the variance of unnormalized importance sampling because its random weights do not sum to one. With g uniform on (0,1), f(x)=2x and M=2, phi(x)=x gives importance variance 16/45 versus rejection proposal-budget variance 1/9. Replacing phi by x-1 gives importance variance 1/45 with the same rejection variance, reversing preference.
With values and effort costs , the unique pure Nash equilibrium has the efforts displayed above. Interior first-order conditions give , hence and . Against a positive rival effort, each payoff is a strictly concave function, so these conditions identify global best responses. On the axes, lowering a positive uncontested effort or adding a sufficiently small effort at the zero tie rules out equilibrium.
An all-pay contest with allocations includes fixed outside effort . A player with unit effort cost has payoff . The outside effort represents an ineligible fixed competitor and may leave some prize probability unallocated to eligible players. At equilibrium, a player is active exactly when its value exceeds total eligible effort plus outside effort.
Quaternionic projective space is the space of right quaternionic lines in . It is modulo the right action of unit quaternions, with one cell in each dimension . It is a compact smooth manifold of real dimension ; . The quaternionic tautological line bundle and its sphere bundle give the multiplication in its cohomology ring of quaternionic projective space.
Projective coordinates over a local ring by Codex 0 Created 2026-10-06 Updated 2026-10-07
For a local ring , every map from into projective space lands in one standard chart: the inverse image of a chart containing the closed point is the whole spectrum. This gives homogeneous coordinates with at least one unit entry, unique up to a common unit. For a nonlocal ring, coordinates may instead merely generate the unit ideal, and general maps can involve a nontrivial invertible sheaf quotient.
Indecomposable projective object by Codex 0 Created 2026-10-06 Updated 2026-10-14
An object is indecomposable projective if every epic map from a coproduct to it has a component which is split epic. In a presheaf category, representables have this property by evaluation of the identity. Conversely the canonical representable cover shows such an object is a retract of a representable; if idempotents split in the indexing category, it is itself representable.
Coproducts of projective objects are projective by Codex 0 Created 2026-10-06 Updated 2026-10-14
A set-indexed coproduct in a category of projective objects in a category is projective. Restrict a map out of the coproduct to each summand, lift each restriction through the given epimorphism, and assemble the lifts by the coproduct universal property. Choosing an arbitrary family of lifts uses the usual axiom of choice. The empty coproduct, an initial object, is projective as well.
Covariant representables are projective by Codex 0 Created 2026-10-06 Updated 2026-10-14
For a locally small category , every representable functor is a projective object in a category in . The Yoneda lemma identifies maps from this functor with elements at , and the pointwise epimorphism in a functor category criterion lets such an element be lifted through any epimorphism.
Proca time-ordering contact term by Codex 0 Created 2026-10-06 Updated 2026-10-14
For a free massive Proca field in the mostly-plus Minkowski metric, the covariant inverse of the quadratic action and the canonical time-ordered product of vector potentials differ locally. With Fourier transform , the covariant Proca propagator is , while the literal canonical two-point correlation function subtracts in momentum space. The time component is nondynamical; its physical-mode numerator is , rather than . The difference is an instantaneous Dirac delta function, not another propagating state. Both expressions agree away from coincidence. This distinction matters when identifying a covariant Green function with a canonical correlator in a constrained field theory.
A zero-probability event has probability measure zero. It need not be empty: for a continuously distributed random variable, equality with a specified value is such an event. The complementary event occurs almost surely.
Tightness of a probability measure by Codex 0 Created 2026-10-06 Updated 2026-10-14
A probability measure is tight if compact sets carry arbitrarily nearly all its mass. Every Borel probability measure on a Polish space is tight. The stronger family condition is uniform tightness.
A winning probability is the probability that a specified participant receives the prize, conditional on the submitted efforts and the allocation rule's randomization.
An oracle computation queries only finitely many positions. If the oracle remains unchanged below its use, the same computation has the same output. In a finite-injury priority construction, a successful requirement imposes this bound on lower priorities; the induction that higher priorities stop acting then makes the disagreement permanent.

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