Yes, it is a uniformly most powerful test for the one-sided alternative. For every fixed , the likelihood ratio is increasing in the same statistic . The size- threshold found in part (c) depends only on the null variance and , not on the selected alternative variance. Thus one and the same test is most powerful against each simple member of the composite alternative, which is exactly uniform most powerfulness.
For , the likelihood ratio in favor of the larger variance is
Because , this is strictly increasing in . The Neyman-Pearson lemma therefore selects an upper-tail rejection region. Under the null, , so size is obtained with
Continuity of the chi-squared distribution makes the boundary have probability zero. This is a fixed-mean normal variance test.
The Neyman-Pearson lemma compares two simple hypotheses with densities . Among all tests of size at most , a most powerful test rejects when , accepts when it is below , and may randomize on equality to attain the prescribed size. The threshold and any boundary randomization are chosen so the rejection probability under is .
The key inequality is pointwise for the likelihood-ratio test . Integration shows its power is at least that of any competing test with no larger size. With continuous likelihood-ratio statistics, boundary randomization is unnecessary.
The standardized observations are independent standard normal random variables. By the definition of the chi-squared distribution,
Its distribution is continuous, so gives the required probability. Put . Solving for the positive variance reverses the reciprocal order. The exact confidence interval is
The mean is known to be zero, so the degrees of freedom are , not . Coverage is exactly under the stated normal model.
The moment-generating function is on the set where this expectation is finite. For independent, identically distributed summands, independence factors the expectation:
The identity holds wherever the factors are finite; in the remaining parts the bounded summands make them finite for every real .
Write a first return time as , where for . It has mean and period two, so the stationary probability at one is . The periodic convergence theorem would give limits along even times and zero along odd times.
Here one can obtain them directly. Put , with . Splitting according to the first return gives the renewal equation
Induction gives for every : the right side is . Odd-time returns are impossible because every return interval is even. Therefore the exact set of limit points is
The sequence does not converge to the stationary mass , precisely because it is periodic.
The stationary balance equations on the closed class are , with . Working backward gives .
Normalization yields , so
These probabilities sum to one and satisfy each balance equation. In particular is the reciprocal of the mean return time , consistent with part (d).
The first return time has distribution . It is finite almost surely, so state one is recurrent. It is positive recurrent precisely when its mean return time is finite:
By irreducibility the same recurrence class contains every state. Thus the condition is finiteness of the expected value of the positive-integer distribution . If that mean is infinite, the chain is null recurrent, not transient.
After a jump from one to , the first return to one occurs exactly steps later, with probability . Later return times are sums of such positive-support values. Thus their greatest common divisor is
In an irreducible chain this is the common period of every state. Hence the chain is aperiodic exactly when . A self-loop at one is sufficient but not necessary; support at two and three also has greatest common divisor one.
Every state reaches state one by deterministic downward steps. From one, the chain can reach a given state exactly when it can jump to some with and then count down to . Therefore
If the support is bounded by , states above cannot be reached from one, so the chain on the stated infinite state space is not irreducible. Its smaller closed class can still have a stationary distribution, as in part (e).
A Markov chain is irreducible if every state communicates with every other: for any there is an integer with . Thus any state can be reached from any other in finitely many steps with positive probability.
The Gaussian integral gives . Thus the normalized ground state is, up to an overall phase,
Its probability density is even in each shifted coordinate, so all three expectations vanish by oddness. Therefore
The mean position is the minimum of the displaced potential, rather than the original coordinate origin.
Put . Substitution of in the one-dimensional Schrödinger equation with energy gives
For degrees zero, one and two, coefficient comparison yields, up to independent nonzero constants,
For the shifted coordinates , let . A basis of wave functions for the first three energy levels is:
  • : .
  • : .
  • : .
These are products of the one-dimensional polynomial solutions. Arbitrary linear combinations within each listed eigenspace are also stationary states. Their counts agree with part (a), so the degeneracies have all been included.
Set and . Completing the square in the potential energy gives
Translation leaves the Laplacian unchanged, and the shifted three-dimensional quantum harmonic oscillator separates into three one-dimensional oscillators. Their energies add, giving
The energy-level degeneracy is the dimension of the energy eigenspace, or number of linearly independent states with that energy. Counting nonnegative integer triples of total by stars and bars gives
The constant electric field displaces the oscillator and shifts all levels by the same amount, preserving their degeneracies.
For the surface of revolution , the coordinate tangent vectors have squared lengths and , and their dot product is zero. Hence its first fundamental form is
Use the energy Lagrangian . Its Euler-Lagrange equations are
For a meridian , choose arc length as parameter, so . Differentiating gives , while the second equation is automatic. Part (b) makes this path an extremal of length. Thus every meridian is a geodesic.
For a nonconstant parallel , choose constant nonzero . The second equation holds, and the first reduces to . Since , this is equivalent to
Conversely that condition makes both equations hold at constant speed, hence supplies a length extremal. Geometrically, a parallel is geodesic exactly at a stationary radius of the surface.
The autonomous Lagrangian has the Beltrami identity
Here is homogeneous of degree two in the velocities, so . Thus itself is constant, say .
For , put . Its Euler-Lagrange expression along the curve is
The first term vanishes by stationarity for , and the second by constancy of . Thus the same path is stationary for its length functional .
On a regular segment described as a graph , reparametrize by . Since ,
Choose the orientation with increasing ; reversing it does not change stationarity. Invariance of length under regular reparametrization therefore gives
This is the principle of length extremals from a constant quadratic energy. The stated nonnegativity also permits the degenerate case . Then the length is zero, its absolute minimum since the integrand is nonnegative, so it is an extremal in the minimizing sense. The differentiated square-root Euler-Lagrange equation above is only used where ; it would not be legitimate to divide by on a null curve. For a genuine surface metric and a regular nonconstant path, automatically.
For fixed endpoint variations, the Euler-Lagrange equations are
Indeed the first variation is . Integration by parts removes the derivatives from the variations; their zero endpoint values remove the boundary term. The fundamental lemma then makes every remaining coefficient vanish.

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