• 【线性代数】MIT Linear Algebra Lecture 6: Column space and nullspace


    fb078286420893a209ce978db908fa3b-1

    Author| Rickyの水果摊

    Time | 2022.9.12


    Lecture 6: Column space and nullspace

    Lecture Info
    1. Instructor: Prof. Gilbert Strang

    2. Course Number: 18.06

    3. Topics: Linear Algebra

    4. Official Lecture Resource: Resource Index of Linear Algebra

    Excellent Notes on GitHub

    There are some classic, excellent notes from other authors on GitHub, wihch I highly recommend you to star ⭐️ and read 📖

    notes-linear-algebra (A systematic notes written in Chinese)

    The-Art-of-Linear-Algebra (Focus on visualization of important concept of Linear Algebra)

    Video Link

    Lecture 6: Column space and nullspace (bilibili)

    Lecture 6: Column space and nullspace (YouTube)

    Key Points
    1. column space
    2. nullspace
    Active Recall Questions
    1. Suppose we have subspaces P , Q P,Q P,Q , if P ∩ Q P \cap Q PQ / P ∪ Q P \cup Q PQ a subspace?
    2. What is the mathematical meaning of A x Ax Ax
    3. Does A x = b Ax=b Ax=b always have solutions for every b ? If the answer is no, which b’s allow A x = b Ax=b Ax=b to be solvable ? (From the perspective of C ( A ) C(A) C(A))
    4. What’s the definiton of the nullspace N ( A ) N(A) N(A) ?
    5. Suppose A m ∗ n A_{m*n} Amn , why N ( A ) N(A) N(A) is a subspace of R n \mathbb{R}^n Rn ? (Hint: rules that a subspace have to follow)
    6. What are the similarities and differences between C ( A ) , N ( A ) C(A), N(A) C(A),N(A) ? (Hint: focus, dimension, the way they span, …)
    7. Suppose all the solutions ( x s xs xs) to A x = b Ax=b Ax=b ( b b b is not zero vector) form a new space N ( A ) ′ N(A)' N(A), if N ( A ) ′ N(A)' N(A) a subspace? (Hint: compare to the N ( A ) N(A) N(A) that A x = 0 Ax=0 Ax=0 form)
    Answer
    1. P ∩ Q P \cap Q PQ is a subspace, P ∪ Q P \cup Q PQ is not a subspace

    2. A x Ax Ax are all the linear combinations of columns of A A A, which form C ( A ) C(A) C(A) (Some columns of A contribute nothing to C ( A ) C(A) C(A), we will discuss them in the next lecture)

    3. No. A x = b Ax=b Ax=b is solvable only when b b b is in C ( A ) C(A) C(A)

    4. The nullspace N ( A ) N(A) N(A) consists of all solutions to A x = 0 Ax=0 Ax=0.

    5. If we want to check if a space is a subspace, we need to check it from the definition of subspace

      First, we take any two vectors x 1 , x 2 x_1,x_2 x1,x2 in the nullspace, they all satisfy A x = 0 Ax=0 Ax=0, we need to check if x 3 = c 1 ∗ x 1 + c 2 ∗ x 2 x_3=c_1*x_1+c_2*x_2 x3=c1x1+c2x2 is still in the nullspace.

      If we can prove A x 3 = 0 Ax_3=0 Ax3=0, then we know that x 3 x_3 x3 is in N ( A ) N(A) N(A), and here is the derivation: A x 3 = A ( c 1 ∗ x 1 + c 2 ∗ x 2 ) = c 1 ∗ A x 1 + c 2 ∗ A x 2 = c 1 ∗ 0 + c 2 ∗ 0 = 0 Ax_3=A(c_1*x_1+c_2*x_2)=c_1*Ax_1+c_2*Ax_2=c_1*0+c_2*0=0 Ax3=A(c1x1+c2x2)=c1Ax1+c2Ax2=c10+c20=0

      That means x 3 x_3 x3 is still in N ( A ) N(A) N(A). Hence N ( A ) N(A) N(A) is a subspace

    6. Here are their similarites and differences:

      1. C ( A ) C(A) C(A) focus on A A A, N ( A ) N(A) N(A) focus on x x x.
      2. dim of C ( A ) C(A) C(A) is r a n k ( A ) rank(A) rank(A), dim of N ( A ) N(A) N(A) is ( n − r a n k ( A ) ) (n-rank(A)) (nrank(A))
      3. C ( A ) C(A) C(A) is a subspace of R m \mathbb {R}^m Rm, N ( A ) N(A) N(A) is a subspace of R n \mathbb {R}^n Rn
      4. C ( A ) C(A) C(A) is formed by the pivot columns of A A A, N ( A ) N(A) N(A) is formed by all the solutions to A x = 0 Ax=0 Ax=0 (We will learn how to determine pivot columns and solutions to A x = 0 Ax=0 Ax=0 in the next lecture)
    7. This derivation is similar to Q5.

      First, we take any two vectors x 1 , x 2 x_1,x_2 x1,x2 in N ( A ) ′ N(A)' N(A), they all satisfy A x = b Ax=b Ax=b, we need to check if x 3 = c 1 ∗ x 1 + c 2 ∗ x 2 x_3=c_1*x_1+c_2*x_2 x3=c1x1+c2x2 is still in N ( A ) ′ N(A)' N(A)

      If we can prove A x 3 = b Ax_3=b Ax3=b, then we know that x 3 x_3 x3 is in N ( A ) ′ N(A)' N(A), however A x 3 = A ( c 1 ∗ x 1 + c 2 ∗ x 2 ) = c 1 ∗ A x 1 + c 2 ∗ A x 2 = c 1 ∗ b + c 2 ∗ b ≠ b Ax_3=A(c_1*x_1+c_2*x_2)=c_1*Ax_1+c_2*Ax_2=c_1*b+c_2*b \ne b Ax3=A(c1x1+c2x2)=c1Ax1+c2Ax2=c1b+c2b=b

      That means x 3 x_3 x3 is not in N ( A ) ′ N(A)' N(A). Hence N ( A ) ′ N(A)' N(A) is not a subspace

  • 相关阅读:
    BRPC学习
    Semantic Kernel Java SDK,为Java应用程序提供AI功能集成
    【Python计算机视觉】Python全栈体系(二十四)
    面试必考精华版Leetcode1466. 重新规划路线
    字典管理怎么使用,vue3项目使用若依的的字典管理模块
    ASTM D2863: 塑料最低氧气浓度测试
    基于SSM的人力资源管理系统,高质量毕业论文范例-可直接使用
    【每日两题】day 01 组队竞赛 & 删除公共字符
    Spring Boot 项目的创建和简单使用
    Vant组件库 引入 阿里矢量图 添加自己喜欢的 ICON
  • 原文地址:https://blog.csdn.net/qq_46025844/article/details/126817181