7.2 Multilinear Alternating Forms
The previous section found that signed area obeys a
few rules: it is linear in each side separately, it
vanishes when two sides are equal, and swapping the
sides changes its sign. This section gives these rules
names for functions of
Throughout,
7.2.1. Multilinear forms
Signed area is not a linear function of the pair
A multilinear form is a function of several vectors that is linear in each vector while the others are held fixed.
A function
In words: fix all arguments except the one in
position
Some examples:
- Signed area. On
, is bilinear. For fixed , the map is a linear functional on , and for fixed , so is . - The dot product. On
, is bilinear, by the same one-slot check. - Products of functionals. If
, then is -linear: in position it is the linear functional multiplied by the fixed scalar . For instance, on , is bilinear, since evaluation at a point is linear (Theorem 0.8.5). - The degenerate case
. A -linear form is exactly a linear functional on . So multilinear forms generalize the dual space of Chapter 5.
Warning. Multilinear is not
linear. A bilinear form is not
a linear function of the pair. For the signed area
7.2.2. Alternating and skew-symmetric forms
The second rule of signed area was geometric: if two edges coincide, the parallelogram or box is flat. There are two natural ways to put this into algebra. One says the value is zero when two arguments are equal. The other says the value changes sign when two arguments are swapped. They look like two phrasings of one idea, but they are not the same, and we must choose.
An alternating form vanishes as soon as two of its arguments coincide.
A
A
In words: “alternating” asks for the value
Check that each of the following is an alternating form.
- (a) On
, for a fixed : . - (b) On
, for fixed coordinate indices : . - (c) On
: . - (d) On any
, with : any linear functional .
Solution.
(a) Bilinearity is the one-slot check above, multiplied by the constant
. With the only pair of positions is , and by commutativity in . So is alternating. For it is the zero form, which is alternating for the silly reason that it is zero everywhere; for it is the signed area of the previous section.(b) In each slot
is a linear functional, as in (a), and . Over these three forms are, up to sign and order, the components of the cross product: . This example shows that the number of arguments need not equal the dimension: here and .(c) Evaluation at
and at are linear in (Theorem 0.8.5), so for fixed the map is linear, and similarly in . Also . It is not the zero form: .(d) A linear functional is
-linear. With a single position there is no pair , so the alternating condition holds vacuously (Example (A vacuously true implication)). This degenerate case matters because it shows that “alternating” is purely a condition about pairs of positions; the interesting content starts at .
Now a non-example, by a minimal change of (a). Over
Quick check. Is
Solution. It is bilinear, but
neither. With
Why this definition. We chose “zero
when two arguments are equal” as the basic notion, and
in the form “any two positions”. There
are two reasons. First, it is what the picture says
directly: two equal edges make a flat box. Second, as we
prove next, it implies the swap rule over
every field, while the swap rule
implies it only when
7.2.3. Consequences of the alternating condition
Everything that elimination does to a determinant will come from the following theorem. Its four parts are the column operations of Chapter 3 seen through a form: swap two arguments, add a multiple of one to another, scale one, and the extreme case of a dependent list.
Let
- (a)
(Swap) Exchanging the arguments in
positions
and multiplies by . In particular, is skew-symmetric. - (b)
(Shear) For every
, replacing by does not change . - (c)
(Scaling) For every
, replacing by multiplies by . - (d)
(Dependence) If the list
is linearly dependent, then . In particular, if some .
Idea. Parts (a)–(c) involve at most
the two slots
Proof. Suppose first
(c) This is linearity of
in position : .(d) By linearity in the first slot of
and ,(e) By bilinearity of
, where the first and last equalities use . Hence , which is the swap statement. Since and were arbitrary, is skew-symmetric (Definition 7.2.3).(f) Suppose
is linearly dependent. By the Linear Dependence Lemma (Theorem 1.4.1), there is an index with . If , then , and by (c) with , . If , write with . By linearity of in position , In the -th term, the vector sits both in position and in position , so the term is because is alternating. Hence . The last sentence of (d) holds because a list containing is dependent. This proves the theorem.
For the determinant, (a)–(c) will be the rules for
column operations, and (d) explains at once why a matrix
with dependent columns must have determinant
7.2.4. Alternating versus skew-symmetric
Part (a) says alternating forms are skew-symmetric. The converse depends on the field.
Let
- (a) If
is alternating, then is skew-symmetric. - (b) If
is skew-symmetric and the characteristic of is not , then is alternating.
Proof.
(a) is Theorem 7.2.1 (a).
(b) Suppose
for some . Exchanging the arguments in positions and does not change the list, so skew-symmetry gives , that is, . If in , then while , so the smallest positive with would be , and the characteristic of would be (Definition 0.7.2). So , and multiplying by gives . Hence is alternating.
Warning. Skew-symmetric
does not imply alternating over
7.2.5. The space of alternating forms
Alternating forms can be added and scaled, and the result is again alternating. This is what makes the uniqueness question later in the chapter a question about dimension.
The
Proof. We use the Subspace Test (Theorem 1.2.1) twice.
The zero function is
Let
If moreover
For
7.2.6. Exercises
A. Check your understanding
- (a) Define an
alternating
-linear form on a vector space over . - (b) True or false: a
bilinear form
on with is alternating. Justify your answer. - (c) True or false:
every skew-symmetric bilinear form on
is alternating. Justify your answer. - (d) Let
be an alternating -linear form on and . What is ? - (e) Name the move that proves an alternating form changes sign under a swap.
Solution.
(a) A function
that is linear in each argument when the others are fixed (Definition 7.2.1), and satisfies whenever for some (Definition 7.2.2).(b) False. The form
is bilinear with , but . Checking the basis vectors is not enough, because the alternating condition is about all vectors.(c) True.
has characteristic , so Theorem 7.2.2 (b) applies.(d)
. The list is linearly dependent, since with coefficients not all zero. By Theorem 7.2.1 (d) the value is .(e) Put the sum of the two arguments into both positions, use
, and expand by linearity in both positions; the terms with equal arguments vanish and the two cross terms must cancel.
B. Practice
Determine which of the following functions are multilinear, and which of those are alternating. Justify your answer.
- (a)
, . - (b)
, . - (c)
, . - (d)
, . - (e)
, .
Solution.
(a) Multilinear and alternating: it is
from Example (Alternating Forms) (a) with .(b) Not multilinear. A linear functional sends
to , but at the map does not. So it is not an alternating form either; in any case its value at is .(c) Multilinear: in each position it is a coordinate functional times a fixed scalar, as for products of functionals. Not alternating: with
and , the value is .(d) By Theorem 0.9.6,
, so this is the zero function. The zero function is multilinear and alternating (Theorem 7.2.3). This is the degenerate case.(e) Multilinear:
and are linear, the second as a composition of differentiation (Example (Differentiation)) with evaluation (Theorem 0.8.5). So for fixed , is linear, and similarly in . Alternating: .
Let
Solution. Write
By Theorem 7.2.3 these
forms form a vector space, and we have just shown
For
Solution. Multilinear.
Each component of
Alternating. There are three pairs of
positions. If
Value.
C. Going deeper
Let
- (a) Prove that every
alternating
-linear form on with is the zero form. - (b) Deduce that the
only alternating
-linear form on is zero, and give a non-zero alternating -linear form on to show that the bound in (a) cannot be lowered to .
Solution.
(a) Let
be an alternating -linear form with , and let . By Theorem 1.6.3 (a), a list of length is linearly dependent. By Theorem 7.2.1 (d), . Since the vectors were arbitrary, is the zero form.(b) Here
, so (a) applies. For , the form of Example (Alternating Forms) (a) is alternating with .
- (a) Let
be a bilinear form on and write . Show that , and that conversely every choice of four scalars defines a bilinear form this way. Hence there are exactly bilinear forms on . - (b) Prove that a
bilinear form on
is skew-symmetric if and only if . How many are there? - (c) Prove that a
bilinear form on
is alternating if and only if and . How many are there? - (d) Over
, how do the analogous two sets of bilinear forms on compare? Justify your answer.
Solution.
(a) Expanding
and by linearity in each argument gives . Conversely, for any scalars , the function is linear in for fixed (a combination of the coordinates with coefficients ) and similarly in , and it takes the value at . So bilinear forms on correspond exactly to quadruples , and over there are .(b) In
, for every , so is skew-symmetric exactly when for all . Taking , gives . If , then for all , and . The entries and the common value are free, so there are skew-symmetric forms.(c)
If is alternating, then and , and , so . With and , . Only is free, so there are alternating forms. Hence skew-symmetric forms over are not alternating; (with , all others ) is one of them, as in the warning. A brute-force check of all forms against all pairs in gives the same counts, and .(d) Over
the two sets are equal. Alternating forms are skew-symmetric by Theorem 7.2.2 (a), and since has characteristic , skew-symmetric forms are alternating by part (b) of that theorem. Concretely, both conditions say and .