For , expand directly in inverse powers:
Therefore the outer Laurent series is
The partial fraction decomposition is
For , expand the second term as a geometric series:
Hence
The identity map
is a continuous bijection by . Its domain is compact by part (i), and its codomain is a Hausdorff space because every metric space is Hausdorff. The compact-to-Hausdorff continuous bijection theorem therefore makes the identity a homeomorphism. Consequently
Here
The L1 norm and uniform norm satisfy
so the identity from the metric to the metric is one-Lipschitz and therefore continuous. The two metrics do not induce the same topology on all of . For
one has but . Thus convergence need not imply uniform convergence.
A map is Lipschitz continuous if there is such that
for all . Evaluation at is one-Lipschitz because
Choose distinct and define
The Vandermonde determinant is nonzero, so is a bijection. It is one-Lipschitz for the two uniform metrics. If are the associated Lagrange cardinal polynomials, then
and hence
Thus is also Lipschitz.
Let be the polynomials whose values lie in . Its image under lies in the bounded cube . It is closed: if , then the Lipschitz inverse gives uniform convergence , and passing to the limit pointwise preserves . By the Heine-Borel theorem, is compact, and the continuous inverse carries compactness back to . Therefore
First solve by forward substitution:
Then solve by backward substitution, obtaining
Direct substitution verifies .
Gaussian elimination gives the LU decomposition
The prescribed diagonal entries of are visible, and direct multiplication gives .
Let be the expected capture time starting from , so . The Strong Markov property at successive first passages to lower levels and part (a) give
At , the next state is zero with probability , one with probability , and two with probability . First-step analysis therefore gives
or
Solving,
Substituting now yields
which is the required expected capture time.
A random time is a stopping time for the natural filtration of a Markov chain when for every . The Strong Markov property says that, conditionally on and , the process after is a fresh copy of the chain started from , independent of the pre- history.
Before capture define the half-separation
For , independence of the two moves gives the transition probabilities
Ignore the holding steps. The resulting embedded chain is a biased random walk that moves left with probability and right with probability . Its expected number of moves needed to descend one level is ; this follows either from first-step analysis or from its drift . A non-holding move occurs with probability at each time, so its mean waiting time is two. Hence, for every , the expected time to go from separation to is
Because , for fixed and sufficiently large ,
Therefore
Equivalently, converges in distribution to an exponential distribution of rate one.
Put . The limiting probability
and the certain inequality suggest the approximate confidence interval
Since , its expected length is
as required.
The scaled maximum
has cumulative distribution function for . Thus
The mean squared error of the maximum likelihood estimator is therefore
Each from the uniform distribution on has mean and variance . The sample mean is unbiased and has variance , hence
A statistic is sufficient for if the conditional distribution of the full sample given does not depend on . It is minimal sufficient if it is a function of every sufficient statistic.
The likelihood factors as
so the Fisher-Neyman factorization theorem shows that , and hence its one-to-one transform , is sufficient. Moreover, for two samples and , the ratio is independent of exactly when their maxima agree. The likelihood-ratio criterion for minimal sufficiency therefore shows that and are minimal sufficient.
For , the sample mean is not sufficient: two samples can have the same mean but different maxima, and their likelihood ratio then depends on through the support indicators. It is consequently not minimal sufficient. For the degenerate special case , the sample mean and maximum coincide and both conclusions reverse.
Let . The likelihood function is
On its feasible range , this is decreasing in . Therefore the maximum likelihood estimator is
The displayed Rodrigues' formula gives the Legendre polynomial
A four-node Gaussian rule is exact through degree . Solving first for gives the four nodes
The rule is not exact for every polynomial of degree eight: its quadrature value on is zero because every node is a root of , whereas
For fixed interpolation nodes , interpolate any as
Integrating shows that the unique weights making the quadrature rule exact through degree are
Now let the nodes be the zeros of the degree- orthogonal polynomial . Given any , polynomial division gives
Orthogonality gives , while makes the quadrature sum for vanish. The rule is already exact on , so it is exact on . This is the defining precision property of Gaussian quadrature.
Define the cardinal polynomials
They satisfy . Hence evaluating the proposed polynomial interpolation formula at gives , so the required coefficients are
The polynomial has degree at most and takes every prescribed value. Its uniqueness follows because the difference of two such polynomials would have distinct roots while having degree at most .
Using and the Pythagorean trigonometric identity,
so the speed is independent of . Since ,
and the speed tends to zero at the vertex. The steady irrotational Bernoulli equation gives
Thus the fluid pressure is also independent of , with
In particular, the pressure difference between the vertex and is
A streamline satisfies
Integration gives
The radius is smallest on the wedge bisector , where . Labelling that radius by therefore gives
Every streamline arrives from infinity along one wall, reaches its closest point on the bisector, and returns to infinity along the other wall:
For a velocity potential, . The incompressible flow condition therefore becomes Laplace equation . The Laplace equation in polar coordinates gives
so positivity of and requires
The velocity components are
The no-penetration boundary condition on both walls says at and , hence . If , changes sign inside the wedge. The stated sign condition therefore selects , and
Stokes theorem gives
For the upward orientation, the outer circle is counterclockwise from above and the inner circle is clockwise. On a counterclockwise circle of radius and height ,
The outer circle contributes . The inner circle would contribute counterclockwise and hence contributes with its induced clockwise orientation. Thus
agreeing with the direct calculation.
The surface is an annular band of the downward-opening paraboloid, bounded by the circles and . Choose the upward orientation.
Figure 1.
An annular surface cut from a paraboloid
. Details.
The curl of is
For the graph , the upward vector surface integral element is
Over the annulus , the odd term integrates to zero. Therefore

There are unlisted articles, also show them or only show them.