Section 02 built the space . A
construction on spaces is worth little until it acts on
maps as well: the philosophy of the whole book has been
objects first, then the maps between them. So given
and , we want a single map built from the two. This section builds
it, computes its matrix, and discovers that the matrix
is the Kronecker product of Chapter 8 — which pays both
of the debts that Chapter 8 §04 left open. It ends with
the identification , which every later
section of the chapter uses.
A map on
each factor gives a map on the product
The definition writes itself, and that is the danger.
We want a map that sends to , so the temptation is to write
“Define , and
extend linearly.”
Nothing in that sentence is a definition. Simple
tensors span (Proposition 15.2.4), but
they do not exhaust it, and worse, the expression of an
element as a combination of them is wildly non-unique:
, and . A formula
prescribed on simple tensors may therefore assign two
different values to one element, and then it defines
nothing at all. Here is a formula that really does fail.
Try to define by . Taking gives (Proposition 15.2.8), so
would have to
send to every
at once.
To build a map out of , never write
a formula on simple tensors: write down a bilinear map
and let the universal property produce the linear
one.
That is the discipline of this chapter, and applied
here it costs three lines.
Theorem
15.3.1 (Tensor Product of Two Linear
Maps)
Let be vector spaces over , and let and
. Then there is exactly
one linear map with for all
and .
Idea. The assignment is bilinear, because and are linear and is bilinear in
its two slots. A bilinear map out of is exactly
what the universal property consumes, and what it
returns is a unique linear map out of . There is
nothing else to check.
Proof. Define by . Fix . The map is the composite of
, which is linear,
with the map , which is linear because the map
of Definition 15.2.1 is
bilinear, hence linear in its first slot with the second
slot held fixed. A composite of linear maps is linear
(Theorem 2.4.2), so
is linear in
its first argument. Fixing instead and swapping
the roles of the two slots gives linearity in the
second. Hence
is bilinear.
By the universal property in Definition 15.2.1 there is
a unique linear with for all . This proves both
existence and uniqueness.
Uniqueness is what licenses a name.
Definition
15.3.1 (Tensor product of linear maps)
Let and . The tensor
product of and is the unique linear
map of Theorem 15.3.1,
characterized by
The symbol now has three
jobs — a space, a vector, a map — and they agree: applied to
is
,
which is the only thing the notation could mean.
Examples.
- The identity. sends
to
, and
so does . Both are linear and both are the
factorization of the same bilinear map, so by the uniqueness clause.
Degenerate, and used in almost every proof below.
- Acting on one slot. sends
to
: it
does in the first
slot and leaves the second alone. If and is differentiation,
is
“differentiate the first factor”.
- Scalars. For , sends to , so it is
. In particular a scalar may be moved from
one slot to the other, which is the map-level shadow of
.
- Zero. If , then , so . The
converse also holds; see Exercise (C1: When a tensor product of maps vanishes).
Non-example by minimal change. Keep
and linear, but try to send
to
. This one is legitimate: the
assignment is a sum of two
bilinear maps, hence bilinear, and the universal
property applies. What is not legitimate is for a fixed non-zero : the added constant destroys linearity
in each slot, so no linear map on does this,
and indeed the prescription contradicts itself at . The exact clause
that fails is bilinearity, and it fails for the same
reason as in the map above.
We will lean repeatedly on the following consequence
of the uniqueness clause. It replaces the phrase “and
extend linearly”, which we are not allowed to use.
Lemma
15.3.2 (Simple Tensors Determine a Map)
Let be a
vector space over
and let be linear. If for all and , then .
Proof. Put . Since is bilinear and
is linear, is bilinear. By
hypothesis as well, so and are both linear maps
factoring
through .
The universal property of Definition 15.2.1 says
there is only one such map. Hence .
No finite-dimensionality is needed, and no basis is
chosen. With it, the algebra of on maps is a
formality.
Proposition
15.3.3 (Algebra of Tensor Products of
Maps)
Let , and . Let also and . Then:
- (a) and ;
- (b) ;
- (c) ;
- (d) .
Proof. In each part both sides are
linear maps out of , so by Lemma 15.3.2 it suffices
to compare their values at a simple tensor .
(a) The left side
gives , which equals
because is additive in
its first slot. That is the value of the right side. The
second identity is the same argument in the other
slot.
(b) , where both outer equalities use
bilinearity of .
(c) , which is the value of .
(d) Done in
Example 1.
Part (c) is the statement that respects
composition: it is functoriality, and we will
see in a moment that it is the mixed product rule of Theorem 8.4.1 in
disguise.
Two more structural facts are needed before §04 can
speak of tensors with several slots. The first extends
the universal property from two factors to any number,
and the second says that the brackets do not matter.
For
define the iterated tensor product by starting from itself when , and write for .
Multilinear maps of arguments were defined
in Definition 15.1.1.
Lemma
15.3.4 (Universal Property for Factors)
Let and
be vector spaces over , and let be multilinear. Then there is
exactly one linear map with for
all . Moreover the tensors span .
Idea. Induction on , freezing the last
argument. With
held fixed,
is multilinear in the first arguments, so the
inductive hypothesis converts it into a linear map on
. Letting move again gives a
bilinear map on , and (T1) finishes. The spanning claim is
the same induction.
Proof. For take , which
is linear, and the claim is trivial; for the statement is Definition 15.2.1 together
with Proposition 15.2.4. Let
and assume
the lemma for . Put .
Fix . The map is multilinear, so the inductive
hypothesis gives a unique linear
with .
The map , , is bilinear. It is linear
in because each
is. For
linearity in ,
fix and : the linear maps and
agree at every , because is linear in its
last argument, and those tensors span by the inductive
hypothesis; so the two maps are equal.
By Definition 15.2.1 there is
a unique linear on with ; taking gives .
Finally, is spanned by the simple tensors (Proposition 15.2.4), each
is a combination
of by the inductive hypothesis,
and is
linear in its first slot; so the -fold tensors span. A
linear map is determined by its values on a spanning
set, which gives uniqueness of .
Proposition
15.3.5 (Associativity of the Tensor
Product)
Let be
vector spaces over . There is a unique
isomorphism with for all
.
Proof. The map is trilinear, since is bilinear in
each of its two uses. By Lemma 15.3.4 with there is a unique
linear on
with the stated values. Symmetrically,
freezing the first argument instead and running
the two-factor property twice produces a linear with
. The
composite fixes
every , and those span by Lemma 15.3.4, so ;
symmetrically .
Hence is an
isomorphism.
From now on we drop the brackets and write ,
with for the element that both ways of bracketing
name, and likewise for any number of factors.
The matrix
of a tensor product of maps
Now we compute. A matrix needs
ordered bases, and has a basis
indexed by pairs , so the whole
content of the computation is which order we put the
pairs in.
Order the basis by dictionary order on the pair
: the index
of the first factor changes slowly, the index of the
second factor runs fastest.
Definition
15.3.2 (The product basis, ordered)
Let be an ordered basis of and
an ordered basis of . Write for the
basis of given by Theorem 15.2.5,
ordered so that
occupies position that is, in the order
Division with remainder writes every position as for exactly
one pair, so this really is an ordering of the whole
basis. It is the dictionary order on pairs, and it is
the same rule that Chapter 8 used to label the rows and
columns of a Kronecker product in the formula after Definition 8.4.1.
That is not a coincidence, and the next theorem says
why.
Theorem
15.3.6 (The Kronecker Product Is the Matrix of
a Tensor Product of Maps)
Let be finite-dimensional vector spaces over
with ordered
bases Let and . Then, with the orderings of Definition 15.3.2 on both
sides, the Kronecker product of Definition 8.4.1.
Idea. A matrix is read off column
by column, and column of the left side holds the coordinates of
. Expanding and in their bases and
multiplying out by bilinearity produces the coefficient
on
— a product of one entry of each
matrix. The entry formula of Chapter 8 says
the Kronecker product puts exactly that number in
exactly that place, provided the pairs are read in
dictionary order. So the theorem is the entry formula
and bilinearity, nothing more.
Proof. Write
and ,
so that by Definition 4.1.1
Fix and
. Using Definition 15.3.1 and then
bilinearity of in each slot,
By Definition 15.3.2, is the
basis vector in position of , and
is the basis vector in position of . So the displayed expansion says that
the entry of
in row
and column is .
By the entry formula accompanying Definition 8.4.1,
that is exactly the entry of in the same
position. Every row index of an matrix is
for
exactly one pair , and every column index is for exactly
one pair , so
the two matrices agree in every position. This proves
the theorem.
The ordering is the whole content, so it is
worth being exact about it. Suppose we had
ordered the product basis the other way, putting in
position , so that the second index changes
slowly. Running the proof again, the entry in row and column
is still
, which
by is the
entry of in that position. So the other ordering
gives the Kronecker product with the factors
swapped — not the transpose, and not
the same matrix. For square factors the two answers are
related exactly as Proposition 8.4.2
says, by conjugating with the permutation matrix that
relabels dictionary order into its reverse — which is
precisely the change-of-coordinates matrix between the
two orderings of the product basis. In the rectangular
setting of Theorem 15.3.6 the
relation is not a conjugation at all: the row and column
relabelings are different permutations, so with two matrices, as
Chapter 8 notes just after that proposition’s proof.
Warning. Do not reverse the
two factors of the basis ordering. The theorem
needs the index of the first tensor
factor to be the slow one, matching Chapter 8’s
dictionary order in . With the fast and
slow indices exchanged the matrix of is . For
and these two differ in the
entry, which
is
in the first and in the
second (the non-example after Definition 8.4.1).
Chapter 8’s two promises, paid. At
Definition 8.4.1,
Chapter 8 wrote that the symbol “anticipates the
tensor product of Chapter 15, of which this is the
matrix version”. Theorem 15.3.6 is that
statement, made precise and proved: the Kronecker
product of two matrices is the matrix of the tensor
product of the two maps they represent, taken in the
product bases. At the end of the same section, Chapter 8
wrote that the Kronecker product is “the coordinate
shadow of a basis-free construction: the tensor product
of linear maps, in Chapter 15, whose matrix in suitable
bases is exactly ”, and promised that “the dictionary order in
will
reappear there as an ordering of a basis ”. The
suitable bases are and ; the dictionary order has reappeared,
as Definition 15.3.2; and the
shadow is cast by . The second promise gets a sharper payment at
the end of this section, where the vec identity turns
out to be this same theorem applied to a space of
matrices.
Example
(Computing with a tensor product of maps)
Let and have matrices, in the standard
bases, Compute
directly from Definition 15.3.1, and
again from the matrix of Theorem 15.3.6. Here is the
standard basis of and that
of .
Solution.
Directly. Columns of and give , ,
and
.
Hence using bilinearity of in both
slots.
By matrix. The domain basis, ordered
as in Definition 15.3.2, is
, so the input
has coordinate column . By Theorem 15.3.6 the matrix
of is
and multiplying it by that column gives . In the
codomain basis this is the same element as before.
What
Chapter 8 was computing
Every property of the Kronecker product proved by
entry-chasing in Chapter 8 is now a property of maps,
and several of them become one-liners. We record the
three that the rest of the chapter uses.
The mixed product rule comes first, because it is the
one Chapter 8 called “the engine of everything that
follows”.
Corollary
15.3.7 (The Mixed Product Rule Is
Functoriality)
Let , , and .
Then
Proof. Let be the linear
maps with matrices in the standard bases of the relevant
spaces . By Theorem 15.3.6, with all
product bases ordered as in Definition 15.3.2, and are the
matrices of and . By Theorem 4.1.2 the
product of the matrices is the matrix of the composite
, which is by Proposition 15.3.3 (c).
Applying Theorem 15.3.6 once more,
and Theorem 4.1.2
again to each factor, the matrix of is .
This is Theorem 8.4.1 (c),
which Chapter 8 proved by partitioning both matrices
into conformable blocks and multiplying blockwise. The
proof above says what the identity means: doing
two things one after the other in each slot separately
is the same as doing them one after the other in both
slots at once. In the same way, the bilinearity of Theorem 8.4.1 (a)
is parts (a) and (b) of Proposition 15.3.3, its
associativity (b) is Proposition 15.3.5, and
its inverse rule (e) is parts (c) and (d) together with
invertibility of a composite.
Next, the numerical invariants.
Corollary
15.3.8 (Rank, Determinant and Trace of a Tensor
Product of Maps)
Let be finite-dimensional over , ,
. Then If moreover and , with and , then
Idea. For the rank, choose bases
adapted to the two kernels: then kills most
product basis vectors and sends the remaining of
them to independent vectors. For the determinant, split
. The factor preserves
each of the
subspaces and acts on each as ; the factor preserves
each of the
subspaces and acts as . So each factor is
block diagonal with repeated blocks, and the exponents
count the other space’s dimension, which is
where the exponents come from. The trace we take from
the matrix.
Proof. Rank. Let
and
. Choose
a basis of
whose last
vectors form a basis of ; this is possible by Theorem 1.8.2
applied to a basis of , after reordering. Then span
by Theorem 2.2.4, and
being
spanning vectors of an -dimensional space they
form a basis of (Theorem 1.6.4).
Choose a basis of
the same way, so that is a basis of and for .
By Theorem 2.2.4, is
spanned by the vectors , and those with or are . Extend to
a basis of
and to a basis of (Theorem 1.8.2). By
Theorem 15.2.5 the
products of these basis vectors form a basis of ; in
particular the
vectors with ,
are linearly independent. They therefore form a basis of
,
and .
Determinant. By Proposition 15.3.3 (c) and
(d), so
by Theorem 7.5.8. Fix
bases of and of and use the ordering of
Definition 15.3.2. For
each , the
subspace is carried into itself by , which
acts on it as
does on ; and
is the
direct sum of these subspaces, because
their bases together form the basis .
Consecutive blocks of the ordering are exactly these
subspaces, so whose determinant is by Theorem 8.1.4 (d)
and induction on the number of blocks. The same argument
for , using instead the subspaces , gives
. (This time the relevant basis
vectors are not consecutive in the ordering of Definition 15.3.2, so
reorder the basis to make them so; matrices of one
operator in two bases are similar, by Theorem 4.2.3,
hence have the same determinant, by Corollary 7.5.7.)
Multiplying the two gives the formula.
Trace. By Theorem 15.3.6 the matrix
of in
is
, so by Definition 4.5.2
and Theorem 8.4.3 (b),
.
These are parts (a), (c) and (b) of Theorem 8.4.3,
transported to operators. Two remarks on what has
changed. First, the exponents in the determinant formula
are no longer something to memorize: appears to the
power
because runs once on each of the
copies of
inside . Second, the
proof of the trace formula above is still a computation
in a basis. There is a genuinely basis-free reason, and
§04 gives it. The determinant, too, has a basis-free
explanation, which has to wait for the top exterior
power in §09.
Warning. Most operators on
are not
of the form . The operators that are of this form
are heavily constrained: by Corollary 15.3.8 their
rank is a product with and . Take , so ,
and let be any
operator on of rank , for instance the
projection onto the span of the first three basis
vectors of Definition 15.3.2. Then
with is
impossible, so for every and . The maps do
span , which is a different and weaker
statement; this is the same distinction as between
simple tensors and general tensors in §02.
Quick check. Let and with and , and suppose
and
. What
are and , where the second is an operator on
?
Solution. By Corollary 15.3.8, . For
the
roles swap, giving as well. The two agree, as they must: a
determinant is a product of scalars, and the exponent
always belongs to the other factor’s dimension.
The tempting wrong answer, , puts each map’s own dimension in its
exponent.
Maps as
tensors
We come to the identification that the rest of the
chapter runs on. A functional and a
vector
together determine a linear map : measure with
, then scale
by the answer.
That recipe is bilinear in , which is
now a reflex: it must come from a linear map on .
Theorem
15.3.9 (Tensors Are Maps)
Let and be
finite-dimensional vector spaces over
. There is a
unique linear map and it is an isomorphism. Moreover, for and
with
finite-dimensional, where is the dual map of Definition 5.4.1 and the
on the left
is the one for the pair .
Idea. Existence is the universal
property again. For bijectivity, count: both sides have
dimension , so it is enough to see that carries a basis
onto a basis. It carries to
the map whose matrix is the matrix unit , and the matrix
units are a basis. The last formula is the statement
that turns
the tensor product of maps into composition on the two
sides; it is checked on simple tensors.
Proof. Existence and
uniqueness. For fixed and , the assignment
is linear, so it is an element of . The map is bilinear: for every , and two maps agreeing at every are equal. By Definition 15.2.1 there is
a unique linear with .
Bijectivity. Let
be a basis of
with dual basis (Definition 5.1.3), and
a basis of . By Theorem 15.2.5 the
products form a basis of , of size
. Now sends to , so it sends to and every other
basis vector to .
By Definition 4.1.1
its matrix is the matrix unit . The matrix units
form a basis of (Example (Standard Bases))
and is an isomorphism (Theorem 4.1.4),
so the maps
form a basis of .
Hence
contains a basis of , so is surjective (Theorem 2.2.4). Since
, Theorem 2.3.1 gives
, so is injective (Theorem 2.2.3).
Therefore is
an isomorphism.
Naturality. Both and are linear in , so by Lemma 15.3.2 it suffices
to check them at . On the left, , and for , using Definition 5.4.1. On the
right, by linearity of . The two agree.
Warning. Finite dimension
is a hypothesis, not decoration. The map is defined and
injective for any
and , but it is
surjective only onto the maps of finite rank: has image inside ,
so its rank is at most . On , the
identity map has infinite rank and is therefore not
for any
. Everything below uses the finite-dimensional
statement.
The letter is deliberate:
taking and
and using
the dual basis to identify with , this is the isomorphism
of Theorem 15.2.7, with the
two factors written in the order that makes the source a
space of maps rather than of matrices. Section
02’s model was the special case; this is the general
statement.
Two uses of the theorem, immediately. First, it names
the matrix units: under , the map with
matrix
is the tensor ,
so a matrix is a sum . Note the index order — the
functional carries the column index, the vector the row
index — and compare it with Chapter 8’s vectorization,
which stacks columns.
Second, the naturality formula is the vec
identity.
Example
(The vec identity, read as a tensor product of
maps)
Let and , and let which is linear. Identify with
and
with .
Explain why Theorem 8.4.4,
, is Theorem 15.3.6 applied to
.
Solution. Let and
be the maps with matrices and in the standard bases.
Under the identification, becomes the map
sending to , so by the naturality
clause of Theorem 15.3.9 it
corresponds, through , to Order the basis of as
in Definition 15.3.2, using
the dual standard basis first and the standard basis
second. Then sits in position , and . By Definition 8.4.2,
. So
is the coordinate map of this ordered
basis: the dictionary order with the column
index slow is exactly the order in which vectorization
stacks the columns.
Now apply Theorem 15.3.6. The matrix
of in the
dual standard bases is , because the matrix
of a dual map is the transpose (Theorem 5.4.2), and the
matrix of is
. Hence the
matrix of in the product bases above is . Reading
that equality of matrices through the coordinate map
gives , which is Theorem 8.4.4.
For a numerical check, take and . Writing the four
images
in the order and stacking the four
columns side
by side gives which is written out.
So the transpose in the vec identity, which Chapter 8
had to warn readers not to get wrong, is not a
bookkeeping accident: it is there because multiplies on the right by , and right
multiplication is precomposition, which
reverses arrows. The dual map is what reverses them, and
the matrix of a dual map is a transpose. That is the
sharper form of Chapter 8’s second promise, and it is
why the wrong guesses and are
wrong.
Exercises
A. Check your
understanding
Exercise
(A1)
- (a) State the
defining property of , and say why writing “, extended linearly” is not by
itself a definition.
- (b) Let , , , . What are
the sizes of ,
and ?
- (c) In the ordering
of Definition 15.3.2 with
and
, which
basis vector of sits in position ?
- (d) True or false:
every operator on is of the form . Justify your answer.
- (e) State Theorem 15.3.9, including
its hypothesis, and say what does to a vector .
Solution.
(a) is the
unique linear map with for
all (Definition 15.3.1). The
quoted phrase is not a definition because a general
element of is a sum of simple tensors in many different
ways, so a prescription on simple tensors may be
inconsistent; already forces consistency conditions.
What makes it work is that is bilinear, so Definition 15.2.1 supplies
the map.
(b) , , and (Theorem 15.3.6: an and a matrix give an
one).
(c) With , position
forces , . So it is .
(d) False. By Corollary 15.3.8, . With , an operator of rank on the -dimensional space cannot have
its rank factored as a product of two integers each at
most .
(e) For
finite-dimensional, there is a unique
linear with , and it is an isomorphism. So
measures with and scales by the
result.
B. Practice
Exercise
(B1: A tensor product of maps, two ways)
Let and have matrices, in the standard
bases,
- (a) Write down for the
standard bases, ordered as in Definition 15.3.2.
- (b) Compute directly from Definition 15.3.1.
- (c) Check (b)
against (a) by multiplying the matrix by the coordinate
column of the input.
Solution.
(a) By Theorem 15.3.6 the matrix
is ,
of size :
(b) The columns
of give and
; the
columns of give
and , where is the standard basis of . Hence where the terms cancel: from the first product
and from the
second.
(c) The input has
coordinates in the basis .
Multiplying gives , which in the basis is exactly the answer
to (b).
Exercise
(B2: Invariants without multiplying matrices)
Let
and
over , with
, , , , , , .
- (a) Find and
.
- (b) Find .
- (c) Find .
Justify the value from the ranks alone.
- (d) Find and
, and check that their product is
not in general by comparing with
(b).
Solution.
(a) By Corollary 15.3.8, . Since by Theorem 15.2.5, Theorem 2.3.1 gives
.
(b) .
(c) , so is
not invertible and by Theorem 3.4.4 and
Definition 7.5.1.
Hence . Directly: , so is not invertible.
(d) and , using
from Theorem 4.5.3.
Their product is . There is no contradiction: is the
composite of the two, and the trace of a
composite is not the product of the traces.
Exercise
(B3: Which statements hold?)
Let be
finite-dimensional over . Determine which of the
following hold for all
and .
Justify your answer.
- (a) .
- (b) .
- (c) implies
or .
- (d) and
commute.
- (e) If and are invertible, so is
, with
inverse .
C. Going deeper
Exercise
(C1: When a tensor product of maps vanishes)
Let be finite-dimensional over , and
.
- (a) Prove that if and
only if or
.
- (b) Prove that , meaning the span of all with .
- (c) Deduce , and check it against
Corollary 15.3.8.
Solution.
(a) If , then for all , so by Lemma 15.3.2. Likewise if
. Suppose
and . Then and , so by Corollary 15.3.8, and
.
(b) For and , ; a kernel is a subspace (Theorem 2.2.1), so it
contains the span of these elements. Choose a
basis of
whose last
vectors span , where , and such that are
independent (as in the proof of Corollary 15.3.8). Let
be a basis of and
let lie in the kernel.
Then and the vectors with
are
linearly independent by Theorem 15.2.5, after
extending to a basis of . Hence for all , so is a combination of the
with , all
of which lie in .
(c) By (b) and Theorem 15.2.5 applied to
and , .
Consistency: Corollary 15.3.8 gives
, and adding the two gives
, as
Theorem 2.3.1
requires.
Exercise
(C2: Rank-one maps and simple tensors)
Let be
finite-dimensional over and let be the isomorphism
of Theorem 15.3.9.
- (a) Prove that has rank at
most if and only
if is a simple
tensor .
- (b) Deduce that “not
every tensor is simple” (§02) says exactly that not
every linear map has rank at most , and identify the
tensor corresponding to in a basis.
- (c) Let .
Exhibit that is not simple, by exhibiting a
map of rank .
Solution.
(a) sends every into , so its image
has dimension at most . Suppose
has rank at most . If , then
since is
injective. Otherwise for some , so for each
there is a
unique scalar with ;
uniqueness and linearity of make linear, so . Then
, and because is
injective.
(b) By (a) and
bijectivity of , the non-simple
tensors in correspond exactly to the maps of rank at
least . Taking
with basis
and dual basis , the matrix of is , so
. For this has rank , hence is not
simple. For
it is the witness , which is
Example (A tensor that is not simple)
read through .
(c) Take for bases of and of . Then sends and
,
so it has rank ,
and by (a) is
not simple.
Exercise
(C3: Reproving the swap)
Let and be finite-dimensional
over with ordered
bases and .
- (a) Prove that there
is a unique isomorphism with .
- (b) Prove that for all , .
- (c) Deduce Proposition 8.4.2:
for
and
there is a permutation matrix with , and identify .
Hint for (c): think of as renaming basis
vectors rather than as moving them.
Solution.
(a) The map is bilinear, so Definition 15.2.1 gives a
unique linear
with . The same construction with the
roles swapped gives with . Then fixes every
simple tensor, so by Lemma 15.3.2, and likewise
.
Hence is an
isomorphism.
(b) Both sides
are linear maps out of , so by Lemma 15.3.2 compare at
: the
left gives , and the right gives
.
(c) Let be the operators on
with
matrices .
Both and are orderings of the same basis of ,
differing by the permutation that sends
position
to position — the direction matters, since is not an
involution unless — and let be its matrix, which
is exactly the built in the
proof of Proposition 8.4.2.