Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
In a one-factor diffusion market, the market price of risk is the excess drift per unit spot volatility. It is the coefficient in the Brownian motion part of a local martingale deflator, .
In a one-factor market with the usual natural Brownian filtration, assume nonzero traded diffusion exposure and a strictly positive local martingale deflator , normalized by . Let be a terminal contingent claim with . DefineThe Brownian martingale representation theorem, with localization when needed, represents the true conditional-expectation martingale as a stochastic integral. Solving the exposure equation against the nonzero traded diffusion constructs a self-financing portfolio with wealth and terminal value . The dollar portfolio from a deflated wealth martingale gives this calculation explicitly.
For any competing nonnegative-wealth self-financing portfolio, the deflated wealth is a nonnegative local martingale, hence a supermartingale. Its initial capital is therefore at least , and the constructed strategy attains that cost. Without normalization, the cost is . Boundedness of alone does not replace the required deflated-payoff integrability in an arbitrary model.
A strict local martingale is a local martingale that is not a true martingale. The reciprocal of a three-dimensional Bessel process is an example: it is a nonnegative continuous local martingale whose expectation decreases strictly.
Integrable discrete-time local martingale is a martingale by
Codex 0 Created 2026-10-05 Updated 2026-10-06
An integrable discrete-time local martingale is a true martingale. Its stopped increments have the form , and the dominated convergence theorem removes a localizing sequence from the conditional increment identity.
For a finite extension of number fields and a nonzero prime ideal of , the primes of above correspond to the orbits ofAn embedding determines a prime by pulling back the local absolute value on a field. Embeddings with the same prime extend to embeddings of the same completion and are conjugate. If , these orbits are the irreducible factors of its minimal polynomial over .
Local prime decomposition of T5 plus 6T3 plus 252T2 plus 126 by
Codex 0 Created 2026-10-05 Updated 2026-11-05
This polynomial is Eisenstein at . Over , its Newton polygon has a single slope , so it is irreducible and a root generates a totally ramified extension of degree five. Over , its factor degrees are : the simple residue roots lift, and the remaining roots have valuation . Thus the degree-five number field generated by a root has one prime above and three above .
For a continuous map of closed connected oriented -dimensional manifolds, suppose is finite. ThenBy excision, the degree- relative homology group is the direct sum of the local groups at . The fundamental class maps to the tuple of local orientation generators. Mapping this tuple to adds their local degrees. Naturality identifies the result with the image of . If the fiber is empty, the same argument gives degree zero.
A massive vector in spacetime dimensions has polarizations perpendicular to its timelike momentum. A massless vector has transverse polarizations modulo its null longitudinal polarization, leaving physical degrees of freedom.
Little group with mixed string boundary conditions by
Codex 0 Created 2026-10-05 Updated 2026-10-06
The symmetry used to classify an open string must preserve its endpoint boundary background as well as its momentum. A Neumann-Dirichlet open-string boundary condition breaks target Lorentz transformations mixing ND and common directions with Neumann boundary conditions. For a D1–D25 pair with 24 ND directions, the common worldvolume has Lorentz group , whose connected massive little group is trivial. The transverse remains as an internal rotation group. Thus a massive 24-component oscillator multiplet is not an vector of the full 26-dimensional massive little group; a vector of that full group would have 25 components.
For independent unbiased estimators of a common mean with known positive variances , the linear unbiased estimator with smallest variance has weights and variance . Unbiasedness requires . Minimizing by a Lagrange multiplier gives the weights, and the strictly positive diagonal Hessian matrix proves a unique global minimum. This conclusion requires no normality assumption.
A best linear unbiased estimator minimizes covariance among linear estimators unbiased for the same target. In , assume , is a full-column-rank design matrix and the known covariance matrix is a positive-definite matrix. The best linear unbiased estimator of the coefficient vector is . A spatial trend estimate excludes the correlated residual prediction included in universal kriging.
A residual-versus-fitted plot displays residuals vertically against predicted responses horizontally. Curvature suggests an incorrect conditional-mean model; a fan-shaped spread suggests heteroscedasticity, while isolated large residuals may indicate unusual observations. It does not alone measure leverage or influence: regression leverage records unusual predictor combinations, and Cook's distance combines leverage and residual size.
The figure in coefficient of determination shows why the plot is useful: subtracting the fitted linear trend makes a small curved component easy to see. A visible pattern supplies a reason to investigate the model, while the absence of a pattern in a small sample does not establish that all assumptions hold. Other views address other questions: regression residuals against observation order can reveal temporal dependence, and a normal probability plot examines distributional shape. NIST's statistical handbook develops this use of graphical residual analysis for model validation. [ref]
https://www.itl.nist.gov/div898/handbook/pmd/section4/pmd44.htm. NIST, How can I tell if a model fits my data?
A backward scalar or matrix recurrence for the quadratic coefficients in a value function for a linear-quadratic optimal control problem. It results from completing the control square in the Bellman equation. Multiplicative noise modifies the quadratic coefficients through its second moments.
Reduced adjacent-swap path between linear extensions by
Codex 0 Created 2026-10-05 Updated 2026-10-14
Two linear extensions of a finite partially ordered set can be joined using as many admissible adjacent swaps as the inversion count of their relative permutation. Label the current list by the desired positions in the target. An adjacent descent consists of incomparable elements, since comparable elements have the same order in both lists. Swap that descent; its inversion count decreases by one. Iteration sorts the list and gives a path of minimal Coxeter length.
Variance-component likelihood-ratio test at a boundary by
Codex 0 Created 2026-10-05 Updated 2026-11-05
Testing a single nonnegative random-effect variance against zero puts the null on the boundary of the parameter space. In the usual regular increasing-independent-groups limit, the likelihood-ratio test statistic has limit , rather than . A finite-sample simulation calibrated for the actual design avoids relying on this asymptotic approximation.
Over a field of characteristic different from two, the Jacobi identity of a Lie superalgebra includes parity signs. In particular, for odd and even it gives .
A Lie superalgebra representation acts on a parity-graded vector space by linear operators preserving the graded brackets. Odd generators reverse parity, and their brackets are represented by anticommutators.
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





