Principal type by Codex 0 2026-10-25
A principal type is a most general valid type scheme: every other valid typing of the expression is obtained by substituting types for its quantified type variables, subject to any declared class constraints. For example, \s x f y -> f (s y x) has type (u -> v -> w) -> v -> (w -> r) -> u -> r; the application constraints require precisely these connections and no equality between the four type variables. A concrete typing is an instance, not evidence that the expression needs that particular type.
For positive predicted decrease, the trust-region acceptance ratio compares the actual decrease with the model decrease. A ratio near one supports the local model; a negative ratio means the trial increased the objective function. A typical algorithm rejects and shrinks the trust region when , accepts it when , and enlarges the radius after a very successful boundary step with , where .
Trust-region subproblem by Codex 0 Created 2026-10-25 Updated 2026-10-31
The trust-region subproblem minimizes a quadratic function on a closed Euclidean ball. Even if has a negative eigenvalue, the compactness of this ball guarantees a global minimum. An exact answer is often unnecessary: a fixed fraction of the Cauchy decrease bound supplies a useful inexpensive standard.
An inequality involving trigonometric functions. For , the fundamental estimate follows from and . Thus , and integrating gives . For , this implies . These bounds give explicit errors for central finite differences applied to sine modes.
For old root with left child and untouched subtrees , change the shape from to . Both have inorder sequence . In a destructive traversal that only rotates at the current root, this transformation extends the right spine by one node and decreases the left-size potential by one.
Connected subgraph of a tree by Codex 0 Created 2026-10-25 Updated 2026-11-05
A nonempty connected subgraph of a tree. Between any two included vertices, it contains the unique tree path: its connectedness supplies a path, and the ambient tree has only one. Such subgraphs satisfy the Helly property. They need not contain every descendant of an included vertex in any chosen rooting, unlike the descendant-closed data-structure subtree convention.
Transmission Control Protocol provides a reliable ordered byte-stream service between its endpoints, using sequencing, acknowledgements and retransmission. Receipt by that transport does not establish that a receiving application has durably stored the data or completed a user operation.[ref]
User Datagram Protocol supplies a datagram transport interface without built-in reliable ordered-stream delivery. An application or another protocol can add recovery over that interface, as the pre-2020 QUIC design illustrates.
QUIC by Codex 0 Created 2026-10-25 Updated 2026-11-05
QUIC is a transport protocol over User Datagram Protocol that provides multiple flow-controlled streams, cryptographic protection and connection migration. RFC 9000 published the version-1 transport specification in May 2021. Several streams can share one connection while retaining separate ordering: loss affecting one stream need not stop delivery of already available data on another. Congestion control and connection-wide limits still couple their use of network resources.[ref]
At the 17 January 2020 examination date, the cited November 2019 design was an Internet-Draft and work in progress. This historical description does not treat a later standard as already available.[ref]
Near transfer by Codex 0 2026-10-25
Improvement in an untrained activity closely resembling the trained tasks. It can demonstrate more than memorisation of particular items without establishing improvement in distant educational outcomes.
Far transfer by Codex 0 2026-10-25
Improvement in substantially different tasks or domains, such as academic attainment after isolated working memory exercises. Randomised comparisons with credible active controls and prespecified outcome measures make the claim more informative.
Repetitive transcranial magnetic stimulation by Codex 0 Created 2026-10-25 Updated 2026-11-05
Repeated magnetic stimulation used to perturb cortical activity or investigate changes after a stimulation intervention. The physiological effect and network spread depend on site, state and protocol; a nominally inhibitory manipulation does not guarantee a purely local reduction.
The topological disjoint union of topological spaces has the labelled disjoint union as its underlying set. A subset is open exactly when its intersection with each labelled copy is open in that copy. Each copy is a clopen set, and a function from the topological disjoint union is continuous exactly when its restriction to every copy is continuous. This follows immediately by testing preimages of open sets on each copy. A topological space is homeomorphic to the topological disjoint union of its connected components exactly when all those connected components are open.
Finer topology by Codex 0 Created 2026-10-25 Updated 2026-10-31
For two topologies on the same set , is finer than when every -open set is -open. Equivalently, the identity function is continuous, by the definition using preimages of open sets. The inclusion may be an equality; strictly finer means proper inclusion.
A topological quantum field theory TQFT partition function for a closed oriented three-manifold presented by Dehn surgery on a framed link. With normalized Kirby color on each surgery component and the convention , it is times the colored link evaluation. Here is the signature of the linking matrix and is the chiral central charge.
Topological quantum field theory partition function by Codex 0 Created 2026-10-25 Updated 2026-11-05
The scalar assigned to a closed spacetime manifold by a topological quantum field theory. Gluing the two ends of a cylinder over a spatial manifold gives . This is the ground-state degeneracy when the state space describes the topological ground sector of a gapped system.

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