Ghost decoupling in strict axial gauge by Codex 0 Created 2026-10-25 Updated 2026-11-05
The Faddeev-Popov operator for is . Its interaction contains and vanishes on the strict gauge slice. Equivalently, its ghost-gluon vertex is proportional to and the axial-gauge propagator obeys . The residual determinant is field independent; its zero modes and singularities still require a compatible axial-gauge pole prescription. Faddeev-Popov ghost decoupling does not mean that the free Faddeev-Popov ghost two-point function is zero.
A single-photon detector based on a reverse-biased photodiode operated above its breakdown voltage. A carrier generated by photon absorption can trigger a self-sustaining impact ionization avalanche. Quenching lowers the bias to stop that avalanche; recovery creates detector dead time. Random internally generated carriers can also trigger indistinguishable pulses, producing dark counts. Single-photon avalanche diodes ordinarily detect an event rather than resolve the incident photon number. [ref]
A point atom is a point whose singleton is a measurable set with strictly positive measure. That singleton is an atom of a measure. This is more specific than a general atom of a measure, which is defined as a positive-measure set that cannot be divided into two measurable sets of positive measure.
For a probability measure on the Borel sigma-algebra of , a point atom at appears as a jump of its cumulative distribution function:
Continuity of probability applied to intervals approaching proves this identity. Keeping such jumps is essential when deciding whether an endpoint belongs to an integration region.
Maintain a counter equal to the number of positive count-array entries. Increment it only when an addition changes zero to one; decrement it only when a removal changes one to zero. Other count changes leave the support unchanged. Initialization at zero and these cases prove the representation invariant by induction over completed operations, giving a constant-time distinct-size query.
Work by Arne Lervåg by Codex 0 Created 2026-10-25 Updated 2026-11-05
Let an Archimedean spiral have polar radius and angle in polar coordinates, with , where is fixed. Parameterizing by gives the arc length
The bounds yield
The squeeze theorem proves the displayed limit. Thus the arc length grows like as the turns become closely spaced, without requiring an explicit antiderivative.
AC-3 by Codex 0 2026-10-25
An arc consistency algorithm maintaining a work list of directed constrained variable pairs. Revising deletes each value of with no compatible value in . If shrinks, incoming arcs are reconsidered; the just-used neighbor need not be included, since deleted values had no support in and hence supported no surviving value there. Initially empty constraint domains are rejected before processing.
Each deletion preserves every complete solution: a solution using the removed value would supply its missing support. Therefore an empty constraint domain certifies impossibility. Successful termination establishes arc consistency but need not establish satisfiability. A triangle of two-valued inequality constraints supplies a counterexample: all values have pairwise support, but no assignment can satisfy all three inequalities.
For variables, constrained pairs and maximum constraint domain size , assume constant-time compatibility tests for combined pair relations. A revision costs , and each shrinking source constraint domain can cause at most rounds of reconsideration of its incoming arcs. Thus there are revisions and time complexity . Fixed , including two-valued constraint domains, gives linear time in .
The greatest componentwise subdomains of given finite initial constraint domains satisfying every directed arc consistency condition, allowing empty subdomains. Repeated sound revisions to a fixed point produce this same closure regardless of revision order, provided every affected arc is eventually reconsidered.
For the proof, fix subdomains of the initial satisfying arc consistency. If all current contain , every value in has a support in , so revising preserves . Mathematical induction shows that every revision preserves every such family . At termination the current domains themselves satisfy arc consistency, so they are the greatest such family. Algorithms that stop immediately on the first empty constraint domain need not finish computing the closure, but correctly establish that no complete solution exists.
Compute an arc-consistency closure by revising every directed constrained pair in complete sweeps until one sweep deletes nothing. The first sweep is unconditional. With variables, maximum constraint domain size , and constrained pairs, at most deletions permit at most sweeps. At per revision plus per emptiness scan, a direct time complexity bound is . AC-3 uses a work list to avoid scanning unrelated arcs after each local change.
Anyon fusion tree by Codex 0 2026-10-25
A basis diagram recording an order for successively combining anyon charges, with every edge labeled by its intermediate charge and every vertex by a permitted anyon fusion rule. Changes of parentheses are implemented by anyon F-matrices.
Anyon R-matrix by Codex 0 2026-10-25
The unitary operator implementing a chosen positive exchange of adjacent anyons in total charge . In a multiplicity-free theory it is a scalar. An inverse crossing uses its inverse. Two positive exchanges give the anyon monodromy .
Antifermion by Codex 0 Created 2026-10-25 Updated 2026-11-05
The antiparticle of a fermion. In a Dirac field, its external wavefunctions are the negative-frequency spinors, while its physical energy is positive. Fermion-number arrows on Feynman diagrams run opposite an antifermion's physical momentum.
A neighboring parallel pair in an antiferromagnetic Ising ring. It costs relative to a satisfied antiparallel pair. If there are such pairs, the energy is , and the periodic boundary conditions force to be even because . Thus an odd ring has ground states, obtained by locating one such pair and choosing one overall Ising spin orientation. The even ring has two ground states with no such pair. This definition uses the local preferred ordering; a parallel pair is a defect in staggered order rather than a wall between uniformly magnetized domains.
The exact zero-field two-point correlation function in the finite canonical ensemble of an antiferromagnetic Ising ring. The spin-chain transfer matrix has eigenvalues and . In their eigenbasis, an Ising spin insertion exchanges the two eigenvectors. The trace with two insertions is therefore , while the partition function is , proving the formula. Its two terms retain both paths around the ring. It has and . At fixed and finite positive inverse temperature its thermodynamic limit is .
An odd periodic nearest-neighbour Ising model with antiferromagnetic coupling has unavoidable geometrical frustration. For parallel bonds, , while forces to be even. Thus odd requires at least one parallel bond. A ground state has exactly one, with possible locations and two global spin inversion symmetry choices, proving the displayed ground-state degeneracy and ground-state energy. The zero-temperature canonical ensemble distributes that defect uniformly. A directed arc of bonds contains it with probability , giving two-point correlation function . The finite antiferromagnetic Ising-ring correlation gives the corresponding positive-temperature result.
Trace anomaly by Codex 0 2026-10-25
A trace anomaly is a quantum contribution to the trace of a stress-energy tensor which was traceless on shell in the classical theory. Running renormalized couplings can supply such a contribution through their beta functions; curvature-dependent contributions can occur as well. Classical stress-energy tensor improvement alone does not remove quantum scale dependence.

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