The dual is
which is in standard maximization form after adding nonnegative slack variables. The simplex pivots first introduce the variable with coefficient seven and then the remaining payoff column; the optimum occurs where both constraints bind:
Thus and the dual value is . Complementary slackness gives . Hence and the normalized optimal strategies are
Every payoff is positive, so every pair of mixed strategies has positive expected payoff and the game value satisfies . Player 1 maximizes subject to , , . Setting turns these into
Maximizing is therefore equivalent to the stated minimization of .
A pure optimum is a saddle point: an entry minimal in its row and maximal in its column. In , at is a saddle; in , at is a saddle. Matrix has row maximin and column minimax , so no saddle exists. Thus
A two-player zero-sum game has a payoff gained by one player and lost by the other. A pure strategy chooses one action deterministically; a mixed strategy is a probability distribution over pure actions.
The null value is interior and the model is regular. Wilks theorem therefore gives
under the null, because the alternative adds one free parameter. An asymptotic size- test rejects when
For known , the likelihood ratio of to is
which increases with . Reject for , with randomization at chosen so that the null rejection probability is exactly . Since the zero indicators form a Bernoulli family with success probability increasing in and have a monotone likelihood ratio in , the Karlin-Rubin theorem makes this test uniformly most powerful for .
A statistic is sufficient when the conditional law of the sample given it is parameter-free; it is minimal sufficient when it is a function of every sufficient statistic. The likelihood factors as
so the factorization theorem makes sufficient. The likelihood-ratio criterion shows that the ratio for two samples is parameter-independent exactly when both and agree. Thus
The Time-dependent Schrödinger equation is . Differentiate , use the equation and its adjoint, and include explicit time dependence of the operator. This gives Ehrenfest theorem
The standard contour transform
holds for , with the appropriate upper or lower pole chosen according to the sign of . Therefore
The Euler-Lagrange equation is
Put , , and . The conditions at zero reduce the general solution to
Define
The remaining boundary conditions give
which determines the unique extremal explicitly.
Differentiate
The product rule cancels all terms except
On an extremal with no explicit dependence both terms vanish, proving the stated conserved quantity.
For variations with at both endpoints, integrating the term once and the term twice gives
The fundamental lemma yields the higher-order Euler-Lagrange equation
The first three initial values vanish and the third derivative at zero equals one. Transforming the differential equation gives
so . Hence
The transform factors as , whose inverse factors are and . The Laplace convolution theorem gives
and direct integration produces
confirming part (b).

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