A weak solution of a stochastic differential equation consists of a choice of probability space, filtration, driving Brownian motion and adapted solution with the specified initial law. The driving noise and the space are part of what may be chosen.
A strong solution of a stochastic differential equation is constructed for a prescribed Brownian motion and initial value, as a nonanticipating measurable functional of that data; for deterministic initial value it is adapted to the usual augmentation of the Brownian filtration. No further independent randomness is required.
Uniqueness in law means that any two weak solutions of a stochastic differential equation with the same initial distribution have the same law as solution processes. Pathwise uniqueness means that two solutions on the same filtered space, driven by the same Brownian motion and with the same initial value almost surely, are indistinguishable: . The latter concerns equality of paths on a common space, whereas uniqueness in law concerns equality of probability distributions.
Interpret the otherwise undefined here as the moment defined above. For , the process is , and for it is ; both are martingales.
For , the Itô formula and the derivative of the Brownian moment recursion yield
The stochastic integral is a true martingale on finite horizons, since the required moment is integrable in time. The continuous finite-variation term is not identically zero. If it were, its continuous derivative would vanish at every time, whereas at a fixed , the nondegenerate Gaussian does not almost surely satisfy the polynomial equation . Uniqueness of continuous semimartingale decomposition therefore rules out even the local martingale property. Hence
For example , so merely subtracting its zero expectation cannot make the cubic power a martingale. The centered Brownian powers need not be martingales distinction is resolved by subtracting the random drift compensator instead of the deterministic mean.
The initial values are and . Repeatedly applying the Brownian moment recursion to odd indices reduces them to , so every odd moment vanishes. For even indices, if the formula holds at , then
The base case is . Thus
Equivalently the even moments are , the familiar Gaussian moment formula with variance .
Fix a finite horizon and define . These stopping times increase to infinity almost surely because continuous paths are bounded on each finite interval. Applying the Itô formula to , for , gives
The first integrand is bounded by , so its integral is square-integrable and has expectation zero. Thus
To justify both limits explicitly, let and choose an integer . The Gaussian density gives by its exponential tail. The Doob Lp maximal inequality states
Therefore and are integrable. The stopped terminal powers converge almost surely to and are dominated in absolute value by . The integrands in the time integral converge almost surely and are bounded by , so their integrals are dominated by . Dominated convergence theorem on both sides, and then Fubini justified by the same bound, give the Brownian moment recursion
This uses only finiteness of Gaussian moments, not the closed moment formula requested in the next part.
For càdlàg semimartingales, the semimartingale integration by parts formula is
For continuous processes the left limits can be replaced by the values. The bracket includes the jump products in the general formula.
For a continuous -valued semimartingale and , the Itô formula is
The formula is localized when the derivatives are unbounded; continuity of makes them bounded after stopping on compact sets.
To prove the one-dimensional formula for polynomials without assuming that formula, use induction. It is immediate for constants and . Suppose
Write with a continuous local martingale and finite variation. The induction hypothesis identifies the martingale part of as . The stochastic-integral covariation identity, obtained by polarization from the quadratic-variation identity, gives
Apply semimartingale integration by parts to . Its first-order terms combine to , and its bracket terms combine to
This proves the induction step. Taking linear combinations proves the polynomial Itô formula from integration by parts for every polynomial .
For an elementary previsible integrand, the integral is the increment sum . This expression uses only and , so is identical under the two measures, irrespective of how the local martingale and finite-variation parts change.
We may use the stochastic dominated convergence theorem: if bounded predictable converge pointwise to under a common deterministic bound, their integrals against a semimartingale converge uniformly on compact intervals in probability. Also convergence in -probability implies convergence in -probability when . To see the latter directly, let . For any event ,
and let first , then . Apply this to events involving the supremum on a finite horizon for the uniform-in-probability statement.
Let be the bounded predictable integrands for which the two integral processes agree up to -indistinguishability. It is a vector space containing elementary rectangle indicators generating the predictable sigma-algebra. It is closed under uniformly bounded pointwise limits: stochastic dominated convergence theorem gives convergence of the integrals under each measure, and the preceding transfer makes the limit also a limit. Uniqueness of limits in probability makes the two limiting integrals equal. The functional monotone-class theorem therefore puts every bounded predictable integrand in .
Finally, for locally bounded , stop on intervals where it has a deterministic bound. Such stopping times tend to infinity under and hence also under . Apply the bounded result to the stopped integrands and use the stopping property of the integral. This proves the stochastic integral under an absolutely continuous measure change identity
The decompositions and thus represent the same process under , although their individual components need not agree. With only absolute continuity, equality is asserted outside a -null set, not necessarily outside a -null set for a chosen version.
The correct quadratic variation of a stochastic integral identity is
The brackets around the final integrator are missing in the PDF. Without them the assertion is false: for and Brownian motion, the left side is while the printed right side is .
For elementary predictable , the integral is obtained by scaling each martingale increment by its known coefficient. Quadratic variation on each interval is therefore scaled by the square of that coefficient, giving the displayed formula. To pass to a general integrand on , take elementary in the integrand norm and put , . The Itô isometry gives , hence . The bracket Cauchy-Schwarz bound
and polarization show that uniformly in probability. On the other side, Cauchy-Schwarz for the quadratic-variation measure gives
Taking limits proves the formula in the square-integrable case. Stopping and pasting as in part b proves it for locally bounded predictable integrands and continuous local martingales.
For every zero-starting continuous local martingale , there is a unique, up to indistinguishability, continuous adapted increasing process , with , such that
This is its quadratic variation. It also satisfies, for deterministic partitions whose mesh tends to zero,
with convergence uniformly on compact time intervals in probability. The theorem includes existence and finiteness on each compact interval; monotonicity is understood pathwise outside one null set.
Uniqueness follows because the difference of two candidate increasing continuous processes is both a finite-variation process and a continuous local martingale, hence is identically zero from its zero initial value. For a continuous semimartingale , its quadratic variation is , since continuous finite-variation terms have zero quadratic variation. Polarization defines the quadratic covariation by .
For an elementary previsible process , with bounded -measurable coefficients, define
The Itô isometry is
More generally the squared distance between the integrals of and is the integral of on the right. The integral is a zero-starting continuous square-integrable martingale.
Elementary predictable processes are dense in . Given in this space, choose elementary converging in its norm and define the Itô integral by the limit of . The isometry proves that this is independent of the approximating sequence and remains valid for the limit. The Doob L2 maximal inequality bounds the expected squared path supremum of the difference by four times its terminal second moment; hence the convergence also gives a continuous martingale version, with uniform convergence on compacts in probability.
For a continuous local martingale and locally bounded process that is previsible, choose increasing stopping times such that is L2-bounded, up to , and . This can be done by combining localizers with first exits of from bounded intervals and the local bounds of . Then is in the integrand space for . Define the integral on each stopped interval by the preceding construction. The stopping property of elementary integrals, extended by the isometry, makes these definitions agree on overlaps. Pasting gives
This is a localization construction; global square integrability of the resulting process is not asserted.
The previsible sigma-algebra on is generated by left-continuous adapted processes. Equivalently it is generated by with and with , . A previsible process is a process measurable for this sigma-algebra; predictable is a synonym.
Use the zero-starting convention for : continuous martingales with and . For such an L2-bounded continuous martingale, the square-integrable stochastic integrand space is
Identify processes that agree almost everywhere for the quadratic-variation measure . This makes the displayed norm an actual Hilbert-space norm on equivalence classes. On a fixed horizon , replace infinity by ; this is the same construction for continuous martingales square-integrable on that horizon. Nonzero initial values may be subtracted because the integral depends only on increments.
Brownian scaling gives , where has Rayleigh distribution with density , . For every ,
Near zero this is bounded by , which is finite; near infinity the Gaussian tail dominates any logarithmic power. The inequality , valid also for , now yields
Let , a finite constant. The same scaling identity gives
An integrable martingale has constant expectation, so the logarithm of planar Brownian radius is a strict local martingale on . Fixed-time integrability, even of every positive power, does not imply the stopping-time uniform integrability required in part a.
First justify that the logarithm is defined at all times from one onward. For planar Brownian motion started at , stop on exiting the annulus , where . This exit time is finite almost surely: the stopped identity gives . The function is harmonic on the annulus, so its stopped process is a bounded martingale. Optional stopping gives
Hitting zero before the outer circle would require hitting every inner circle first. It therefore has probability zero. Taking a countable sequence of outer radii tending to infinity proves that planar Brownian motion avoids a fixed point. Since has a density and is nonzero almost surely, condition on to apply this result to the future path.
For , and in two dimensions. The Itô formula on annuli therefore gives
To localize explicitly, let . These stopping times increase to infinity almost surely: on each compact time interval the continuous path has a finite maximum and, by point avoidance, a positive minimum radius. Up to , the stochastic integrand has norm at most . Its stopped integral is square-integrable on every finite horizon. The initial value is integrable, as follows from the Rayleigh-density calculation in part d. Hence is a true martingale from time one and is a local martingale. This also gives its quadratic variation from time one as .
The Lévy characterization of multidimensional Brownian motion says that a continuous adapted -valued process , with , is standard Brownian motion relative to the given filtration if and only if its coordinates are local martingales and
For Brownian motion, independent centered Gaussian increments give the martingale property of each coordinate and of . The defining uniqueness of quadratic covariation consequently gives the bracket condition.
Conversely, suppose the local martingale and bracket conditions hold. For , the Itô formula gives
since the bracket term cancels the time derivative. On , , so its real and imaginary parts are bounded local martingales and hence true martingales. Thus, for ,
This is the characteristic function of and is independent of . Uniqueness of characteristic functions shows that has that Gaussian distribution and is independent of the past. Iterating over ordered times gives independent Gaussian increments; together with continuous paths and , these are precisely the defining properties of standard Brownian motion.
Take a complete, right-continuous filtration , an increasing family of sigma-algebras. Adapted means that is -measurable at each ; càdlàg means right-continuous with left limits. A local martingale is an adapted càdlàg process , with integrable initial value, for which there are stopping times almost surely such that each stopped process is a true martingale. Such a sequence is a localizing sequence. A true martingale is integrable at each time and satisfies for .
The necessary and sufficient condition is that is a Class DL process:
A family is uniformly integrable if its members are integrable and as . A stopping time satisfies for all .
For necessity, on the optional stopping theorem gives ; conditional expectations of one integrable variable form a uniformly integrable family. For sufficiency, almost surely, and Class DL upgrades this convergence to on each finite horizon. Pass to the limit in to obtain the martingale identity. Requiring uniform integrability of all times on the entire half-line would be stronger than necessary; Brownian motion is already a counterexample to that stronger requirement.
Here is an explicit Braess paradox. Use four vertices and unit demand from to . The delay on equals its own link flow, as does the delay on ; the delays on and are constantly one. Initially the two routes are and . If the first carries and the second , their delays are and . The Wardrop equilibrium has , so every traveler takes time .
Add a directed link with zero delay. Let the old upper and lower routes carry , and let the new route carry , with . Their delays become
If , the upper route is strictly slower than the middle route, contradicting the Wardrop equilibrium condition. Similarly is impossible. Thus the new equilibrium has , and all three route delays are two. Consequently
This is an incentive effect, not a loss of feasible allocations: the old half-and-half flow remains feasible after adding the link. For completeness, its social optimality can be checked directly. Write , . Total travel time in the enlarged network is
It is minimized at , giving the original total time . The Wardrop equilibrium instead incurs total time two, a factor larger. The Beckmann potential and total-delay objectives differ because an extra traveler ignores the delay their presence imposes on others. More generally, adding routes cannot worsen the optimum of total delay when it leaves the previous feasible flows available, but it can worsen a selfish Wardrop equilibrium.
Assume each link delay is continuous and nondecreasing. Define the Beckmann potential on feasible route flows by
The integral of a nondecreasing function is convex, so is a convex function. The chain rule gives
At a minimum, move a small amount of flow from a used route to any other route for the same source-sink pair. This is a feasible direction, and its one-sided derivative is . Thus every used route has minimum cost, establishing the Wardrop equilibrium conditions.
Conversely, if satisfies the Wardrop equilibrium conditions, then for any feasible ,
Here on each pair, whereas . The supporting inequality for a convex function then gives . Therefore
The feasible route-flow set is compact, and the Beckmann potential is continuous, so a minimizer exists. If each is strictly increasing, the potential is strictly convex as a function of link loads. Two minimizers with distinct link-load vectors would have a midpoint with strictly smaller potential, a contradiction. Thus equilibrium link loads are unique in this case; route-flow nonuniqueness at a Wardrop equilibrium can still occur because different route decompositions can have the same link loads.
The optimization of selfish route choice must be distinguished from the minimization of total travel time
For differentiable delays, the marginal social cost on link is , rather than just . The marginal external cost toll makes each traveler's perceived link cost equal to this derivative. If is convex, the tolled Wardrop equilibria minimize : the corresponding Beckmann potential is exactly , up to its zero reference value. Convexity of is an additional assumption and does not follow merely from nondecreasing delays.
An elastic-demand extension assigns pair an inverse demand function and allows demand to vary. Subtracting from the Beckmann potential produces the optimization formulation: its marginal condition equates minimum route delay with marginal willingness to travel on positive-demand pairs. With decreasing inverse demands, the subtracted utility is concave and the resulting objective remains convex. This explains why both fixed-demand route choice and an elastic-demand Wardrop equilibrium fit a common optimization framework.
A useful starting model treats a road network as a directed flow network and travelers as a divisible population in a nonatomic congestion game: an individual traveler has negligible effect on link congestion. For each source-sink pair , fix a demand and a finite set of allowed routes. Let be the flow on route , with . The link-route incidence matrix gives link loads . If link has delay , the route travel time is
A Wardrop equilibrium is a feasible route-flow vector for which every used route has minimum travel time among the routes serving the same source-sink pair. Equivalently, there are numbers such that
The condition says that a traveler cannot lower their own delay by changing route. It does not assert that their choice minimizes the total delay experienced by all travelers. At a Wardrop equilibrium, unused routes may have exactly the same delay as used ones.
This static flow network model requires delay to depend on present link load, with each source-sink demand fixed. Models from queueing theory instead describe vehicles or packets as discrete customers whose delay depends on random arrivals, service and accumulated queues; a time-dependent model must also track changes of flow and travel-time propagation. Those models answer different questions from a static Wardrop equilibrium. The static model is nevertheless valuable because its route-choice condition has a precise convex optimization formulation, as developed next.
The orthogonal projection onto the eigenspace of the Pauli matrix is . By the Born rule and the Bloch vector representation,
Since ,
The given vector has length , so it lies inside the Bloch ball and indeed defines a valid mixed qubit state. For the physical spin operator , the corresponding outcome is with the same probability.
The unread measurement is the pinching map , a nonselective projective measurement. Its output is block diagonal and commutes with each , so also commutes with the projectors on its support.
First the quantum relative entropy is finite. If lies in the kernel of , positivity gives
Every summand is zero; summing gives . Thus , equivalently .
The block-diagonal logarithm obeys on this support. Cyclicity of the trace therefore gives
Consequently the relative entropy of a pinched state is exactly the entropy increase:
By the proved nonnegativity of quantum relative entropy and its equality condition,
Equivalently, equality holds exactly when all off-diagonal blocks for already vanish, or when commutes with every measurement projector. This argument proves the equality condition even when the projectors are degenerate and the states singular.
The generalized measurement postulate specifies Kraus operators , where is the recorded outcome and permits unobserved alternatives for that outcome, satisfying
For a density operator , outcome has probability and conditional state
With one operator per outcome, this is the usual formula , . The positive operators form a POVM, while the state-update maps form a quantum instrument.
The full postulate reduces to the usual projective measurement with the Lüders update when there is one operator per outcome and , with , for , and . Then and . Projective effects alone ensure these probabilities but do not fix the state update: an additional outcome-dependent unitary could still be applied. The choice makes the required projective state-update condition explicit.

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