A linear Boolean function is a linear map from to . Here is the two-element finite field, whose addition is exclusive or. Every such function has a unique coefficient binary string and takes the form
The dot is the binary inner product. To prove the representation, expand in the standard basis and use linearity, obtaining ; thus . For example, gives . Adding a nonzero constant produces an affine map, not a linear map.
Predicate by Codex 0 2026-10-25
A Boolean function expressing whether its argument satisfies a property. Membership in a set is represented by its characteristic predicate. Returning a function lets a tree fold return a predicate that subsequently checks membership of a binary search tree.
Implicant by Codex 0 2026-10-25
A logical conjunction of literals is an implicant of a Boolean function if every Boolean valuation making true also makes true. Every term in a disjunctive normal form is an implicant of the represented Boolean function. To rule out a one-literal term, it suffices to find a false Boolean valuation of where that literal is true.
A Boolean function satisfying the displayed condition. Composition of one-preserving Boolean functions is one-preserving, since each inner output is one on an all-one input. Consequently structural induction shows that a variable-built propositional formula using only one-preserving logical connectives, such as , is true under the all-one Boolean valuation.
Karnaugh map by Codex 0 2026-10-25
A truth table arranged so neighbouring cells differ in one Boolean variable, using Gray code order along each multi-bit axis. Opposite edges are also adjacent. A valid group contains all combinations of varying variables while every other variable stays fixed; it eliminates those variables and gives an implicant; covering the one-cells yields a disjunctive normal form. The method is associated with Maurice Karnaugh.
Minority Boolean function by Codex 0 Created 2026-10-25 Updated 2026-10-31
For an odd number of input bits, this Boolean function is one exactly when fewer than half of the inputs are one. For three inputs, . Each term says that a specified pair of inputs is zero; at most one input can then be one. This proves both directions of the formula.
The convex hull of the six Pauli eigenstates in the Bloch ball. A mixture has a Bloch vector obeying the displayed inequality. Conversely, assign weights to the corresponding signed vertices and distribute the leftover weight over any opposite pair; this realizes every vector satisfying the inequality. Single-qubit Clifford gates permute its vertices, while a T gate can take a vertex to a pure state outside it.
In a planar potential flow, superpose a positive- uniform flow of speed and a line source of strength at the real point . Introduce an impermeable unit circular cylinder with zero circulation. The Milne-Thomson circle theorem gives the complex potential of a two-dimensional potential flow
The displayed horizontal force per unit length acts on the cylinder, and by reflection symmetry. To prove it, let be the complex velocity. At infinity, , so the sum of all finite residues of is . At the external pole , write ; then
The residue theorem and the counterclockwise Blasius force theorem give , proving the formula. With and , its sign changes at .
Black-Scholes reflection symmetry by Codex 0 Created 2026-10-25 Updated 2026-10-31
For the dividend-free Black-Scholes equation, the displayed transform preserves solutions when and . Put and . The equation becomes
Substitution shows that solves the same equation when : its first-derivative coefficient becomes , and the additional zeroth-order term vanishes. Subtracting the reflected solution enforces a zero boundary value at . Its use in a killed barrier option is restricted to the alive side of the barrier; the algebraic extension to the other side is generally not a valid price.
For , , put and let be the quantile of the standard normal distribution. Inverting the approximate score test retains precisely the parameters satisfying
Multiplication and collection of terms gives the quadratic inequality
Its two roots are the displayed endpoints. The Wilson score interval stays within and remains nontrivial when or , unlike the unmodified Wald confidence interval. Its coverage probability is approximate and varies with ; it is not a uniformly exact 95% guarantee. Separate pointwise intervals for several groups are not a simultaneous confidence statement. The method is named after Edwin Bidwell Wilson.[ref]
For rejection sampling with acceptance probability , , the accepted count in trials has binomial distribution, mean and variance . To obtain at least acceptances with approximate probability , use the standard normal distribution quantile . The central limit theorem without continuity correction gives . Solving this quadratic inequality in gives the displayed threshold, rounded upward. It exceeds the average stopping cost because it allows for fluctuations in the accepted count. For , the count is deterministic and exactly. Exact coverage uses the binomial distribution tail rather than the approximation.
Write column of a two-row binary game as , with the row player's payoff first. If there is no pure Nash equilibrium, the column player's maximum payoff in each row must be one. Otherwise every column would be a best response in a zero-payoff row, and excluding an equilibrium there would force the opposite row to dominate in every column, giving an equilibrium in that opposite row.
A column maximizing the column player's top-row payoff must then have , or its top cell would be an equilibrium. Its bottom column-player payoff must be zero, or its bottom cell would be one. Thus a column occurs. The same argument for the bottom row produces . No column can give the column player payoffs , since a row-player best response within that column would be a pure equilibrium.
Consequently, if neither pure equilibrium is found, mix equally over the two rows and equally over those two special columns. The row player's two expected payoffs are ; every column gives the column player at most , and the supported columns achieve . This is a Nash equilibrium. Computing the two row maxima, scanning for pure equilibria and locating the two special columns takes running time for columns.
Binary fraction by Codex 0 2026-10-25
A base-two positional fraction with a binary point separating nonnegative and negative powers of two. For example, . A finite expansion is a dyadic rational: with fractional places, its value is an integer divided by . Conversely, any nonnegative reduced fraction whose denominator is a power of two has a finite binary expansion. Leading integer zeroes and trailing fractional zeroes do not change its value.
For a deterministic length- channel code with messages on a binary erasure channel of erasure probability , exclude the message decoded from the all-erased output. Under a uniform choice of the other messages, success probability is at least . Conditional on an erasure pattern with unerased positions, there are at most output words, so average success is at most . With no unerased positions it is zero.
Put . The scalar bound is immediate for . Otherwise set . Since for ,
The inequality follows because equality holds at and the derivative of is for . Averaging the scalar bound over the number of unerased positions, with , proves the displayed claim. Thus implies code rate . The cases satisfy this rate bound directly.
Deterministic decoding is essential to this version: on an always-erased channel, a randomized uniform guess has maximal decoding error probability despite receiving no information. The usual deterministic channel decoder has maximal error one when on that channel.
With channel feedback, resend each message bit through a binary erasure channel until a non-erased copy arrives, then move to the next bit. The channel decoder deletes erasure symbols, giving the message without error whenever transmission completes. For , the waiting times have an independent and identically distributed geometric distribution with expectation , so every finite message completes almost surely. The strong law of large numbers gives forward code rate , matching channel capacity. At , transmission never completes. Independent erasure indicators, rather than independent message bits, are the essential hypothesis.
For a fixed wall at and a wall rotating at at , the quasi-steady Stokes approximation with the no-slip boundary condition gives
Indeed the biharmonic equation for is ; the angular basis is . The four wall conditions are , . The outward radial volume flux per unit width is , precisely the negative rate of increase of wedge area. The associated local pressure is . Its logarithmic singularity is integrable, although the ideal hinge requires a microscopic regularization.
Limited-memory BFGS by Codex 0 Created 2026-10-25 Updated 2026-10-31
Limited-memory BFGS is a quasi-Newton method that applies an inverse-Hessian matrix approximation without storing a dense square matrix. It retains only a fixed number of recent secant pairs and . The standard two-loop recursion computes the search direction using storage and arithmetic in dimension .
With a positive-definite initial metric and safeguarded curvature updates, the step is , with chosen by a line search. It is useful when full-memory BFGS would require too much storage. Fixed-memory convergence results typically give linear convergence under strong convexity, bounded metric and suitable line search assumptions; one must not automatically transfer the full-memory superlinear theorem. In a nonconvex problem, a local method does not by itself certify a global minimum.[ref]
For two polynomials over the complex numbers of equal positive degree of a polynomial with no common root of a polynomial, there are unique polynomials of degree of a polynomial less than such that . To prove the bound, let be the vector space of polynomials of degree of a polynomial at most , including the zero polynomial. The linear map from to has zero kernel of a linear map: if , each root of a polynomial of , counted with its multiplicity of a root, must occur in because it does not occur in , forcing by the degree of a polynomial bound, and then . Both vector spaces have dimension , so the rank-nullity theorem makes the linear map a bijection, and has a unique preimage.
For an independent statistical sample from the beta distribution with parameters , , the probability density function is on . Its raw moments are for , by direct integration. Consequently the method of moments gives , whereas the maximum-likelihood estimator is .
The second formula follows by setting the score function to zero; its derivative is negative. Also has an exponential distribution of rate , since . The central limit theorem and delta method give
Thus the asymptotic relative efficiency of relative to is . The transformed sum has a gamma distribution of shape and rate , which also gives for and for .

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