A constant of motion is a quantity preserved along the evolution, possibly with explicit time dependence. For in a gravitational potential , the preservation condition is
For free motion, is a useful explicitly time-dependent example. Such initial-position labels should not be counted as stationary isolating integrals of a galactic orbit.
The printed symbol is not defined. Take , or more generally an subspace with its induced norm; density must be in that norm. Given , choose a sequence with
By the assumed convergence on , each holds outside a null set . Their countable union is still null. Thus outside the convergence statements for every member of this single approximation sequence hold simultaneously. No assertion of simultaneous convergence for the entire uncountable dense class is needed.
The domination hypothesis includes . For any approximation error , linearity and the triangle inequality therefore give the uniform estimate
For a general input and an approximating , this implies
The first term converges on the dense class, while the weak type (1,1) estimate controls the exceptional set where the second is large.
Small random-walk proposal variance gives many accepted tiny moves and strong autocorrelation; excessive variance proposes mostly low-density points, giving low acceptance and long rejection plateaus. Tune each coordinate or block during a pilot run to balance movement and acceptance, and inspect effective sample size per unit computation. Rescale or transform parameters with very different units, and account for posterior correlation rather than adjusting only diagonal variances.
There is no universal optimal acceptance percentage for every target or update dimension. Keep the chosen proposal fixed in the production run, or use an adaptive method with a proved diminishing-adaptation and containment justification. The direction of the trace-based changes for this particular run is given in the parent solution.
Single-component updates propose one coordinate while holding the others fixed, with acceptance based on the resulting target ratio. They are cheap and permit individual scale tuning, but can crawl along a narrow correlated ridge. Block updates propose several coordinates jointly and can follow posterior covariance directions, potentially improving mixing substantially.
A practical compromise uses small correlated blocks, or a full Gaussian block with covariance estimated in a pilot run and rescaled for acceptance. Blocking independent coordinates need not help, and a badly scaled high-dimensional block may be rejected frequently. Compare computing cost per effective draw, rather than acceptance rate alone. A Metropolis-within-Gibbs sweep of coordinate updates and a properly accepted block update both preserve the target.
Convergence means that the chain's distribution approaches the intended posterior, independently of its initial state, under the relevant ergodicity assumptions. It is separate from obtaining enough effectively independent draws for a precise answer. Start several chains at dispersed plausible points, examine trace plots and stability of posterior summaries, compare between-chain and within-chain variation, and inspect autocorrelation and effective sample size of a Markov chain. Discard an initial transient when appropriate and report Monte Carlo uncertainty.
No finite diagnostic proves convergence. Agreement among chains started in the same basin can miss another mode. If different starting points give incompatible summaries, extend runs or improve proposals rather than merely deleting more observations. Extra thinning does not repair poor exploration; retaining all post-transient draws usually preserves more information for estimating uncertainty.
For each bootstrap replicate form the studentized pivot
Let be its empirical quantiles. The bootstrap-t confidence interval approximates
Solving both inequalities for reverses the quantile order, giving
Using the same fixed standard error in every bootstrap numerator would not implement this studentized procedure; each replicate needs its own .
Let and be the empirical quantiles of the paired-bootstrap values . The percentile bootstrap confidence interval is
Its endpoints use the bootstrap distribution of the estimate itself. The regularity assumptions and resampling scheme are those in the parent solution.
Assume . Draw an independent component indicator with a Bernoulli distribution of success probability . On success, generate the normal distribution from part (i) and return its absolute value; this has the half-normal distribution probability density function on . On failure, generate the Weibull distribution from part (ii). Use fresh independent uniforms for the chosen component.
The law of total probability gives the output probability density function
as required. The factor two belongs inside the half-normal component; the probability of choosing that component is , not .
For , integrating the Weibull distribution probability density function gives
The inverse transform sampling method takes uniform on and solves . Hence
Since is also uniform, is an equivalent implementation. For any , the resulting event has probability , verifying its distribution.
Use the ratio-of-uniforms method on
Writing gives and . Consequently
because the derivative vanishes at . Thus the normal ratio-of-uniforms envelope is the rectangle , .
Generate independent with uniform distribution on , set and , and accept precisely when
Reject and repeat otherwise. On acceptance return . One can compare logarithms instead of exponentials to avoid underflow.
For a proof, the change of variables has Jacobian determinant . A uniform point in therefore gives an -density proportional to
Normalizing yields the required normal distribution with mean zero and variance . The region area is ; dividing it by the rectangle area gives acceptance probability .
For a stopping time , the optional sampling theorem for the L2-bounded continuous martingale gives . Consequently
If is unbounded, first multiply by a bounded truncation and then remove it using bounds and the Cauchy-Schwarz inequality. Thus (ii) implies (iv). Taking proves the converse. For , the same calculation uses the terminal value.
The polarization identity for quadratic covariation, together with , yields
The bracket identity for each zero-starting square-integrable martingale is the Itô isometry for integration of the constant integrand against that martingale. Polarizing both identities gives the displayed covariance identity for continuous square-integrable martingales. The bracket is integrable: its total variation is at most by the Kunita-Watanabe inequality, whose expectation is finite by the Cauchy-Schwarz inequality. Therefore condition (iii) is equivalent to (ii).
The equal-time condition is the criterion proved equivalent to weak orthogonality in solution. Its equivalence with the quadratic-covariation condition follows from the covariance identity for continuous square-integrable martingales in solution; its equivalence with the forward-stopping condition follows from the optional sampling theorem in solution. These combine to give all four equivalences.
If are weakly orthogonal continuous martingales, taking the two times equal gives . Conversely suppose this equal-time condition holds. For , the martingale property and conditional expectation give
For , condition the other factor at time instead. Products are integrable by the Cauchy-Schwarz inequality. Thus the equal-time condition implies the full cross-time definition, proving (i) equivalent to (ii).
Factor the coefficients into a tensor product:
This is already a Schmidt decomposition with one term. Consequently
Each reduced density matrix is the rank-one orthogonal projector onto , so its other eigenvalue is zero. The joint pure state is a product state, with no entanglement.
The coefficient matrix in the computational orthonormal bases, with Alice's index labelling rows, is
Since the entries are real, the reduced density matrices are
Both have trace one and determinant . Their characteristic polynomial is , so the nonzero eigenvalues are
Both are positive. Thus the Schmidt rank, or the Schmidt number of this pure state, is
If “Schmidt numbers” denotes the individual positive Schmidt coefficients instead, those are
Their squares are ; giving both the Schmidt rank and the Schmidt coefficients removes this terminology ambiguity. The pure state is entangled because its Schmidt rank exceeds one.
For a maximum of finitely many nonnegative quantities, its th power is at most the sum of their th powers. Hence the increment assumption gives
By the triangle inequality in the Lp norm, the partial sums defining have norms bounded by a geometric series. Monotone convergence of their th powers gives
In particular is finite almost surely, so the preceding pathwise estimate has a common probability-one domain for all dyadic pairs.
For each sample point put . First take in the dyadic rationals, set , and choose with . The left grid approximations and are at most two grid steps apart, so .
For either endpoint , successive left approximations are equal or one step apart on the level- grid. Since is dyadic these approximations eventually equal exactly. The triangle inequality therefore gives
The second inequality is valid also for . Thus the required bound holds simultaneously for every dyadic pair whenever is finite; if it is infinite the inequality holds in the extended sense. For the left side is zero. This is dyadic increment chaining, with the stated constant two.
For , define the bounded stopping time on and on . Before time its stopping events are empty, at time the event belongs to , and subsequently it has stopped everywhere. Subtract the assumed mean identity for this from that for the constant stopping time to obtain
Since is integrable and -measurable, this is precisely the defining property of conditional expectation giving . Thus the adapted process is a martingale, completing the bounded-stopping-time characterization of a martingale.

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