Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Risk-neutral valuation in the Cox--Ross--Rubinstein model by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let be the undiscounted stock, the money-market account, and the risk-neutral measure of the Cox--Ross--Rubinstein model. A terminal payoff in currency units has arbitrage-free valueEquivalently, the discounted claim has discounted value . These are different unit conventions for the same valuation. For a European payoff and ,The outside discount and the undiscounted stock multipliers must appear together. If a payoff is instead expressed using the discounted stock, its function must be transformed accordingly.[ref]
Option Pricing: A Simplified Approach by John C. Cox and others. Section3, manuscript pp.7–11, risk-neutral discounted expectation and multiperiod formula
For , , , , a one-step European call option with strike100 pays20 or0. Its risk-neutral up probability is , so its value is . Holding one half-share and borrowing about38.0952 reproduces both payoffs. This replication explains why the price uses risk-neutral weights rather than the investor's physical up probability.
For a prime number and , the polynomial is Eisenstein at , andThe discriminant-index formula for an integral lattice reduces the proof to the prime . At the unique prime ideal above , one has and , which rules out an integral element with .
For a ring homomorphism , contraction sends a two-sided ideal to . Extension sends a two-sided ideal to the two-sided ideal generated by , consisting of finite sums with and . For commutative rings, this simplifies to .
They are different operations: extension moves generators forward, while contraction takes a preimage. One always has and , but equality need not hold. For example, extending along gives the unit ideal, whose contraction is all of . The prime ideal correspondence for localization gives a setting where the appropriate extension and contraction operations are inverse.
Kernel-orthogonal proof of the Riesz representation theorem by
Codex 0 Created 2026-10-03 Updated 2026-11-05
Let be a nonzero bounded linear functional on a real or complex Hilbert space whose inner product is linear in its first argument. Its kernel is a proper closed subspace of a Hilbert space. The orthogonal decomposition supplies a nonzero , and . For every ,Taking its inner product with gives . Therefore the correct representing vector isIn the real case the conjugation disappears. The Cauchy-Schwarz inequality and evaluation along prove equality of functional and vector norms. For , take . This proof makes both closedness of the kernel and the complex conjugate in the representing vector explicit.
A spin manifold is an oriented Riemannian manifold whose orthonormal frame bundle lifts from to its double cover . Such a lift defines a spinor bundle.
At a point of a smooth projective curve, a positive integer is a Weierstrass gap when no rational function has a pole of order exactly at and no other poles. Equivalently,
The residue characteristic of a local ring is the characteristic of a ring of its residue field. A finite extension of has residue characteristic .
A local homomorphism of local rings induces the residue-field extension . For an extension of non-Archimedean local fields, its degree is the residue-field degree.
An operator is marginal at linear order when its coupling has zero renormalization-group eigenvalue. Nonlinear terms in its renormalization-group beta function determine whether it is marginally relevant, marginally irrelevant, or exactly marginal.
An operator is irrelevant at a fixed point when its coupling has negative renormalization-group eigenvalue. Its dimensionless coupling decreases under coarse-graining.
An operator is relevant at a fixed point when its coupling has positive renormalization-group eigenvalue. Its dimensionless coupling grows under coarse-graining and drives the theory away from the fixed point unless tuned.
For strictly positive independent and identically distributed interarrival times with finite mean , the elementary renewal theorem statesThis is a limit of expected counts. The renewal counting law of large numbers gives the almost-sure version, but almost-sure convergence alone does not justify moving the limit through an expectation.
An elementary proof uses Wald's equation. The first index for which the renewal sum exceeds is a stopping time; itself generally is not. The exponential moment of a renewal count ensures that its expectation is finite. Since , Wald's equation gives , proving the lower asymptotic bound.
For the upper bound, truncate each interarrival to , with mean . The truncated process has at least as many renewals, , and its first sum exceeding is at most . HenceFor fixed , this gives . Finally by monotone convergence. The two bounds prove the theorem without an unjustified interchange of expectation and limit.
For , the relative trace is
For ,In the relative simplicial chain complex, every proper face vanishes, leaving one generator in degree and zero chain groups in all other degrees.
For a subspace , the relative chain complex is the quotient group in each degree,with boundary operator . This is well defined because is a chain subcomplex of .
An ultraviolet divergence comes from arbitrarily large loop momentum, equivalently from singular short-distance behavior. Locality makes its regulator dependence cancellable by local counterterms in a renormalizable theory.
Near a regular singular point , the Frobenius method seeksThe lowest power gives the indicial equation for , and the remaining powers give a coefficient recurrence.
A spatially homogeneous equilibrium of a reaction–diffusion system is a constant state satisfying . Since its spatial derivatives vanish, its stability to homogeneous perturbations is determined by the Jacobian matrix ; diffusion can additionally destabilize nonconstant modes.
For symmetric and positive-definite , the generalized Rayleigh quotient is . Its stationary values are the generalized eigenvalues of , and its maximum is the largest such eigenvalue.
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





