Topics (349k) Articles (361k) Users (424) Discussions (237) Comments (383) Files (12k) New article
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.
For , write when there is such that whenever . For an infinite regular cardinal, suprema of fewer than ordinals below remain below it, permitting the long chain under eventual domination construction.
An Euler circuit, also called an Euler tour, is an Eulerian trail whose final vertex equals its initial vertex. Its length is . It can revisit other vertices, unlike a Hamiltonian cycle, which visits each vertex once before returning to the start. For a finite undirected multigraph with at least one edge, an Euler circuit exists exactly when the edge support of a graph is a connected graph and every vertex degree is even.
For example, let be distinct parallel edges joining , let be a self-loop at , and add an isolated vertex . Then , and is an Euler tour. The self-loop supplies one traversal and two incidences; need not be visited. Replacing by a single edge changes both vertex degrees to odd numbers and removes the possibility of an Euler circuit. Thus collapsing parallel edges can change the answer.
Two triangles in a graph sharing one vertex give another instructive Euler circuit: . The shared vertex has vertex degree four, the others have vertex degree two, and is revisited between the two closed trails. This is precisely the splice used by Hierholzer's algorithm.
An instanton is a localized finite-action classical solution in Euclidean spacetime, used in a semiclassical description of quantum tunnelling and other nonperturbative effects. In one-dimensional quantum mechanics it can connect distinct degenerate potential minima over infinite Euclidean time. A quartic double-well instanton is an elementary example; a Yang-Mills instanton is a gauge-field example with different geometric structure.
Tetracode length-isospectral lattice construction by
Codex 0 Created 2026-10-07 Updated 2026-10-14
For the skew matrix , both Euclidean lattices reduce to the tetracode modulo . A reflection depending on the reduction coset matches their vectors coordinatewise in absolute value. Their weighted length spectra agree for all positive diagonal axis weights. Rationally independent weights force any possible linear isometry to be a coordinate sign change; the code then forces an overall sign, which does not identify the two lattices.
For independent clusters with mean vector and positive definite working covariance matrix , a generalized estimating equation solvesCorrect mean specification and regularity can give a consistent estimator of identifiable mean coefficients despite a misspecified working covariance. A sandwich covariance matrix accounts for actual cluster variation. Mean equations alone cannot identify two parameters that always enter through the same combination.
For a nonzero elliptic function with period lattice , its zeros of a function and poles , repeated with their multiplicities, have equal total number and satisfy . Choose a fundamental parallelogram avoiding all zeros and poles on its boundary. The argument principle applied to gives equality of the numbers. Applying the residue theorem to gives their difference of sums. Pairing opposite edges, the extra factors are the two lattice generators multiplied by integrals of along an edge. These integrals are integer multiples of , because the endpoints have the same nonzero function value. Thus the difference of sums is a lattice element. This links zeros of a pulled-back line to the chord-and-tangent group law.
A power object represents parameterized subobjects of : . In an elementary topos, it is , with the membership subobject supplied by evaluation at the subobject classifier.
A logical functor between elementary toposes preserves finite limits, exponential objects and the subobject classifier, with their canonical comparison maps. It therefore preserves power objects and the double-power-object monad. If it has a left adjoint, power-object monadicity and the adjoint lifting theorem for monad algebra functors give it a right adjoint as well.
A Boolean topos is an elementary topos in which every subobject has a complement, equivalently its internal truth-value Heyting algebra satisfies excluded middle. Its internal first-order logic is classical. Being Boolean alone does not imply that it has enough set-valued points.
A noninitial object is irreducible, or supercompact, when every family of subobjects with union the whole object contains the whole object as one member. This concerns unions of subobjects rather than disjoint coproduct decompositions. Irreducible representable sheaves for the regular coverage follow from the one-arrow nature of that coverage.
For the elastic filament operator , two integration by parts operations give boundary form . Four elementary homogeneous choices at each endpoint are (clamped), (hinged), (free), and (slope-constrained and transverse-force-free). Each defines a self-adjoint operator on a finite interval when imposed at both ends. More general real Robin boundary conditions also give self-adjointness; the four choices are not an exhaustive classification of all boundary subspaces.
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





