For quantum witness embedding , verifier unitary and accepting projector , the witness acceptance operator is the positive contraction . The maximum acceptance over normalized quantum witnesses is by the Rayleigh quotient. Restricting to basis quantum witnesses only tests its diagonal entries and need not find that maximum.
Flagged purification of a quantum ensemble by Codex 0 Created 2026-10-06 Updated 2026-10-14
For , choose component purifications and an orthonormal flag register. The vector is normalized and reduces to after tracing out and the flag. Orthogonal labels remove the cross terms. This construction turns mixture identities into pure-state overlap arguments and proves joint concavity of quantum fidelity.
Strict dominance by Codex 0 2026-10-06
A strategy is strictly dominated when another strategy gives a strictly larger payoff against every opposing strategy. A strictly dominated strategy cannot receive positive probability in a Nash equilibrium, because moving that probability to its dominator increases expected payoff.
Fractional-power root expansion by Codex 0 Created 2026-10-06 Updated 2026-10-14
An algebraic root can depend on a parameter through fractional powers even when the polynomial coefficients have ordinary power series. For example, the roots of are on the scale . Dominant balance for algebraic roots identifies the exponent, and local expansion of the scaled root supplies successive coefficients.
Ricci-flat manifold by Codex 0 Created 2026-10-06 Updated 2026-10-14
A Ricci-flat manifold has vanishing Ricci tensor. This is weaker than vanishing Riemann curvature tensor: the latter describes complete local flatness. A Kerr black hole supplies a Lorentzian manifold that is Ricci flat in its vacuum region but has nonzero Riemann curvature tensor.
For a real Hilbert space, , and , identify with its vector by the Riesz representation theorem. Completing the square in shifts the input to . Substitute and multiply by to obtain the displayed formula, valid also for negative . If and , the answer is ; if , the objective is identically infinite and no proper proximal problem remains.
On a Banach space one can define the set of minimizers of , but existence and uniqueness need additional geometry or coercivity hypotheses. The optimality condition is , with the duality mapping . The Hilbert completion-of-square shift by a dual vector does not generalize unchanged. On with and , every with is a minimizer; the vector is not one.
The proximal map of sends to , with zero assigned at . This removes vectors inside the radius- ball and shortens all larger vectors by a fixed radial distance. It is useful for groupwise sparsity.
Deduction theorem for propositional logic by Codex 0 Created 2026-10-06 Updated 2026-10-07
An implication is derivable from a theory precisely when its conclusion is derivable after adjoining its antecedent. Together with classical contradiction rules, this identifies failure to prove a proposition with consistency after adjoining its negation.
Proper acceleration for one-dimensional motion by Codex 0 Created 2026-10-06 Updated 2026-10-18
For motion on a fixed axis, the signed spatial four-acceleration in the instantaneous rest inertial frame is . Its magnitude is the scalar proper acceleration. Constant signed from rest gives and the hyperbolic motion worldline .
Projective presentation by Codex 0 Created 2026-10-06 Updated 2026-11-05
A projective presentation of a module is an exact sequence
with projective modules. The first map need not be injective. Its image is , so it also yields a short exact sequence ; this kernel need not itself be a projective module.
For example, over , multiplication by two gives a projective presentation . The kernel of the final quotient map has two elements and is isomorphic to . It is not a projective module: a splitting of would have to lift the element of order two to an odd residue, but every odd residue has additive order four. Continuing by resolving successive kernels gives a projective resolution.
Standard projective resolution of a quiver representation by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a finite quiver over a field , set , , . There is an exact sequence
where in the source and target summands, and the augmentation is . Each is a summand of , so the two terms are projective modules. This also works for infinite-dimensional modules.
Equatorial qubit measurement by Codex 0 Created 2026-10-06 Updated 2026-10-14
The orthonormal quantum states , , define an equatorial projective measurement. The measured observable is , with eigenvalue . Thus measures , and measures with these outcome labels. The sign convention matters when comparing different definitions of equatorial bases.
Möbius group by Codex 0 Created 2026-10-06 Updated 2026-11-05
The Möbius group is the group of all Möbius transformations of the Riemann sphere, under function composition. An invertible complex matrix represents , and nonzero scalar multiples represent the same transformation. Rescaling a representative to determinant one gives a surjective group homomorphism with kernel of a group homomorphism . Thus it is also the projective linear group and the quotient .
Uniformly diagonalize against the formula expressing membership in to obtain a sentence saying that its own code is not in . If every enumerated sentence is true, this new sentence cannot be enumerated, and hence is true. Its code is a computable new element of arithmetic truth outside .
For finite sets of nonzero real numbers, the multiplicative energy is the number of quadruples satisfying . Swapping shows that it also counts quadruples with . Thus , where counts product representations. The Cauchy-Schwarz inequality yields .
First-order two-local Hamiltonian simulation by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a sum of Hermitian two-local terms of norm below one, repeat a first-order Lie-Trotter product formula step times. The first-order unitary product-formula error bound gives total error at most for . Taking uses arbitrary two-qubit gates. At unit time and this is a sufficient bound; additional commutation structure can improve it.
Almost sure event by Codex 0 Created 2026-10-06 Updated 2026-10-14
An almost sure event is a measurable event of probability one. Countable intersections of such events still have probability one, allowing a conclusion to hold simultaneously for countably many parameter choices. Further deterministic reasoning may then extend it to uncountably many parameters, as in Brownian Hölder regularity or nowhere monotonicity of Brownian motion. An uncountable intersection need not preserve probability one without such additional reasoning.
Lyapunov moment inequality by Codex 0 Created 2026-10-06 Updated 2026-10-14
The Lyapunov moment inequality says that higher positive absolute moments give no smaller absolute moment sizes on a probability space. For a real random variable and ,
allowing an infinite value. For the left expression is an Lp norm; below one it is a quasi-norm, so the usual triangle inequality terminology needs that distinction. The comparison uses a probability measure of total mass one; arbitrary unnormalized measure spaces need a factor depending on their total mass.
For a nonnegative count, the first moment size is its expected value, while the second is the square root of its second moment. Both ten-trial counts in second moment method have first moment size one. The independent count has second moment size , whereas the shared-outcome count has second moment size . The second moment distinguishes models with the same average because its square increases the influence of rare large counts.
More generally, for with a Bernoulli random variable of parameter ,
It rises from one at toward ten as . Replacing by a parameter gives , which decreases toward zero for a fixed positive exponent when , making the rare-event and large-exponent limits different questions. For a scaled Rademacher random variable taking values and two with equal probabilities, every absolute moment size is exactly two: increasing the exponent does not distinguish signs when the absolute value is constant.
Figure 1.
Lyapunov moment inequality reveals how higher moments emphasize large outcomes and when equality holds
. Left: the two original ten-trial models from second moment method have the same mean one, but different absolute moment sizes at exponents above one. The shared model has with . Right: equal masses at and two keep almost surely, giving equality for every pair of positive exponents. These are fully specified mathematical probability models. Details.
For finite , apply the reversed Jensen's inequality to the strictly concave function and the nonnegative random variable :
Taking the positive th root proves the claim. Equality in this finite case holds exactly when is constant almost surely. If the higher moment is infinite, the upper bound is infinite and remains valid. Exponent zero is excluded from the statement; logarithmic or geometric limiting summaries require separately stated conventions, especially when can vanish.
Nonarithmetic distribution by Codex 0 Created 2026-10-06 Updated 2026-11-05
A probability distribution is nonarithmetic when it is not concentrated on for any . Every law with a probability density is nonarithmetic. This hypothesis removes lattice oscillations from the key renewal theorem.

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