Forgot password?
 Register account
View 1401|Reply 3

方程$Ax=b$有解的充要条件是$A^Ty=0$,$y^Tb=0$

[Copy link]

84

Threads

2336

Posts

110K

Credits

Credits
13076

Show all posts

其妙 Posted 2014-5-29 12:50 |Read mode
$m\times n$的矩阵$A_{m\times n}$,则方程$Ax=b$有解的充要条件是方程$A^Ty=0$的任何解$\beta$,都有$\beta^Tb=0$.
妙不可言,不明其妙,不着一字,各释其妙!

3153

Threads

7906

Posts

610K

Credits

Credits
64096
QQ

Show all posts

hbghlyj Posted 2023-2-27 06:46
Fredholm alternative Linear algebra
If $V$ is an $n$-dimensional vector space and $T:V\to V$ is a linear transformation, then exactly one of the following holds:
  • For each vector $v$ in $V$ there is a vector $u$ in $V$ so that $T(u) = v$. In other words: $T$ is surjective (and so also bijective, since $V$ is finite-dimensional).
  • $\dim(\ker(T)) > 0$.

A more elementary formulation, in terms of matrices, is as follows. Given an $m\times n$ matrix $A$ and a $m\times 1$ column vector $\mathbf{b}$, exactly one of the following must hold:
  • Either: $A\mathbf{x} = \mathbf{b}$ has a solution $\mathbf{x}$.
  • Or: $A^T\mathbf{y} = 0$ has a solution $\mathbf{y}$ with $\mathbf{y}^T\mathbf{b}\neq 0$.

In other words, $A\mathbf{x} = \mathbf{b}$ has a solution $(\mathbf{b}\in\def\im{\operatorname{Im}}\im(A))$ if and only if for any $\mathbf{y}$ s.t. $A^T\mathbf{y} = 0$, $\mathbf{y}^T\mathbf{b} = 0$ $(\mathbf{b}\in(\ker(A^T))^{\bot})$.

3153

Threads

7906

Posts

610K

Credits

Credits
64096
QQ

Show all posts

hbghlyj Posted 2023-2-27 06:48
Image of adjoint equals orthogonal complement of kernel
Let ${\bf v}\in{\rm im}(T^\ast)$, then ${\bf v}=T^\ast({\bf w})$ for some ${\bf w}\in W$. Now, given ${\bf u}\in\ker T$, we see that $T({\bf u})={\bf 0}$ and therefore
$$\langle {\bf u}\mid{\bf v}\rangle
=\langle {\bf u}\mid T^\ast({\bf w})\rangle
=\langle T({\bf u})\mid {\bf w}\rangle
=\langle {\bf 0}\mid{\bf w}\rangle
=0.$$
That is, ${\bf v}\in(\ker T)^\perp$. Conversely, if ${\bf v}\notin{\rm im}(T^\ast)$, then there exists an ${\bf v}'\in{\rm im}(T^\ast)^\perp$ such that $\langle {\bf v}\mid{\bf v}'\rangle\ne 0$.
In fact, we have ${\bf v}'\in\ker T$ because $T^\ast T({\bf v}')\in{\rm im}(T^\ast)$, which implies
$$\langle T({\bf v}')\mid T({\bf v}')\rangle
=\langle {\bf v}'\mid T^\ast T({\bf v}')\rangle=0\quad\Longrightarrow\quad
T({\bf v}')={\bf 0}.$$
Therefore ${\bf v}\notin(\ker T)^\perp$, which completes the proof.

3153

Threads

7906

Posts

610K

Credits

Credits
64096
QQ

Show all posts

hbghlyj Posted 2023-2-27 06:53
As a side remark: If you know exact sequences and that taking duals is exact (actually left-exactness suffices, which is a general property of the $\hom$-functor), then you can show $\im(T^*)=(\ker T)^\perp$ as follows: The exact sequence
$$
0\longrightarrow \ker T\longrightarrow V\xrightarrow T\im T\longrightarrow 0
$$
gives an exact sequence
$$
0\longrightarrow (\im T)^*\longrightarrow V^*\xrightarrow f (\ker T)^*\longrightarrow 0.
$$
By definition, we have $(\ker T)^\perp = \ker f$ and exactness gives $\ker f = (\im T)^*$ (where we view $(\im T)^*\subseteq V^*$ via the injective map given by precomposing $T$). So it suffices to show $(\im T)^* = \im T^*$. But this follows directly from the definitions.  
Here, all the work done above is implicit in the exactness of taking duals.

Mobile version|Discuz Math Forum

2025-6-5 01:19 GMT+8

Powered by Discuz!

× Quick Reply To Top Edit