I will start this lecture with a brief review, both because we have some new students joining us and because I am generally a proponent of the spiral method of learning.
In the beginning there was the category whose objects are finite sets
and whose morphisms are functions
Initially I called this the combinatorial category, but it could just as well be called the computational category because everything about it can be described using just two digits,
and
Indeed, for any finite set
there exists a unique
such that an isomorphism
Any such isomorphism is called an ordering of
and typically one writes
Once an ordering is fixed, we can encode
as the column vector
If and
are two finite sets with orderings
and
then a function
is encoded as the
logical matrix
Note that the columns of this one-hot encoding of are nothing but the bit strings
For any two functions
such that
is defined, it can be computed as the matrix product
So our conclusion early on was that everything about
can be expressed in terms of matrix algebra, and only binary matrices are needed.
We then began to argue a case which we will continue to argue throughout the quarter. We claim that it is advantageous to move from the classical computational category to the quantum computational category
whose objects are finite-dimensional Hilbert spaces and whose morphism are linear transformations. Here all computations can again be reduced to matrix algebra but the matrices used are no longer constrained to be built from two bits; rather they can involve arbitrary complex numbers. The passage from classical computation to quantum computation is one way to motivate the study of linear algebra. A more traditional way is to start with the desire to solve systems of linear equations, which I assume you have already been exposed to.
More formally, we introduced the quantization functor
which sends each finite set to the Hilbert space
containing
as an orthonormal basis. This is called the free Hilbert space on
and it may be constructed concretely as the space of complex-valued functions on
equipped with the
-scalar product. The functor
also sends each function
to the linear transformation
defined by
The quantization functor is faithful but not full. Faithful means that and
are isomorphic objects in
if and only if
and
are isomorphic objection in
Not full means that there are many more morphisms in
then there are in
, and this is a good thing. For example, in order to show that
and
are isomorphic sets we can try to show that
and
are isomorphic Hilbert spaces, and there are many more ways in which this can happen. I even have a friend who claims that there are no bijections, only invertible linear transformations (he’s kidding but also kind of serious). The upshot is that we want to argue that
is better than
and we will use the category-theoretic perspective to guid us in understanding what “better” should mean.
Definition 7.1. A category is said to be enriched over another category
if for every
we have
For example, the category is enriched over itself. The question we want to answer: is
enriched over itself?
Let us start with some obvious statements and work towards answering this question. First of all, is enriched over
which is the same thing as saying that
is a locally small category. But we can easily do better than this.
Proposition 7.2. The category is enriched over the category
whose objects are complex vector spaces and whose morphisms are linear maps.
Proving this means showing that for any finite-dimensional Hilbert spaces the corresponding set
can be made into a complex vector space, and equipping linear maps with addition and scalar multiplication defined point wise we get the desired vector space structure (this should be familiar, but you should still think about it).
Now let us see if we can do better than this and show that is enriched over
the full subcategory of
whose objects are finite-dimensional complex vector spaces.
Definition 7.3. Given let
and
be orthonormal bases. We define the corresponding elementary operators
by
To get a feel for the definition, let us compute the matrix elements of relative to the orthonormal bases
and
: we have
Thus, has exactly one matrix element equal to one, namely
and all other matrix elements are equal to zero.
Problem 7.1. Prove that is a basis of
and show that the expansion of any
is
This expansion is one way to write down the information contained in the matrix of without actually writing down the matrix. An immediate consequence of Problem 7.1 is that
is enriched over
Another useful consequence of having an explicit basis for this space is the following.
Theorem 7.4. Every is a continuous function, with respect to the Hilbert space norms on
and
Proof: It suffices to prove that the elementary transformations are continuous, since then every transformation is a sum of continuous functions and hence continuous. In fact, the elementary transformations are not just continuous, they are contractive mappings. To see this, we compute
where the final inequality is Cauchy-Schwarz together with the fact that and
are unit vectors.
We still have not discovered a scalar product on the finite-dimensional vector space so it is not yet a Hilbert space. Instead of trying to find a scalar product immediately, let us first shoot for an intermediate goal: finding a norm.
Definition 7.5. A Banach space is a complex vector space equipped with a norm.
This definition has the same irregularity as our definition of Hilbert space, namely that we do not require completeness. This is because we are really only interested in finite-dimensional Banach spaces, which are always complete.
Problem 7.2. Let and let
and
be orthonormal bases. Define a function
by
Show that is a norm on
, but that it is not induced by a scalar product.
An immediate consequence of Problem 7.2 is that is enriched over the category
whose objects are finite-dimensional Banach spaces and whose morphisms are linear transformations. However, the norm
is not a very good norm in that it depends on choosing orthonormal bases
and
In this sense it is not tethered to the intrinsic geometry of a linear transformation, but rather to the particular numerology of a specific matrix representation.
A better norm on can be obtained by observing that linear transformations are not just continuous functions, they are Lipschitz functions.
Theorem 7.5. Every is Lipschitz.
Proof: Let and
be orthonormal bases. Using the solution to Problem 7.1 as well as the triangle inequality and Cauchy-Schwarz inequality for the Hilbert space norm in
we have
which shows that is Lipschitz.
Definition 7.6. The operator norm of is defined to be its Lipschitz constant,
Problem 7.3. Prove that the operator norm on really is a norm, but that it is not induced by a scalar product.