Jephian Lin
    • Create new note
    • Create a note from template
      • Sharing URL Link copied
      • /edit
      • View mode
        • Edit mode
        • View mode
        • Book mode
        • Slide mode
        Edit mode View mode Book mode Slide mode
      • Customize slides
      • Note Permission
      • Read
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Write
        • Only me
        • Signed-in users
        • Everyone
        Only me Signed-in users Everyone
      • Engagement control Commenting, Suggest edit, Emoji Reply
    • Invite by email
      Invitee

      This note has no invitees

    • Publish Note

      Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

      Your note will be visible on your profile and discoverable by anyone.
      Your note is now live.
      This note is visible on your profile and discoverable online.
      Everyone on the web can find and read all notes of this public team.
      See published notes
      Unpublish note
      Please check the box to agree to the Community Guidelines.
      View profile
    • Commenting
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
      • Everyone
    • Suggest edit
      Permission
      Disabled Forbidden Owners Signed-in users Everyone
    • Enable
    • Permission
      • Forbidden
      • Owners
      • Signed-in users
    • Emoji Reply
    • Enable
    • Versions and GitHub Sync
    • Note settings
    • Note Insights New
    • Engagement control
    • Transfer ownership
    • Delete this note
    • Save as template
    • Insert from template
    • Import from
      • Dropbox
      • Google Drive
      • Gist
      • Clipboard
    • Export to
      • Dropbox
      • Google Drive
      • Gist
    • Download
      • Markdown
      • HTML
      • Raw HTML
Menu Note settings Note Insights Versions and GitHub Sync Sharing URL Create Help
Create Create new note Create a note from template
Menu
Options
Engagement control Transfer ownership Delete this note
Import from
Dropbox Google Drive Gist Clipboard
Export to
Dropbox Google Drive Gist
Download
Markdown HTML Raw HTML
Back
Sharing URL Link copied
/edit
View mode
  • Edit mode
  • View mode
  • Book mode
  • Slide mode
Edit mode View mode Book mode Slide mode
Customize slides
Note Permission
Read
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Write
Only me
  • Only me
  • Signed-in users
  • Everyone
Only me Signed-in users Everyone
Engagement control Commenting, Suggest edit, Emoji Reply
  • Invite by email
    Invitee

    This note has no invitees

  • Publish Note

    Share your work with the world Congratulations! 🎉 Your note is out in the world Publish Note

    Your note will be visible on your profile and discoverable by anyone.
    Your note is now live.
    This note is visible on your profile and discoverable online.
    Everyone on the web can find and read all notes of this public team.
    See published notes
    Unpublish note
    Please check the box to agree to the Community Guidelines.
    View profile
    Engagement control
    Commenting
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    • Everyone
    Suggest edit
    Permission
    Disabled Forbidden Owners Signed-in users Everyone
    Enable
    Permission
    • Forbidden
    • Owners
    • Signed-in users
    Emoji Reply
    Enable
    Import from Dropbox Google Drive Gist Clipboard
       Owned this note    Owned this note      
    Published Linked with GitHub
    • Any changes
      Be notified of any changes
    • Mention me
      Be notified of mention me
    • Unsubscribe
    # $A{\bf x} = {\bf b}$ 的解集合 ![Creative Commons License](https://i.creativecommons.org/l/by/4.0/88x31.png) This work by Jephian Lin is licensed under a [Creative Commons Attribution 4.0 International License](http://creativecommons.org/licenses/by/4.0/). {%hackmd 5xqeIJ7VRCGBfLtfMi0_IQ %} ```python from lingeo import random_int_list, random_ref ``` ## Main idea Let $A$ be an $m\times n$ matrix and ${\bf b}$ a vector in $\mathbb{R}^n$. Recall that $A{\bf x} = {\bf b}$ is equivalent to a system of linear equation. When ${\bf b} = {\bf 0}$, the system is said to be homogeneous, and $$\operatorname{ker}(A) = \{{\bf x}\in\mathbb{R}^n : A{\bf x} = {\bf 0}\}. $$ Let $U = \{{\bf x}\in\mathbb{R}^n : A{\bf x} = {\bf b}\}$ be the set of all solutions. Then $U$ is an affine subspace in $\mathbb{R}^n$. In fact, $U$ can be written as ${\bf p} + \operatorname{ker}(A)$, where ${\bf p}$ can be any vector in $U$. We call $U$ the set of **general solutions**. When one element is chosen from $U$, it is called a **particular solution**. And $\operatorname{ker}(A)$ is called the set of **homogeneous solutions**. Equivalently, the solutions set of $A{\bf x} = {\bf b}$ is of the form: general solutions = particular solution + homogeneous solutions (a shifted space) (a vector) (a space) ## Side stories - `A.nullspace()` ## Experiments ##### Exercise 1 執行下方程式碼。 ```python ### code set_random_seed(0) print_ans = False A = random_ref(3,5,2) p = vector(random_int_list(5)) b = A * p h = A.right_kernel().basis()[0] p1 = p + h print("A =") show(A) print("b =", b) print("p =", p) print("h =", h) print("p1 =", p1) ``` ##### Exercise 1(a) 利用題目給的 ${\bf h}$. 確認它在 $\operatorname{ker}(A)$ 中。 計算 ${\bf p} + {\bf h}$ 並驗證它符合 $A({\bf p} + {\bf h}) = {\bf b}$。 :::warning - [x] **0** --> $\bzero$,要丟要數學式裡,後兩題都是 ::: 答: 題目給的 $A = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3\\ 0 & 0 & 0 & 0& 0\\ \end{bmatrix}$, ${\bf p} = (-3,3,4,-4,-3)$, ${\bf h} = (1,0,0,\frac{-1}{5},0)$, ${\bf b} = (4,-26,0)$。 因為 $A{\bf h} = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3\\ 0 & 0 & 0 & 0& 0\\ \end{bmatrix}$ $\begin{bmatrix} 1\\0\\0\\\frac{-1}{5}\\0\\ \end{bmatrix} = \begin{bmatrix} 0\\0\\0 \end{bmatrix} = \bzero$, 所以 ${\bf h}$ 在 $\operatorname{ker}(A)$ 中。 ${\bf p} + {\bf h} = (-2,3,4,\frac{-21}{5},-3)$ , $A({\bf p} + {\bf h}) = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3\\ 0 & 0 & 0 & 0 & 0\\ \end{bmatrix} \begin{bmatrix} -2\\3\\4\\\frac{-21}{5}\\-3\\ \end{bmatrix} = \begin{bmatrix} 4\\-26\\10\\ \end{bmatrix} = \bb$。 驗證符合 $A({\bf p} + {\bf h}) = {\bf b}$。 ##### Exercise 1(b) 如果已知 $A{\bf p} = {\bf b}$。 證明對任意 $\operatorname{ker}(A)$ 中的向量 ${\bf h}$﹐ 都有 $A({\bf p} + {\bf h}) = {\bf b}$。 :::warning - [x] 全型標點旁不用再空格 ::: 答: 因為向量 ${\bf h}$ 在 $\operatorname{ker}(A)$ 中, 所以 $A{\bf h}$ = $\bzero$。 因此 $A({\bf p + \bf h})$ = $A{\bf p} + A{\bf h}$ = ${\bf b}$ + **0** = ${\bf b}$, 可證明對任意 $\operatorname{ker}(A)$ 中的向量 ${\bf h}$,都有 $A({\bf p} + {\bf h}) = {\bf b}$。 ##### Exercise 1(c) 利用題目給的 ${\bf p}_1$﹐ 確認它符合 $A{\bf p}_1 = {\bf b}$。 計算 ${\bf p}_1 - {\bf p}$ 並驗證它在 $\operatorname{ker}(A)$ 中。 答: 題目給 ${\bf p}_1 = (-2,3,4,\frac{-21}{5},-3)$。 $A{\bf p}_1 = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3 & \\ 0 & 0 & 0 & 0 & 0\\ \end{bmatrix} \begin{bmatrix}-2\\3\\4\\\frac{-21}{5}\\-3\\\end{bmatrix} = \begin{bmatrix} 4\\-26\\10\\ \end{bmatrix} = {\bf b}$。 ${\bf p}_1 - {\bf p} = (1,0,0,\frac{-1}{5},0)$, $A({\bf p}_1 - {\bf p}) = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3 & \\ 0 & 0 & 0 & 0 & 0\\ \end{bmatrix} \begin{bmatrix} 1\\0\\0\\\frac{-1}{5}\\0\\\end{bmatrix} = \begin{bmatrix} 0\\0\\0\\\end{bmatrix}$。 因為 $A({\bf p}_1 - {\bf p})$ = $\bzero$, 所以 ${\bf p}_1 - {\bf p}$ 在 $\operatorname{ker}(A)$ 中。 ##### Exercise 1(d) 如果已知 $A{\bf p} = {\bf b}$。 證明對任意符合 $A{\bf p}_1 = {\bf b}$ 的向量 ${\bf p}_1$﹐ 都有 ${\bf p}_1 - {\bf p}\in\operatorname{ker}(A)$。 :::warning - [x] 怎麼突然從 答 變 Ans 了。兩者皆可,但是 $Ans:$ 不要放數學式,斜體可以用 *Ans:* ::: 答: 已知 $A{\bf p} = {\bf b}$,若存在 ${\bf p}_1$,使得 $A{\bf p}_1 = {\bf b}$ ,則 $A{\bf p}_1 - A{\bf p}$ = ${\bf b} - {\bf b}$,可得 $A({\bf p}_1 - {\bf p})$ = $0$。 由此可證 ${\bf p}_1 - {\bf p}\in\operatorname{ker}(A)$。 ## Exercises ##### Exercise 2 給定矩陣 $A$ 和向量 ${\bf b}$。 假設 $\bb \in \Col(A)$。 令 $U = \{ {\bf x}: A{\bf x} = {\bf b} \}$。 證明 $V = \{ {\bf p}_1 - {\bf p}_2 : {\bf p}_1 , {\bf p}_2 \in U \}$ 是一個子空間。 (因此 $U$ 是一個仿射子空間。) :::warning - [x] 令 ${\bf x}\in\operatorname{ker}(A)$, --> 令 ${\bf x}\in\operatorname{ker}(A)$。因為 $\bb\in\Col(A)$,所以 $U\neq\emptyset$。 - [x] 兩邊同乘 $A$ ,可得 $A({\bf p}_1 - {\bf p}_2) = A{\bf x} = 0$。 <-- 這句不用 - [x] 由此可知 ${\bf p}_1 \in U$, --> 因為 $A\bp_1 = A(\bp_2 + \bx) = \bb + \bzero = \bb$,由此可知 ${\bf p}_1 \in U$, ::: 答: 若 ${\bf p}_1 , {\bf p}_2 \in U$ , 則 : $A{\bf p}_1 = {\bf b}$ 且 $A{\bf p}_2 = {\bf b}$。 因此可得 $A{\bf p}_1 - A{\bf p}_2 = {\bf b} - {\bf b}$, $A({\bf p}_1 - {\bf p}_2) = \bzero$。 令 ${\bf x}\in\operatorname{ker}(A)$。 因為 ${\bf b} \in\operatorname{Col}(A)$,所以 $U\neq\emptyset$。 取 ${\bf p}_2 \in U$,令 ${\bf p}_1 = {\bf p}_2 + {\bf x}$,則 ${\bf p}_1 - {\bf p}_2 = {\bf x}$, 因為 $A{\bf p}_1 = A({\bf p}_2 + {\bf x}) = {\bf b} + \bzero = {\bf b}$ 由此可知 ${\bf p}_1 \in U$, 因此可得 $V = \{ {\bf p}_1 - {\bf p}_2 : {\bf p}_1 , {\bf p}_2 \in U \} = \{ {\bf x}:A{\bf x} = \bzero \}$ 是一個子空間。 ##### Exercise 3 執行以下程式碼。 ```python ### code set_random_seed(0) A = random_ref(3,5,2) b = vector(random_int_list(2) + [0]) b1 = b + vector([0,0,1]) print("A =") show(A) print("b =", b) print("b1 =", b1) ``` ##### Exercise 3(a) 湊出一個 $A{\bf x} = {\bf b}$ 的解﹐稱之作 ${\bf p}$。 答: 題目給 $A = \begin{bmatrix} 1 & 0 & 3 & 5 & -5\\ 0 & 1 & -5 & 0 & 3\\ 0 & 0 & 0 & 0& 0\\ \end{bmatrix}$, ${\bf b} = (-3,3,0)$。 設 ${\bf x} = (x_1,x_2,x_3,x_4,x_5)$,則 $A{\bf x} = {\bf b}$ 為: $$\begin{cases} 1x_1 + 0x_2 + 3x_3 + 5x_4 - 5x_5 &= -3,\\ 0x_1 + 1x_2 - 5x_3 + 0x_4 + 3x_5 &= 3,\\ 0x_1 + 0x_2 + 0x_3 + 0x_4 + 0x_5 &= 0. \end{cases} $$ 令 $x_3=x_4=x_5=0$,則 $x_1=-3,x_2=3$, 所以 ${\bf p}={\bf x}=(x_1,x_2,x_3,x_4,x_5)=(-3,3,0,0,0)$。 ##### Exercise 3(b) 利用參數式的方法找出 ${\bf h}_1$、${\bf h}_2$ 和 ${\bf h}_3$ 使得 $\operatorname{ker}(A) = \operatorname{span}(\{{\bf h}_1, {\bf h}_2, {\bf h}_3\})$。 :::warning - [x] 呃... 啊你為什麼不要解 $A\bx = \bzero$ 就好,這樣就不用一直 $-\bp$ ::: 答: 當 ${\bf x}=(x_1,x_2,1,0,0)$ 時解 $A\bx = \bzero$,則 $x_1=-3,x_2=5$, 所以 ${\bf h}_1=(-3,5,1,0,0)$。 當 ${\bf x}=(x_1,x_2,0,1,0)$ 時解 $A\bx = \bzero$,則 $x_1=-5,x_2=0$, 所以 ${\bf h}_2=(-5,0,0,1,0)$。 當 ${\bf x}=(x_1,x_2,0,0,1)$ 時解 $A\bx = \bzero$,則 $x_1=5,x_2=-3$, ${\bf h}_3=(5,-3,0,0,1)$。 因此 $\operatorname{ker}(A) = \{s{\bf h}_1 + t{\bf h}_2 + u{\bf h}_3:s,t,u \in \mathbb{R}\} = \operatorname{span}(\{{\bf h}_1, {\bf h}_2,{\bf h}_3\})$。 ##### Exercise 3(c) 求出 $A{\bf x} = {\bf b}$ 的所有解。 :::warning - [x] 用 `aligned` 對齊 - [x] 加一下 $\bh_3$,上一題我題目打錯了 ::: 答: 上述已求出 ${\bf p}$ 和 $\operatorname{ker}(A) = \operatorname{span}(\{{\bf h}_1, {\bf h}_2, \bh_3\})$, 因此 $\{A{\bf x} = {\bf b}\}$ 的所有解 $$\begin{aligned} &= {\{\bf p} + s{\bf h}_1 + t{\bf h}_2 + u{\bf h}_3:s,t,u \in \mathbb{R}\} \\ &= {\bf p} + \{s{\bf h}_1 + t{\bf h}_2 + u{\bf h}_3:s,t,u \in \mathbb{R}\} \\ &= {\bf p} + \operatorname{span}(\{{\bf h}_1, {\bf h}_2,{\bf h}_3\}). \end{aligned} $$ ##### Exercise 3(d) 說明 $A{\bf x} = {\bf b}_1$ 無解。 (儘管 $\operatorname{ker}(A)$ 中有很多向量。) 答: 題目給 ${\bf b}_1 = (-3,3,1)$。 令 ${\bf x} = (x_1,x_2,x_3,x_4,x_5)$。 假設 $A{\bf x} = {\bf b}_1$ 有解, 此時 $A{\bf x} = {\bf b}_1$ 可寫成方程組 $$\begin{cases} 1x_1 + 0x_2 + 3x_3 + 5x_4 - 5x_5 &= -3,\\ 0x_1 + 1x_2 - 5x_3 + 0x_4 + 3x_5 &= 3,\\ 0x_1 + 0x_2 + 0x_3 + 0x_4 + 0x_5 &= 1, \end{cases} $$ 其中 $x_1,x_2,x_3,x_4,x_5 \in \mathbb{R}$。 因為 $0x_1 + 0x_2 + 0x_3 + 0x_4 + 0x_5 = 0 \neq 1$, 所以 $A{\bf x} = {\bf b}_1$ 有解的假設矛盾, 因此 $A{\bf x} = {\bf b}_1$ 無解。 ##### Exercise 4 我們現階段對解集合的理解 已經可以告訴我們一些有趣的性質。 ##### Exercise 4(a) 令 $V$ 為一子空間。 若 $V$ 中至少有兩個向量﹐ $V$ 中向量的個數是否有可能是有限個? :::warning - [x] Let $\vspan(V)=({\bf u}_1,{\bf u}_2 , \cdots ,{\bf u}_n)$ <-- 第一句我就看不懂,你是說 $V$ 只有 $n$ 個向量嗎?集合應該用 $\{...\}$。啊你沒事拿 $V$ 去 $\vspan$ 幹麻... 如果 $V$ 是子空間,那麼 $\vspan(V) = V$。 - [x] 句子不完整 - [x] 文法 大致上你要說的只有: ... ::: 答: 因為有兩個點,我們令 $\bu_1,\bu_2\in V$ 且 $\bu_1 \neq \bu_2$。 由於 $V$ 是一個子空間,$c_1\bu_1 + c_2\bu_2\in V$。 因為 $\bu_1 \neq \bu_2$,我們可以假設 $\bu_2\neq\bzero$。 同時,因為 $c_2$ 可以是任何實數, 所以 $c_1\bu_1 + c_2\bu_2\in V$ 有無窮多個可能性。 因此 $V$ 不可能只有有限個元素。 <!-- Let $\vspan(V)=({\bf u}_1,{\bf u}_2 , \cdots ,{\bf u}_n)$ for ${\bf u}_1,{\bf u}_2\in \mathbb{V}$ has ${\bf u}_1+{\bf u}_2\in \mathbb{V}$ and for every scalar ${\bf k }.{\bf m }.....{\bf g },{\bf u}_1.{\bf u}_2.....{\bf u}_n\in \mathbb{V}$ has ${\bf k }{\bf u }_1.{\bf m }{\bf u }_2.....{\bf g}{\bf u }_n\in \mathbb{V}$ according to $\vspan(V)$ definition we have ${\bf k }{\bf u }_1.{\bf m }{\bf u }_2.....{\bf g}{\bf u }_n\in \mathbb{V}$ ${\bf k }.{\bf m }....{\bf g}\in \mathbb{R}$ Obviously,we can have infinity vector by this liner combination,so the question is NO --> ##### Exercise 4(b) 若 $A{\bf x} = {\bf b}$ 至少有兩個解﹐ 全部解的個數是否有可能是有限個? :::warning - [x] 跟前面一樣:若 $\bx_1$ 和 $\bx_2$ 為兩相異解,則 ...。既然也不確定有幾個解,沒必要假設有 $n$ 個,就拿兩個出來就好。 - [x] 純量不用粗體 ::: 答: 因為有兩個解,我們令 $\bu_1,\bu_2$ 滿足 $A\bu_1 = A\bu_2 = \bb$,$\bu_1 \neq \bu_2$。 則 $A(\bu_1 - \bu_2) = \bb - \bb = \bzero$。 我們可以發現,對於任何 $k\in\mathbb{R}$ 都有 $$ A(\bu_1 + k(\bu_1 - \bu_2)) = A\bu_1 + kA(\bu_1 - \bu_2) = \bb + \bzero = \bb. $$ 因此 $\bu_1 + k(\bu_1 - \bu_2)$ 也是 $A\bx = \bb$ 的解。 由於 $k$ 有無窮多個可能性。 因此 $A\bx = \bb$ 不可能只有有限個解。 <!-- Let $A{\bf x} = {\bf b}$ has ${\bf x}_1$,${\bf x}_2$,${\bf x}_3$......${\bf x}_n$ solution,$n \in \mathbb{N}$。 Satisfy that $A{\bf x}_1 = {\bf b}$ ,$A{\bf x}_2 = {\bf b}$,……,$A{\bf x}_n= {\bf b}$ ${\bf a}_1A{\bf x}_1 = {\bf b}$ ,${\bf a}_2A{\bf x}_2 = {\bf b}$ ,……,${\bf a}_nA{\bf x}_n = {\bf b}$ ${\bf a}_1A{\bf x}_1+{\bf a}_2A{\bf x}_2+......{\bf a}_nA{\bf x}_n={\bf A}({\bf a}_1{\bf x}_1+{\bf a}_2{\bf x}_2+{\bf a}_n{\bf x}_n)=({\bf a}_1+{\bf a}_2+......{\bf a}_n){\bf b}$ Satisfy that ${\bf a}_1+{\bf a}_2+......{\bf a}_n=1$,${\bf a}_1{\bf x}_1,{\bf a}_2{\bf x}_2......{\bf a}_n{\bf x}_n$ can combine infinity answer,so the question is NO --> :::info 乾淨漂亮! 3(b) 有不必要的步驟 第 5 題不知道在寫什麼,有待改進。 目前分數 5.5/5 :::

    Import from clipboard

    Paste your markdown or webpage here...

    Advanced permission required

    Your current role can only read. Ask the system administrator to acquire write and comment permission.

    This team is disabled

    Sorry, this team is disabled. You can't edit this note.

    This note is locked

    Sorry, only owner can edit this note.

    Reach the limit

    Sorry, you've reached the max length this note can be.
    Please reduce the content or divide it to more notes, thank you!

    Import from Gist

    Import from Snippet

    or

    Export to Snippet

    Are you sure?

    Do you really want to delete this note?
    All users will lose their connection.

    Create a note from template

    Create a note from template

    Oops...
    This template has been removed or transferred.
    Upgrade
    All
    • All
    • Team
    No template.

    Create a template

    Upgrade

    Delete template

    Do you really want to delete this template?
    Turn this template into a regular note and keep its content, versions, and comments.

    This page need refresh

    You have an incompatible client version.
    Refresh to update.
    New version available!
    See releases notes here
    Refresh to enjoy new features.
    Your user state has changed.
    Refresh to load new user state.

    Sign in

    Forgot password

    or

    By clicking below, you agree to our terms of service.

    Sign in via Facebook Sign in via Twitter Sign in via GitHub Sign in via Dropbox Sign in with Wallet
    Wallet ( )
    Connect another wallet

    New to HackMD? Sign up

    Help

    • English
    • 中文
    • Français
    • Deutsch
    • 日本語
    • Español
    • Català
    • Ελληνικά
    • Português
    • italiano
    • Türkçe
    • Русский
    • Nederlands
    • hrvatski jezik
    • język polski
    • Українська
    • हिन्दी
    • svenska
    • Esperanto
    • dansk

    Documents

    Help & Tutorial

    How to use Book mode

    Slide Example

    API Docs

    Edit in VSCode

    Install browser extension

    Contacts

    Feedback

    Discord

    Send us email

    Resources

    Releases

    Pricing

    Blog

    Policy

    Terms

    Privacy

    Cheatsheet

    Syntax Example Reference
    # Header Header 基本排版
    - Unordered List
    • Unordered List
    1. Ordered List
    1. Ordered List
    - [ ] Todo List
    • Todo List
    > Blockquote
    Blockquote
    **Bold font** Bold font
    *Italics font* Italics font
    ~~Strikethrough~~ Strikethrough
    19^th^ 19th
    H~2~O H2O
    ++Inserted text++ Inserted text
    ==Marked text== Marked text
    [link text](https:// "title") Link
    ![image alt](https:// "title") Image
    `Code` Code 在筆記中貼入程式碼
    ```javascript
    var i = 0;
    ```
    var i = 0;
    :smile: :smile: Emoji list
    {%youtube youtube_id %} Externals
    $L^aT_eX$ LaTeX
    :::info
    This is a alert area.
    :::

    This is a alert area.

    Versions and GitHub Sync
    Get Full History Access

    • Edit version name
    • Delete

    revision author avatar     named on  

    More Less

    Note content is identical to the latest version.
    Compare
      Choose a version
      No search result
      Version not found
    Sign in to link this note to GitHub
    Learn more
    This note is not linked with GitHub
     

    Feedback

    Submission failed, please try again

    Thanks for your support.

    On a scale of 0-10, how likely is it that you would recommend HackMD to your friends, family or business associates?

    Please give us some advice and help us improve HackMD.

     

    Thanks for your feedback

    Remove version name

    Do you want to remove this version name and description?

    Transfer ownership

    Transfer to
      Warning: is a public team. If you transfer note to this team, everyone on the web can find and read this note.

        Link with GitHub

        Please authorize HackMD on GitHub
        • Please sign in to GitHub and install the HackMD app on your GitHub repo.
        • HackMD links with GitHub through a GitHub App. You can choose which repo to install our App.
        Learn more  Sign in to GitHub

        Push the note to GitHub Push to GitHub Pull a file from GitHub

          Authorize again
         

        Choose which file to push to

        Select repo
        Refresh Authorize more repos
        Select branch
        Select file
        Select branch
        Choose version(s) to push
        • Save a new version and push
        • Choose from existing versions
        Include title and tags
        Available push count

        Pull from GitHub

         
        File from GitHub
        File from HackMD

        GitHub Link Settings

        File linked

        Linked by
        File path
        Last synced branch
        Available push count

        Danger Zone

        Unlink
        You will no longer receive notification when GitHub file changes after unlink.

        Syncing

        Push failed

        Push successfully