Print this page and work through it on paper. Revealed answers are never printed, so you can check one question and still print a clean sheet.
Linear Algebra · Chapter test
Inner Product Spaces
Work this sheet on paper and show every step: an inner-product computation is checked by its route, not its final number, and the solutions are written so you can compare routes. Name every result you use (“by Cauchy–Schwarz”, “by the Pythagorean theorem”, “by the best-approximation theorem”) and, before you apply a formula that needs an orthogonal or orthonormal basis, say why the basis in your hands qualifies. No calculator is needed anywhere — every answer is an exact fraction, surd or multiple of . Full worked solutions are on a separate page; each question also has its own reveal, so you can check one answer without seeing the rest.
- 1.Computation · 7 min
For each candidate below, decide whether it is an inner product. If it is, verify all four axioms, treating positive definiteness with particular care. If it is not, exhibit a specific vector that breaks a named axiom.
- (a)On : .
- (b)On : .
- (c)On (polynomials of degree at most ): . Then explain what goes wrong if the same formula is used on , and propose the smallest repair.
Show the solution to question 1
(a) An inner product. Symmetry: swapping and turns into , the same expression, and the two square terms are visibly symmetric. Additivity and homogeneity in the first slot hold because every term is a product of exactly one coordinate of with one coordinate of , and each such product is linear in . For positive definiteness complete the square:
A sum of two nonnegative terms, so ; and it is only if and , i.e. only if . All four axioms hold.
(b) Not an inner product. Symmetry and bilinearity hold for the same reasons as in (a), so the only candidate for failure is positive definiteness, and it does fail: with ,
A nonzero vector with negative "squared length" violates axiom 4. (Note , so the form is neither positive nor negative — it is indefinite, and no rescaling rescues it.)
(c) An inner product on . Evaluation at and differentiation are both linear, so and are linear maps, and is a sum of products of one linear functional of with one of : bilinear and symmetric. For positivity write ; then and , so
with equality only when , i.e. . Axiom 4 holds.
On the same two numbers no longer determine the polynomial: has and , so although . Positive definiteness collapses and we have only a semi-inner product. The smallest repair is to add one more independent functional, for instance : for this gives , which vanishes only for . The moral matches the sampling example: a formula is an inner product exactly when the quantities it reads off are enough to pin the vector down.
- 2.Computation · 6 min
Work in with , and let and .
- (a)Compute , and , and confirm that the three numbers are consistent with Cauchy–Schwarz.
- (b)Compute the distance directly from the definition, and then again from the expansion . The two routes must agree.
- (c)Normalise . Then say, without integrating again, what the normalisation of is, and which property of the norm decides it.
Show the solution to question 2
(a) Three integrals.
So and . Cauchy–Schwarz demands , i.e. . Squaring, , which is true — and only just, which is reasonable because and are both increasing on and "agree" strongly.
(b) Distance two ways. Directly, , so
By the expansion, as well. Hence . Sanity check: on , so the distance must be below , and is.
(c) Normalising. From (b), , so
For : the norm is homogeneous, , so and
The absolute value in the homogeneity rule is what makes the sign survive: normalising a vector keeps its direction and forgets only its length, so scaling by a negative number flips the unit vector.
- 3.Proof · 8 min
Each part is an application of the Cauchy–Schwarz inequality or of one of its corollaries. In every case say which inner product space you are working in and which two vectors you are applying the inequality to.
- (a)Let be real numbers with . Prove that , and determine exactly when equality holds.
- (b)Suppose and in some inner product space. Find the largest and smallest values that can take, prove your bounds, and give a choice of (in terms of ) attaining each.
- (c)Let be continuous and strictly positive on . Prove that , and identify the functions for which equality holds.
Show the solution to question 3
(a) Work in with the dot product and take , . Then , and . Cauchy–Schwarz gives
and squaring, . Equality in Cauchy–Schwarz holds exactly when and are linearly dependent, i.e. ; the constraint then forces . So equality holds precisely for , and indeed .
(b) Upper bound: by the triangle inequality applied to and ,
Lower bound: by the reverse triangle inequality, . Both are attained. Take : then and . Take : again , and . So the range of possible values is exactly (every value between is reached by rotating continuously from one position to the other, but the question only asks for the extremes).
(c) Work in with . Because and continuous, both and are continuous, so they are legitimate vectors. Their inner product is
while and . Cauchy–Schwarz, , reads
which is the claim. Equality holds iff and are linearly dependent, i.e. for a constant , i.e. is constant. Sanity check with : the left factor is and the right is , product , and strictly greater because is not constant.
- 4.Computation · 7 min
Three short exercises on angle, orthogonality and the parallelogram law.
- (a)In with the trace inner product , find the angle between and the identity matrix .
- (b)In with , find the constant for which is orthogonal to . Then verify the Pythagorean theorem for this and by computing all three of , and .
- (c)On , the function is a norm (you may assume this). Show that it is not induced by any inner product, and name the theorem that licenses the conclusion.
Show the solution to question 4
(a) The trace inner product is the entrywise dot product, so . The norms are and . Therefore
(Geometrically: as vectors in , and , and is "half of" in two of the four coordinates.)
(b) Orthogonality requires
With and :
and , so
Since , the Pythagorean theorem is confirmed — as it must be, since the cross term was arranged to vanish.
(c) Every norm induced by an inner product satisfies the parallelogram law , so a norm that violates it cannot be induced by one. Test , . Then , while and both have , whose square is . So
The two sides differ, so the parallelogram law fails and is not induced by any inner product. Only the -norm among the -norms passes this test, which is why Euclidean geometry is special.
- 5.Sketch · 8 min
Equip with the weighted inner product , and write for the norm it induces. Draw everything on one pair of axes, labelled, and justify each feature with an equation or an inner-product computation. A picture without the computations beside it earns nothing.
- (a)Sketch the unit circle of this inner product, with the ordinary Euclidean unit circle drawn dashed for comparison.
- (b)Show that and are orthogonal for , draw them, and compute the Euclidean angle between them to make clear that they are not perpendicular in the ordinary sense.
- (c)Draw the line of all vectors -orthogonal to and, for contrast, the line of all vectors Euclidean-orthogonal to .
- (d)Explain the whole picture at once: find a linear map with for all , and say what it does to each of the features drawn in (a)–(c).
Show the solution to question 5
(a) The unit "circle" is an ellipse. By definition , so the unit circle is the curve
an ellipse centred at the origin crossing the horizontal axis at and the vertical axis at . It lies inside the Euclidean unit circle except at , where the two curves touch: a vertical displacement is charged four times as heavily as a horizontal one, so vertical unit vectors are shorter on the page. Draw the ellipse solid and the Euclidean circle dashed.
(b) A pair that is orthogonal but does not look it.
so . Their Euclidean dot product is ; with the Euclidean angle satisfies , about . Draw both arrows from the origin — rising to the right, falling to the right, symmetric about the horizontal axis — and label the angle between them . Their -lengths are .
(c) Two different perpendicular lines. The vector is -orthogonal to iff , i.e. iff : a line through the origin of slope . Euclidean orthogonality to is , the line of slope . Draw the arrow and both lines, labelled by their equations. Notice the -perpendicular is much flatter: to cancel the heavily-weighted second coordinate you need only a quarter as much of it.
(d) The stretch that explains everything. Take . Then
So carries the weighted inner product to the dot product: every -length, -angle and -orthogonality is the Euclidean one after stretching the plane vertically by a factor . Equivalently, the sketch is the ordinary Euclidean picture squashed vertically by . Check each feature: sends the ellipse onto the unit circle; it sends and to and , which are visibly perpendicular; and it sends to , whose Euclidean perpendicular direction is , which pulls back under to — slope , exactly the line drawn in (c). Every weighted inner product with positive weights is a Euclidean inner product viewed through such a stretch; that is why none of the theorems of the chapter can tell the two apart.
- 6.Computation · 10 min
Work in with . Keep every coefficient as an exact fraction, and check each new vector against an earlier one before moving on.
- (a)Apply Gram–Schmidt to (in that order) to produce an orthogonal basis , and compute .
- (b)Normalise to obtain an orthonormal basis of .
- (c)Without any further integration, write down the orthogonal projection of onto and the distance from to . Explain which feature of the Gram–Schmidt construction makes both immediate.
Show the solution to question 6
(a) Gram–Schmidt. Start with , and .
For : , so
For we need two inner products: and
Hence
Check against both earlier vectors: and ; orthogonality to and to gives orthogonality to . Good.
For the norm, the cheapest route uses orthogonality: since and ,
(Expanding and integrating term by term gives as well.)
(b) Normalising. . Next , so . Finally , so
Check: . Three orthonormal vectors in the -dimensional space form an orthonormal basis.
(c) Projection and distance for free. Gram–Schmidt subtracts from precisely its projection onto , and that span equals by the span property of the algorithm. So the subtracted part is the projection:
and the leftover is the residual, which is orthogonal to . By the best-approximation theorem the distance from to is the length of that residual:
Sanity check: is the line that best fits the parabola on in mean square. It passes through and , undershooting at both ends and overshooting in the middle, which is what a balanced fit to a convex curve should do.
- 7.Computation · 10 min
Work in with . You may take as known that Gram–Schmidt applied to produces , , , with .
- (a)Carry out the next Gram–Schmidt step to find , using parity to avoid every integral that must vanish. Rescale so that the result takes the value at ; this is the Legendre polynomial .
- (b)Find all the roots of and confirm that they behave as the theorem on roots of orthogonal polynomials predicts. State carefully why that theorem applies to — in particular why is orthogonal to every polynomial of degree at most , not merely to , and .
- (c)The two-point Gauss rule uses the roots of as its nodes and is exact for every polynomial of degree at most . Test it on and on , and report the first degree at which it fails.
Show the solution to question 7
(a) The step for . Gram–Schmidt says
On the symmetric interval the integral of an odd function is zero. The products and are odd, so without computation. Only the middle term survives:
Check: . Since , rescale by :
(b) Roots. Factor: , so the roots are
Three distinct real roots, all strictly inside — exactly what the theorem promises for a degree- polynomial orthogonal to all polynomials of lower degree.
Why the hypothesis holds: by construction is orthogonal to each of , and by the span property of Gram–Schmidt, . A vector orthogonal to a spanning set of a subspace is orthogonal to the whole subspace (only the span matters), so , and hence its multiple , is orthogonal to every polynomial of degree at most . That is the full hypothesis of the theorem.
(c) Testing the two-point rule. For the exact integral is , and the rule gives . Exact, as promised for degree . (Degree is exact too, trivially: any odd integrates to and the rule returns .)
For the exact integral is , but the rule gives . Since , exactness first fails at degree , one beyond the guarantee. The pattern — nodes at the roots of give exactness up to degree — is what makes the roots of orthogonal polynomials the sample points of choice in numerical integration, and part (b) is the reason those roots are real, distinct and inside the interval, as sample points must be.
- 8.Proof · 10 min
Let and be subspaces of a finite-dimensional inner product space . Recall that .
- (a)Prove that . Which hypotheses, if any, does this part actually use?
- (b)Deduce that . Name each theorem you invoke and say where finite-dimensionality enters.
- (c)In with the dot product, let and . Compute and separately, confirm they agree, and check the dimensions against the decomposition theorem.
Show the solution to question 8
(a) Two inclusions.
. Let , so for every . Every is in (write , using ), so for all : . Symmetrically . Hence .
. Let and let , say . By additivity in the second slot,
so .
This part uses only that and are subspaces (so that and ) and the bilinearity of the inner product. Finite-dimensionality is not used anywhere, and the argument is valid in any inner product space.
(b) Apply (a) to the subspaces and (each is a subspace, since every orthogonal complement is):
where the last equality is the double-complement corollary , valid because and are finite-dimensional. Now take orthogonal complements of both sides:
The left side is by the double-complement corollary once more, applied to the finite-dimensional subspace . Hence .
Finite-dimensionality enters exactly twice, both times through the double complement, which in turn rests on the orthogonal decomposition theorem . Part (a) needed neither.
(c) A vector lies in iff it is orthogonal to a spanning set of , i.e. to both and :
From the second, ; substituting, . So .
Separately, is the plane and is the plane ; their intersection is the solution set of the same two equations, again . The two computations agree, as (a) says they must. (Sanity check: and .)
Dimensions: and are independent, so , and the decomposition theorem predicts . Correct. Note also , which is fine: two planes through the origin in always share a line, and that line is the answer.
- 9.Computation · 10 min
Work in with , and let . The aim is the polynomial of degree at most that best approximates in the least-squares sense. Split every integral of at , or use symmetry.
- (a)Verify that is an orthogonal basis of , record the three squared norms, and explain why the projection formula may not be applied to the basis instead.
- (b)Compute , giving the answer as a polynomial in with exact coefficients.
- (c)Compute the minimum error exactly, without integrating directly. Then check that the residual is orthogonal to the constant function , and compare the error with that of the best constant approximation.
Show the solution to question 9
(a) The basis. Pairwise inner products: and , both because the integrand is odd; and
Three pairwise orthogonal nonzero vectors are independent, and has dimension , so they form a basis. Squared norms:
The formula is derived from the orthogonal decomposition and is only valid when the are pairwise orthogonal. The basis is not: . Applying the formula to it would produce some element of , but not the nearest one, and the residual would fail to be orthogonal to .
(b) The projection. Three inner products with , which is even:
Therefore
since and . Sanity check: sits a little above the corner at , and a little above the endpoints — a parabola cannot make a corner, so it overshoots at the ends to sink toward it in the middle.
(c) The error. Since and , the Pythagorean theorem gives . Here , and by the coordinate formula for an orthogonal basis
Hence
Residual check: . Good.
The best constant is the projection onto , namely (the mean of ), with squared error . Admitting contributes nothing, because is even; admitting cuts the squared error from to , a factor of . That drop is the coefficient in the Bessel sum above — the energy of that lives in the direction.
- 10.Critique · 9 min
A student, working in with and , submits the following.
Step 1. The functions and are orthogonal in , so Bessel's inequality applies to the set .
Step 2. Integrating by parts, and .
Step 3. So the Bessel sum is , whereas . Since , Bessel's inequality is false.
Bessel's inequality is a theorem. Find the error.
- (a)Identify the step that is wrong, state precisely which hypothesis of Bessel's inequality has been ignored, and write down the correct form of the inequality for a set that is orthogonal but not orthonormal.
- (b)Verify the two integrals in Step 2 by integration by parts, then compute the correct Bessel sum and confirm that the inequality holds.
- (c)Interpret the deficit as a squared distance, saying to what. Then explain what the deficit tends to as are added one by one, and why adding the cosines as well would change nothing.
Show the solution to question 10
(a) Step 1 is the error. Bessel's inequality requires the set to be orthonormal, not merely orthogonal. Here , so neither vector is a unit vector, and the coefficients are not the coordinates the theorem is about. Steps 2 and 3 are arithmetically fine; they compute the wrong quantity.
For an orthogonal set of nonzero vectors, normalise first: gives , and Bessel's inequality becomes
The missing denominators are exactly what inflated the student's sum by a factor of .
(b) Checking the integrals. Both integrands are even, so integrate over and double. With , :
For this is , so ; for it is , so . Step 2 is correct.
The correct Bessel sum divides each square by :
and because . The inequality holds, with room to spare.
(c) The deficit. Let . The Bessel sum is , and the Pythagorean theorem gives , so the deficit
is the squared distance from to — the least-squares error of the best approximation to by a combination of and .
Adding , , … enlarges , so the distance can only decrease, and the Bessel sum grows to . By Parseval's identity for the trigonometric system, with , which is the statement , i.e. . So the Bessel sum tends to and the deficit tends to : the sines alone capture all the energy of .
The cosines add nothing because is odd and is even, so for every : every cosine coordinate of is zero, and enlarging by directions in which has no component leaves the projection, hence the deficit, unchanged.
- 11.Proof · 11 min
Work in with the standard inner product , and let and .
- (a)Compute and , and check that they are conjugates. Then compute and , and explain why they differ.
- (b)Show that even though and are not orthogonal, and identify exactly which quantity the Pythagorean identity controls over .
- (c)Let . Show that is unitary by checking its columns, write down , and verify for the vector above.
- (d)Prove: if is skew-Hermitian (), then is purely imaginary for every , and consequently every eigenvalue of is purely imaginary.
Show the solution to question 11
(a) Conjugate symmetry and sesquilinearity. Conjugate the second argument:
Conjugate symmetry holds. Scalars come out of the first slot as they are and out of the second slot conjugated:
They differ because the inner product is linear in the first slot but only conjugate-linear in the second — sesquilinear, not bilinear. Over the two would coincide.
(b) Pythagoras without orthogonality. and . Also , so
Yet , so and are not orthogonal. The explanation is the complex expansion : the Pythagorean identity holds iff , and . Over the identity controls only the real part of the inner product, so the converse of the Pythagorean theorem fails.
(c) A unitary matrix. The columns are and . Norms: and likewise . Inner product, conjugating the second column:
Orthonormal columns are one of the equivalent characterisations of a unitary matrix, so is unitary. Its adjoint is the conjugate transpose,
and one can confirm . For the norm check, , so , as a unitary matrix guarantees.
(d) Skew-Hermitian means purely imaginary. Using conjugate symmetry, then the defining property of the adjoint, then :
A complex number equal to the negative of its own conjugate has zero real part, so is purely imaginary. Now let be an eigenvalue with eigenvector , so . Then
with real by positive definiteness. A purely imaginary number divided by a positive real is purely imaginary, so .
This is the mirror image of the Hermitian case, where the same three lines give and real eigenvalues. Sanity check: is real skew-symmetric, hence skew-Hermitian, and its eigenvalues are .
- 12.Computation · 12 min
Work in with , and let be differentiation, . The goal is the adjoint , defined by for all .
A student argues: "In the basis we have and , so the matrix of is . The matrix of the adjoint is the transpose, , so and ; that is, ."
- (a)Show by a single explicit pair that is not self-adjoint.
- (b)Show by a single explicit pair that the student's formula for is wrong, and state which hypothesis of the matrix-of-the-adjoint theorem the argument violates.
- (c)Compute correctly: use the orthonormal basis , , find the matrix of in it, take the conjugate transpose, and convert back to a formula
- (d)Verify your formula against the defining identity for general and , and confirm that .
Show the solution to question 12
(a) Not self-adjoint. Take and . Then , while . Since , the identity fails and .
(b) The student's fails. Take . The defining identity would need . The left side is ; with the student's the right side is . They disagree, so the formula is wrong.
The theorem "the matrix of is the conjugate transpose of the matrix of " holds only when both matrices are taken with respect to orthonormal bases; its proof reads off matrix entries as inner products, , and that identification needs orthonormality. The basis is neither orthogonal () nor normalised (), so transposing its matrix means nothing.
(c) The correct adjoint. First confirm the basis: ; ; and . Orthonormal, and two vectors in a -dimensional space form a basis.
Apply : and . So, columns being coordinate vectors of the images,
(real entries, so conjugation does nothing). Reading the columns: and .
To convert, expand in the orthonormal basis by taking inner products: , and
Hence , and by linearity
So , or more memorably : the adjoint of differentiation records the mean of and spreads it along the direction orthogonal to the constants.
(d) Verification. With , and
On the other side, using and ,
The two sides agree for all , so this really is the adjoint, and by uniqueness it is the only one.
Kernel and image: is the constants, , so . From the formula, iff iff . The two sets coincide: , as the kernel–image proposition for adjoints predicts. (Likewise , which is , the one-dimensional space of mean-zero polynomials.) The student's formula, by contrast, has , which is not orthogonal to the constants — a second way to see it was wrong.
Solutions: calc-path.com/linear-algebra/test/inner-product-spaces/answers