Scribd
Upload
22 views2 pages

Linear Algebra Homework Solutions

The document contains a series of exercises from a homework assignment focused on linear algebra concepts, including linear functionals, differentiation operators, and properties of matrices. Key results include the null space of the transpose of differentiation operators and the isomorphism between linear operators on finite-dimensional vector spaces. Additionally, it addresses properties of skew-symmetric, orthogonal, and unitary matrices, including determinants and examples.

Uploaded by

Nikita Pathania
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views2 pages

Linear Algebra Homework Solutions

The document contains a series of exercises from a homework assignment focused on linear algebra concepts, including linear functionals, differentiation operators, and properties of matrices. Key results include the null space of the transpose of differentiation operators and the isomorphism between linear operators on finite-dimensional vector spaces. Additionally, it addresses properties of skew-symmetric, orthogonal, and unitary matrices, including determinants and examples.

Uploaded by

Nikita Pathania
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Homework assignment 8

Section 3.7 pp. 115


Exercise 2.
Let V be the vector space of all polynomial functions over the field of real
numbers. Let a and b be fixed real numbers and let f be the linear functional on
V defined by
Z b
f (x) = p(x)dx
a

If D is the differentiation operator on V , what is Dt f ?


Solution: By the fundamental theorem of calculus, we get:
Z b
t
D f (q) = f (D(q)) = q 0 (x)dx = q(b) − q(a)
a

Exercise 3. Let V be the space of all n × n matrices over a field F and let B be
a fixed n × n matrix. If T is the linear operator on V defined by T (A) = AB − BA
and if f is the trace function, what is T t f ?
Solution: Using the result from the previous hw. tr(AB) = tr(BA) we get:

T t f (A) = f (T (A)) = tr(T (A)) = tr(AB − BA) = tr(AB) − tr(BA) = 0

Exercise 6. Let n be a positive integer and let V be the space of all polyno-
mial functions over the field of real numbers which have degree at most n, i.e.,
functions of the form
f (x) = c0 + . . . + cn xn
Let D be the differentiation operator on V . Find a basis for the null space of the
transpose Dt .
Solution: Since (Dt )t = D (not equal, but canonically identified, dim V < ∞),
using theorem 22 we get that the range of D = (Dt )t is the annihilator of the
null space of Dt . But we know from the last Hw that the range of D consists
of all polynomials of degree strictly less than n. Therefore, the null space of Dt
consists of all functionals which vanish on polynomials which only contain terms
of degree n. A basis for this space is {f } where f (c0 + · · · + cn xn ) = cn . The explicit
calculation done in the recitation yields the same result.
Exercise 7. Let V be a finite dimensional vector space over the field F . Show
that T 7→ T is an isomorphism of L(V, V ) onto L(V ∗ , V ∗ ).
t

Solution: Let φ : L(V, V ) → L(V ∗, V ∗) be given by φ(T ) = T t. Using the definition


of the transpose we get that φ is linear. At this point we can either check that
φ is one to one and onto or find an inverse for φ. Let us do the latter. Using
the canonical identification of V with (V ∗ )∗ (here is where we use the fact that
V is finite dimensional) we define ψ : L(V ∗ , V ∗ ) → L((V ∗ )∗ , (V ∗ )∗ ) = L(V, V ) by the
formula ψ(S) = S t . Using the definitions and the canonical identification we get
that ψ ◦ φ = Id and φ ◦ ψ = Id

1
Section 5.2 pp. 149
Exercise 5. Let A be a 2 × 2 matrix over a field F ., and suppose that A2 = 0.
Show for each scalar c that det(cI − A) = c2
Solution: Multiplying cI − A times A we get A(cI − A) = cA − A2 = cA, therefore
det(A) det(cI − A) = c2 det(A)
µ ¶
x y
so if det(A) 6= 0 we get the result. Suppose now that det(A) = 0 and A = .
z w
Then det(cI − A) = c2 − c(x + w) + det(A) = c2 − c(x + w). Notice that since det(A) = 0
0 = tr(A2 ) = (x + w)2 therefore x + w = 0 and we get the identity.
Section 5.4 pp. 162-163
Exercise 3. An n × n matrix A over a field F is skew-symmetric if At = −A.
If A is a skew-symmetric n × n matrix with complex entries and n is odd, prove
that det(A) = 0
Solution: We know that det(A) = det(At ) and that det(cA) = cn det(A). Thus,
since n is odd det(A) = det(At ) = det(−A) = det((−1)A) = (−1)n det(A) = − det(A)
therefore 2 det(A) = 0, but over C this implies that det(A) = 0

Exercise 4. An n × n matrix over a field F is called orthogonal if AAt = I. If


A is orthogonal show that det(A) = ±1. Give an example of an orthogonal matrix
for which det(A) = −1

Solution: Since det(A) = det(At), we get det(I) = det(AAt) = det(A) det(At) =


det(A)2 = 1. Therefore det(A) = ±1. An example with determinant equal to −1 is:
µ ¶
0 1
A=
1 0

Exercise 5. An n × n matrix A over the field of complex numbers is said to


be unitary if AA∗ = I (A∗ denotes the conjugate transpose of A). If A is unitary,
show that | det(A)| = 1.
Solution: Notice that if p(x) is a complex polynomial p(x̄) = p(x) (taking the
conjugate commutes with taking sums and products). Therefore det(A) = det(A)
(the determinant is a polynomial in the entries of the matrix). Thus, we get
t
det(A∗ ) = det(A ) = det(A) = det(A). This implies that 1 = det(I) = det(AA∗ ) =
det(A) det(A∗ ) = det(A)det(A) = | det(A)|.

Common questions

Powered by AI

Linear operators on matrix spaces, such as T(A) = AB - BA, leverage trace properties (e.g., tr(AB) = tr(BA)), resulting in zero trace operation outcomes. Conversely, polynomial function spaces use differentiation and integration properties (e.g., null spaces of Dt) to assess transformation impacts .

For an orthogonal matrix, AAt = I, implying det(A)^2 = 1, so det(A) must be ±1. An example of an orthogonal matrix with det(A) = -1 is A = [0 1; 1 0].

For a 2x2 matrix A where A^2 = 0, multiplying A by cI results in det(cI - A) = c^2. This occurs because det(A) det(cI - A) = c^2 det(A), and if det(A) = 0, det(cI - A) is simplified to c^2, due to the trace condition x + w = 0 from det(A) = 0 .

Since V is finite dimensional, the map φ: L(V, V) → L(V*, V*) defined by φ(T) = Tt is linear, and using canonical identifications, we can define ψ: L(V*, V*) → L(V, V) by ψ(S) = St. We find ψ ◦ φ = Id and φ ◦ ψ = Id, thus establishing the isomorphism .

The trace function is invariant under cyclic permutations, so for T(A) = AB - BA, we have tr(AB) = tr(BA). Therefore, the trace of T(A) is tr(AB - BA) = tr(AB) - tr(BA) = 0 .

Skew-symmetric matrices with odd n have det(A) = 0 due to A^t = -A asymmetry. Orthogonal matrices, satisfying AAt = I, yield ±1 determinants, relating to volume-preserving transformations with possibly negated orientation .

The null space of Dt consists of all functionals which vanish on polynomials containing only terms of degree n, while the range of D includes polynomials of degree strictly less than n. Hence, a basis for the null space of Dt is {f}, where f(c0 + ... + cn xn) = cn .

By the fundamental theorem of calculus, the operator Dt applied to f, where f is defined as f(p) = ∫_a^b p(x) dx, results in Dt f(q) = f(D(q)) = ∫_a^b q'(x) dx, which equals q(b) - q(a).

For unitary matrices, where AA*=I, the property of taking determinants gives det(AA*) = det(A)det(A*) = |det(A)|^2 = 1, leading to |det(A)| = 1 .

A skew-symmetric matrix A satisfies A^t = -A. For odd n, det(A) = (-1)^n det(A) leads to det(A) = -det(A), implying 2det(A) = 0, thus det(A) = 0 .

You might also like