Website build

Author: colinjcotter

Computationallinearalgebracourse.pdf

@@ -564,9 +564,7 @@ <h2><span class="section-number">1.5. </span>Inner products and orthogonality<a
 <p>Let <span class="math notranslate nohighlight">\(x,y\in \mathbb{C}^m\)</span>. Then the inner product of <span class="math notranslate nohighlight">\(x\)</span> and <span class="math notranslate nohighlight">\(y\)</span> is</p>
 <div class="math notranslate nohighlight">
 \[x^*y = \sum_{i=1}^m \bar{x}_iy_i.\]</div>
-</div></div><p>(Exercise: check that the inner product is bilinear, i.e. linear in
-both of the arguments.)</p>
-<p>We will frequently use the natural norm derived from the inner product
+</div></div><p>We will frequently use the natural norm derived from the inner product
 to define size of vectors.</p>
 <div class="proof proof-type-definition" id="id19">
 

L1_preliminaries.html

@@ -539,9 +539,6 @@ The inner product is a critical tool in computational linear algebra.
 
       x^*y = \sum_{i=1}^m \bar{x}_iy_i.
 
-(Exercise: check that the inner product is bilinear, i.e. linear in
-both of the arguments.)
-
 We will frequently use the natural norm derived from the inner product
 to define size of vectors.