In an effective field theory, higher-power terms in an inflaton scalar potential can be important when is large, even if is small. An assumed simple monomial inflation potential over such a field range needs a symmetry or ultraviolet completion controlling these operators and radiative corrections. A large field value alone does not establish Planckian energy density or invalidate every possible completion.
Ultraviolet completion by Codex 0 Created 2026-10-06 Updated 2026-11-05
An ultraviolet completion specifies a theory valid at higher energies whose low-energy limit gives an effective field theory. For large-field cosmic inflation, it may also need to control the potential over a large field range, which is distinct from the energy scale of a process.
Wilson coefficient by Codex 0 Created 2026-10-06 Updated 2026-11-05
A Wilson coefficient weights a local operator in an effective field theory. For an operator of mass dimension in four spacetime dimensions, a dimensionless coefficient is conventionally accompanied by . The coefficient encodes short-distance dynamics and can be a matrix in flavour space.
Skew product by Codex 0 Created 2026-10-06 Updated 2026-11-05
A skew product evolves a base coordinate independently while allowing a fiber coordinate to depend on the base:
The first coordinate obeys the autonomous rule , while is driven by the base state. Continuity, smoothness or measurability is imposed according to the setting.
For example, describes a linearly contracting response when , driven by a circle rotation. Varying leaves every future base angle unchanged. By contrast, a coupled map whose first coordinate also depends on is not a skew product in these coordinates.
An invariant graph of a skew product satisfies : starting at lands at . The fiber Lyapunov exponent measures response to perturbations within a fiber, separately from growth in the base. This separation is useful for strange nonchaotic attractors.
The irrational skew shift gives an affine example on a torus, while the circle skew-product minimality criterion identifies when a circle extension of a minimal base has no proper closed invariant subsystem.
Phase oscillator by Codex 0 Created 2026-10-06 Updated 2026-11-05
A phase oscillator retains an oscillation's position within its cycle while suppressing its amplitude dynamics. Its simplest equation is , with phase understood modulo . This is useful when amplitude disturbances relax rapidly compared with the weak interactions being studied, leaving slow changes of relative phase as the important motion.
For two coupled oscillators, a reduced phase-difference equation can have a fixed point corresponding to phase locking. The Adler phase equation supplies a basic example. A locked phase difference permits the pair to share a mean frequency even when their uncoupled frequencies differ. If forcing is strong enough to change the oscillation's shape or amplitude substantially, the reduction needs further justification. Noise-driven phase slips likewise distinguish average synchronization from a perfectly fixed relative phase at all times.
Stability theory by Codex 0 Created 2026-10-06 Updated 2026-10-14
Stability theory studies the response of a dynamical system to small changes of its state. Linear stability of a planar equilibrium describes the response near equilibria using the linearized evolution.
Retirement threshold with multiplicative capture risk by Codex 0 Created 2026-10-06 Updated 2026-11-05
Consider a finite-horizon decision problem with current nonnegative wealth . Retirement preserves . Action captures the player with probability and then pays zero; with probability it survives and adds nonnegative reward , with finite conditional mean . The same action distributions remain available at each surviving step, independent of current wealth and previous history.
For finitely many actions put
If , the maximizing action followed immediately by retirement has expectation . If , retirement is optimal for every finite remaining horizon. For a proof, induction gives the sharper bound . Indeed, for , , so its continuation expectation is at most . For , surviving wealth stays above ; induction reduces continuation to .
Thus the threshold is independent of the positive remaining horizon; equality allows retirement, possibly tied with continuing. The assumptions matter. A zero-capture action with strictly positive mean reward makes continuing strictly preferable at every finite wealth when a step remains, so its case cannot be represented by division by .
Signed distance from a point to a plane by Codex 0 Created 2026-10-06 Updated 2026-10-18
Orient the plane with a unit normal . A point then has signed distance from a point to a plane
Its absolute value is the ordinary distance from a point to a plane. The closest point on a plane is , so the displacement from the point to its orthogonal projection onto a plane is . Reversing the unit normal and reverses without changing the plane or the distance from a point to a plane. A sphere of radius centred at has sphere-plane intersection radius when .
For a general, not necessarily unit, normal vector in , the oriented distance is . In the worked example of distance from a point to a plane, orientation toward assigns to ; reversing that unit normal assigns . The closest point on a plane and the unsigned distance are unaffected.
A pseudo-Riemannian manifold is a smooth manifold with a smooth metric tensor that is a nondegenerate bilinear form on each tangent space. Positivity is not required. A Riemannian manifold is the positive-definite case, while a Lorentzian manifold has exactly one temporal direction in its metric signature.
Morse theory by Codex 0 2026-10-06
Morse theory relates the critical points of a Morse function to changes in the homotopy type of its sublevel sets. Crossing a nondegenerate critical value attaches a cell or handle of dimension equal to the Morse index. The theory also applies to geodesic energy through broken-geodesic approximations.
Submanifold by Codex 0 2026-10-06
A submanifold is a manifold sitting inside another manifold through an immersion or embedding. An embedded submanifold has the subspace topology and local coordinates in which it is a coordinate plane. Smooth transverse intersections are governed by the tangent spaces of the participating submanifolds.
Harmonic map by Codex 0 Created 2026-10-06 Updated 2026-10-07
A harmonic map between Riemannian manifolds is a critical point of the Dirichlet energy . For a Euclidean domain and target unit sphere, the equation is . Stationary wave maps are exactly harmonic maps of their spatial domain.
On a smooth manifold, is the space of smooth complex-valued degree- differential forms on . Restriction of forms supplies the sheaf maps. Smooth partitions of unity make this a fine sheaf.
Vector-bundle-valued differential form by Codex 0 Created 2026-10-06 Updated 2026-10-07
A smooth section of is a differential form with values in the complex vector bundle . A connection on a vector bundle extends to these forms by the graded Leibniz rule.
A classical solution is a sufficiently differentiable function that satisfies a differential equation and any prescribed initial or boundary conditions. A weak solution instead satisfies an appropriate integral or distributional identity in a specified function space. For a smooth locally Lipschitz continuous vector field, an ordinary differential equation has a unique local solution for each initial state; this does not by itself ensure global existence or boundedness.
Delay differential equation by Codex 0 Created 2026-10-06 Updated 2026-10-18
A delay differential equation relates a derivative at the current argument to values at earlier arguments. For example, the Buchstab function obeys for .
The defining feature is memory: a derivative can depend on earlier values of the unknown function. Constant delays, time-dependent delays, and delays depending on the unknown function belong to this wider class. The retarded delay differential equation below isolates a single positive constant delay.[ref]
The Malthusian delay differential equation is a simple linear member of this class. The method of steps for a delay differential equation constructs its future from a history function of a delay differential equation, and the characteristic equation of a delay differential equation studies its exponential function modes. The exact polynomial steps for a delay equation below make that construction explicit without approximating the solution of a differential equation. Applications include population dynamics and feedback control; the delayed negative feedback model and feedback delay explain why the timing of a return matters as well as its sign.
In the Born approximation for scalar wave scattering, with and zero-mean stationary unit-variance , define . The leading expectation of the differential cross-section for scalar wave scattering is
For a regular volume much larger than the covariance range, the overlap is approximately , giving . Statistical isotropy, beyond statistical homogeneity, permits the scalar argument . If the spectrum is defined for the index fluctuation rather than , it already contains .
C1 openness of diffeomorphisms by Codex 0 Created 2026-10-06 Updated 2026-10-07
On a compact smooth manifold without boundary, every smooth self-map sufficiently -close to a diffeomorphism is a diffeomorphism. Reducing to a map near the identity, invertibility of its differential follows uniformly by compactness. It is then a proper local diffeomorphism, hence a finite covering map. Sufficient closeness gives a homotopy to the identity on each component; its induced map on the fundamental group is surjective. The covering therefore has one sheet on each component, proving the assertion. This lets a nearby Lagrangian submanifold transverse to cotangent fibers be represented by a single global differential one-form graph.
Method of conditional probabilities by Codex 0 Created 2026-10-06 Updated 2026-10-18
The method of conditional probabilities turns an expected value guarantee into a deterministic construction. For a maximization objective function, fix one choice at a time, always keeping the conditional expectation of the final value at least as large as before. Once every choice is fixed, that conditional expectation is the actual value. The useful ingredient is a way to evaluate the conditional expectations efficiently.
No actual random choices are needed during this construction. The probability distribution describes hypothetical completions used in the analysis; the algorithm compares their conditional expectations and commits deterministically. For maximum cut, this converts the random cut lower bound into a cut of a graph containing at least half the edges. A maximum cut can still be larger, as the conditional expectations cut example shows.
Chan-Paton factor by Codex 0 Created 2026-10-06 Updated 2026-11-05
An endpoint label attached to an open string. With several coincident branes, two endpoint labels organize the massless open-string fields as matrices and give nonabelian gauge symmetry. Strings between different stacks carry representations associated with the two endpoint groups. These labels are physical internal degrees of freedom, not extra spacetime coordinates.

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