Take a variation , where the differentiable function obeys
because both and its first derivative have fixed endpoint values. The first variation of the functional is
Applying integration by parts once to the second term and twice to the third gives
The endpoint conditions on and make every boundary term zero. Since the remaining integral vanishes for every admissible variation, the fundamental lemma of the calculus of variations yields the higher-order Euler-Lagrange equation
Let on . If , the circle lies in that half-plane. The Cauchy derivative formula gives
The line segment joining to remains in , so
Thus one may take , as in the lipschitz bound inside a bounded analytic half-plane.
If (i) holds, the submodule theorem for free modules over a principal ideal domain says that any submodule is free. Its rank is at most , since tensoring the inclusion with embeds into . Hence has at most generators, proving (iv).
Conversely, apply (iv) with . Every ideal is an -submodule of and therefore has one generator, which is (i). Thus all four conditions are equivalent.
Assume (iii). Because is a Noetherian ring, every ideal is finitely generated. Regard as an -submodule of . By (iii), for some ; since unless , this is a principal ideal of . Thus every ideal is principal and (i) holds.
Together with the previous two implications, this proves (i), (ii), and (iii) equivalent.
Assume (ii), and let an -submodule be generated by . Choose a common nonzero denominator and write with . Repeated application of (ii) shows that
for one element : the gcd at each step is a linear combination of the elements processed so far. Therefore
so (iii) holds. This is the finite-ideal property defining a Bézout domain.
Assume (i). For , write the ideal . Then for some . Since , the element divides both; and every common divisor of divides the displayed linear combination . Thus is a greatest common divisor and (ii) holds.
True. Suppose are real and for an invertible complex matrix , with real. Taking real and imaginary parts gives
The polynomial is not identically zero, since . Choose a real outside its finite zero set. Then is real and invertible, and . Thus and are conjugate over , as stated by complex similarity of real matrices implies real similarity.
False. The real matrix
has the two distinct complex eigenvalues and , so it is diagonalizable over . It has no real eigenvalue and hence no real eigenbasis, so it is not diagonalizable over .
True. Since is invertible, every eigenvalue is nonzero. If had a nontrivial Jordan block , then for the stated positive integer ,
would still have a nonzero nilpotent part and could not be diagonalizable. Therefore all Jordan blocks of have size one. This also proves diagonalizability inherited from an invertible power.
False. At eigenvalue , algebraic multiplicity two and minimal-polynomial exponent two force one block . At eigenvalue , the blocks have total size five and largest size two, so there are only two possible partitions,
Hence there are exactly two conjugacy classes satisfying the given polynomial data, represented by
and
There cannot be three mutually non-conjugate examples.
True. By Jordan normal form, the characteristic polynomial records the total size of the blocks for each eigenvalue, while the minimal polynomial records the largest block for each eigenvalue. In dimension three this determines every block partition: for algebraic multiplicity three the possibilities , , and have largest block sizes three, two, and one; multiplicities one and two are equally immediate. Thus the two matrices have the same Jordan form and are conjugate. This is the characteristic and minimal polynomials determine similarity in dimension three phenomenon.
The null hypothesis is that mortality is independent of carbolic-acid use, equivalently that the two mortality probabilities are equal. The two-sided alternative is that they differ.
Use the Chi-squared test of independence, equivalently the likelihood-ratio statistic, with Pearson's statistic
where are the fitted counts under independence using the observed row and column totals. Under the null, is asymptotically . A size- test rejects when
For a null parameter space , the generalized likelihood ratio is
The Wilks theorem states, under standard regularity conditions and under the null, that
If has full column rank, then for every nonzero ,
Thus is positive definite and invertible, and the normal equation has the unique solution

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