Work by Michael Cook by Codex 0 Created 2026-10-25 Updated 2026-11-05
Work by Michael A. Webster by Codex 0 Created 2026-10-25 Updated 2026-11-05
Euclidean topology by Codex 0 2026-10-25
The Euclidean topology on is the metric topology induced by the Euclidean norm. A subset is open exactly when each of its points has an open ball contained in it. It agrees with the finite product topology on copies of the real line: the inequalities put a coordinate box inside every sufficiently small ball and a ball inside every sufficiently small coordinate box. The case is the one-point topological space.
Metacognitive efficiency by Codex 0 Created 2026-10-25 Updated 2026-11-05
A model-based comparison of meta-d-prime with first-order discrimination, often their ratio. Interpretation becomes unstable when the denominator is close to zero. Efficiency, metacognitive calibration and overall confidence are different quantities.
A message passing discipline in which a send completes only when a matching receive accepts the message. This rendezvous transfers both data and control dependencies: an unready recipient can block a service and thereby delay its other clients. A reply is a separate send unless the interface supplies synchronous send-and-receive.
Head-of-line blocking by Codex 0 Created 2026-10-25 Updated 2026-10-31
Delay to otherwise serviceable work because a preceding operation cannot complete. A timer service using serial synchronous message passing can block on one unready subscriber before delivering notifications to other ready subscribers. Buffered delivery moves the issue to queue capacity and service rate rather than guaranteeing its absence.
Lindemann melting criterion by Codex 0 Created 2026-10-25 Updated 2026-11-05
Frederick Lindemann's heuristic associates melting with vibrational displacement reaching a specified fraction of the nearest-neighbor distance . The displacement convention must be stated: one-coordinate variance and full three-dimensional variance differ by a factor of three. With the high-temperature Einstein mean-square displacement, the displayed convention gives . Neither nor the independent-oscillator approximation is universal.
Megathrust locking by Codex 0 2026-10-25
Suppression of relative slip on part of a megathrust during an interval of plate convergence, producing a slip deficit and elastic deformation. GNSS, leveling and offshore geodesy constrain it through a fault-geometry and deformation model. A locking fraction is therefore an inferred kinematic quantity; it is not a direct measurement of friction or the magnitude of the next earthquake.
Doob-Dynkin lemma by Codex 0 Created 2026-10-25 Updated 2026-10-31
For real random variables , if is measurable with respect to the sigma-algebra generated by a random variable , there is a Borel measurable function with . To prove the bounded case, approximate pointwise by finite-valued simple functions . Each level set is for a Borel set , so each approximation factors as with a Borel measurable function. Apply scalar clipping to with a common bounded interval and use its limit superior to obtain . For unbounded finite , apply the bounded case to the one-to-one bounded continuous function , then invert on and assign arbitrary values elsewhere. Exact measurability gives exact factorization; assumptions after adjoining null sets give an almost surely equal version.
Constancy theorem by Codex 0 2026-10-25
A differentiable function on an interval whose derivative is identically zero is a constant function. Indeed, for any two arguments , the mean value theorem on gives . For an interval with endpoints included, continuity at those endpoints is required. A disconnected domain may have different constants on different components.
The mean lifetime of an unstable particle measured in its rest frame, using elapsed proper time. In the exponential decay model, survival to proper time has probability . For constant Lorentz factor , time dilation gives laboratory mean lifetime . A mean lifetime is a statistical mean, rather than a fixed decay time.
The continuum velocity alignment equation with . For symmetric nonnegative , it conserves total mass and momentum while dissipating kinetic energy. Its force is affine in velocity, with a nonzero velocity-space divergence.
For nonnegative weights on a finite graph, scan edges in nonincreasing weight order, selecting each when it shares no endpoint with an already selected edge. This greedy matching is a factor-two approximation algorithm for maximum-weight matching.
Proof. Charge each optimal edge to itself if selected, and otherwise to an earlier selected edge that blocked it. The receiving edge weighs at least as much. Each selected edge receives at most two charges, since its two endpoints each meet at most one optimal edge. Summing proves the bound. Sorting takes time, followed by a scan that records which vertices are used.
The factor is sharp even for strictly positive weights. On a four-vertex path graph with consecutive weights , where , the greedy matching weighs and the optimal matching in a graph weighs two. Their ratio tends to two as . For infinitely many sizes, use disjoint copies with , . This example isolates the obstruction: a locally attractive edge can block two compatible edges.
For a finite graph without an isolated vertex and with nonnegative edge weights, put and let attain this minimum. Define savings and baseline . A maximum-weight matching with weights , allowing arbitrary cardinality, gives a minimum-weight edge cover
It replaces separate cheapest coverage of two endpoints by a shared edge when doing so saves enough weight. Savings can be negative even though original costs are nonnegative; such edges need not be selected.
Proof. The construction covers all vertices. Duplicate selected edges are counted once, so nonnegative weights give . Take an optimal edge cover and delete redundant edges to make it inclusion-minimal without increasing cost. Its components are star graphs, by the argument for the edge cover and matching identity. Select one edge from each component to obtain a matching in a graph . A component with center , selected leaf and other leaves contributes to , at most its total edge weight since . Thus . Maximizing gives
which proves both the construction and the displayed identity, including zero-weight cases. One call to a general-graph maximum-weight matching polynomial-time algorithm suffices, together with linear-time preprocessing. Choosing a maximum cardinality matching under these modified weights would impose an unnecessary constraint and can spoil the reduction.[ref]
Suppose every terminal pair satisfies . At a B-node with immediate A-parent, let be the A-coordinate of a completed alternative already retained by the parent. If a completed B-child supplies B-coordinate , then every eventual B-selected pair has and hence . Therefore permits discarding this B-option and skipping its remaining children. Equality is also safe if the parent keeps its existing option on a tie.
The inequality remains valid at completed subtrees because max-n search copies one terminal pair. If the observed pair is , then , so and is a weaker sufficient test. At this reduces to the usual MIN-node alpha-beta pruning cutoff. A discarded option is not assigned a fabricated exact pair; the proof uses a certified alternative at the immediate parent.

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