The second moment of area about an axis weights each element of cross-sectional area by its squared perpendicular distance from that axis. The ellipse extends farther along than along , so its material lies, on balance, farther from the axis. Therefore
With zero intrinsic curvature of an elastic filament, the respective bending moments required by the constitutive equation are and . Thus their magnitudes satisfy
for : bending about the minor axis is harder. Here is Young's modulus, and is the corresponding bending stiffness.
The right-handed material frame of a rod has and . Hence the director kinematics of a rod reduce to
Solving these constant-coefficient ordinary differential equations with the given initial frame gives
The inextensible rod has . An integration using yields, for ,
Indeed,
so the centreline is a circular arc of radius in the plane perpendicular to . The continuous limit is , , and .
The material frame of a rod obeys the director kinematics of a rod
In the stress-free reference configuration, the constitutive equation gives , , and , since all three stiffnesses are positive. Thus . Its cross product with vanishes, so
Consequently this director is a fixed vector in space, even though the other two directors rotate along the elastic rod.
Over the complex numbers, the fundamental theorem of algebra makes every irreducible polynomial factor equal to . Part (b)(iv) gives
with distinct eigenvalues. The primary decomposition theorem for linear maps consequently expresses as the direct sum of the actual eigenspaces , with no higher generalized eigenspaces needed. Part (ii) makes these summands mutually orthogonal.
Apply the Gram-Schmidt process to a basis within each eigenspace. Its linear combinations stay within that eigenspace, so all resulting vectors are still eigenvectors. Their union is orthonormal by part (ii) and spans by the primary decomposition theorem for linear maps. Thus
for an orthonormal basis of eigenvectors. This proves the finite-dimensional complex spectral theorem for normal operators by the requested decomposition argument.
Let and , with . By part (i) and the adjoint operator identity,
The last step uses conjugate-linearity in the second argument of the inner product. Therefore , proving the orthogonality of the two eigenspaces:
Take . It is a polynomial in the normal operator , so part (b)(iii) makes a normal operator. Also . If , part (b)(i), applied to , gives
The norm vanishes only at the zero vector, so
This is the adjoint eigenvector identity for a normal matrix expressed independently of coordinates.
Suppose some exponent . Define
Part (iii) makes a normal operator. For every , put . The minimal polynomial identity gives
Part (ii), applied to , forces . As this holds for every ,
This contradicts minimality: is a monic polynomial of smaller degree annihilating . Therefore the minimal polynomial of a normal operator is a square-free polynomial over either of the given fields:
This argument does not require the irreducible polynomials to be linear, so it also covers the real case.
For a polynomial , the defining identity and uniqueness of the adjoint operator give
Indeed, the adjoint operator of a sum is the sum of the adjoint operators, the adjoint of is , and the adjoint of a product is . Since the normal operator commutes with , each power of commutes with each power of . Multiplying the two finite sums therefore gives
Hence polynomials of a normal operator are normal, including constant polynomials.
Let . If , then , and part (i) gives . Thus and
The positive definiteness of the inner product gives . Since the reverse kernel inclusion always holds, we obtain
This is kernel stabilization for a normal operator.
For the normal operator , the adjoint operator identity and give
For the last equality, and complex conjugation allow reversal of the two arguments. Taking the nonnegative square roots proves
In particular the two kernels coincide.
If and both satisfy the defining identity of an adjoint operator, then
for every . Choosing gives . The positive definiteness of the inner product forces for every , proving
An adjoint operator of is a linear map satisfying
This identity transfers from the first input of the inner product to the second.
Put , including . The restriction of to has kernel , so the rank-nullity theorem gives
Likewise has kernel and hence image dimension . But , which implies
Comparing dimensions yields the required concavity of the kernel dimensions of powers of a nilpotent map:
Write , with . The minimal polynomial means and . Choose with . For each , set . Then
Thus . Also because applying to zero still gives zero. Therefore the kernel dimensions of powers of a nilpotent map increase strictly until the nilpotency index:
The same reasoning covers , when the nilpotent linear map is zero on a nonzero vector space.
We prove by mathematical induction on that every linear map on an -dimensional complex vector space admits both triangular forms. For or this is immediate. When , the fundamental theorem of algebra supplies an eigenvector ; its span is an invariant subspace.
By parts (ii) and (iii), has dimension and is an invariant subspace of the dual map . Apply the induction hypothesis to to choose a basis with an upper triangular matrix. Extend it by a linear functional satisfying . Such a functional exists by basis extension, and cannot belong to . In this basis of , the matrix of has the form
where is an upper triangular matrix; here the last diagonal entry follows by evaluating at , where .
There is a basis of with , since the dual basis construction gives a finite-dimensional bidual evaluation map isomorphism. In particular . The matrix transpose relationship for a dual map gives
a lower triangular matrix. Reversing this basis turns a lower triangular matrix into an upper triangular matrix. If is the permutation matrix reversing the order, we have proved
This completes the induction by triangularization using dual spaces.
Suppose is an invariant subspace for . For and , the dual map satisfies
because and the annihilator of a vector subspace consists of the linear functionals vanishing there. Thus
This is the correspondence between invariant subspaces and annihilators.
For a vector subspace , its annihilator of a vector subspace is
Let and . Extend a basis of to a basis of , and let be the dual basis. Every linear functional has the unique expression . It belongs to precisely when its first coefficients vanish. Consequently
The listed dual basis elements are linearly independent, so counting them proves the formula, including and .
The dual space is the vector space of all linear functionals on :
Addition and scalar multiplication are defined pointwise. The dual map sends an output measurement back along :
The function composition of these linear maps is linear, and is linear in . This is the algebraic dual map, so its definition involves no complex conjugation or inner product.
All calculations here take place in the finite field . For the given matrix , its characteristic polynomial is
The values are , so this quadratic polynomial has no polynomial root in and is an irreducible polynomial. Direct calculation gives
Neither nor is zero. The Cayley-Hamilton theorem says that the minimal polynomial divides ; its proper monic polynomial divisors cannot annihilate , so .
The two kernels give the required primary decomposition theorem for linear maps explicitly:
The determinant of the matrix with these three basis vectors as columns is in , proving . To check these are invariant subspaces, writing and gives and . Hence the matrix of the restriction to in the basis is
with minimal polynomial ; the nonzero vector space has zero restriction and minimal polynomial .
The primary decomposition theorem for linear maps starts with a linear map on a finite-dimensional vector space over a field . Factor its minimal polynomial as
where the are distinct monic polynomials that are irreducible polynomials and . Define . Then
Thus the direct sum separates the irreducible polynomial factors into uniquely determined invariant subspaces. The statement works even when the minimal polynomial does not split into linear polynomials over .

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