Fix with nonempty subdifferential for a convex function . If and , monotonicity of a convex subdifferential gives for any fixed . Hence
The Cauchy-Schwarz inequality proves the bound uniformly for . If has an -Lipschitz gradient, this makes the remainder in the proximal gradient mapping descent bound at most . Thus the big O notation is justified despite the dependence of the proximal gradient mapping on .
Target: convex-optimization.bigb, under Coordinate descent.
Minterm by Codex 0 2026-10-25
A conjunction containing each of a specified finite collection of Boolean variables exactly once, either positively or negated. It is satisfied by exactly one Boolean valuation of those variables. The minterms for all valuations are mutually exclusive and collectively exhaustive, so they can encode an arbitrary finite table of values.
A propositional substitution maps each atomic propositional variable to a propositional formula and extends recursively through every logical connective. Replacements are simultaneous: a variable appearing inside a replacement formula is not replaced again in the same substitution step. Since propositional logic has no variable-binding quantifiers, this operation has no variable-capture problem.
Every propositional formula generated by a parenthesized grammar has equally many opening and closing parentheses. By structural induction, atomic formulas begin with equal zero counts; negation preserves them; and a parenthesized binary logical connective adds its two subformula counts and one parenthesis of each kind. An optional paired-parenthesis construction also adds one to both counts. This necessary syntactic invariant is useful for checking generated expressions, though equal counts alone do not guarantee correctly nested syntax.
Subformula by Codex 0 2026-10-25
A subformula is a constituent propositional formula in a formula's recursive construction, including the whole formula itself. For an atomic variable the only subformula is itself; for , add to the subformulas of ; for a binary connective, add the combined formula to the union of the two operands' subformulas. The set of distinct subformulas can have smaller cardinality than the number of occurrences in the abstract syntax tree when the same expression appears more than once.
A Lorentz transformation with determinant that preserves future-directed timelike four-vectors. Equivalently, it belongs to the identity component of the Lorentz group. For the Minkowski metric , its matrix satisfies and . Such transformations preserve the future light cone, so the retarded Green function of the d'Alembert operator transforms as a Lorentz scalar.
Projective frame by Codex 0 Created 2026-10-25 Updated 2026-11-05
An ordered projective frame consists of projective points such that any representative vectors are linearly independent. After mapping the first points to the coordinate axes, the last point has every coordinate nonzero; rescaling those axes sends it to . This proves existence and uniqueness of the projective transformation carrying one ordered frame to another. In the projective plane a frame consists of four points, no three collinear.
Let and . They generate the dihedral group of a square, realized by . Its image in the projective linear group has four elements, since opposite matrices become equal. The projective classes of commute because , and each squares to the identity. Sending to gives the Klein four-group. This is an example in which a nontrivial scalar commutator disappears after passing to a projective representation.
A nonzero bipartite pure state is a product state if and only if all its partial inner products on the first subsystem lie in a common one-dimensional vector subspace of the second. For a product , every contraction equals . Conversely, contract against each vector of an orthonormal basis to write . If for a common nonzero , then . Zero conditional vectors are allowed. A nontrivial linear dependence relation requires multipliers not both zero; allowing both multipliers to vanish would give no test at all.
Suppose are identically distributed independent random variables with , , and not constant almost surely. For each , strict concavity of gives
The moment is finite because on . Let . Independence and Markov's inequality give
The series of the latter probabilities is finite. The First Borel-Cantelli lemma, applied for the countable choices , proves almost surely. This proof requires neither existence nor integrability of .
Although this nonnegative martingale has at every time, its terminal expected value is zero. It is therefore not uniformly integrable. The contrast is useful: bounded expected values ensure almost sure convergence here, but do not allow preservation of the expected value through the limit.
In mostly-plus signature, the unitary gauge limit leaves the longitudinal Proca propagator term . Its ultraviolet scaling is constant in the momentum magnitude, whereas finite gives scaling. Thus taking the gauge-parameter limit before the ultraviolet limit obscures ordinary power-counting renormalizability. A conserved external current annihilates the longitudinal term, so the exchange between two such currents still falls as . The issue does not make a free massive-vector Gaussian integral inconsistent.
A probability mass function obtained by summing a joint probability mass function over the unretained coordinates. Nonnegative summands ensure that iterated sums are well defined.
Base rate by Codex 0 2026-10-25
A class prevalence applicable before considering the current case-specific evidence. Under random sampling from the relevant reference population, it sets the prior class probability used in Bayes' theorem.
For a continuous even function on , the Cauchy principal value
defines a distribution of order of a distribution at most one. For test functions supported in , the absolute value is at most , since the numerator is bounded by . When , the expression equals the absolutely convergent ordinary integral .
It is a regular distribution exactly when for some . Necessity follows by testing away from zero: any representing locally integrable function must equal almost everywhere off zero. Sufficiency follows from absolute convergence. Continuity with alone does not suffice: near zero gives the divergent integral .
Target: L1-normalized dilation of a distribution. Parent: Dilation of a distribution. Intended file: distribution-theory.bigb.
A PPA pattern characterised by effortful or agrammatic language, often with apraxia of speech. Motor speech and syntactic comprehension should be measured separately; neither is established merely by slow output.
A PPA pattern prominently affecting word and conceptual meaning. Failure to understand a sentence can arise from missing word knowledge even if some grammatical operations remain available.
A PPA pattern involving word-finding pauses and impaired repetition, with phonological-memory limitations often important. Sentence length and syntactic complexity should be varied independently when testing comprehension.
When a vacuum vessel's window shatters, a nearly atmospheric initial pressure difference gives inward pressure force on frontal area . Dividing by the glass mass estimates its initial collective acceleration. An ideal atmospheric pressure-work budget for vessel volume would give a collective kinetic energy estimate if assigned entirely to the fragments. This is a model-dependent energy budget, not a universal bound on every fragment's speed: air motion, fragmentation, pressure equalization and wall impacts alter the transfer, and unequal sharing can accelerate a small fragment faster than the collective estimate.
The equal normal stresses in the two directions perpendicular to the local magnetic field for a gyrotropic phase-space distribution function. The factor one half averages the two perpendicular velocity components. With first adiabatic invariant , the integrand is .
The normal stress along the local magnetic field, evaluated using the random parallel velocity. At zero equilibrium mean flow, its linear perturbation is obtained from together with the perturbation of the velocity-space measure.

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