2024-11-03

847: For (n + n') x (n + n'') Injective Matrix with Right-Top n x n'' Submatrix 0, Matrix with Left-Top n x n Submatrix Replaced with Injective Matrix Is Injective

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for (n + n') x (n + n'') injective matrix with right-top n x n'' submatrix 0, matrix with left-top n x n submatrix replaced with injective matrix is injective

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any (n + n') x (n + n'') injective matrix with the right-top n x n'' submatrix 0, the matrix with the left-top n x n submatrix replaced with any injective matrix is injective.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
F: { the fields }
N: { the (n+n)x(n+n)F injective matrices }, with the top-right nxn matrix 0
M: { the nxnF injective matrices }
N~: =N with the top-left nxn submatrix replaced with M, { the (n+n)x(n+n)F matrices }
//

Statements:
N~{ the injective matrices }
//

"injective matrix" means that the canonical linear map induced by the matrix is injective.


2: Proof


Whole Strategy: Step 1: decompose any vector, wFn+n, as w=v+v, where the n+1n+n components of v are 0 and the 1n components of v are 0; Step 2: take any w~=v~+v~ such that ww~, and see that vv~ or v=v~vv~; Step 3: see that when vv~, N~wN~w~; Step 4: see that when v=v~vv~, N~vN~v~ and so, N~wN~w~; Step 5: conclude the proposition.

Step 1:

Let us decompose any vector, wFn+n, as w=v+v, where the n+1n+n components of v are 0 and the 1n components of v are 0.

Step 2:

Let w~Fn+n be any such that ww~.

w~ is decomposed to be =v~+v~.

vv~ or v=v~.

When v=v~, vv~, because otherwise, it would be that w=v+v=v~+v~=w~, a contradiction.

Step 3:

Let us suppose that vv~.

For N~w=N~(v+v)=N~v+N~v, the 1n components are contributed only by N~v, because the 1n rows of N~ have the 0 n+1n+n components and v has the 0 1n components.

Likewise for N~w~.

Denoting the projection of Fn+n into the 1st Fn as πn, the 1n components of N~v are Mπn(v) and the 1n components of N~v~ are Mπn(v~).

Mπn(v)Mπn(v~), because M is injective.

So, N~wN~w~.

Step 4:

Let us suppose that v=v~vv~.

We already know that the 1n components of N~v and the 1n components of N~v~ are 0.

In fact, also the 1n components of Nv and the 1n components of Nv~ are 0, by the same reason.

The n+1n+n components of N~v equal the n+1n+n components of Nv, because they do not depend on the replaced nxn submatrix.

Likewise, the n+1n+n components of N~v~ equal the n+1n+n components of Nv~.

So, Nv=N~v and Nv~=N~v~.

But as N is injective, NvNv~, and so, N~v=NvNv~=N~v~.

So, N~w=N~v+N~vN~v~+N~v~=N~w~.

Step 5:

So, N~wN~w~ anyway.

So, N~ is injective.


References


<The previous article in this series | The table of contents of this series | The next article in this series>