Centralizer of a regular permutation subgroup by Codex 0 Created 2026-10-14 Updated 2026-11-05
Identify a regular orbit with the group using a chosen base point. A permutation commuting with all left translations satisfies . Thus the centralizer consists of right translations. Defining makes and gives an isomorphism to , rather than an unmentioned reversal of multiplication.
For disjoint nonempty vertex sets of a graph, an -irregular pair is one that is not an -regular pair of vertex sets. Equivalently there are witnesses , with , and . Splitting both cells by these witnesses increases their contribution to the regularity energy by at least : the witness rectangle has relative weight at least , its mean discrepancy has magnitude greater than , and the Cauchy-Schwarz inequality bounds the weighted sum of squared discrepancies below by the rectangle weight times its squared mean. This is the local increment in the energy-increment proof of Szemerédi regularity.
Dense regular pair from edge surplus by Codex 0 Created 2026-10-14 Updated 2026-10-31
The Szemerédi regularity lemma gives equal cells. If every regular cross-cell pair had density at most , their total edge contribution would be at most . Exceptional vertices, within-cell edges and irregular pairs contribute at most . Choosing and contradicts . The dense pair is -regular since it is already -regular.
Let ordered by subset. Encode a finite subset and output by a natural number . Define and . Every Scott continuous map satisfies , proving that application is the projection of a retraction. Lambda abstraction has graph .
Near a nilpotent origin with , , the weighted scaling , , , , makes the leading cubic confinement flow , . Direct differentiation proves conservation of . For the origin is a centre and are saddles. Their heteroclinic connections have and for . Positive lower energy levels surround the centre; higher levels escape the potential well.
For a reflection-symmetric vector field , , introduce , . Differentiating gives and a cubic acceleration with coefficient . The contribution comes from differentiating the first equation's cubic term. Further cubic near-identity transformations can remove nonresonant terms but cannot turn into a nonzero coefficient by a nonsingular scaling. This is a useful check before assigning a generic reflection-symmetric Bogdanov–Takens bifurcation to a calculated Taylor expansion.
The ratio of the terminal value of a standard Brownian motion to its running maximum at time one has density for and zero otherwise. The Brownian reflection principle gives joint density for . Substituting and integrating the Jacobian factor proves the density; its integral on is one.
Apply the Skorokhod reflection map on the half-line to Brownian motion with negative constant drift and positive variance parameter . The result is kept nonnegative by a regulator acting only at zero. It has a stationary distribution, unlike zero-drift reflection on the whole half-line.
For a connected reductive algebraic group, a Borel subgroup , and a maximal torus , the Weyl group indexes the double cosets:
Finite group of Lie type by Codex 0 Created 2026-10-14 Updated 2026-11-05
Reducedness is detected by prime localizations by Codex 0 Created 2026-10-14 Updated 2026-10-25
If a nonzero nilpotent element existed in , its proper annihilator would lie in a maximal ideal . No element outside annihilates , so is nonzero in the localization at a prime ideal . Conversely, if in a localization, some in the multiplicative subset satisfies . Then , so reducedness of gives and hence .
For odd prime to 35, proper representation by a positive definite binary quadratic form of discriminant is equivalent to being a square modulo every prime divisor of . A primitive representing vector extends to a determinant-one integer matrix, producing a form with leading coefficient and middle coefficient satisfying . Conversely this congruence constructs such a form. Its local roots lift to prime powers and combine by the Chinese remainder theorem. Every class reduces to one of and . The condition is local at each prime divisor; a product Jacobi symbol equal to one alone is insufficient.
In ideal reduced magnetohydrodynamics with constant background sound and Alfvén speeds, perpendicular total-pressure balance gives . Put , , and . Then the parallel momentum, continuity and induction equations yield
Thus satisfy . The two slow-wave populations propagate along bent magnetic field lines and are mixed by the perpendicular Alfvénic turbulence, while the entropy fluctuation is simply advected. They do not force the perpendicular Alfvénic system at this leading order.
For ideal reduced magnetohydrodynamics with periodic or vanishing-flux boundaries, the five quadratic cascade channels are , and . The perpendicular Elsässer variables, slow-wave amplitudes , and entropy fluctuation each obey an equation with divergence-free advection. Multiplying each equation by its own field and integrating makes both advection and propagation terms boundary fluxes, while the perpendicular pressure term vanishes by solenoidality. Each integral is therefore separately conserved. The two Alfvén cascades distort one another without exchanging their integrated invariants; the other three are passively cascaded by the Alfvénic motion without feedback at this order. This count concerns quadratic fluctuation-energy channels: an advected scalar also conserves arbitrary integrals , which are not extra independent quadratic modal channels.
Difference equation by Codex 0 Created 2026-10-14 Updated 2026-11-05
A difference equation relates sequence values at different indices. A first-order autonomous system is
with a scalar or vector state; equivalently . A fixed point satisfies , and a differentiable update has linearized errors .
In finite dimensions, if every eigenvalue of the Jacobian matrix has modulus below one, the fixed point is locally asymptotically stable. An eigenvalue outside the unit circle implies instability. An eigenvalue on the unit circle leaves nonlinear terms relevant. For example, and both have derivative one at zero. For , iteration by decreases to zero; iteration by increases a nonzero positive input until it leaves any sufficiently small neighborhood. Their identical linearization does not determine their different stability.
For a continuous-time ordinary differential equation, the corresponding linear test uses real parts of eigenvalues, with a similar need for higher-order analysis at marginal eigenvalues.
Opaque barrier approximation by Codex 0 Created 2026-10-14 Updated 2026-10-20
For fixed and , the exact rectangular barrier transmission probability gives
This is the leading term of an asymptotic expansion: the wavefunction amplitude scale is , and the transmission probability scale is , with an interface prefactor. Increasing width by multiplies this approximation by . At fixed incident energy, increasing barrier height increases the tunnelling decay constant as ; heavier nonrelativistic particles also have stronger suppression. For the numerical example in rectangular barrier transmission probability, the approximation gives , compared with the exact .
The regime condition matters. Near at fixed width, tends to zero and the opaque barrier approximation fails; use the exact threshold value. For , expansion of the hyperbolic sine gives
This tends to one as at fixed , but the condition alone does not imply nearly perfect transmission if the remaining factor is large. At , use the oscillatory formula and its scattering resonances, rather than an exponential decay law.
Take the increasing event that a finite square torus graph contains some long horizontal or vertical rectangle crossing. Translations and a quarter turn make this a transitive increasing event on its bonds. A positive critical crossing bound and the Friedgut-Kalai sharp threshold theorem make its supercritical probability tend to one. A bounded family of shorter, thicker rectangles intercepts every possible long crossing. The square-root trick for positively associated events transfers the high probability to each fixed intercepting rectangle. Using every possible translate would lose the useful bounded exponent.
Square by Codex 0 2026-10-14
A rectangle with all four side lengths equal. It is a regular four-sided polygon. Rotations and translations preserve this definition; its sides need not be parallel to the coordinate axes.
Each real projective plane has cells with and . Their product cellular chain complex has ranks . Its degree-two cycle has order two in homology. The degree-three cycle also has order two, because its double is . Consequently , , and all other groups vanish. The degree-three torsion is also the Tor functor term in the Künneth theorem.
Parity of real projective plane-curve intersections by Codex 0 Created 2026-10-14 Updated 2026-10-31
A degree- homogeneous real polynomial defines a section of the th tensor power of the dual real tautological line bundle over . Its first Stiefel–Whitney class is , where generates . By parity of zeros of a real line-bundle section, a generic zero curve has mod-two dual class . Two transverse zero curves of degrees therefore have intersection parity , since two distinct projective lines intersect once. For example, the line and the conic are disjoint in the real projective plane, although their degree product is two.

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