Topics (316k) Articles (328k) Users (379) Discussions (237) Comments (383) Files (10k) New article
A partial wave is a component of a scattering state with definite orbital angular momentum. A central potential preserves each angular-momentum channel, so the scattering problem decomposes into independent partial waves.
For a localized target and a plane wave incident along the -axis, the large-radius scattering wavefunction has the formwhere is the scattering amplitude.
In the Cox--Ross--Rubinstein model, a stock changes at each discrete time by an up factor or a down factor , while the money-market account changes by a deterministic factor . After discounting by the money-market account, the factors are and . The model is arbitrage-free exactly when , equivalently .
Wald's equation turns a random sum into a product of two expected values: the average contribution per step and the average number of steps. Its surprising feature is that the number of steps may depend on what has already happened. A procedure can stop on its first successful Bernoulli trial, for example, while the identity still accounts for its total cost. The crucial restriction is that the decision to take the next step cannot use that step's unobserved outcome.
Let be real independent and identically distributed random variables with , let , and put and . Suppose is a nonnegative integer-valued stopping time for the natural filtration , with . Then is an integrable random variable andThese hypotheses allow statistical dependence between and the increments; they do not allow access to future increments. The finite-expected value requirement is stronger than stopping almost surely.[ref]
For the proof idea, count step only on . This event is determined by the first observations, so its indicator function is independent of . The Proof of Wald's equation by stopping indicators combines this observation with the tail-sum formula for expectation. The same calculation with gives , which justifies interchanging the expected value and the infinite series. This is why the result survives a data-dependent end point without assuming an independent count.
The identity is useful in randomized algorithms and repeated sampling: one can translate an average amount of work into an average number of attempts, or conversely, without first finding the full probability distribution of the total. The examples below separate a permissible stopping rule from a rule that peeks ahead and from a valid rule whose average waiting time is infinite.
A finitely additive probability measure on a set is a function such that and for disjoint subsets . Unlike a probability measure, it need not be countably additive.
The probability of an event is its value under a probability measure, a real number between zero and one. It compares the mass assigned to that event with the unit mass of the whole sample space. For a finite sample space with equally likely outcomes, . For unequal outcome masses, add their individual probabilities instead.
For example, selecting a coin with head probability with chance , or a coin with head probability with chance , gives head probability . This is the law of total probability: averaging over the hidden selection is part of calculating the outcome's probability.
A two-dimensional point source of strength has velocity potential and outward velocity . Every closed contour enclosing it has volume flux .
A cap set is a subset containing no three distinct points satisfying . Equivalently, it contains no nonconstant three-term arithmetic progression.
Let have total degree of a polynomial less than . If the associated polynomial function vanishes on all of , then is the zero polynomial. Induct on : writeFor each fixed , the resulting univariate polynomial of degree less than has all field elements as roots, so every coefficient vanishes everywhere. The induction hypothesis makes every the zero polynomial.
A discriminant is a polynomial expression in the coefficients that vanishes when the associated polynomial has a repeated root.
The real univariate polynomials form a vector space with the countable Hamel basisThe subspace of polynomials of degree at most has dimension .
A polynomial function is the function obtained by evaluating a polynomial on a specified ring or field. Distinct polynomials can induce the same polynomial function over a finite field; for example, and agree on .
Over , the nonzero formal polynomial evaluates to zero at both possible inputs, zero and one. It therefore induces the same polynomial function as the zero polynomial, despite having different coefficients and polynomial degree. Over an infinite field, equality at every input forces equality of polynomials by the root bound for a polynomial. The distinction matters whenever a representation is supposed to identify the function uniquely.
A planar periodic orbit, oriented by the flow, has Poincaré index . The index theorem equates this with the sum of the indices of the isolated equilibria enclosed by the orbit. A hyperbolic equilibrium has index when its Jacobian matrix has positive determinant and index when it is a saddle equilibrium.
The Euclidean plane is with its standard Euclidean norm and the resulting distance, angles, and Riemannian metric.
Phase portrait of x dot equals two x times y minus a by
Codex 0 Created 2026-10-03 Updated 2026-10-05
This reflection-symmetric planar system has equilibria and, for , . Its divergence is the constant , excluding periodic orbits when by the Bendixson-Dulac criterion. At it is Hamiltonian withand the nonzero equilibria are nonlinear centers. At the symmetric equilibria undergo pitchfork bifurcations.
A second-order partial differential equation contains derivatives of the unknown function of order at most two and at least one second derivative. Its principal symbol determines its characteristic directions and elliptic, parabolic or hyperbolic type.
The parity of a two-particle centre-of-mass state with intrinsic parities and relative orbital angular momentum is
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





