Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Angular relation for two-photon electron-positron annihilation by
Codex 0 Created 2026-10-07 Updated 2026-10-14
When an electron of Lorentz factor annihilates with a stationary equal-mass positron, transverse four-momentum conservation makes the photons' transverse components opposite. Eliminating their positive frequencies gives the displayed relation for noncollinear photon angles to the incoming electron. The exactly collinear forward/backward configuration is physically allowed but makes the quotient ; its undivided cross-multiplied identity remains valid. The angle relation thus requires nondegeneracy or an appropriate limit, rather than an assertion that every allowed angle pair defines the quotient.
Let two set families on coordinates forbid cross-intersection size , and let be their density product. For , put , , and . Repeated forbidden-intersection density increments terminate when one endpoint of the forbidden interval reaches zero or the remaining dimension. In the first case, if steps widened the interval, the cross-intersection bound from cube separation gives . In the second case, at least steps occurred and at most widened, giving . For a single set family take the square of its density. Choosing proves for forbidden intersections and , with small dimensions handled directly.
A Cartesian theory uses a many-sorted first-order signature and sequents between Cartesian formulas. The fragment contains equality, atomic relations, truth, finite conjunction and existential quantification with provably unique witnesses. It has a Cartesian syntactic category with finite limits, whose finite-limit-preserving functors classify its internal models. Arbitrary existential quantification, disjunction and falsity are not added as finite-limit constructors.
Regular logic has atomic formulas and equality, truth, finite conjunction and unrestricted existential quantification. Its categorical semantics uses regular categories: conjunction is intersection and existential quantification is image. Disjunction and falsity are not added as formula constructors in the regular fragment.
The fragment uses finite conjunction, set-indexed disjunction and existential quantification, with equality and atomic relations. It is preserved under inverse image functors of geometric morphisms. The universal closure of an axiom is expressed by its variable context, not an unrestricted universal-quantifier constructor.
For independent regular first-class constraints in a -dimensional phase space, imposing the equations removes dimensions and quotienting independent gauge orbits removes another . Reducibility, singular strata or vanishing gauge directions can invalidate that elementary count. Closure of the constraint algebra is necessary but does not by itself establish regularity.
A numerical flux estimates the rate of transfer across a cell face from nearby states. In the finite volume method update, approximates the conservation law flux averaged over the time step; is the transferred amount. For a two-state numerical flux approximating a scalar conservation law with conservation law flux , consistency of a numerical method requires . Thus equal states recover the physical transfer rate. With constant equal-width cells, this also preserves a constant state because its incoming and outgoing numerical fluxes agree.[ref]
Riemann Problems and Jupyter Solutions by David I. Ketcheson, Randall J. LeVeque, and Mauricio J. del Razo. Approximate solvers, §Finite volume methods, consistency paragraph after equation FVupdate
Consistency and shared face flux cancellation answer different questions: matching at equal states approximates the intended equation, while sharing one oriented face value preserves the total. The example periodic upwind finite volume advection uses for , so the arriving state comes from the left. The Godunov numerical flux uses an entropy solution of a local Riemann problem; the Engquist-Osher flux provides a different construction for a scalar conservation law. A monotone conservative scheme uses a numerical flux nondecreasing in its left state and nonincreasing in its right state, together with a time step that makes the complete update monotone. Neither two-state consistency nor conservation by itself supplies that time-step restriction or a general stability or order of a numerical method guarantee.
A scalar finite-volume update is monotone if increasing any input state cannot decrease any output state. A consistent conservative update preserves constants and has an invariant interval by comparison. On a periodic grid, or an infinite grid with summable perturbations, conservation and monotonicity imply L1 contraction of a monotone conservative scheme. Translation invariance then implies the total variation diminishing scheme property.
Finite-field theorem for finitely generated integer algebras by
Codex 0 Created 2026-10-07 Updated 2026-11-05
A field that is a finite-type integer algebra has prime characteristic or zero. Prime characteristic and Zariski lemma make it a finite algebraic extension of a finite prime field. In characteristic zero, the same lemma makes it a number field; clearing finitely many coefficient denominators makes it integral over . The integral field extension forces the base domain to be a field, but a prime not dividing is not invertible there. This contradiction excludes characteristic zero.
Upper-unitriangular three-by-three matrices over the prime finite field form the finite analogue of the real Heisenberg group. In coordinates their multiplication is . The order is , and . For odd , every nonidentity element has order , but the group is nonabelian. For the exponent statement changes, so odd characteristic is essential for the nonisomorphic Gassmann equivalent regular subgroups construction.
For a finite Galois extension with group , there is such that the elements form a -basis. Equivalently the additive -module is a regular representation. Over p-adic fields, its p-adic lattices are thus commensurable with regular lattices; this is useful in Herbrand quotient calculations after applying a p-adic logarithm to deep principal units.
Trace of an integral element over a normal domain by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For a normal domain with fraction field , the field trace of an integral element in a finite separable field extension belongs to . Its conjugates are integral, so their sum is integral; it lies in and hence in by normality. This places the integral closure inside a trace-dual lattice.
A fiber bundle whose fibers are affine spaces and whose transition functions are affine. Differences of points in one fiber lie in a corresponding model vector bundle, but there need not be a preferred zero in each fiber.
A closed chain of Dirac propagators is a fermion loop. Its closed fermion loop sign distinguishes it from a bosonic loop. Tracing spinor indices produces gamma matrix traces, and the high-momentum powers of the propagators determine possible ultraviolet divergences.
A box diagram has a one-loop cycle of four propagator edges and four vertices connecting external legs. Its internal particle types depend on the theory. In a charged weak box contribution to kaon mixing, two charged weak-boson propagators connect two up-type quark lines, with flavor-changing charged-current vertices.
In a Dirac field mode expansion, the antiparticle contribution to first appears with operator order . Normal ordering changes it to using the fermionic anticommutation relations. Thus its scattering coefficient is . Pair-annihilation and creation terms have the operator orders and . Keeping these orders and a fixed external-state convention determines interference signs, especially between exchange and annihilation graphs in a Yukawa interaction.
Extreme points of a real continuous-function unit ball by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For compact Hausdorff , the extreme points of the real unit ball in the space of continuous functions on a compact space are precisely its continuous sign-valued functions. A point with permits a nonzero continuous bump perturbation supported where there is uniform slack, while pointwise equality at an endpoint of forces both functions in a midpoint decomposition to agree. For the Cantor set, clopen indicators give the perturbations directly.
A quadratic exponential sum has a polynomial phase of degree two. Its multiplicative derivative at lag has the linear phase up to a constant factor. This degree reduction lets the Van der Corput inequality for finite scalar sequences reduce its size to estimates for finite geometric series.
Known-state success dilution for exact amplitude amplification by
Codex 0 Created 2026-10-07 Updated 2026-10-25
For known good probability , choose . A known reversible preparation of one state with good probability permits ordinary amplitude amplification iterations to reach the good subspace exactly. With ancillary marking access, prepare a flag with one-probability and define joint success as good data and flag one. Reflection about the prepared product state is known, while the joint phase test requires a controlled marking oracle or a computed Boolean output. This changes the success projector and enlarges the state space; it does not evade the obstruction to uniform probability lowering by a unitary. Query costs of preparation, its inverse and marking must all be counted.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





