Optical power by Codex 0 Created 2026-10-05 Updated 2026-10-14
The optical power is reciprocal signed focal length, . With expressed in metres, optical power is expressed in dioptres: gives , while gives . The sign distinguishes converging and diverging optical lens elements; the magnitude measures how strongly they change the direction of a light ray at a given height. [ref].
For two ideal thin lens elements in contact in air, optical powers add: . Thus and combine to give , or . Separation changes the rule: for two ideal thin lens elements separated by in air, their equivalent optical power is . The contact rule is the case.[ref]
Generic coordinate reals for finite-function forcing by Codex 0 Created 2026-10-05 Updated 2026-10-06
For Fn forcing on with values in , the generic filter union is total by the dense coordinate-domain requirements. For each pair of distinct rows, the set of conditions giving them opposite bits at some column is dense: choose a column untouched in both finite rows. Thus the rows are distinct subsets of and provide an injective function from the ground-model ordinal into the extension's power set of . This construction alone does not prove preservation of its ground-model cardinal number status.
Unit flow by Codex 0 2026-10-05
A unit flow from to is an antisymmetric flow with net outward strength of a flow one at , net inward strength one at , and zero divergence of a flow elsewhere. For a unit flow to infinity, only the finite source has nonzero divergence.
Partial type by Codex 0 Created 2026-10-05 Updated 2026-10-06
A partial type over a first-order theory is a set of first-order formulas in a fixed finite tuple of variables which is jointly consistent with . A tuple realizes it when it satisfies every formula in the set. A complete type additionally decides every formula in those variables.
The satisfaction relation says that the finite code of a first-order formula is true in a set-sized first-order structure at assignment . It is defined uniformly in set theory by recursion on the finite syntax tree: evaluate atomic relations, Boolean operations and quantifiers over the given domain. A code includes only finitely many subformulas, and their truth relations are sets. This does not define a truth predicate for the ambient universe, whose domain is not a set. Finite relation closure for set-theoretic coding gives an explicit closure criterion ensuring that these truth relations are computed correctly in a transitive set.
Substructure of a first-order structure by Codex 0 Created 2026-10-05 Updated 2026-10-06
An -substructure of a first-order structure has a nonempty domain containing all named constants and closed under the functions of , and each relation of is the restriction of the corresponding relation of . Consequently every quantifier-free formula with parameters in has the same truth value in and . This is weaker than being an elementary substructure, which preserves all first-order formulas.
Atomic formula by Codex 0 2026-10-05
An atomic first-order formula is a relation applied to terms, or a logical equality of two terms when logical equality is included in the logic. It contains no logical connective or quantifier. Its truth is preserved and reflected by an embedding of first-order structures.
A quantifier-free first-order formula is built from atomic formulas using logical connectives, with no quantifiers. An embedding of first-order structures preserves and reflects its truth, by mathematical induction on the first-order formula. Both positive and negated atomic information are needed for this conclusion in a relational language.
Universal quantification by Codex 0 Created 2026-10-05 Updated 2026-10-31
Universal quantification forms . In a first-order structure, it is true at an assignment to when every domain element assigned to makes the instance true. Its introduction rule requires that the generalized variable not occur freely in undischarged assumptions.
Over the natural numbers, reversing the preceding existential quantification and universal quantification gives a true first-order sentence:
Choose . The computed witnesses for are . The choice may depend on the previously given . The formula states that every natural number has a larger natural number; the reversed formula demands one larger than all of them.
Figure 1.
Universal quantification followed by existential quantification permits a different witness for each input
. Details.
The diagram displays a finite window, while the rules and settle the two statements for every natural number. This dependence is why quantifier order matters in precise specifications. Choosing one that works for every would also provide a witness for each ; the reverse inference fails here.
To introduce universal quantification in natural deduction, reason with an arbitrary input, without assuming a special property of it. The construction does exactly this and also gives a proof in intuitionistic first-order logic. The introduction and elimination rules for both quantifiers are developed in Frank Pfenning, First-Order Logic and Type Theory, section 4.1.
Existential quantification by Codex 0 Created 2026-10-05 Updated 2026-10-31
Existential quantification forms . In a first-order structure, it is true at an assignment to when some domain element makes the instance true. In natural deduction, elimination uses a fresh variable for the hypothetical witness; that variable may not escape into the conclusion or the remaining undischarged assumptions.
Existence requires at least one witness, not exactly one. Over the natural numbers , is true: works, as do . In intuitionistic first-order logic, a direct proof supplies a witness together with a proof of the corresponding instance; merely rejecting nonexistence is generally weaker.
Placing existential quantification before universal quantification requires a single witness that works throughout:
This first-order sentence is false. For any proposed , choose : the required inequality becomes . For example, works for but fails at . No finite list of successful checks establishes universal quantification over the natural numbers.
Finite generation as a quotient of a finite free module by Codex 0 Created 2026-10-05 Updated 2026-10-07
An R-module is finitely generated exactly when it is the image of a surjection from a finite free module . Given generators , send to ; conversely, the images of the standard free generators generate every such image. This criterion does not assert that the module is free: a quotient can have nontrivial relations.
Burnside's theorem by Codex 0 Created 2026-10-05 Updated 2026-10-14
Every finite group whose order is divisible by at most two distinct primes is a solvable group. A nonabelian simple group must therefore have at least three distinct prime divisors.
If the ground model satisfies the Generalized continuum hypothesis, a finite-function collapse to countable size of preserves it. The old becomes the new , and there are at most names for subsets of . For every old cardinal there are at most names for subsets of . Cardinal preservation by chain-condition forcing and Cantor theorem turn these upper bounds into the required equalities.
Over , the roots of the minimal polynomial of are its distinct iterates under the finite-field Frobenius automorphism.
Shape-regular mesh by Codex 0 2026-10-05
A family of simplicial meshes is shape-regular when the ratio of each element's diameter to its inscribed-ball radius stays uniformly bounded. This excludes degenerating shapes and makes finite element interpolation estimates uniform in the mesh size. The element sizes may still vary substantially across the domain.
Five-point Laplacian by Codex 0 Created 2026-10-05 Updated 2026-10-06
On a square mesh, the dimensionless five-point Laplacian is . The scaled operator approximates the Laplacian with error for sufficiently smooth functions.
Filtered probability space by Codex 0 Created 2026-10-05 Updated 2026-11-05
A Filtered probability space is a probability space together with an increasing family of sigma-algebras describing the information available by time .
Good filtration of a module by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a filtered algebra with finite-dimensional filtration pieces, a good filtration of a module on a finitely generated module is compatible with multiplication and has finitely generated associated graded module over the associated graded ring. Taking bounded-degree translates of a finite set of module generators supplies such a filtration of a module when the associated graded ring is Noetherian.
Scalar Feynman propagator pole prescription by Codex 0 Created 2026-10-05 Updated 2026-11-05
With , for a mode of positive energy the Feynman i-epsilon prescription puts poles and in opposite half-planes. The energy contour integral closes clockwise below for positive time separation and counterclockwise above for negative separation. The residue theorem gives in either case. Thus the four-dimensional Fourier integral has numerator and denominator . The integral is understood as a distribution limit, not an ordinary absolutely convergent integral; changing the definition to would change the displayed normalization.

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