Advanced Algebra part of Homework

\textcolorblueAdvanced Algebra HW2      \textcolorblue2022.3.16$\text{textcolor}blue\text{Advanced Algebra }\mathbb{HW}2{}_{\text{textcolor}}blue2022.3.16$

1.2.1 four subspaces$\text{four subspaces}$

Prove or find counter examples.

1. For four subspaces, if any three of them are linearly independent, then the four subspaces are linearly independent.
2. If subspaces V1,V2$V_1,V_2$ are linearly independent, and V1,V3,V4$V_1,V_3,V_4$ are linearly independent, and V2,V3,V4$V_2,V_3,V_4$ are linearly independent, then all four subspaces are linearly independent.
3. If V1,V2$V_1,V_2$ are linearly independent, and V3,V4$V_3,V_4$ are linearly independent, and V1+V2,V3+V4$V_1+V_2,V_3+V_4$ are linearly independent, then all four subspaces are linearly independent.

---

(1)$(1)$ Construct four subspaces below. It is obvious that any three of them are linearly independent, but four subspaces together are linearly dependent. （dimR3=3$\dim {\mathbb{R}}^3=3$） V1={[k00]∣k∈R},V2={[0k0]∣k∈R},V3={[00k]∣k∈R},V4={[kkk]∣k∈R}$$V_1=\{\left[\begin{array}{c}k\\ 0\\ 0\end{array}\right]\mid k\in \mathbb{R}\},V_2=\{\left[\begin{array}{c}0\\ k\\ 0\end{array}\right]\mid k\in \mathbb{R}\},V_3=\{\left[\begin{array}{c}0\\ 0\\ k\end{array}\right]\mid k\in \mathbb{R}\},V_4=\{\left[\begin{array}{c}k\\ k\\ k\end{array}\right]\mid k\in \mathbb{R}\}$$ (2)$(2)$ Construct four subspaces below. We can prove that each of V1,V2$V_1,V_2$ and V1,V3,V4$V_1,V_3,V_4$ and V2,V3,V4$V_2,V_3,V_4$ are linearly independent. V1={[k00]∣k∈R},V2={[0k0]∣k∈R},V3={[k0k]∣k∈R},V4={[0kk]∣k∈R}$$V_1=\{\left[\begin{array}{c}k\\ 0\\ 0\end{array}\right]\mid k\in \mathbb{R}\},V_2=\{\left[\begin{array}{c}0\\ k\\ 0\end{array}\right]\mid k\in \mathbb{R}\},V_3=\{\left[\begin{array}{c}k\\ 0\\ k\end{array}\right]\mid k\in \mathbb{R}\},V_4=\{\left[\begin{array}{c}0\\ k\\ k\end{array}\right]\mid k\in \mathbb{R}\}$$ However, pick some special vectors from these subspaces and its linear combination are zero 1⋅[100]+(−1)⋅[010]+(−1)[101]+1⋅[011]=→0$$1\cdot \left[\begin{array}{c}1\\ 0\\ 0\end{array}\right]+(-1)\cdot \left[\begin{array}{c}0\\ 1\\ 0\end{array}\right]+(-1)\left[\begin{array}{c}1\\ 0\\ 1\end{array}\right]+1\cdot \left[\begin{array}{c}0\\ 1\\ 1\end{array}\right]=\overrightarrow{0}$$ (3)$(3)$ Reduction to absurdity, assume that four real numbers that not all of them is zero a1→v1+a2→v2+a3→v3+a4→v4=0$$a_1{\overrightarrow{v}}_1+a_2{\overrightarrow{v}}_2+a_3{\overrightarrow{v}}_3+a_4{\overrightarrow{v}}_4=0$$ We can proof that a1→v1+a2→v2≠0$a_1{\overrightarrow{v}}_1+a_2{\overrightarrow{v}}_2\ne 0$, otherwise according to the independence of V1,V2$V_1,V_2$ and

V3,V4$V_3,V_4$ a1=a2=0,a3=a4=0$a_1=a_2=0,a_3=a_4=0$, so a1→v1+a2→v2≠0,a3→v3+a4→v4≠0$a_1{\overrightarrow{v}}_1+a_2{\overrightarrow{v}}_2\ne 0,a_3{\overrightarrow{v}}_3+a_4{\overrightarrow{v}}_4\ne 0$

But a1→v1+a2→v2∈V1+V2,a3→v3+a4→v4∈V3+V4$a_1{\overrightarrow{v}}_1+a_2{\overrightarrow{v}}_2\in V_1+V_2,a_3{\overrightarrow{v}}_3+a_4{\overrightarrow{v}}_4\in V_3+V_4$, so linear combination of a1→v1+a2→v2$a_1{\overrightarrow{v}}_1+a_2{\overrightarrow{v}}_2$ and

a3→v3+a4→v4$a_3{\overrightarrow{v}}_3+a_4{\overrightarrow{v}}_4$ can add up to 0$0$, which is contrary to the independence of V1+V2.V3+V4$V_1+V_2.V_3+V_4$

All in all, the four subspaces must be linearly independence

1.2.2 decomposition of transpose$\text{decomposition oftranspose}$

Let V$V$ be the space of n×n$n\times n$ real matrices. Let T:V→V$T:V\to V$ be the transpose operation, i.e., T$T$ sends A$A$ to AT$A^{\mathrm{T}}$ for each A∈V$A\in V$. Find a non-trivial T$T$-invariant decomposition of V$V$, and find the corresponding block form of T$T$. (Here we use real matrices for your convenience, but the statement is totally fine for complex matrices and conjugate transpose.)

---

Set S={A∣A=AT,A∈Mn×n}$S=\{A\mid A=A^T,A\in M_{n\times n}\}$, this decomposition is invariant. Because after transposing any symmetric matrix, the matrix remains itself.

Set S′={A∣A=−AT,A∈Mn×n}$S^{\prime }=\{A\mid A=-A^T,A\in M_{n\times n}\}$, A=−AT⟹AT=−A=−(AT)T$A=-A^T⟹A^T=-A=-(A^T{)}^T$, so any antisymmetric matrix's transpose is antisymmetric.

So decompose the linear map of T$T$ into S$S$ and S′$S^{\prime }$, dimS=n(n+1)2,dimS′=n(n−1)2$\dim S={\displaystyle \frac{n(n+1)}{2}},\dim S^{\prime }={\displaystyle \frac{n(n-1)}{2}}$

Because any n×n$n\times n$ matrix B=B+BT2+B−BT2$B={\displaystyle \frac{B+B^T}{2}}+{\displaystyle \frac{B-B^T}{2}}$ , so transpose T$T$ can be decomposed

into S$S$ and S′$S^{\prime }$ two block form.

A→(A+AT200A−AT2)$A\to \left(\begin{array}{cc}\frac{A+A^T}{2}& 0\\ 0& \frac{A-A^T}{2}\end{array}\right)$ so the corresponding block form of T$T$ is (I00−I)$\left(\begin{array}{cc}I& 0\\ 0& -I\end{array}\right)$

1.2.3 ultimate subspaces $\text{ultimate subspaces }$

Let p(x)$p(x)$ be any polynomial, and define p(A)$p(A)$ in the obvious manner. E.g., if p(x)=$p(x)=$ x2+2x+3$x^2+2x+3$, then p(A)=A2+2A+3I$p(A)=A^2+2A+3I$. We fix some n×n$n\times n$ matrix A$A$.

1. If AB=BA$AB=BA$, show that Ker(B),Ran(B)$\mathrm{Ker}(B),\mathrm{Ran}(B)$ are both A$A$-invariant subspaces.
2. Prove that Ap(A)=p(A)A$Ap(A)=p(A)A$.
3. Conclude that N∞(A−λI),R∞(A−λI)$N_{\mathrm{\infty }}(A-\lambda I),R_{\mathrm{\infty }}(A-\lambda I)$ are both A$A$-invariant for any λ∈C$\lambda \in \mathbb{C}$.

---

(1)$(1)$ For any vector →v∈Ker(B),B→v=→0$\overrightarrow{v}\in \text{Ker}(B),B\overrightarrow{v}=\overrightarrow{0}$, so B(A→v)=BA→v=AB→v=0,A→v∈Ker(B)$B(A\overrightarrow{v})=BA\overrightarrow{v}=AB\overrightarrow{v}=0,A\overrightarrow{v}\in \text{Ker}(B)$

And for any vector →v∈Ran(B),B→x=→v$\overrightarrow{v}\in \text{Ran}(B),B\overrightarrow{x}=\overrightarrow{v}$, so A→v=A(B→v)=AB→v=BA→v=B(A→v)$A\overrightarrow{v}=A(B\overrightarrow{v})=AB\overrightarrow{v}=BA\overrightarrow{v}=B(A\overrightarrow{v})$

A→v∈Ran(B)$A\overrightarrow{v}\in \text{Ran}(B)$. So Ker(B)$\text{Ker}(B)$ and Ran(B)$\text{Ran}(B)$ are both A−$A-$invariant subspaces

(2)$(2)$ Similar to polynomial, set p(A)=n∑i=0aiAn$p(A)={\displaystyle \sum _{i=0}^n{a}_i{A}^n}$, so calculate Ap(A)$Ap(A)$
Ap(A)=An∑i=0aiAn=n∑i=0aiAn+1=(n∑i=0aiAn)A=p(A)A$$Ap(A)=A{\displaystyle \sum _{i=0}^n{a}_i{A}^n=\sum _{i=0}^n{a}_i{A}^{n+1}=(\sum _{i=0}^n{a}_i{A}^n)A=p(A)A}$$ (3)$(3)$ Due to limited dimension n$n$ of A$A$, N∞(A−λI)$N_{\mathrm{\infty }}(A-\lambda I)$ and R∞(A−λI)$R_{\mathrm{\infty }}(A-\lambda I)$ are limited combinations

of Ker(A−λI)k$\text{Ker}(A-\lambda I{)}^k$ and Ran(A−λI)k$\text{Ran}(A-\lambda I{)}^k$ . According to the conclusion from (1)$(1)$ and (2)$(2)$

A(A−λI)=(A−λI)A,A(A−λI)2=(A−λI)2A,⋯,A(A−λI)k=(A−λI)kA$A(A-\lambda I)=(A-\lambda I)A,A(A-\lambda I{)}^2=(A-\lambda I{)}^{2}A,\cdots ,A(A-\lambda I{)}^k=(A-\lambda I{)}^{k}A$

so ∀ k∈Z$\mathrm{\forall }k\in Z$ , Ker(A−λI)k$\text{Ker}(A-\lambda I{)}^k$ and Ran(A−λI)k$\text{Ran}(A-\lambda I{)}^k$ are all A−$A-$invariant. Add them all together

So, N∞(A−λI),R∞(A−λI)$N_{\mathrm{\infty }}(A-\lambda I),R_{\mathrm{\infty }}(A-\lambda I)$ are both A$A$-invariant for any λ∈C$\lambda \in \mathbb{C}$.

1.2.4 interchangeability and common eigenvector$\text{interchangeability and commoneigenvector}$

Note that any linear map must have at least one eigenvector. (You may try to prove this yourself, but it is not part of this homework.) You may use this fact freely in this problem. Fix any two n×n$n\times n$ square matrices A,B$A,B$. Suppose AB=BA$AB=BA$.

1. If W$W$ is an A-invariant subspace, show that A$A$ has an eigenvector in W$W$.
2. Show that Ker(A−λI)$\mathrm{Ker}(A-\lambda I)$ is always B$B$-invariant for all λ∈C$\lambda \in \mathbb{C}$. (Hint: Last problem.)
3. Show that A,B$A,B$ has a common eigenvector. (Hint: Last two sub-problem.)

---

(1)$(1)$ Construct a new linear map from W$W$ to W$W$ W⟼W:→w⟼A→w$$W⟼W:\overrightarrow{w}⟼A\overrightarrow{w}$$ According to the fact that any linear map must have at least one eigenvector, A has an eigenvector in W$W$

(2)$(2)$ For any vector →v$\overrightarrow{v}$ from Ker(A−λI)$\text{Ker}(A-\lambda I)$, (A−λI)→v=0,A→v=λ→v$(A-\lambda I)\overrightarrow{v}=0,A\overrightarrow{v}=\lambda \overrightarrow{v}$, use AB=BA$AB=BA$

Because (A−λI)(B→v)=(AB−λB)→v=(BA−λB)→v=B(A−λI)→v=0$(A-\lambda I)(B\overrightarrow{v})=(AB-\lambda B)\overrightarrow{v}=(BA-\lambda B)\overrightarrow{v}=B(A-\lambda I)\overrightarrow{v}=0$

So Ker(A−λI)$\text{Ker}(A-\lambda I)$ is B−$B-$invariant for all λ∈C$\lambda \in \mathbb{C}$

(3)$(3)$ According to (1)$(1)$ and (2)$(2)$, there exists at least one eigenvector →v$\overrightarrow{v}$ in Ker(A−λI)$\text{Ker}(A-\lambda I)$ that

B→v=λB→v$B\overrightarrow{v}={\lambda }_B\overrightarrow{v}$ And the vector →v$\overrightarrow{v}$ also satisfies that A→v=λA→v$A\overrightarrow{v}={\lambda }_A\overrightarrow{v}$

So if A$A$ and B$B$ are interchangeable, they must have common eigenvector.

\textcolorblueAdvanced Algebra HW3      \textcolorblue2022.3.24$\text{textcolor}blue\text{Advanced Algebra }\mathbb{HW}3{}_{\text{textcolor}}blue2022.3.24$

1.3.1 jordan normal form$\text{jordan normal form}$

Find a basis in the following vector space so that the linear map involved will be in Jordan normal form. Also find the Jordan normal form.

1. V=C2$V={\mathbb{C}}^2$ is a real vector space, and A:V→V$A:V\to V$ that sends [xy]$\left[\begin{array}{l}x\\ y\end{array}\right]$ to [ˉx−ℜ(y)(1+i)ℑ(x)−y]$\left[\begin{array}{c}\overline{x}-\mathrm{\Re }(y)\\ (1+i)\mathrm{\Im }(x)-y\end{array}\right]$ is a real linear map. (Here ˉx$\overline{x}$ means the complex conjugate of a complex number x$x$, and ℜ(x),ℑ(x)$\mathrm{\Re }(x),\mathrm{\Im }(x)$ means the real part and the imaginary part of a complex number x.)$x.)$
2. V=P4$V=P_4$, the real vector space space of all real polynomials of degree at most 4. And A:V→V$A:V\to V$ is a linear map such that A(p(x))=p′(x)+p(0)+p′(0)x2$A(p(x))=p^{\prime }(x)+p(0)+p^{\prime }(0)x^2$ for each polynomial p∈P4$p\in P_4$.
3. A=[a1a2a3a4]$A=\left[\begin{array}{llll}& & & a_1\\ & & a_2& \\ & a_3& & \\ a_4& & & \end{array}\right]$. Be careful here. Maybe we have many possibilities for its Jordan normal form depending on the values of a1,a2,a3,a4$a_1,a_2,a_3,a_4$.

---

(1)$(1)$ A1=(10−100−10001−10010−1)=(1210004004000401)(10000−11000−10000−1)(1210004004000401)−1$A_1=\left(\begin{array}{cccc}1& 0& -1& 0\\ 0& -1& 0& 0\\ 0& 1& -1& 0\\ 0& 1& 0& -1\end{array}\right)=\left(\begin{array}{cccc}1& 2& 1& 0\\ 0& 0& 4& 0\\ 0& 4& 0& 0\\ 0& 4& 0& 1\end{array}\right)\left(\begin{array}{cccc}1& 0& 0& 0\\ 0& -1& 1& 0\\ 0& 0& -1& 0\\ 0& 0& 0& -1\end{array}\right){\left(\begin{array}{cccc}1& 2& 1& 0\\ 0& 0& 4& 0\\ 0& 4& 0& 0\\ 0& 4& 0& 1\end{array}\right)}^{-1}$

(2)$(2)$ A:a0+a1x+a2x2+a3x3+a4x4⟼(a0+a1)+2a2x+(a1+2a3)x2+4a4x3$A:a_0+a_{1}x+a_2{x}^2+a_3{x}^3+a_4{x}^4⟼(a_0+a_1)+2a_{2}x+(a_1+2a_3)x^2+4a_4{x}^3$ (1100000200010300000400000)=J(100000√200000−√2000000100000)J−1J=(1√2+11−√21212011−1200√22−√220−60004000001)$$\begin{array}{c}\left(\begin{array}{ccccc}1& 1& 0& 0& 0\\ 0& 0& 2& 0& 0\\ 0& 1& 0& 3& 0\\ 0& 0& 0& 0& 4\\ 0& 0& 0& 0& 0\end{array}\right)=J\left(\begin{array}{ccccc}1& 0& 0& 0& 0\\ 0& \sqrt{2}& 0& 0& 0\\ 0& 0& -\sqrt{2}& 0& 0\\ 0& 0& 0& 0& 1\\ 0& 0& 0& 0& 0\end{array}\right)J^{-1}\\ J=\left(\begin{array}{ccccc}1& \sqrt{2}+1& 1-\sqrt{2}& 12& 12\\ 0& 1& 1& -12& 0\\ 0& {\displaystyle \frac{\sqrt{2}}{2}}& -{\displaystyle \frac{\sqrt{2}}{2}}& 0& -6\\ 0& 0& 0& 4& 0\\ 0& 0& 0& 0& 1\end{array}\right)\end{array}$$ (3)$(3)$ J=(J1,4OOJ2,3),where Ji,j={(√aiaj00−√aiaj)ai≠0,aj≠0(0000)ai=0,aj≠0 or ai≠0,aj=0(0100)ai=aj=0$$J=\left(\begin{array}{cc}{J}_{1,4}& O\\ O& J_{2,3}\end{array}\right),\text{where }{J}_{i,j}=\{\begin{array}{ll}\left(\begin{array}{cc}\sqrt{a_i{a}_j}& 0\\ 0& -\sqrt{a_i{a}_j}\end{array}\right)& a_i\ne 0,a_j\ne 0\\ \left(\begin{array}{cc}0& 0\\ 0& 0\end{array}\right)& a_i=0,a_j\ne 0\text{ or }{a}_i\ne 0,a_j=0\\ \left(\begin{array}{cc}0& 1\\ 0& 0\end{array}\right)& a_i=a_j=0\end{array}$$

1.3.2 partitions of interger$\text{partitions ofinterger}$

A partition of integer n$n$ is a way to write n$n$ as a sum of other positive integers, say 5=2+2+1$5=2+2+1$. If you always order the summands from large to small, you end up with a dot diagram, where each column represent an integer: [⋅⋅⋅⋅⋅]$\left[\begin{array}{ll}\cdot & \cdot \\ \cdot & \cdot \\ \cdot \end{array}\right]$. Similarly, 7=4+2+1$7=4+2+1$ should be represented as [⋅⋅⋅⋅⋅⋅⋅]$\left[\begin{array}{lll}\cdot & \cdot & \cdot \\ \cdot & \cdot & \\ \cdot & & \\ \cdot & & \end{array}\right]$

1. If the Jordan normal form of an n×n$n\times n$ nilpotent matrix A$A$ is diag (Ja1,Ja2,…,Jak)$(J_{a_1},J_{a_2},\dots ,J_{a_k})$, then we have a partition of integer n=a1+…+ak$n=a_1+\dots +a_k$. However, we also have a partition of integer n=[dimKer(A)]+[dimKer(A2)−dimKer(A)]+[dimKer(A3)−dimKer(A2)]+…$n=[\dim \mathrm{Ker}(A)]+[\dim \mathrm{Ker}\left(A^2\right)-\dim \mathrm{Ker}(A)]+[\dim \mathrm{Ker}\left(A^3\right)-\dim \mathrm{Ker}\left(A^2\right)]+\dots$ where we treat the content of each bracket as a positive integer. Can you find a relation between the two dot diagrams?

2. A partition of integer n=a1+…+ak$n=a_1+\dots +a_k$ is called self-conjugate if, for the matrix A=diag(Ja1,Ja2,…,Jak)$A=\mathrm{diag}(J_{a_1},J_{a_2},\dots ,J_{a_k})$, the two dot diagrams you obtained above are the same. Show that, for a fixed integer n, the number of self-conjugate partition of n$n$ is equal to the number of partition of n$n$ into distinct odd positive integers. (Hint: For a self-conjugate dot diagram, count the total number of dots that are either in the first column or in the first row or in both. Is this always odd?)

3. Suppose a 4 by 4 matrix A$A$ is nilpotent and upper trianguler, and all (i,j)$(i,j)$ entries for i<j$i<j$ are chosen randomly and uniformly in the interval [−1,1]$[-1,1]$. What are the probabilities that its Jordan canonical form corresponds to the partitions 4=4,4=3+1,4=2+2,4=2+1+1,4=1+1+1+1$4=4,4=3+1,4=2+2,4=2+1+1,4=1+1+1+1$ ?

---

(1)$(1)$ I can find that the sequence of each bracket' number is not incremental, which is just like the dot graph. Put [dimKer(A)],[dimKer(A2)−dimKer(A)],[dimKer(A3)−dimKer(A2)],…$[\dim \mathrm{Ker}(A)],[\dim \mathrm{Ker}\left(A^2\right)-\dim \mathrm{Ker}(A)],[\dim \mathrm{Ker}\left(A^3\right)-\dim \mathrm{Ker}\left(A^2\right)],\dots$ like the dot graph. According to the 'killing chain', the number of each row's dots of the dot graph is just a1,a2,a3,…$a_1,a_2,a_3,\dots$

(2)$(2)$ The self-conjugate of the partition is just like a flying wing. Like this [⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅⋅]$\left[\begin{array}{llllll}\cdot & \cdot & \cdot & \cdot & \cdot & \cdot \\ \cdot & \cdot & \cdot & \cdot & \cdot \\ \cdot & \cdot & \cdot & \\ \cdot & \cdot & \\ \cdot & \cdot & \\ \cdot \end{array}\right]$

If rudely call this as a matrix A$A$, because of the condition, we have A=AT$A=A^T$.

Consider the outermost corner, the total number of the dots is n+n−1=2n−1∈odd$n+n-1=2n-1\in \text{odd}$

And deprive each corner, the newest outermost corner also satisfies the odd condition.

So every self-conjugate can be correspondence to odd-partition. And for each odd-partition, we can construct the matrix one corner by one corner.

In conclusion, the two numbers are the same.

(3)$(3)$ A$A$ is nilpotent and its dimension is 4$4$, so A4=O$A^4=O$. Consider the diagonal elements.

A4(i,i)=(A(i,i))4=0$A^4(i,i)=(A(i,i){)}^4=0$, so A$A$ is like A=(0ranranran00ranran000ran0000)$A=\left(\begin{array}{cccc}0& \text{ran}& \text{ran}& \text{ran}\\ 0& 0& \text{ran}& \text{ran}\\ 0& 0& 0& \text{ran}\\ 0& 0& 0& 0\end{array}\right)$. It is obvious that all the

eigenvalues are 0$0$. Consider Ker(A),Ker(A2),Ker(A3),Ke(A4)$\text{Ker}(A),\text{Ker}(A^2),\text{Ker}(A^3),\text{Ke}(A^4)$, dimension of each is nearly

1,2,3,4$1,2,3,4$ , since each ran$\text{ran}$ is randomly chosen from [−1,1]$[-1,1]$. The probability 4=1+1+1+1$4=1+1+1+1$

is 1$1$, others are 0$0$.

\textcolorblueAdvanced Algebra HW6      \textcolorblue2022.4.29$\text{textcolor}blue\text{Advanced Algebra }\mathbb{HW}6{}_{\text{textcolor}}blue2022.4.29$

1.6.1 Vandermode matrix$\text{Vandermode matrix}$

Let V$V$ be the space of real polynomials of degree less than n$n$. So dimV=n$\dim V=n$. Then for each a∈R$a\in \mathbb{R}$, the evaluation eva${\mathrm{ev}}_a$ is a dual vector.

For any real numbers a1,…,an∈R$a_1,\dots ,a_n\in \mathbb{R}$, consider the map L:V→Rn$L:V\to {\mathbb{R}}^n$ such that L(p)=[p(a1)⋮p(an)]$L(p)=\left[\begin{array}{c}p\left(a_1\right)\\ ⋮\\ p\left(a_n\right)\end{array}\right]$.

1. Write out the matrix for L$L$ under the basis 1,x,…,xn−1$1,x,\dots ,x^{n-1}$ for V$V$ and the standard basis for Rn${\mathbb{R}}^n$. (Do you know the name for this matrix?)
2. Prove that L$L$ is invertible if and only if a1,…,an$a_1,\dots ,a_n$ are distinct. (If you can name the matrix L$L$, then you may use its determinant formula without proof.)
3. Show that eva1,…,evan${\mathrm{ev}}_{a_1},\dots ,{\mathrm{ev}}_{a_n}$ form a basis for V∗$V^{\ast }$ if and only if all a1,…,an$a_1,\dots ,a_n$ are distinct.
4. Set n=3$n=3$. Find polynomials p1,p2,p3$p_1,p_2,p_3$ such that pi(j)=δij$p_i(j)={\delta }_{ij}$ for i,j∈{−1,0,1}$i,j\in \{-1,0,1\}$.
5. Set n=4$n=4$, and consider ev−2,ev−1,ev0,ev1,ev2∈V∗${\mathrm{ev}}_{-2},{\mathrm{ev}}_{-1},{\mathrm{ev}}_0,{\mathrm{ev}}_1,{\mathrm{ev}}_2\in V^{\ast }$. Since dimV∗=4$\dim V^{\ast }=4$, these must be linearly dependent. Find a non-trivial linear combination of these which is zero.

---

(1)$(1)$ L=[1a1⋯an−111a2⋯an−12⋮⋮1an⋯an−1n]$L=\left[\begin{array}{cccc}1& a_1& \cdots & a_1^{n-1}\\ 1& a_2& \cdots & a_2^{n-1}\\ ⋮& & & ⋮\\ 1& a_n& \cdots & a_n^{n-1}\end{array}\right]$Vandermode matrix

Calculate its inverse and we can get standard basis using Lagrange interpolation. (1a1⋯an−111a2⋯an−12⋮⋮1an⋯an−1n)(x0x1x2⋮xn−1)=(y0y1y2⋮yn−1)(1a1⋯an−111a2⋯an−12⋮⋮1an⋯an−1n)−1(y0y1y2⋮yn−1)=(x0x1x2⋮xn−1)$$\begin{gathered} \left(\begin{array}{cccc}1& a_1& \cdots & a_1^{n-1}\\ 1& a_2& \cdots & a_2^{n-1}\\ ⋮& & & ⋮\\ 1& a_n& \cdots & a_n^{n-1}\end{array}\right)\left(\begin{array}{c}{x}_0\\ x_1\\ x_2\\ ⋮\\ x_{n-1}\end{array}\right)=\left(\begin{array}{c}{y}_0\\ y_1\\ y_2\\ ⋮\\ y_{n-1}\end{array}\right) \\ {\left(\begin{array}{cccc}1& a_1& \cdots & a_1^{n-1}\\ 1& a_2& \cdots & a_2^{n-1}\\ ⋮& & & ⋮\\ 1& a_n& \cdots & a_n^{n-1}\end{array}\right)}^{-1}\left(\begin{array}{c}{y}_0\\ y_1\\ y_2\\ ⋮\\ y_{n-1}\end{array}\right)=\left(\begin{array}{c}{x}_0\\ x_1\\ x_2\\ ⋮\\ x_{n-1}\end{array}\right) \end{gathered}$$ Construct polynomial f(a)=∑iyi∏j≠ia−ajai−aj$f(a)={\displaystyle \sum _i{y}_i\prod _{j\ne i}\frac{a-a_j}{a_i-a_j}}$ So f(ai)=xi$f(a_i)=x_i$

So (V−1)ij${\left(V^{-1}\right)}_{ij}$ is the coefficient of ∏k≠ia−akai−ak${\displaystyle \prod _{k\ne i}\frac{a-a_k}{a_i-a_k}}$ at xj−1$x^{j-1}$ , which is (V−1)ij=[xj−1]∏k≠ia−akai−ak${\displaystyle {\left(V^{-1}\right)}_{ij}=\left[x^{j-1}\right]\prod _{k\ne i}\frac{a-a_k}{a_i-a_k}}$ (V−1)ij=(−1)j+1∑0≤p1<⋯<pn−ζ;p1,p2,⋯pn−j≠ixp1xp2⋯xpn−j∏0≤k<n;k≠i(xk−xi)$${\left(V^{-1}\right)}_{ij}=(-1{)}^{j+1}\frac{{\displaystyle \sum _{0\le p_1<\cdots <p_{n-\zeta };p_1,p_2,\cdots p_{n-j}\ne i}{x}_{p_1}{x}_{p_2}\cdots x_{p_{n-j}}}}{{\displaystyle \prod _{0\le k<n;k\ne i}(x_k-x_i)}}$$ The column of the (V−1)$(V^{-1})$ is the standard basis of V$V$

(2)$(2)$ det$detL={\displaystyle \prod _{1\le i\le j\le n}(a_i-a_j)\ne 0⟺a_i\ne a_j}$

(3)$(3)$ e v_{a_{1}}, \cdots, ev_{a_n}$e{v}_{a_1},\cdots ,e{v}_{a_n}$ form a basis for V^{*} \Longleftrightarrow e v_{a_{1}}, e v_{a_{2}}, \cdots, ev_{a_n}$V^{\ast }⟺e{v}_{a_1},e{v}_{a_2},\cdots ,e{v}_{a_n}$, evan are linearly indepenctent.

The matrix \left(\begin{array}{c}e v_{a_{1}} \\ e v_{a_{2}} \\ \vdots \\ e v_{a_{n}}\end{array}\right)$\left(\begin{array}{c}e{v}_{a_1}\\ e{v}_{a_2}\\ ⋮\\ e{v}_{a_n}\end{array}\right)$ is invertible, which means L$L$ is invertible. According to \small(2)$(2)$, a_i$a_i$ are distinct.

(4)$(4)$ Pick original basis \{1,x,x^2\}$\{1,x,x^2\}$ So \alpha_{1}=(1,-1,1) \quad \alpha_{2}=(1,0,0) \quad \alpha_{3}=(1,1,1)${\alpha }_1=(1,-1,1){\alpha }_2=(1,0,0){\alpha }_3=(1,1,1)$ A=\left(\begin{array}{l}\alpha_{1} \\ \alpha_{2} \\ \alpha_{3}\end{array}\right)=\left(\begin{array}{ccc}1 & -1 & 1 \\ 1 & 0 & 0 \\ 1 & 1 & 1\end{array}\right) \quad A^{-1}=\left(\begin{array}{ccc}0 & 1 & 0 \\ -\frac{1}{2} & 0 & \frac{1}{2} \\ \frac{1}{2} & -1 & \frac{1}{2}\end{array}\right) $$A=\left(\begin{array}{l}{\alpha }_1\\ {\alpha }_2\\ {\alpha }_3\end{array}\right)=\left(\begin{array}{ccc}1& -1& 1\\ 1& 0& 0\\ 1& 1& 1\end{array}\right)A^{-1}=\left(\begin{array}{ccc}0& 1& 0\\ -\frac{1}{2}& 0& \frac{1}{2}\\ \frac{1}{2}& -1& \frac{1}{2}\end{array}\right)$$ So p_{1}=-\dfrac{1}{2} x+\dfrac{1}{2} x^{2} \quad p_{2}=1-x^{2} \quad p_{3}=\dfrac{1}{2} x+\dfrac{1}{2} x^{2}$p_1=-{\displaystyle \frac{1}{2}}x+{\displaystyle \frac{1}{2}}{x}^2{p}_2=1-x^2{p}_3={\displaystyle \frac{1}{2}}x+{\displaystyle \frac{1}{2}}{x}^2$

(5)$(5)$ Set p(x)=ax^3+bx^2+cx+d$p(x)=a{x}^3+b{x}^2+cx+d$ and m e v_{-2}+n e v_{-1}+p e v_{0}+q e v_{1}+r e v_{2}=0$$me{v}_{-2}+ne{v}_{-1}+pe{v}_0+qe{v}_1+re{v}_2=0$$ \begin{gathered} e v_{-2}=-8 a+4 b-2 c+d \quad e v_{-1}=-a+b-c+d \quad e v_{0}=d\\ \quad e v_{1}=a+b+c+d \quad e v_{2}=8 a+4 b+2 c+d\\ \left(\begin{array}{ccccc}-8 & -1 & 0 & 1 & 8 \\ 4 & 1 & 0 & 1 & 4 \\ -2 & -1 & 0 & 1 & 2 \\ 1 & 1 & 1 & 1 &1\end{array}\right)\left(\begin{array}{l}m \\ n \\ p \\ q \\ r\end{array}\right)=\boldsymbol 0 \end{gathered} $$\begin{array}{c}e{v}_{-2}=-8a+4b-2c+de{v}_{-1}=-a+b-c+de{v}_0=d\\ e{v}_1=a+b+c+de{v}_2=8a+4b+2c+d\\ \left(\begin{array}{ccccc}-8& -1& 0& 1& 8\\ 4& 1& 0& 1& 4\\ -2& -1& 0& 1& 2\\ 1& 1& 1& 1& 1\end{array}\right)\left(\begin{array}{l}m\\ n\\ p\\ q\\ r\end{array}\right)=\text{boldsymbol}0\end{array}$$ Solve that e v_{-2}-4 e v_{-1}+6 e v_{0}-4 e v_{1}+e v_{2}=0$e{v}_{-2}-4e{v}_{-1}+6e{v}_0-4e{v}_1+e{v}_2=0$

1.6.2\ \small \mbox{dual vector in polynomials}$\text{dual vector inpolynomials}$

Let V$V$ be the space of real polynomials of degree less than 3$3$. Which of the following is a dual vector? Prove it or show why not.

1. p \mapsto \operatorname{ev}_{5}((x+1) p(x))$p\mapsto {\mathrm{ev}}_5((x+1)p(x))$.
2. p \mapsto \lim _{x \rightarrow \infty} \dfrac{p(x)}{x}$p\mapsto \underset{x\to \mathrm{\infty }}{lim}{\displaystyle \frac{p(x)}{x}}$.
3. p \mapsto \lim _{x \rightarrow \infty} \dfrac{p(x)}{x^{2}}$p\mapsto \underset{x\to \mathrm{\infty }}{lim}{\displaystyle \frac{p(x)}{x^2}}$.
4. p \mapsto p(3) p^{\prime}(4)$p\mapsto p(3)p^{\prime }(4)$.
5. p \mapsto \operatorname{deg}(p)$p\mapsto \mathrm{deg}(p)$, the degree of the polynomial p$p$.

---

(1)$(1)$ Yes. ①\ e_{s}((x+1) p(x))=6 p(5)$\mathrm{①}{e}_s((x+1)p(x))=6p(5)$. that is the map from V$V$ to \mathbb{R}$\mathbb{R}$. ②$\mathrm{②}$ For \forall\ p, q \in V$\mathrm{\forall }p,q\in V$ and

\forall m, n \in \mathbb{R}, L(m p+n q)=6 m p(5)+6 n p(5)=m L(p)+n L(q)$\mathrm{\forall }m,n\in \mathbb{R},L(mp+nq)=6mp(5)+6np(5)=mL(p)+nL(q)$, so its bilinear.

(2)$(2)$ No. Sometimes the limit doeen't exist when \mbox{deg}(p)\geq 2$\text{deg}(p)\ge 2$

(3)$(3)$ Yes. This vector is just a 'taking the coefficient of x^2$x^2$', which is bilinear.

(4)$(4)$ No. For instance, p(x)=x^{2}+2, q(x)=-2 x, \quad L(p)=11 \times 8=88 \quad L(q)=12$p(x)=x^2+2,q(x)=-2x,L(p)=11\times 8=88L(q)=12$

L(p+q)=5 \times 6=30 . \quad L(p+q) \neq L(p)+L(q)$L(p+q)=5\times 6=30.L(p+q)\ne L(p)+L(q)$. So it's not a dual vector.

(5)$(5)$ No. For instance, p(x)=x^{2}+x, q(x)=-x^{2}+1, L(p)=\operatorname{deg}(p)=2, L(q)=\operatorname{deg}(q)=2$p(x)=x^2+x,q(x)=-x^2+1,L(p)=\mathrm{deg}(p)=2,L(q)=\mathrm{deg}(q)=2$

L(p+q)=\operatorname{deg}(x+1)=1 . L(p)+L(q) \neq L(p+q)$L(p+q)=\mathrm{deg}(x+1)=1.L(p)+L(q)\ne L(p+q)$. So it's not a clual vector

1.6.3\ \small \mbox{directional derivative}$\text{directionalderivative}$

Fix a differentiable function f: \mathbb{R}^{2} \rightarrow \mathbb{R}$f:{\mathbb{R}}^2\to \mathbb{R}$, and fix a point \boldsymbol{p} \in \mathbb{R}^{2}$\text{boldsymbol}p\in {\mathbb{R}}^2$. For any vector \boldsymbol{v} \in \mathbb{R}^{2}$\text{boldsymbol}v\in {\mathbb{R}}^2$, then the directional derivative of f$f$ at \boldsymbol{p}$\text{boldsymbol}p$ in the direction of \boldsymbol{v}$\text{boldsymbol}v$ is defined as \nabla_{\boldsymbol{v}} f:=\lim _{t \rightarrow 0} \dfrac{f(\boldsymbol{p}+t \boldsymbol{v})-f(\boldsymbol{p})}{t} . S \mathrm{Show}${\mathrm{\nabla }}_{\text{boldsymbol}v}f:=\underset{t\to 0}{lim}{\displaystyle \frac{f(\text{boldsymbol}p+t\text{boldsymbol}v)-f(\text{boldsymbol}p)}{t}}.S\mathrm{Show}$ that the map \nabla f: \boldsymbol{v} \mapsto \nabla_{\boldsymbol{v}}(f)$\mathrm{\nabla }f:\text{boldsymbol}v\mapsto {\mathrm{\nabla }}_{\text{boldsymbol}v}(f)$ is a dual vector in \left(\mathbb{R}^{2}\right)^{*}${\left({\mathbb{R}}^2\right)}^{\ast }$, i.e., a row vector. Also, what are its "coordinates" under the standard dual basis? (Remark: In calculus, we write \nabla f$\mathrm{\nabla }f$ as a column vector for historical reasons. By all means, from a mathematical perspective, the correct way to write \nabla f$\mathrm{\nabla }f$ is to write it as a row vector, as illlustrated in this problem. (But don't annoy your calculus teachers though.... In your calculus class, you use whatever notation your calculus teacher told you.) (Extra Remark: If we use row vector, then the evaluation of \nabla f$\mathrm{\nabla }f$ at \boldsymbol{v}$\text{boldsymbol}v$ is purely linear, and no inner product structure is needed, which is sweet. But if we HAVE TO write \nabla f$\mathrm{\nabla }f$ as a column vector (for historical reason), then we would have to do a dot product between \nabla f$\mathrm{\nabla }f$ and \boldsymbol{v}$\text{boldsymbol}v$, which now requires an inner product structure. That is an unnecessary dependence on an extra structure that actually should have no influence.)

---

Set \vec{v}=\begin{pmatrix}a\\b\end{pmatrix}$\overrightarrow{v}=\left(\begin{array}{c}a\\ b\end{array}\right)$, since the function f$f$ is differentiable, \nabla_{\vec{v}} f=\dfrac{\partial f(\vec{v})}{\partial x} \cdot \dfrac{a}{\sqrt{a^{2}+b^{2}}}+\dfrac{\partial f(\vec{v})}{\partial y} \dfrac{b}{\sqrt{a^{2}+b}}${\mathrm{\nabla }}_{\overrightarrow{v}}f={\displaystyle \frac{\partial f(\overrightarrow{v})}{\partial x}}\cdot {\displaystyle \frac{a}{\sqrt{a^2+b^2}}}+{\displaystyle \frac{\partial f(\overrightarrow{v})}{\partial y}}{\displaystyle \frac{b}{\sqrt{a^2+b}}}$

So the map \nabla f$\mathrm{\nabla }f$ is a map from \left(\mathbb{R}^{2}\right)^{*}${\left({\mathbb{R}}^2\right)}^{\ast }$ to \mathbb{R}$\mathbb{R}$.And for \forall$\mathrm{\forall }$ diffential functions f, g, \forall m, n \in \mathbb{R}$f,g,\mathrm{\forall }m,n\in \mathbb{R}$, we have: \begin{aligned} \nabla_{\vec{v}}(m f+n g) &=\frac{\partial[m f(\vec{v})+n g(\vec{v})]}{\partial x} \cdot \frac{a}{\sqrt{a^{2}+b^{2}}}+\frac{\partial[m f(\vec{v})+n g(\vec{v})]}{\partial y} \cdot \frac{b}{\sqrt{a^{2}+b^{2}}} \\ &=m \nabla_{\vec{v}} f+n \nabla_{\vec{v}} g \end{aligned} $$\begin{array}{rl}{\mathrm{\nabla }}_{\overrightarrow{v}}(mf+ng)& =\frac{\partial [mf(\overrightarrow{v})+ng(\overrightarrow{v})]}{\partial x}\cdot \frac{a}{\sqrt{a^2+b^2}}+\frac{\partial [mf(\overrightarrow{v})+ng(\overrightarrow{v})]}{\partial y}\cdot \frac{b}{\sqrt{a^2+b^2}}\\ & =m{\mathrm{\nabla }}_{\overrightarrow{v}}f+n{\mathrm{\nabla }}_{\overrightarrow{v}}g\end{array}$$ So the map \nabla f$\mathrm{\nabla }f$ is bilinear, i.e, is a dual vector in \left(\mathbb{R}^{2}\right)^{*}${\left({\mathbb{R}}^2\right)}^{\ast }$.

Since x$x$-axis and y$y$-axis are perpendicular, the standard dual basis is \dfrac{\partial f}{\partial x}${\displaystyle \frac{\partial f}{\partial x}}$ and \dfrac{\partial f}{\partial y} .${\displaystyle \frac{\partial f}{\partial y}}.$ And the coordinates are \dfrac{\vec{v} \cdot \hat{x}}{\|\vec{v}\|}${\displaystyle \frac{\overrightarrow{v}\cdot \hat{x}}{\Vert \overrightarrow{v}\Vert }}$ and \dfrac{\vec{v} \cdot \hat{y}}{\|\vec{v}\|}${\displaystyle \frac{\overrightarrow{v}\cdot \hat{y}}{\Vert \overrightarrow{v}\Vert }}$

1.6.4 $$

Consider a linear map L: V \rightarrow W$L:V\to W$ and its dual map L^{*}: W^{*} \rightarrow V^{*}$L^{\ast }:W^{\ast }\to V^{\ast }$. Prove the following.

1. \operatorname{Ker}\left(L^{*}\right)$\mathrm{Ker}\left(L^{\ast }\right)$ is exactly the collection of dual vectors in W^{*}$W^{\ast }$ that kills \operatorname{Ran}(L)$\mathrm{Ran}(L)$.
2. \operatorname{Ran}\left(L^{*}\right)$\mathrm{Ran}\left(L^{\ast }\right)$ is exactly the collection of dual vectors in V^{*}$V^{\ast }$ that kills \operatorname{Ker}(L)$\mathrm{Ker}(L)$.

---

(1)$(1)$ First, all the elements in \ker(L^*)\in W^{*}$\ker (L^{\ast })\in W^{\ast }$, so just prove \forall \ \vec{v}\in \ker(L^*),\vec{\omega}\in \mbox{Ran}(L),\vec{v}^{T}\cdot \vec{\omega}=0$\mathrm{\forall }\overrightarrow{v}\in \ker (L^{\ast }),\overrightarrow{\omega }\in \text{Ran}(L),{\overrightarrow{v}}^T\cdot \overrightarrow{\omega }=0$

L^{*}\vec{v}=0,L^{*}\vec{v}\cdot\vec{x}=0=\vec{v}^{T}(L\vec{x})$L^{\ast }\overrightarrow{v}=0,L^{\ast }\overrightarrow{v}\cdot \overrightarrow{x}=0={\overrightarrow{v}}^T(L\overrightarrow{x})$, set L\vec{x}=\vec{\omega}$L\overrightarrow{x}=\overrightarrow{\omega }$ So \vec{v}^{T}\cdot \vec{\omega}=\langle \vec{v},\vec{\omega}\rangle=0${\overrightarrow{v}}^T\cdot \overrightarrow{\omega }=⟨\overrightarrow{v},\overrightarrow{\omega }⟩=0$

(2)$(2)$ First, all the elements in \mbox{Ran}(L^{*})\in V^{*}$\text{Ran}(L^{\ast })\in V^{\ast }$ ,so just prove \forall \ \vec{v}\in \mbox{Ran}(L^*),\vec{\omega}\in \mbox{Ker}(L),\vec{v}^{T}\cdot \vec{\omega}=0$\mathrm{\forall }\overrightarrow{v}\in \text{Ran}(L^{\ast }),\overrightarrow{\omega }\in \text{Ker}(L),{\overrightarrow{v}}^T\cdot \overrightarrow{\omega }=0$

L\vec{\omega}=0,L\vec{\omega}\cdot\vec{x}=0=\vec{\omega}^{T}(L^{*}\vec{x})$L\overrightarrow{\omega }=0,L\overrightarrow{\omega }\cdot \overrightarrow{x}=0={\overrightarrow{\omega }}^T(L^{\ast }\overrightarrow{x})$, set L^{*}\vec{x}=\vec{v}$L^{\ast }\overrightarrow{x}=\overrightarrow{v}$, So \vec{\omega}^{T}\cdot \vec{v}=\langle \vec{\omega},\vec{v}\rangle=0${\overrightarrow{\omega }}^T\cdot \overrightarrow{v}=⟨\overrightarrow{\omega },\overrightarrow{v}⟩=0$

\large\textcolor{blue}{\mbox{Advanced Algebra } \small \mathbb{HW}\mathrm{7}}\ \ \ \ \ \ _\textcolor{blue}{2022.5.3}$\text{textcolor}blue\text{Advanced Algebra }\mathbb{HW}7{}_{\text{textcolor}}blue2022.5.3$

1.7.1\ \small \mbox{bra map and Riesz map}$\text{bra map and Rieszmap}$

On the space \mathbb{R}^{n}${\mathbb{R}}^n$, we fix a symmetric positive-definite matrix A$A$, and define (\boldsymbol{v}, \boldsymbol{w})=\boldsymbol{v}^{\mathrm{T}}A\boldsymbol{w}$(\text{boldsymbol}v,\text{boldsymbol}w)=\text{boldsymbol}{v}^{\mathrm{T}}A\text{boldsymbol}w$

1. Show that this is an inner product.
2. The Riesz map (inverse of the bra map) from V^{*}$V^{\ast }$ to V$V$ would send a row vector \boldsymbol{v}^{\mathrm{T}}$\text{boldsymbol}{v}^{\mathrm{T}}$ to what?
3. The bra map from V$V$ to V^{*}$V^{\ast }$ would send a vector \boldsymbol{v}$\text{boldsymbol}v$ to what?
4. The dual of the Riesz map from V^{*}$V^{\ast }$ to V$V$ would send a row vector \boldsymbol{v}^{\mathrm{T}}$\text{boldsymbol}{v}^{\mathrm{T}}$ to what?

---

(1)$(1)$ Easy to prove.

(2)$(2)$ The bra map means \forall \ \langle \boldsymbol{v}|\in \mathcal{B},s.t.\langle \boldsymbol{v}|:\boldsymbol{\omega\longmapsto}\langle\boldsymbol{v},\boldsymbol{\omega}\rangle=\boldsymbol{v}^{\mathrm{T}}A\boldsymbol{w}$\mathrm{\forall }⟨\text{boldsymbol}v|\in \mathcal{B},s.t.⟨\text{boldsymbol}v|:\text{boldsymbol}\omega ⟼⟨\text{boldsymbol}v,\text{boldsymbol}\omega ⟩=\text{boldsymbol}{v}^{\mathrm{T}}A\text{boldsymbol}w$ So the inverse of \langle \boldsymbol{v}|$⟨\text{boldsymbol}v|$ is make \boldsymbol{v}^{\mathrm{T}}A$\text{boldsymbol}{v}^{\mathrm{T}}A$

to \boldsymbol {v}$\text{boldsymbol}v$, which is from V^{*}$V^{\ast }$ to V$V$. Set \boldsymbol{u}=\boldsymbol {v}^{T}A$\text{boldsymbol}u=\text{boldsymbol}{v}^{T}A$, so \boldsymbol{v}^{T}=\boldsymbol{u}A^{-1}$\text{boldsymbol}{v}^T=\text{boldsymbol}u{A}^{-1}$ then transpose it we can get \boldsymbol{v}=(A^{-1})^{T}\boldsymbol{u^{T}}$\text{boldsymbol}v=(A^{-1}{)}^T\text{boldsymbol}{u}^T$

So if the input is \boldsymbol{v}^{T}\in V^{*}$\text{boldsymbol}{v}^T\in V^{\ast }$, the output is (A^{-1})^{T}(\boldsymbol v^{T})^{T}=(A^{-1})^{T}\boldsymbol{v}\in V$(A^{-1}{)}^T(\text{boldsymbol}{v}^T{)}^T=(A^{-1}{)}^T\text{boldsymbol}v\in V$

(3)$(3)$ Obviously, it sends \boldsymbol{v}$\text{boldsymbol}v$ to \boldsymbol{v}^{T}A$\text{boldsymbol}{v}^{T}A$

(4)$(4)$ I guess the result is the same with \small(2)$(2)$, which sends \boldsymbol {v}^{T}$\text{boldsymbol}{v}^T$ to (A^{-1})^{T}\boldsymbol{v}$(A^{-1}{)}^T\text{boldsymbol}v$

1.7.2\ \small \mbox{What is a derivative}$\text{What is aderivative}$

The discussions in this problem holds for all manifolds M$M$. But for simplicities sake, suppose M=\mathbb{R}^{3}$M={\mathbb{R}}^3$ for this problem.

Let V$V$ be the space of all analytic functions from M$M$ to \mathbb{R}$\mathbb{R}$. Here analytic means f(x, y, z)$f(x,y,z)$ is a infinite polynomial series (its Taylor expansion) with variables x, y, z$x,y,z$. Approximately f(x, y, z)=a_{0}+a_{1} x+a_{2} y+$f(x,y,z)=a_0+a_{1}x+a_{2}y+$ a_{3} z+a_{4} x^{2}+a_{5} x y+a_{6} x z+a_{7} y^{2}+\ldots$a_{3}z+a_4{x}^2+a_{5}xy+a_{6}xz+a_7{y}^2+\dots$, and things should converge always.

Then a dual vector v \in V^{*}$v\in V^{\ast }$ is said to be a "derivation at \boldsymbol{p} \in M^{\prime \prime}$\text{boldsymbol}p\in M^{\prime \prime }$ if it satisfy the following Leibniz rule (or product rule): v(f g)=f(\boldsymbol{p}) v(g)+g(\boldsymbol{p}) v(f) . $$v(fg)=f(\text{boldsymbol}p)v(g)+g(\text{boldsymbol}p)v(f).$$ (Note the similarity with your traditional product rule (f g)^{\prime}(x)=f(x) g^{\prime}(x)+g(x) f^{\prime}(x)$(fg{)}^{\prime }(x)=f(x)g^{\prime }(x)+g(x)f^{\prime }(x)$.) Prove the following:

1. Constant functions in V$V$ must be sent to zero by all derivations at any point.
2. Let x, y, z \in V$x,y,z\in V$ be the coordinate function. Suppose \boldsymbol{p}=\left[\begin{array}{l}p_{1} \\ p_{2} \\ p_{3}\end{array}\right]$\text{boldsymbol}p=\left[\begin{array}{l}{p}_1\\ p_2\\ p_3\end{array}\right]$, then for any derivation v$v$ at \boldsymbol{p}$\text{boldsymbol}p$, then we have v\left(\left(x-p_{1}\right) f\right)=f(\boldsymbol{p}) v(x), v\left(\left(y-p_{2}\right) f\right)=f(\boldsymbol{p}) v(y)$v\left((x-p_1)f\right)=f(\text{boldsymbol}p)v(x),v\left((y-p_2)f\right)=f(\text{boldsymbol}p)v(y)$ and v\left(\left(z-p_{3}\right) f\right)=f(\boldsymbol{p}) v(z)$v\left((z-p_3)f\right)=f(\text{boldsymbol}p)v(z)$.
3. Let x, y, z \in V$x,y,z\in V$ be the coordinate function. Suppose \boldsymbol{p}=\left[\begin{array}{l}p_{1} \\ p_{2} \\ p_{3}\end{array}\right]$\text{boldsymbol}p=\left[\begin{array}{l}{p}_1\\ p_2\\ p_3\end{array}\right]$, then for any derivation v$v$ at \boldsymbol{p}$\text{boldsymbol}p$, then we have v\left(\left(x-p_{1}\right)^{a}\left(y-p_{2}\right)^{b}\left(z-p_{3}\right)^{c}\right)=0$v\left({(x-p_1)}^a{(y-p_2)}^b{(z-p_3)}^c\right)=0$ for any non-negative integers a, b, c$a,b,c$ such that a+b+c>1$a+b+c>1$.
4. Let x, y, z \in V$x,y,z\in V$ be the coordinate function. Suppose \boldsymbol{p}=\left[\begin{array}{l}p_{1} \\ p_{2} \\ p_{3}\end{array}\right]$\text{boldsymbol}p=\left[\begin{array}{l}{p}_1\\ p_2\\ p_3\end{array}\right]$, then for any derivation v$v$ at \boldsymbol{p}, v(f)=$\text{boldsymbol}p,v(f)=$ \dfrac{\partial f}{\partial x}(\boldsymbol{p}) v(x)+\dfrac{\partial f}{\partial y}(\boldsymbol{p}) v(y)+\dfrac{\partial f}{\partial z}(\boldsymbol{p}) v(z)${\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)v(x)+{\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)v(y)+{\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)v(z)$. (Hint: use the Taylor expansion of f$f$ at \left.\boldsymbol{p} .\right)$\text{boldsymbol}p.)$
5. Any derivation v$v$ at \boldsymbol{p}$\text{boldsymbol}p$ must be exactly the directional derivative operator \nabla_{\boldsymbol{v}}${\mathrm{\nabla }}_{\text{boldsymbol}v}$ where \boldsymbol{v}=\left[\begin{array}{l}v(x) \\ v(y) \\ v(z)\end{array}\right]$\text{boldsymbol}v=\left[\begin{array}{l}v(x)\\ v(y)\\ v(z)\end{array}\right]$. (Remark: So, algebraically speaking, tangent vectors are exactly derivations, i.e., things that satisfy the Leibniz rule.)

---

(1)$(1)$ Set f(\vec{p})\equiv a$f(\overrightarrow{p})\equiv a$, because v(f g)=f(\boldsymbol{p}) v(g)+g(\boldsymbol{p}) v(f)$v(fg)=f(\text{boldsymbol}p)v(g)+g(\text{boldsymbol}p)v(f)$ and v\in V^{*}$v\in V^{\ast }$ is linear, v(fg)=av(g)+g(\boldsymbol{p})v(f)$v(fg)=av(g)+g(\text{boldsymbol}p)v(f)$

Set g=f$g=f$, so v(ff)=2av(f)=v(af)=av(f)$v(ff)=2av(f)=v(af)=av(f)$ If a=0$a=0$, v(g)=v(0)=v(gg)=0+0=0$v(g)=v(0)=v(gg)=0+0=0$ If a\neq 0$a\ne 0$

av(f)=0$av(f)=0$, and v(f)=0$v(f)=0$ So constant functions in V$V$ are all sent to 0$0$

(2)$(2)$ Calculate v((x-p_1)f)=f(\boldsymbol {p})v(x-p_1)+(x-p_1)(\boldsymbol{p})v(f)$v((x-p_1)f)=f(\text{boldsymbol}p)v(x-p_1)+(x-p_1)(\text{boldsymbol}p)v(f)$ And x(\boldsymbol{p})=p_1,p_1(\boldsymbol{p})=p_1$x(\text{boldsymbol}p)=p_1,p_1(\text{boldsymbol}p)=p_1$

So (x-p_1)(\boldsymbol{p})=0$(x-p_1)(\text{boldsymbol}p)=0$ For constant \boldsymbol{p}$\text{boldsymbol}p$, v(\boldsymbol{p}=0)$v(\text{boldsymbol}p=0)$ So v((x-p_1)f)=f(\boldsymbol{p})(v(x)-v(p_1))=f(\boldsymbol{p})v(x)$v((x-p_1)f)=f(\text{boldsymbol}p)(v(x)-v(p_1))=f(\text{boldsymbol}p)v(x)$

(3)$(3)$ As a,b,c$a,b,c$ are all integers, if a,b,c<1$a,b,c<1$, the sum of them is a+b+c\leq 0$a+b+c\le 0$, contradiction

So at least one intergers is \geq 1$\ge 1$, without loss of generalization, assume a\geq 1$a\ge 1$

v\left(\left(x-p_{1}\right)^{a}\left(y-p_{2}\right)^{b}\left(z-p_{3}\right)^{c}\right)=v(x-p_1)((x-p_1)^{a-1}(y-p_2)^b(z-p_3)^c)(\boldsymbol{p})$v\left({(x-p_1)}^a{(y-p_2)}^b{(z-p_3)}^c\right)=v(x-p_1)((x-p_1{)}^{a-1}(y-p_2{)}^b(z-p_3{)}^c)(\text{boldsymbol}p)$

And if a> 1$a>1$, (x-p_1)^{a-1}(\boldsymbol{p})=(x-p_1)^{a-2}(x-p_1)(\boldsymbol{p})=0$(x-p_1{)}^{a-1}(\text{boldsymbol}p)=(x-p_1{)}^{a-2}(x-p_1)(\text{boldsymbol}p)=0$ if a=1$a=1$, then b+c>0$b+c>0$

at least one integer in b$b$ and c$c$ \geq 1$\ge 1$, without of generalization, assume b\geq 1$b\ge 1$. Then

(y-p_2)^{b}(\boldsymbol{p})=(y-p_2)^{b-1}(y-p_2)(\boldsymbol{p})=0$(y-p_2{)}^b(\text{boldsymbol}p)=(y-p_2{)}^{b-1}(y-p_2)(\text{boldsymbol}p)=0$ So v\left(\left(x-p_{1}\right)^{a}\left(y-p_{2}\right)^{b}\left(z-p_{3}\right)^{c}\right)=0$v\left({(x-p_1)}^a{(y-p_2)}^b{(z-p_3)}^c\right)=0$

(4)$(4)$ Use Taylor expansion for f$f$, we have f(x, y, z)=f\left(p_{1}, p_{2}, p_{3}\right)+\frac{\partial f}{\partial x}(\boldsymbol{p})\left(x-p_{1}\right)+\frac{\partial f}{\partial y}(\boldsymbol{p})\left(y-p_{2}\right)+\frac{\partial f}{\partial z}(\boldsymbol{p})\left(z-p_{3}\right)+o(|\boldsymbol{r}-\boldsymbol{p}|) $$f(x,y,z)=f(p_1,p_2,p_3)+\frac{\partial f}{\partial x}(\text{boldsymbol}p)(x-p_1)+\frac{\partial f}{\partial y}(\text{boldsymbol}p)(y-p_2)+\frac{\partial f}{\partial z}(\text{boldsymbol}p)(z-p_3)+o(|\text{boldsymbol}r-\text{boldsymbol}p|)$$ According to (3)$(3)$, the remainder o(|\boldsymbol{r}-\boldsymbol{p}|)=\left(x-p_{1}\right)^{a}\left(y-p_{2}\right)^{b}\left(z-p_{3}\right)^{c},a+b+c>1$o(|\text{boldsymbol}r-\text{boldsymbol}p|)={(x-p_1)}^a{(y-p_2)}^b{(z-p_3)}^c,a+b+c>1$

So v(o(|\boldsymbol{r}-\boldsymbol{p}|))=0$v(o(|\text{boldsymbol}r-\text{boldsymbol}p|))=0$ For constant number v$v$ sends to 0$0$. Take v$v$ function to the Taylor expansion v(f)=\dfrac{\partial f}{\partial x}(\boldsymbol{p}) v(x)+\dfrac{\partial f}{\partial y}(\boldsymbol{p}) v(y)+\dfrac{\partial f}{\partial z}(\boldsymbol{p}) v(z) $$v(f)={\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)v(x)+{\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)v(y)+{\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)v(z)$$ Which shows the complete differential at \boldsymbol{p}$\text{boldsymbol}p$

(5)$(5)$ Just calculate the directional derivative \nabla_{\boldsymbol{v}}${\mathrm{\nabla }}_{\text{boldsymbol}v}$ where \boldsymbol{v}=\left[\begin{array}{l}v(x) \\ v(y) \\ v(z)\end{array}\right]$\text{boldsymbol}v=\left[\begin{array}{l}v(x)\\ v(y)\\ v(z)\end{array}\right]$ \begin{aligned} \nabla_{v} f &=\lim _{t \rightarrow 0^{+}} \frac{f(\boldsymbol{p}+t \boldsymbol{v})-f(\boldsymbol{p})}{t} \\ &=\lim _{t \rightarrow 0^{+}} \dfrac{f(\boldsymbol{p})+\dfrac{\partial f}{\partial x}(\boldsymbol{p}) v(x) t+\dfrac{\partial f}{\partial y}(\boldsymbol{p}) v(y) t+\dfrac{\partial f}{\partial z}(\boldsymbol{p}) v(z) t+o(\|\boldsymbol{v}\| t)-f(\boldsymbol{p})}{t} \\ &=\frac{\partial f}{\partial x}(\boldsymbol{p}) v(x)+\frac{\partial f}{\partial y}(\boldsymbol{p}) v(y)+\frac{\partial f}{\partial z}(\boldsymbol{p}) v(z) \\ &=v(f) \end{aligned} $$\begin{array}{rl}{\mathrm{\nabla }}_{v}f& =\underset{t\to 0^{+}}{lim}\frac{f(\text{boldsymbol}p+t\text{boldsymbol}v)-f(\text{boldsymbol}p)}{t}\\ & =\underset{t\to 0^{+}}{lim}{\displaystyle \frac{f(\text{boldsymbol}p)+{\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)v(x)t+{\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)v(y)t+{\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)v(z)t+o(\Vert \text{boldsymbol}v\Vert t)-f(\text{boldsymbol}p)}{t}}\\ & =\frac{\partial f}{\partial x}(\text{boldsymbol}p)v(x)+\frac{\partial f}{\partial y}(\text{boldsymbol}p)v(y)+\frac{\partial f}{\partial z}(\text{boldsymbol}p)v(z)\\ & =v(f)\end{array}$$ So derivative in calculus is just a vector in the dual space of R^{n}$R^n$ which suits Leibniz rule

1.7.3\ \small \mbox{What is a vector field}$\text{What is a vectorfield}$

The discussions in this problem holds for all manifolds M$M$. But for simplicities sake, suppose M=\mathbb{R}^{3}$M={\mathbb{R}}^3$ for this problem. Let V$V$ be the space of all analytic functions from M$M$ to \mathbb{R}$\mathbb{R}$ as usual. We say X: V \rightarrow V$X:V\to V$ is a vector field on X$X$ if X(f g)=f X(g)+g X(f)$X(fg)=fX(g)+gX(f)$, i.e., the Leibniz rule again! Prove the following:

1. Show that X_{\boldsymbol{p}}: V \rightarrow \mathbb{R}$X_{\text{boldsymbol}p}:V\to \mathbb{R}$ such that X_{\boldsymbol{p}}(f)=(X(f))(\boldsymbol{p})$X_{\text{boldsymbol}p}(f)=(X(f))(\text{boldsymbol}p)$ is a derivation at \boldsymbol{p}$\text{boldsymbol}p$. (Hence X$X$ is indeed a vector field, since it is the same as picking a tangent vector at each point.)

2. Note that each f$f$ on M$M$ induces a covector field \mathrm{d} f$\mathrm{d}f$. Then at each point \boldsymbol p$\text{boldsymbol}p$, the cotangent vector \mathrm{d} f$\mathrm{d}f$ and the tangent vector X$X$ would evaluate to some number. So \mathrm{d} f(X)$\mathrm{d}f(X)$ is a function M \rightarrow \mathbb{R}$M\to \mathbb{R}$. Show that \mathrm{d} f(X)=X(f)$\mathrm{d}f(X)=X(f)$, i.e., the two are the same. (Hint: just use definitions and calculate directly.)

3. If X, Y: V \rightarrow V$X,Y:V\to V$ are vector fields, then note that X \circ Y: V \rightarrow V$X\circ Y:V\to V$ might not be a vector field. (Leibniz rule might fail.) However, show that X \circ Y-Y \circ X$X\circ Y-Y\circ X$ is always a vector field.

4. On a related note, show that if A, B$A,B$ are skew-symmetric matrices, then A B-B A$AB-BA$ is still skewsymmetric. (Skew-symmetric matrices actually corresponds to certain vector fields on the manifold of orthogonal matrices. So this is no coincidence.)

---

(1)$(1)$ X_{\boldsymbol{p}}(fg)=(X(fg))(\boldsymbol{p})=(fX(g)+gX(f))(\boldsymbol{p})=f(\boldsymbol{p})X(g)(\boldsymbol{p})+g(\boldsymbol{p})X(f)(\boldsymbol{p})$X_{\text{boldsymbol}p}(fg)=(X(fg))(\text{boldsymbol}p)=(fX(g)+gX(f))(\text{boldsymbol}p)=f(\text{boldsymbol}p)X(g)(\text{boldsymbol}p)+g(\text{boldsymbol}p)X(f)(\text{boldsymbol}p)$

=f(\boldsymbol{p})X_{\boldsymbol{p}}(g)+g(\boldsymbol{p})X_{\boldsymbol{p}}(f)$=f(\text{boldsymbol}p)X_{\text{boldsymbol}p}(g)+g(\text{boldsymbol}p)X_{\text{boldsymbol}p}(f)$ So it suits the definition of derivative at \boldsymbol{p}$\text{boldsymbol}p$

(2)$(2)$ X_{\boldsymbol{p}}:V\rightarrow R$X_{\text{boldsymbol}p}:V\to R$ So X_{\boldsymbol{p}}\in V^{*}$X_{\text{boldsymbol}p}\in V^{\ast }$ X_{p}=\left[\begin{array}{c} X_{\boldsymbol{p}}(X) & X_{p}(Y) & X_{p}(Z) \end{array}\right]$X_p=\left[\begin{array}{ccc}{X}_{\text{boldsymbol}p}(X)& X_p(Y)& X_p(Z)\end{array}\right]$

df(X)(\boldsymbol{p})=df_{\boldsymbol{p} }(X_{\boldsymbol{p}})$df(X)(\text{boldsymbol}p)=d{f}_{\text{boldsymbol}p}(X_{\text{boldsymbol}p})$ where df=\left[\begin{array}{c} \dfrac{\partial f}{\partial x}(\boldsymbol{p})\\ \dfrac{\partial f}{\partial y}(\boldsymbol{p})\\ \dfrac{\partial f}{\partial z}(\boldsymbol{p})\\ \end{array}\right]$df=\left[\begin{array}{c}{\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)\\ {\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)\\ {\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)\end{array}\right]$ combine them together then we have

From \small (1.4)$(1.4)$ (X(f))(\boldsymbol{p})=X_{p}(f)=\dfrac{\partial f}{\partial x}(\boldsymbol{p}) X_{\boldsymbol{p}}(X)+\dfrac{\partial f}{\partial y}(\boldsymbol{p}) X_{\boldsymbol{p}}(Y)+\dfrac{\partial f}{\partial z}(\boldsymbol{p}) X_{\boldsymbol{p}}(Z)$(X(f))(\text{boldsymbol}p)=X_p(f)={\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)X_{\text{boldsymbol}p}(X)+{\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)X_{\text{boldsymbol}p}(Y)+{\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)X_{\text{boldsymbol}p}(Z)$

=\left[\begin{array}{c} X_{\boldsymbol{p}}(X) & X_{p}(Y) & X_{p}(Z) \end{array}\right]\left[\begin{array}{c} \dfrac{\partial f}{\partial x}(\boldsymbol{p})\\ \dfrac{\partial f}{\partial y}(\boldsymbol{p})\\ \dfrac{\partial f}{\partial z}(\boldsymbol{p})\\ \end{array}\right]=df(X)$=\left[\begin{array}{ccc}{X}_{\text{boldsymbol}p}(X)& X_p(Y)& X_p(Z)\end{array}\right]\left[\begin{array}{c}{\displaystyle \frac{\partial f}{\partial x}}(\text{boldsymbol}p)\\ {\displaystyle \frac{\partial f}{\partial y}}(\text{boldsymbol}p)\\ {\displaystyle \frac{\partial f}{\partial z}}(\text{boldsymbol}p)\end{array}\right]=df(X)$

(3)$(3)$ Just unfold the fomula \begin{gathered} (X\circ Y-Y\circ X)(fg)=X\circ Y(fg)-Y\circ X(fg)=X\circ (fY(g)+gY(f))-Y\circ (fX(g)+gX(f))\\ =\small f (X\circ Y)g+X(f)Y(g)+g (X\circ Y)f+X(g)Y(f)-(f (Y\circ X)g+Y(f)X(g)+g (Y\circ X)f+Y(g)X(f))\\ =f(X\circ Y-Y\circ X)g+g(X\circ Y-Y\circ X)f \end{gathered} $$\begin{array}{c}(X\circ Y-Y\circ X)(fg)=X\circ Y(fg)-Y\circ X(fg)=X\circ (fY(g)+gY(f))-Y\circ (fX(g)+gX(f))\\ =f(X\circ Y)g+X(f)Y(g)+g(X\circ Y)f+X(g)Y(f)-(f(Y\circ X)g+Y(f)X(g)+g(Y\circ X)f+Y(g)X(f))\\ =f(X\circ Y-Y\circ X)g+g(X\circ Y-Y\circ X)f\end{array}$$ So X\circ Y-Y \circ X$X\circ Y-Y\circ X$ suits the Leibniz rule, which is a vector field.

(4)$(4)$ Calculate directly we can prove (AB-BA)^{T}=-(AB-BA)$(AB-BA{)}^T=-(AB-BA)$ \begin{aligned} (A B-B A)^{T} =(A B)^{T}-(B A)^{T} =(B^{T} A^{T}-A^{T} B^{T}) \\ =(-B)(-A)-(-A)(-B) =BA-AB=-(A B-B A) \end{aligned} $$\begin{array}{r}(AB-BA{)}^T=(AB{)}^T-(BA{)}^T=(B^T{A}^T-A^T{B}^T)\\ =(-B)(-A)-(-A)(-B)=BA-AB=-(AB-BA)\end{array}$$ For all the positive orthogonal matrices \mathcal{Q}$\mathcal{Q}$ \forall \ Q\in \mathcal{Q},\det(Q)=1$\mathrm{\forall }Q\in \mathcal{Q},det(Q)=1$. At one matrix, its tangent vector

(Q+A)^{T}(Q+A)=I=(Q^{T}+A^{T})(Q+A)=I\Longrightarrow A=-A^{T},||A||\to 0$(Q+A{)}^T(Q+A)=I=(Q^T+A^T)(Q+A)=I⟹A=-A^T,||A||\to 0$

are all Skew-symmetric matrices. According to \small (3)$(3)$, AB-BA$AB-BA$ is also a Skew-symmetric matrix

\Large \mathbf{If\ your\ life\ is\ tense,\ it\ could\ be\ a\ tensor. }$\mathbf{If}\mathbf{your}\mathbf{life}\mathbf{is}\mathbf{tense}\mathbf{,}\mathbf{it}\mathbf{could}\mathbf{be}\mathbf{a}\mathbf{tensor}\mathbf{.}$

\large\textcolor{blue}{\mbox{Advanced Algebra } \small \mathbb{HW}\mathrm{8}}\ \ \ \ \ \ _\textcolor{blue}{2022.5.9}$\text{textcolor}blue\text{Advanced Algebra }\mathbb{HW}8{}_{\text{textcolor}}blue2022.5.9$

1.8.1\ \small \mbox{Elementary layer operations for tensors}$\text{Elementary layer operations fortensors}$

Note that, for "2D" matrices we have row and column operations, and the two kinds of operations corresponds to the two dimensions of the array.

For simplicity, let M$M$ be a 2 \times 2 \times 2$2\times 2\times 2$ "3D matrix". Then we have "row layer operations", "column layer operations", "horizontal layer operations". The three kinds corresponds to the three dimensions of the array. We interpret this as a multilinear map M: \mathbb{R}^{2} \times \mathbb{R}^{2} \times \mathbb{R}^{2} \rightarrow \mathbb{R}$M:{\mathbb{R}}^2\times {\mathbb{R}}^2\times {\mathbb{R}}^2\to \mathbb{R}$. Let \left(\left(\mathbb{R}^{2}\right)^{*}\right)^{\otimes 3}${\left({\left({\mathbb{R}}^2\right)}^{\ast }\right)}^{\otimes 3}$ be the space of all multilinear maps from \mathbb{R}^{2} \times \mathbb{R}^{2} \times \mathbb{R}^{2}${\mathbb{R}}^2\times {\mathbb{R}}^2\times {\mathbb{R}}^2$ to \mathbb{R}$\mathbb{R}$.

1. Given \alpha, \beta, \gamma \in\left(\mathbb{R}^{2}\right)^{*}$\alpha ,\beta ,\gamma \in {\left({\mathbb{R}}^2\right)}^{\ast }$, what is the (i, j, k)$(i,j,k)$-entry of the "3D matrix" \alpha \otimes \beta \otimes \gamma$\alpha \otimes \beta \otimes \gamma$ in terms of the coordinates of \alpha, \beta, \gamma$\alpha ,\beta ,\gamma$ ? Here \alpha \otimes \beta \otimes \gamma$\alpha \otimes \beta \otimes \gamma$ is the multilinear map sending (\boldsymbol{u}, \boldsymbol{v}, \boldsymbol{w})$(\text{boldsymbol}u,\text{boldsymbol}v,\text{boldsymbol}w)$ to the real number \alpha(\boldsymbol{u}) \beta(\boldsymbol{v}) \gamma(\boldsymbol{w})$\alpha (\text{boldsymbol}u)\beta (\text{boldsymbol}v)\gamma (\text{boldsymbol}w)$.
2. Let E$E$ be an elementary matrix. Then we can send \alpha \otimes \beta \otimes \gamma$\alpha \otimes \beta \otimes \gamma$ to (\alpha E) \otimes \beta \otimes \gamma$(\alpha E)\otimes \beta \otimes \gamma$. Why can this be extended to a linear map M_{E}:\left(\left(\mathbb{R}^{2}\right)^{*}\right)^{\otimes 3} \rightarrow\left(\left(\mathbb{R}^{2}\right)^{*}\right)^{\otimes 3}$M_E:{\left({\left({\mathbb{R}}^2\right)}^{\ast }\right)}^{\otimes 3}\to {\left({\left({\mathbb{R}}^2\right)}^{\ast }\right)}^{\otimes 3}$ ? (This gives a formula for the "elementary layer operations" on "3D matrices", where the three kinds of layer operations corresponds to applying E$E$ to the three arguments respectively.)
3. Show that elementary layer operations preserve rank. Here we say M$M$ has rank r$r$ if r$r$ is the smallest possible integer such that M$M$ can be written as the linear combination of r$r$ "rank one" maps, i.e., maps of the kind \alpha \otimes \beta \otimes \gamma$\alpha \otimes \beta \otimes \gamma$ for some \alpha, \beta, \gamma \in\left(\mathbb{R}^{2}\right)^{*}$\alpha ,\beta ,\gamma \in {\left({\mathbb{R}}^2\right)}^{\ast }$.
4. Show that, if some "2D" layer matrix of a "3D matrix" has rank r, then the 3 D$3D$ matrix has rank at least r$r$.
5. Let M$M$ be made of two layers, \left[\begin{array}{ll}1 & 0 \\ 0 & 1\end{array}\right]$\left[\begin{array}{ll}1& 0\\ 0& 1\end{array}\right]$ and \left[\begin{array}{ll}0 & 1 \\ 1 & 0\end{array}\right]$\left[\begin{array}{ll}0& 1\\ 1& 0\end{array}\right]$. Find its rank.
6. (Read only) Despite some practical interests, finding the tensor rank in general is NOT easy. In fact, it is NP-complete just for 3-tensors over finite field. Furthermore, a tensor with all real entries might have different real rank and complex rank.

---

(1)$(1)$ According to the symmetry of dot product \langle\alpha,u\rangle=\langle u,\alpha\rangle$⟨\alpha ,u⟩=⟨u,\alpha ⟩$ we have equation \alpha^Tu=u^T\alpha${\alpha }^{T}u=u^T\alpha$ So

\alpha^{T} u \beta^{T} v \gamma^{T} \omega=u^{T} \alpha \beta^{T} v \gamma^{T} \omega=u^{T}\left[\alpha \beta^{T} v \gamma_{1} \quad \partial \beta^{T} v \gamma_{2}\right] \omega${\alpha }^{T}u{\beta }^{T}v{\gamma }^T\omega =u^T\alpha {\beta }^{T}v{\gamma }^T\omega =u^T\left[\alpha {\beta }^{T}v{\gamma }_1\partial {\beta }^{T}v{\gamma }_2\right]\omega$ Compare to [u^TA_1v\quad u^TA_2v]\omega$[u^T{A}_{1}v{u}^T{A}_{2}v]\omega$ hence

A_{1}=\gamma_{1}\left(\begin{array}{ll}\alpha_{1} \beta_{1} & \alpha_{1} \beta_{2} \\ \alpha_{2} \beta_{1} & \alpha_{2} \beta_{2}\end{array}\right)=\gamma_1\alpha\beta^T,A_{2}=\gamma_{2}\left(\begin{array}{ll}\alpha_{1} \beta_{1} & \alpha_{1} \beta_{2} \\ \alpha_{2} \beta_{1} & \alpha_{2} \beta_{2}\end{array}\right)=\gamma_2\alpha\beta^T$A_1={\gamma }_1\left(\begin{array}{ll}{\alpha }_1{\beta }_1& {\alpha }_1{\beta }_2\\ {\alpha }_2{\beta }_1& {\alpha }_2{\beta }_2\end{array}\right)={\gamma }_1\alpha {\beta }^T,A_2={\gamma }_2\left(\begin{array}{ll}{\alpha }_1{\beta }_1& {\alpha }_1{\beta }_2\\ {\alpha }_2{\beta }_1& {\alpha }_2{\beta }_2\end{array}\right)={\gamma }_2\alpha {\beta }^T$ . So A_{ijk}=\gamma_i\alpha_j\beta_k$A_{ijk}={\gamma }_i{\alpha }_j{\beta }_k$

(2)$(2)$ M_E$M_E$ sends tensor M=[[A_1,A_2]]=[[\gamma_1\alpha \beta^T,\gamma_2\alpha \beta^T]]$M=[[A_1,A_2]]=[[{\gamma }_1\alpha {\beta }^T,{\gamma }_2\alpha {\beta }^T]]$ to M'=[[\gamma_1\alpha E \beta^T,\gamma_2\alpha E\beta^T]]$M^{\prime }=[[{\gamma }_1\alpha E{\beta }^T,{\gamma }_2\alpha E{\beta }^T]]$

For \alpha _1,\alpha_2${\alpha }_1,{\alpha }_2$ in (\mathbb{R}^2)^*$({\mathbb{R}}^2{)}^{\ast }$ as one part in ((\mathbb{R}^2)^*)^{\otimes3}$(({\mathbb{R}}^2{)}^{\ast }{)}^{\otimes 3}$ M_{k\alpha_1+\mu\alpha_2}=[[\gamma_1(k\alpha_1+\mu\alpha_2) \beta^T,\gamma_2(k\alpha_1+\mu\alpha_2) \beta^T]]=kM_{\alpha _1}+\mu M_{\alpha _2}\in ((\mathbb{R}^2)^*)^{\otimes3} $$M_{k{\alpha }_1+\mu {\alpha }_2}=[[{\gamma }_1(k{\alpha }_1+\mu {\alpha }_2){\beta }^T,{\gamma }_2(k{\alpha }_1+\mu {\alpha }_2){\beta }^T]]=k{M}_{{\alpha }_1}+\mu M_{{\alpha }_2}\in (({\mathbb{R}}^2{)}^{\ast }{)}^{\otimes 3}$$ So for \alpha ,\beta$\alpha ,\beta$ is linear. and for \gamma_1,\gamma_2${\gamma }_1,{\gamma }_2$ in (\mathbb{R}^2)^*$({\mathbb{R}}^2{)}^{\ast }$ as one part in ((\mathbb{R}^2)^*)^{\otimes3}$(({\mathbb{R}}^2{)}^{\ast }{)}^{\otimes 3}$, set \gamma_{11,12}${\gamma }_{11,12}$ as the component of \gamma_1${\gamma }_1$

\gamma_{21,22}${\gamma }_{21,22}$ as the component of \gamma_2${\gamma }_2$, So M_{k\gamma_1+\mu\gamma_2}=[[(k\gamma_{11}+\mu\gamma_{21})\alpha\beta^T,(k\gamma_{12}+\mu\gamma_{22})\alpha \beta^T]]=kM_{\gamma _1}+\mu M_{\gamma _2}\in ((\mathbb{R}^2)^*)^{\otimes3} $$M_{k{\gamma }_1+\mu {\gamma }_2}=[[(k{\gamma }_{11}+\mu {\gamma }_{21})\alpha {\beta }^T,(k{\gamma }_{12}+\mu {\gamma }_{22})\alpha {\beta }^T]]=k{M}_{{\gamma }_1}+\mu M_{{\gamma }_2}\in (({\mathbb{R}}^2{)}^{\ast }{)}^{\otimes 3}$$ So M_E$M_E$ is a linear map, three operations at \alpha,\beta,\gamma$\alpha ,\beta ,\gamma$

(3)$(3)$ Suppose M=\displaystyle \sum_{i=1}^rM_{base(i)}$M={\displaystyle \sum _{i=1}^r{M}_{base(i)}}$ if we operate elementary layer operations for M$M$, the right hand side

is also in "rank one" maps, so r'\leq r$r^{\prime }\le r$. And if r'<r$r^{\prime }<r$, i.e., M'=\displaystyle \sum_{i=1}^{r'}M_{base(i)}$M^{\prime }={\displaystyle \sum _{i=1}^{r^{\prime }}{M}_{base(i)}}$ As elementary have its inverse

operate the inverse of elementary operation, and we have contradiction, so r'=r$r^{\prime }=r$

(4)$(4)$ According to \mbox{SVD}$\text{SVD}$, the minimum number of decomposing a matrix into rank-1$1$ matrixes equals to rank

So if 2D$2D$ matrix needs at least r$r$ rank-1$1$ matrixes to make up, since every rank-1$1$ maps in \alpha \otimes \beta \otimes \gamma$\alpha \otimes \beta \otimes \gamma$

contains two rank-1$1$ matrix, so the 3D$3D$ matrix also needs at least r$r$ rank-1$1$ tensors to make up

(5)$(5)$ For A_1=\left[\begin{array}{ll}1 & 0 \\ 0 & 1\end{array}\right]$A_1=\left[\begin{array}{ll}1& 0\\ 0& 1\end{array}\right]$ its rank is 2$2$, so r(M)\geq 2$r(M)\ge 2$. Besides, construct two rank-1$1$ tensors M_1=[[\dfrac{1}{2}\begin{bmatrix}1 & 1 \\ 1 & 1\end{bmatrix},\dfrac{1}{2}\begin{bmatrix}1 & 1 \\ 1 & 1\end{bmatrix}]], M_2=[[\dfrac{1}{2}\begin{bmatrix}1 & -1 \\ -1 & 1\end{bmatrix},-\dfrac{1}{2}\begin{bmatrix}1 & -1 \\ -1 & 1\end{bmatrix}]] $$M_1=[[{\displaystyle \frac{1}{2}}\left[\begin{array}{cc}1& 1\\ 1& 1\end{array}\right],{\displaystyle \frac{1}{2}}\left[\begin{array}{cc}1& 1\\ 1& 1\end{array}\right]]],M_2=[[{\displaystyle \frac{1}{2}}\left[\begin{array}{cc}1& -1\\ -1& 1\end{array}\right],-{\displaystyle \frac{1}{2}}\left[\begin{array}{cc}1& -1\\ -1& 1\end{array}\right]]]$$ And M=M_1+M_2$M=M_1+M_2$, so its rank is 2$2$

1.8.2\ \small \mbox{i+j+k rank-3 tensor}$\text{i+j+k rank-3 tensor}$

Let M$M$ be a 3 \times 3 \times 3$3\times 3\times 3$ "3D matrix" whose (i, j, k)$(i,j,k)$-entry is i+j+k$i+j+k$. We interpret this as a multilinear map M: \mathbb{R}^{3} \times \mathbb{R}^{3} \times \mathbb{R}^{3} \rightarrow \mathbb{R}$M:{\mathbb{R}}^3\times {\mathbb{R}}^3\times {\mathbb{R}}^3\to \mathbb{R}$.

1. Let \boldsymbol{v}=\left[\begin{array}{l}x \\ y \\ z\end{array}\right]$\text{boldsymbol}v=\left[\begin{array}{l}x\\ y\\ z\end{array}\right]$, then M(\boldsymbol{v}, \boldsymbol{v}, \boldsymbol{v})$M(\text{boldsymbol}v,\text{boldsymbol}v,\text{boldsymbol}v)$ is a polynomial in x, y, z$x,y,z$. What is this polynomial?
2. Let \sigma:\{1,2,3\} \rightarrow\{1,2,3\}$\sigma :\{1,2,3\}\to \{1,2,3\}$ be any bijection. Show that M\left(\boldsymbol{v}_{1}, \boldsymbol{v}_{2}, \boldsymbol{v}_{3}\right)=M\left(\boldsymbol{v}_{\sigma(1)}, \boldsymbol{v}_{\sigma(2)}, \boldsymbol{v}_{\sigma(3)}\right)$M(\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3)=M(\text{boldsymbol}{v}_{\sigma (1)},\text{boldsymbol}{v}_{\sigma (2)},\text{boldsymbol}{v}_{\sigma (3)})$. (Hint: brute force works. But alternatively, try find the (i, j, k)$(i,j,k)$ entry of the multilinear map M^{\sigma}$M^{\sigma }$, a map that sends \left(\boldsymbol{v}_{1}, \boldsymbol{v}_{2}, \boldsymbol{v}_{3}\right)$(\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3)$ to M\left(\boldsymbol{v}_{\sigma(1)}, \boldsymbol{v}_{\sigma(2)}, \boldsymbol{v}_{\sigma(3)}\right)$M(\text{boldsymbol}{v}_{\sigma (1)},\text{boldsymbol}{v}_{\sigma (2)},\text{boldsymbol}{v}_{\sigma (3)})$.)
3. Show that the rank r$r$ of M$M$ is at least 2 and at most 3. (It is actually exactly three.)
4. (Read only) Any study of polynomial of degree d$d$ on n$n$ variables is equivalent to the study of some symmetric d$d$ tensor on \mathbb{R}^{n}${\mathbb{R}}^n$.

---

(1)$(1)$ M=[[\begin{bmatrix}3 & 4 & 5 \\ 4 & 5 & 6\\5& 6&7\end{bmatrix},\begin{bmatrix}4 & 5 & 6 \\ 5 & 6 & 7\\6& 7&8\end{bmatrix},\begin{bmatrix}5 & 6 & 7 \\ 6 & 7 & 8\\7& 8&9\end{bmatrix}]]=[[A_1,A_2,A_3]]$M=[[\left[\begin{array}{ccc}3& 4& 5\\ 4& 5& 6\\ 5& 6& 7\end{array}\right],\left[\begin{array}{ccc}4& 5& 6\\ 5& 6& 7\\ 6& 7& 8\end{array}\right],\left[\begin{array}{ccc}5& 6& 7\\ 6& 7& 8\\ 7& 8& 9\end{array}\right]]]=[[A_1,A_2,A_3]]$ And M(\boldsymbol v,\boldsymbol v,\boldsymbol v)$M(\text{boldsymbol}v,\text{boldsymbol}v,\text{boldsymbol}v)$ where \boldsymbol{v}=\begin{pmatrix}x\\y\\z\end{pmatrix}$\text{boldsymbol}v=\left(\begin{array}{c}x\\ y\\ z\end{array}\right)$

=[\boldsymbol v^TA_1\boldsymbol v\quad \boldsymbol v^TA_2\boldsymbol v\quad \boldsymbol v^TA_3\boldsymbol v]\boldsymbol v=[\boldsymbol v^T\begin{bmatrix}3 & 4 & 5 \\ 4 & 5 & 6\\5& 6&7\end{bmatrix}\boldsymbol v\quad \boldsymbol v^T\begin{bmatrix}4 & 5 & 6 \\ 5 & 6 & 7\\6& 7&8\end{bmatrix}\boldsymbol v\quad \boldsymbol v^T\begin{bmatrix}5 & 6 & 7 \\ 6 & 7 & 8\\7& 8&9\end{bmatrix}\boldsymbol v]\boldsymbol v$=[\text{boldsymbol}{v}^T{A}_1\text{boldsymbol}v\text{boldsymbol}{v}^T{A}_2\text{boldsymbol}v\text{boldsymbol}{v}^T{A}_3\text{boldsymbol}v]\text{boldsymbol}v=[\text{boldsymbol}{v}^T\left[\begin{array}{ccc}3& 4& 5\\ 4& 5& 6\\ 5& 6& 7\end{array}\right]\text{boldsymbol}v\text{boldsymbol}{v}^T\left[\begin{array}{ccc}4& 5& 6\\ 5& 6& 7\\ 6& 7& 8\end{array}\right]\text{boldsymbol}v\text{boldsymbol}{v}^T\left[\begin{array}{ccc}5& 6& 7\\ 6& 7& 8\\ 7& 8& 9\end{array}\right]\text{boldsymbol}v]\text{boldsymbol}v$

Calculate it by \mbox{Mathematica}$\text{Mathematica}$, the result is p(x,y,z)=3 (x+y+z)^2 (x+2 y+3 z)$p(x,y,z)=3(x+y+z{)}^2(x+2y+3z)$

(2)$(2)$ let a linear map from \mathbb{R}^{3} \times \mathbb{R}^{3} \times \mathbb{R}^{3}${\mathbb{R}}^3\times {\mathbb{R}}^3\times {\mathbb{R}}^3$ to \mathbb{R}$\mathbb{R}$ sends \left(\boldsymbol{v}_{1}, \boldsymbol{v}_{2}, \boldsymbol{v}_{3}\right)$(\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3)$ to M\left(\boldsymbol{v}_{\sigma(1)}, \boldsymbol{v}_{\sigma(2)}, \boldsymbol{v}_{\sigma(3)}\right)$M(\text{boldsymbol}{v}_{\sigma (1)},\text{boldsymbol}{v}_{\sigma (2)},\text{boldsymbol}{v}_{\sigma (3)})$

Obviously, it's multi-linear since for \boldsymbol{v}_i$\text{boldsymbol}{v}_i$ the evaluation result is linear no matter which position \boldsymbol{v}_i$\text{boldsymbol}{v}_i$ is.

And this map have a tensor such M'=[[A_1',A_2',A_3']]$M^{\prime }=[[A_1^{\prime },A_2^{\prime },A_3^{\prime }]]$. Specialise \boldsymbol{v_i}$\text{boldsymbol}{v}_i$ to get value of A_{1}',A_{2}',A_{3}'$A_1^{\prime },A_2^{\prime },A_3^{\prime }$

Set \boldsymbol{b}_1=\begin{pmatrix}1\\0\\0\end{pmatrix},\boldsymbol{b}_2=\begin{pmatrix}0\\1\\0\end{pmatrix},\boldsymbol{b}_3=\begin{pmatrix}0\\0\\1\end{pmatrix}$\text{boldsymbol}{b}_1=\left(\begin{array}{c}1\\ 0\\ 0\end{array}\right),\text{boldsymbol}{b}_2=\left(\begin{array}{c}0\\ 1\\ 0\end{array}\right),\text{boldsymbol}{b}_3=\left(\begin{array}{c}0\\ 0\\ 1\end{array}\right)$ let (\boldsymbol{v_1},\boldsymbol{v_2},\boldsymbol{v_3})=(\boldsymbol{b_i},\boldsymbol{b_j},\boldsymbol{b_k})$(\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3)=(\text{boldsymbol}{b}_i,\text{boldsymbol}{b}_j,\text{boldsymbol}{b}_k)$ where 1\leq i,j,k\leq 3$1\le i,j,k\le 3$

and they can be the same. Put one of condition into the map so A_{k(ij)}'=A_{\sigma^{-1}(i)(\sigma^{-1}(j)\sigma^{-1}(k))}=\sigma^{-1}(i)+\sigma^{-1}(j)+\sigma^{-1}(k)=i+j+k $$A_{k(ij)}^{\prime }=A_{{\sigma }^{-1}(i)({\sigma }^{-1}(j){\sigma }^{-1}(k))}={\sigma }^{-1}(i)+{\sigma }^{-1}(j)+{\sigma }^{-1}(k)=i+j+k$$ So for k=1,2,3$k=1,2,3$ A_{k}'=A_k$A_k^{\prime }=A_k$, which implies that M'=M$M^{\prime }=M$, so the equation is proved.

A brute try (failed):

It is obvious that swaping \boldsymbol{v}_{i},\boldsymbol{v}_{j}$\text{boldsymbol}{v}_i,\text{boldsymbol}{v}_j$ at most twice can make \boldsymbol{v}_1,\boldsymbol{v}_2,\boldsymbol{v}_3$\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3$ $$ \boldsymbol{v}_{\sigma(1)}, \boldsymbol{v}_{\sigma(2)}, \boldsymbol{v}_{\sigma(3)}$\text{boldsymbol}{v}_{\sigma (1)},\text{boldsymbol}{v}_{\sigma (2)},\text{boldsymbol}{v}_{\sigma (3)}$

If swap \boldsymbol{v}_{1},\boldsymbol{v}_{2}$\text{boldsymbol}{v}_1,\text{boldsymbol}{v}_2$, the value \boldsymbol v_1^TA_i\boldsymbol v_2=\boldsymbol v_2^TA_i\boldsymbol v_1,i=1,2,3$\text{boldsymbol}{v}_1^T{A}_i\text{boldsymbol}{v}_2=\text{boldsymbol}{v}_2^T{A}_i\text{boldsymbol}{v}_1,i=1,2,3$, since A_i=A_i^T$A_i=A_i^T$ so the result stays the same.

And if we swap \boldsymbol{v}_{2},\boldsymbol{v}_{3}$\text{boldsymbol}{v}_2,\text{boldsymbol}{v}_3$, [\boldsymbol v_1^TA_1\boldsymbol v_2\quad \boldsymbol v_1^TA_2\boldsymbol v_2\quad \boldsymbol v_1^TA_3\boldsymbol v_2]\boldsymbol v_3=\boldsymbol v_1^TA_1\boldsymbol v_2v_{3x}+\boldsymbol v_1^TA_2\boldsymbol v_2v_{3y}+\boldsymbol v_1^TA_3\boldsymbol v_2v_{3z}$[\text{boldsymbol}{v}_1^T{A}_1\text{boldsymbol}{v}_2\text{boldsymbol}{v}_1^T{A}_2\text{boldsymbol}{v}_2\text{boldsymbol}{v}_1^T{A}_3\text{boldsymbol}{v}_2]\text{boldsymbol}{v}_3=\text{boldsymbol}{v}_1^T{A}_1\text{boldsymbol}{v}_2{v}_{3x}+\text{boldsymbol}{v}_1^T{A}_2\text{boldsymbol}{v}_2{v}_{3y}+\text{boldsymbol}{v}_1^T{A}_3\text{boldsymbol}{v}_2{v}_{3z}$

(3)$(3)$ According to 1.8.1(4)$1.8.1(4)$, since \mbox{rank}(A_i)=2$\text{rank}(A_i)=2$, so r\geq 2$r\ge 2$. Then just construct a reasonable combination

I guess \alpha=\begin{pmatrix}1\\1\\-1\end{pmatrix},\beta=\begin{pmatrix}1\\-1\\1\end{pmatrix},\gamma=\begin{pmatrix}-1\\1\\1\end{pmatrix}$\alpha =\left(\begin{array}{c}1\\ 1\\ -1\end{array}\right),\beta =\left(\begin{array}{c}1\\ -1\\ 1\end{array}\right),\gamma =\left(\begin{array}{c}-1\\ 1\\ 1\end{array}\right)$ so the rank-1$1$ matrix like \begin{bmatrix}a&b&c\\a&b&c\\-a&-b&-c\end{bmatrix},\begin{bmatrix}d&e&f\\-d&-e&-f\\d&e&f\end{bmatrix},\begin{bmatrix}-g&-h&-i\\g&h&i\\g&h&i\end{bmatrix}, $$\left[\begin{array}{ccc}a& b& c\\ a& b& c\\ -a& -b& -c\end{array}\right],\left[\begin{array}{ccc}d& e& f\\ -d& -e& -f\\ d& e& f\end{array}\right],\left[\begin{array}{ccc}-g& -h& -i\\ g& h& i\\ g& h& i\end{array}\right],$$ And the linear combinations of these three matrixes are \begin{bmatrix}3 & 4 & 5 \\ 4 & 5 & 6\\5& 6&7\end{bmatrix},\begin{bmatrix}4 & 5 & 6 \\ 5 & 6 & 7\\6& 7&8\end{bmatrix},\begin{bmatrix}5 & 6 & 7 \\ 6 & 7 & 8\\7& 8&9\end{bmatrix}$\left[\begin{array}{ccc}3& 4& 5\\ 4& 5& 6\\ 5& 6& 7\end{array}\right],\left[\begin{array}{ccc}4& 5& 6\\ 5& 6& 7\\ 6& 7& 8\end{array}\right],\left[\begin{array}{ccc}5& 6& 7\\ 6& 7& 8\\ 7& 8& 9\end{array}\right]$

which transfers to three nine - dimensional equations, out of my hand ability, the coefficient matrix is A=\left( \begin{array}{ccccccccc} 1 & 0 & 0 & 1 & 0 & 0 & -1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 & 0 & 0 & -1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & -1 \\ 0 & 1 & 0 & 0 & -1 & 0 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & -1 & 0 & 0 & 1 \\ 1 & 0 & 0 & -1 & 0 & 0 & 1 & 0 & 0 \\ -1 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & -1 & 0 & 0 & 1 & 0 & 0 & 1 & 0 \\ 0 & 0 & -1 & 0 & 0 & 1 & 0 & 0 & 1 \\ \end{array} \right),A\vec{x}=\vec{b}_{i}=\begin{pmatrix}3\\4\\5\\4\\5\\6\\5\\6\\7\end{pmatrix},\begin{pmatrix}4\\5\\6\\5\\6\\7\\6\\7\\8\end{pmatrix},\begin{pmatrix}5\\6\\7\\6\\7\\8\\7\\8\\9\end{pmatrix} $$A=\left(\begin{array}{ccccccccc}1& 0& 0& 1& 0& 0& -1& 0& 0\\ 0& 1& 0& 0& 1& 0& 0& -1& 0\\ 0& 0& 1& 0& 0& 1& 0& 0& -1\\ 0& 1& 0& 0& -1& 0& 0& 1& 0\\ 0& 0& 1& 0& 0& -1& 0& 0& 1\\ 1& 0& 0& -1& 0& 0& 1& 0& 0\\ -1& 0& 0& 1& 0& 0& 1& 0& 0\\ 0& -1& 0& 0& 1& 0& 0& 1& 0\\ 0& 0& -1& 0& 0& 1& 0& 0& 1\end{array}\right),A\overrightarrow{x}={\overrightarrow{b}}_i=\left(\begin{array}{c}3\\ 4\\ 5\\ 4\\ 5\\ 6\\ 5\\ 6\\ 7\end{array}\right),\left(\begin{array}{c}4\\ 5\\ 6\\ 5\\ 6\\ 7\\ 6\\ 7\\ 8\end{array}\right),\left(\begin{array}{c}5\\ 6\\ 7\\ 6\\ 7\\ 8\\ 7\\ 8\\ 9\end{array}\right)$$ And the accurate solution is \begin{gathered} \begin{bmatrix}3 & 4 & 5 \\ 4 & 5 & 6\\5& 6&7\end{bmatrix}=\begin{bmatrix}3.5&4.5&5.5\\3.5&4.5&5.5\\-3.5&-4.5&-5.5\end{bmatrix}+ \begin{bmatrix}4&5&6\\-4&-5&-6\\4&5&6\end{bmatrix}+\begin{bmatrix}-4.5&-5.5&-6.5\\4.5&5.5&6.5\\4.5&5.5&6.5\end{bmatrix}\\ \begin{bmatrix}4 & 5 & 6 \\ 5 & 6 & 7\\6& 7&8\end{bmatrix}=\begin{bmatrix}4.5&5.5&6.5\\4.5&5.5&6.5\\-4.5&-5.5&-6.5\end{bmatrix}+ \begin{bmatrix}5&6&7\\-5&-6&-7\\5&6&7\end{bmatrix}+\begin{bmatrix}-5.5&-6.5&-7.5\\5.5&6.5&7.5\\5.5&6.5&7.5\end{bmatrix}\\ \begin{bmatrix}5 & 6 & 7 \\ 6 & 7 & 8\\7& 8&9\end{bmatrix}=\begin{bmatrix}5.5&6.5&7.5\\5.5&6.5&7.5\\-5.5&-6.5&-7.5\end{bmatrix}+ \begin{bmatrix}6&7&8\\-6&-7&-8\\6&7&8\end{bmatrix}+\begin{bmatrix}-6.5&-7.5&-8.5\\6.5&7.5&8.5\\6.5&7.5&8.5\end{bmatrix}\\ \end{gathered} $$\begin{array}{c}\left[\begin{array}{ccc}3& 4& 5\\ 4& 5& 6\\ 5& 6& 7\end{array}\right]=\left[\begin{array}{ccc}3.5& 4.5& 5.5\\ 3.5& 4.5& 5.5\\ -3.5& -4.5& -5.5\end{array}\right]+\left[\begin{array}{ccc}4& 5& 6\\ -4& -5& -6\\ 4& 5& 6\end{array}\right]+\left[\begin{array}{ccc}-4.5& -5.5& -6.5\\ 4.5& 5.5& 6.5\\ 4.5& 5.5& 6.5\end{array}\right]\\ \left[\begin{array}{ccc}4& 5& 6\\ 5& 6& 7\\ 6& 7& 8\end{array}\right]=\left[\begin{array}{ccc}4.5& 5.5& 6.5\\ 4.5& 5.5& 6.5\\ -4.5& -5.5& -6.5\end{array}\right]+\left[\begin{array}{ccc}5& 6& 7\\ -5& -6& -7\\ 5& 6& 7\end{array}\right]+\left[\begin{array}{ccc}-5.5& -6.5& -7.5\\ 5.5& 6.5& 7.5\\ 5.5& 6.5& 7.5\end{array}\right]\\ \left[\begin{array}{ccc}5& 6& 7\\ 6& 7& 8\\ 7& 8& 9\end{array}\right]=\left[\begin{array}{ccc}5.5& 6.5& 7.5\\ 5.5& 6.5& 7.5\\ -5.5& -6.5& -7.5\end{array}\right]+\left[\begin{array}{ccc}6& 7& 8\\ -6& -7& -8\\ 6& 7& 8\end{array}\right]+\left[\begin{array}{ccc}-6.5& -7.5& -8.5\\ 6.5& 7.5& 8.5\\ 6.5& 7.5& 8.5\end{array}\right]\end{array}$$ So it can be decomposed into three rank-1$1$ tensors. So r\leq 3$r\le 3$